Log in

Relevant bibliographies by topics / Queuing theory. Telecommunication

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Queuing theory. Telecommunication'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Queuing theory. Telecommunication.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Queuing theory. Telecommunication"

1

Afolalu, S. A., O. M. Ikumapayi, A. Abdulkareem, M. E. Emetere, and O. Adejumo. "A short review on queuing theory as a deterministic tool in sustainable telecommunication system." Materials Today: Proceedings 44 (2021): 2884–88. http://dx.doi.org/10.1016/j.matpr.2021.01.092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Иванов, А. Ю., В. И. Комашинский, and А. Н. Соколов. "Mathematical modeling of the characteristics of the quality of service of messages in the information and telecommunication network of water transport." MORSKIE INTELLEKTUAL`NYE TEHNOLOGII), no. 2(52) (June 5, 2021): 92–97. http://dx.doi.org/10.37220/mit.2021.52.2.014.

Full text

Abstract:

Внедрение интеллектуальных транспортных систем позволяет перейти на качественно новый уровень решения транспортно-логистических задач произвольного масштаба. Интеллектуализация основана на широком использовании информационно-телекоммуникационных сетей и систем, ориентированных на реализацию передовых и перспективных информационных технологий. В этом аспекте проявляется актуальность и важность построения коммуникационной среды, обеспечивающей передачу разнородного контента с требуемым уровнем качества. Материал статьи сосредоточен на разработке математического аппарата в рамках теории массового обслуживания с целью прогностического анализа характеристик качества обслуживания сообщений в информационно-телекоммуникационной сети водного транспорта. Осуществлена постановка задачи нахождения значений показателей качества обслуживания пакетов данных в сети. Обоснованы и получены основные математические соотношения. Оценена корректность разработанного математического инструментария. Показана возможность решения как прямых, так и обратных задач исследования информационно-телекоммуникационных систем в приведенной постановке. На этом основании сформулированы рекомендации по практическому применению результатов, полученных в статье. The introduction of intelligent transport systems allows you to move to a qualitatively new level of solving transport and logistics problems of any scale. Intellectualization is based on the widespread use of information and telecommunication networks and systems focused on the implementation of advanced and promising information technologies. This aspect demonstrates the relevance and importance of building a communication environment that ensures the transfer of heterogeneous content with the required level of quality. The material of the article is focused on the development of a mathematical apparatus within the framework of the queuing theory for the purpose of predictive analysis of the characteristics of the quality of service of messages in the information and telecommunication network of water transport. The formulation of the problem of finding the values of quality indicators of service of data packets in the network is carried out Basic mathematical relations are substantiated and obtained. The correctness of the developed mathematical tools is assessed. The possibility of solving both direct and inverse problems of researching information and telecommunication systems in the given formulation is shown. On this basis, recommendations were formulated for the practical application of the results obtained in the article.

APA, Harvard, Vancouver, ISO, and other styles

3

Ammar, Sherif I., Tao Jiang, and Qingqing Ye. "Transient analysis of impatient customers in an M/M/1 disasters queue in random environment." Engineering Computations 37, no. 6 (February 10, 2020): 1945–65. http://dx.doi.org/10.1108/ec-06-2019-0274.

Full text

Abstract:

Purpose This paper aims to consider a single server queue with system disasters and impatience behavior are evident in our daily life. For this purpose, authors require to know the general behavior of these systems. Transient analysis shows for us how the system will operate up to some time instant t. Design/methodology/approach In this paper, authors consider a single server queue with system disaster and impatient behavior of customers in a multi-phase random environment, in which the system transits to a repair state after each system disaster. When the system is in a failure phase or going through a repair phase, the new arrivals would be impatient. In case the system is not repaired before the customer’s time expires, the customer would leave the queue and never return. Moreover, after repair, the system becomes ready for service in an operative phase with probability $q_{i} \ge 0.$. Using generating functions along with continued fractions and some properties of the confluent hypergeometric function, authors obtained on their own results. Findings Explicit expressions have been obtained for the time-dependent probabilities of the underlying queuing model. Also, time-dependent mean and variance of customers in the system are deduced. Research limitations/implications The system authors are dealing with is somewhat complicated, there are some performance measures that cannot be achieved, but some of them have been obtained, such as the expectation and variance of the number of customers in the system. Practical implications Based on the obtained results, some numerical examples are some numerical examples are presented to illustrate the effect of various parameters on the behavior of the proposed system. Social implications Authors’ studied transient analysis of a single server queue with system disaster and impatient customer system is suitable for behavior interpretation of many systems in our lives, such as telecommunication networks, inventory systems and impatient telephone switchboard customers, manufacturing system and service system. Originality/value To the best of the author’s/authors’ knowledge and according to the literature survey, in a multi-phase random environment, no previous published article is presented for transient analysis of a single server queue with system disaster and impatient customer behavior in a random environment.

APA, Harvard, Vancouver, ISO, and other styles

4

Mubarak, Rio, Setiyo Budiyanto, Putri Wulandari, Fajar Rahayu, Andi Adriansyah, and Mudrik Alaydrus. "A queue theory in the cross-polarization of antenna in satellite communication." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 2 (May 1, 2021): 884. http://dx.doi.org/10.11591/ijeecs.v22.i2.pp884-892.

Full text

Abstract:

<span>Satellite communication is a telecommunications technique that uses satellites as a connecting component, for example VSAT. In antenna installation, there is an important process which is called the cross-polarization. Cross-polarization is one process that cannot be released inside installation of VSAT antennas for satellite communication. Sometimes, in this process, a user queue will occur. Queuing theory explain the process is done and also calculate the other factors that are in the process. By knowing queuing theory to the cross-polarization, it will be easy to know the efficiency of queuing theory in the cross-polarization. Based on the characteristics of the cross-polarization, user can be known the queuing model that used and performance of the queuing system. The queuing model for the cross-polarization, using Kendall notation, M/M/1. Based on the analysis that has been done; by using 1 server the value of service level (ρ) is 0.67, using 2 servers = 0.33 and 3 servers = 0.22. The waiting time in the queue is longer if using 1 server which is 0.67 hours or 40 minutes. If a satellite operator uses 2 servers, waiting time in the queue is 25 minutes and 3 servers is 2.8 minutes which means that there is almost no waiting time in the queue.</span>

APA, Harvard, Vancouver, ISO, and other styles

5

Papir, Z. "Queueing Theory with Applications to Packet Telecommunications [Book Review." IEEE Communications Magazine 44, no. 5 (May 2006): 14–16. http://dx.doi.org/10.1109/mcom.2006.1637937.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Le Gall, Pierre. "The theory of networks of single server queues and the tandem queue model." Journal of Applied Mathematics and Stochastic Analysis 10, no. 4 (January 1, 1997): 363–81. http://dx.doi.org/10.1155/s1048953397000427.

Full text

Abstract:

We consider the stochastic behavior of networks of single server queues when successive service times of a given customer are highly correlated. The study is conducted in two particular cases: 1) networks in heavy traffic, and 2) networks in which all successive service times have the same value (for a given customer), in order to avoid the possibility of breaking up the busy periods. We then show how the local queueing delay (for an arbitrary customer) can be derived through an equivalent tandem queue on the condition that one other local queueing delay is added: the jitter delay due to the independence of partial traffic streams.We consider a practical application of the results by investigating the influence of long packets on the queueing delay of short packets in modern packet switched telecommunication networks. We compare these results with the results given by traffic simulation methods to conclude that there is good agreement between results of calculation and of traffic simulation.

APA, Harvard, Vancouver, ISO, and other styles

7

Klimenok, Valentina, Alexander Dudin, and Vladimir Vishnevsky. "Priority Multi-Server Queueing System with Heterogeneous Customers." Mathematics 8, no. 9 (September 4, 2020): 1501. http://dx.doi.org/10.3390/math8091501.

Full text

Abstract:

In this paper, we analyze a multi-server queueing system with heterogeneous customers that arrive according to a marked Markovian arrival process. Customers of two types differ in priorities and parameters of phase type distribution of their service time. The queue under consideration can be used to model the processes of information transmission in telecommunication networks in which often the flow of information is the superposition of several types of flows with correlation of inter-arrival times within each flow and cross-correlation. We define the process of information transmission as the multi-dimensional Markov chain, derive the generator of this chain and compute its stationary distribution. Expressions for computation of various performance measures of the system, including the probabilities of loss of customers of different types, are presented. Output flow from the system is characterized. The presented numerical results confirm the high importance of account of correlation in the arrival process. The values of important performance measures for the systems with the correlated arrival process are essentially different from the corresponding values for the systems with the stationary Poisson arrival process. Measurements in many real world systems show poor approximation of real flows by such an arrival process. However, this process is still popular among the telecommunication engineers due to the evident existing gap between the needs of adequately modeling the real life systems and the current state of the theory of algorithmic methods of queueing theory.

APA, Harvard, Vancouver, ISO, and other styles

8

Tarasov, V. N., and N. F. Bakhareva. "DELAY MODELS BASED ON SYSTEMS WITH USUAL AND SHIFTED HYPEREXPONENTIAL AND HYPERERLANGIAN INPUT DISTRIBUTIONS." Radio Electronics, Computer Science, Control, no. 2 (June 26, 2021): 56–64. http://dx.doi.org/10.15588/1607-3274-2021-2-6.

Full text

Abstract:

Context. In the queueing theory, the study of systems with arbitrary laws of the input flow distribution and service time is relevant because it is impossible to obtain solutions for the waiting time in the final form for the general case. Therefore, the study of such systems for particular cases of input distributions is important. Objective. Getting a solution for the average delay in the queue in a closed form for queuing systems with ordinary and with shifted to the right from the zero point hyperexponential and hypererlangian distributions in stationary mode. Method. To solve this problem, we used the classical method of spectral decomposition of the solution of the Lindley integral equation. This method allows to obtaining a solution for the average delay for two systems under consideration in a closed form. The method of spectral decomposition of the solution of the Lindley integral equation plays an important role in the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used. Results. For the first time, a spectral decomposition of the solution of the Lindley integral equation for systems with ordinary and with shifted hyperexponential and hyperelangian distributions is obtained, which is used to derive a formula for the average delay in a queue in closed form. Conclusions. It is proved that the spectral expansions of the solution of the Lindley integral equation for the systems under consideration coincide; therefore, the formulas for the mean delay will also coincide. It is shown that in systems with a delay, the average delay is less than in conventional systems. The obtained expression for the waiting time expands and complements the wellknown incomplete formula of queuing theory for the average delay for systems with arbitrary laws of the input flow distribution and service time. This approach allows us to calculate the average delay for these systems in mathematical packages for a wide range of traffic parameters. In addition to the average waiting time, such an approach makes it possible to determine also moments of higher orders of waiting time. Given the fact that the packet delay variation (jitter) in telecommunications is defined as the spread of the waiting time from its average value, the jitter can be determined through the variance of the waiting time.

APA, Harvard, Vancouver, ISO, and other styles

9

Tarasov, V. N. "Queuing Systems with a Time Lag." INFORMACIONNYE TEHNOLOGII 27, no. 6 (June 9, 2021): 291–98. http://dx.doi.org/10.17587/it.27.291-298.

Full text

Abstract:

The article discusses various queuing systems (QS) formed by four laws of probability distributions: exponential, hyperexponential, Erlang and hyper-Erlang of the second order. These four laws form sixteen different QS. In contrast to the classical theory, this article considers QS with distribution laws shifted to the right from the zero point. Such QS are of type G/G/1 with arbitrary laws of the distribution of intervals between the requirements of the input flow and the service time. As you know, for such systems it is impossible to obtain solutions for the main characteristic of QS the average waiting time in the general case. Therefore, studies of such systems are important for special cases of distribution laws. The article provides an overview of the author's results for the average waiting time in a queue in a closed form for systems with input distributions shifted to the right from the zero point. To solve this problem, the spectral decomposition method for solving the Lindley integral equation was used. In the course of solving the problem, spectral decompositions of the solution of the Lindley integral equation for eight systems were obtained and with their help calculation formulas were derived for the average waiting time in the queue. It is shown that in systems with delay, the average waiting time is shorter than in conventional systems. The obtained calculation formulas for the average waiting time expand and complement the well-known incomplete formula of the queuing theory for the average waiting time for G/G/1 systems. The proposed approach allows us to calculate the average value and moments of higher orders of waiting time for these systems in mathematical packages for a wide range of changes in traffic parameters. Given the fact that the variation in packet delay (jitter) in the telecommunications standard is defined as the spread of waiting time around its average value, the jitter can be determined through the variance of the waiting time.

APA, Harvard, Vancouver, ISO, and other styles

10

Brezavšček, Alenka, and Alenka Baggia. "Optimization of a Call Centre Performance Using the Stochastic Queueing Models." Business Systems Research Journal 5, no. 3 (September 1, 2014): 6–18. http://dx.doi.org/10.2478/bsrj-2014-0016.

Full text

Abstract:

Abstract Background A call centre usually represents the first contact of a customer with a given company. Therefore, the quality of its service is of key importance. An essential factor of the call centre optimization is the determination of the proper number of operators considering the selected performance measure. Results of previous research show that this can be done using the queueing theory approach. Objectives: The paper presents the practical application of the stochastic queueing models aimed at optimizing a Slovenian telecommunication provider’s call centre. Methods/Approach: The arrival and the service patterns were analysed, and it was concluded that the call centre under consideration can be described using the M/M/r {infinity/infinity/FIFO} queueing model. Results: An appropriate number of operators were determined for different peak periods of the working day, taking into consideration the following four performance measures: the expected waiting time, the expected number of waiting customers, the probability that a calling customer will have to wait, and the call centre service level. Conclusions: The obtained results prove the usefulness and applicability of the queueing models as a tool for a call centre performance optimization. In practice, all the data needed for such a mathematical analysis are usually provided. This paper is aimed at illustrating how such data can be efficiently exploited.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Queuing theory. Telecommunication"

1

Coyle, Andrew James. "Some problems in queueing theory." Title page, contents and summary only, 1989. http://web4.library.adelaide.edu.au/theses/09PH/09phc8812.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yunus, Muhammad Naim. "Blocking in teletraffic systems under nonstationary arrival and service conditions /." Title page, contents and summary only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phy95.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Dan, György. "Internet Video Transmission." Doctoral thesis, KTH, Telekommunikationssystem, TSLab, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-623.

Full text

Abstract:

The Internet has rapidly evolved from being a scientific experiment to a commercial network connecting millions of hosts that carries traffic generated by a large amount of applications with diverse requirements. Its architecture was however designed to enable efficient point-to-point delivery of bulk data, and can not provide statistical guarantees on the timely delivery of delay sensitive data such as streaming and real-time multimedia. Thus, applications that require low loss probabilities in today's Internet have to use some end-to-end error recovery mechanism. For delay sensitive applications the introduced latency by the applied schemes has to be low as well. Traffic control functions such as delay limited shaping and forward error correction (FEC), and multiple description coding (MDC) have been proposed for variable bitrate video. Their major drawback is, however, that it is difficult to predict their efficiency, as it depends on many factors like the characteristics of the stream itself, the characteristics of the traffic in the network and the network parameters. Consequently, it is difficult to decide which control mechanisms to employ, how to combine them and to choose the right parameters (e.g. block length, code rate) for optimal performance. In this thesis we present results on the efficiency of traffic control functions and MDC for video transmission based on mathematical models and simulations. We investigate the efficiency of delay limited traffic shaping and the trade-offs in the joint use of traffic shaping and forward error correction. We identify the packet size distribution of the traffic in the network as an additional factor that may influence the efficiency of FEC, and present a thorough analysis of its possible effects. We present an analytical comparison of MDC versus media-dependent FEC and media-independent FEC, and based on the results we conclude that MDC is a promising error control solution for multimedia communications with very strict delay bounds in an environment with bursty losses. We combine the analytical results with traces from measurements performed on the Internet to evaluate how efficient these error control schemes are under real loss patterns. We compare the efficiency of MDC and media-dependent FEC in the presence of channel estimation errors; we propose a new rate allocation method, which is robust to mis-estimations of the channel state and which improves error resilience on non-stationary channels. Finally we present an analytical model of the performance of an end-point-based multimedia streaming architecture based on multiple distribution trees and forward error correction, and analyze the behavior of the architecture for a large number of nodes.
QC 20101115

APA, Harvard, Vancouver, ISO, and other styles

4

Dán, György. "Internet Video Transmission." Doctoral thesis, KTH, School of Electrical Engineering (EES), 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-623.

Full text

Abstract:

The Internet has rapidly evolved from being a scientific experiment to a commercial network connecting millions of hosts that carries traffic generated by a large amount of applications with diverse requirements. Its architecture was however designed to enable efficient point-to-point delivery of bulk data, and can not provide statistical guarantees on the timely delivery of delay sensitive data such as streaming and real-time multimedia. Thus, applications that require low loss probabilities in today's Internet have to use some end-to-end error recovery mechanism. For delay sensitive applications the introduced latency by the applied schemes has to be low as well. Traffic control functions such as delay limited shaping and forward error correction (FEC), and multiple description coding (MDC) have been proposed for variable bitrate video. Their major drawback is, however, that it is difficult to predict their efficiency, as it depends on many factors like the characteristics of the stream itself, the characteristics of the traffic in the network and the network parameters. Consequently, it is difficult to decide which control mechanisms to employ, how to combine them and to choose the right parameters (e.g. block length, code rate) for optimal performance.

In this thesis we present results on the efficiency of traffic control functions and MDC for video transmission based on mathematical models and simulations. We investigate the efficiency of delay limited traffic shaping and the trade-offs in the joint use of traffic shaping and forward error correction. We identify the packet size distribution of the traffic in the network as an additional factor that may influence the efficiency of FEC, and present a thorough analysis of its possible effects. We present an analytical comparison of MDC versus media-dependent FEC and media-independent FEC, and based on the results we conclude that MDC is a promising error control solution for multimedia communications with very strict delay bounds in an environment with bursty losses. We combine the analytical results with traces from measurements performed on the Internet to evaluate how efficient these error control schemes are under real loss patterns. We compare the efficiency of MDC and media-dependent FEC in the presence of channel estimation errors; we propose a new rate allocation method, which is robust to mis-estimations of the channel state and which improves error resilience on non-stationary channels. Finally we present an analytical model of the performance of an end-point-based multimedia streaming architecture based on multiple distribution trees and forward error correction, and analyze the behavior of the architecture for a large number of nodes.

APA, Harvard, Vancouver, ISO, and other styles

5

Ng, Hwee Ping. "Performance analysis of management techniques for SONET/SDH telecommunications networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FNg.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Libardi, Junior José Carlos 1983. "Comparação de simulações por eventos discretos para modelos de fila." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267737.

Full text

Abstract:

Orientadores: Varese Salvador Timoteo, Edson Luiz Ursini
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia
Made available in DSpace on 2018-08-27T17:38:56Z (GMT). No. of bitstreams: 1 LibardiJunior_JoseCarlos_M.pdf: 4110678 bytes, checksum: eee73fe122555a9710247faeceb6f135 (MD5) Previous issue date: 2015
Resumo: A constante evolução do poder computacional aliada ao baixo custo de aquisição, faz com que os computadores sejam indispensáveis para construção de modelos de simulação. Atualmente, a simulação por computador é usada nas mais diversificadas áreas, como previsão meteorológica, dimensionamento de centrais telefônicas, e estudos aerodinâmicos. A presente dissertação valida e comprova a eficácia de modelos de simulação construídos no software Mathematica 10 por meio do software Arena 14.50. Para isso, foi construído um modelo que, sem focar nas condições reais do sistema, simula de forma hipotética (levando em conta apenas o número de canais de comunicação disponíveis e o tempo de médio duração das chamadas) o tráfego oferecido por chamadas de áudio e vídeo em uma ERB (Estação Rádio-Base) CDMA (Code Division Multiple Access) ou GSM (Global System for Mobile) que nesse trabalho, é representada por um sistema de fila. Diversos cenários de tráfego foram analisados utilizando diferentes parâmetros como a quantidade de chamadas ingressantes, tempo de duração da chamada e o número de canais disponíveis. Os resultados finais comprovaram que os modelos de simulação criados no Mathematica 10 são equivalentes aos modelos de simulação construídos no Arena 14.50
Abstract: The constant evolution of power of computers together with their low cost of aquisition, make them indispensable in building of simulation models. Nowadays, computer simulation is used in a variety of areas such weather forecasting, sizing of telephone stations and in aerodynamic studies. This essay validate and proves the effectiveness of these simulation models built on The Mathematica 10 software with the Arena 14.50. In order to do that, a model was built and without focusing on System s real condition, it simulates in a hypothetical way (considering only the number of communication channels available and average length of the calls) The traffic offered by audio and vídeo calls through a RBS (Radio Base Station) CDMA (Code Division Multiple Access) or GSM (Global System for Mobile) which herein is shown through a queue system. Various traffic scenarios were analyzed using different setups, like quantity of incoming calls, length of calls and number of available channels. The final results confirmed that the simulation models built on Mathematica 10 are equivalents to The simulation models built on Arena 14.50
Mestrado
Tecnologia e Inovação
Mestre em Tecnologia

APA, Harvard, Vancouver, ISO, and other styles

7

Nabas, Kleber Kendy Horikawa. "Proposta de um modelo para análise de desempenho do escalonador WFQ alimentado com tráfego LRD." Universidade Tecnológica Federal do Paraná, 2009. http://repositorio.utfpr.edu.br/jspui/handle/1/123.

Full text

Abstract:

Técnicas de gerenciamento de filas e descarte de pacotes são empregadas pelos escalonadores de pacotes presentes nos roteadores internos de uma rede de telecomunicações. Devido às características auto-similares do tráfego presente nas redes, o desenvolvimento de modelos para análise de desempenho de protocolos e de elementos de rede é enormemente dificultado. Tais características auto-similares são oriundas da ação dos protocolos predominantes nas redes em questão, e dos mecanismos fim-a-fim de controle de congestionamento existentes, determinantes no comportamento do fluxo de informações entre diferentes camadas na hierarquia de protocolos TCP/IP. Esta tese tem como objetivo principal propor modelos analíticos de baixo esforço computacional que permitam fazer uma análise de desempenho de um nó de rede (podendo este nó ser do tipo: DiffServ, IntServ, IP, Multi Protocol Label Switching, entre outros) com o escalonador WFQ. O tráfego considerado é do tipo TCP, devido ao fato que este protocolo é o mais utilizado na Internet atualmente, apresentando, portanto, características auto-similares. Foram desenvolvidos modelos para o escalonador WFQ quando o mesmo é alimentado com tráfego Poissoniano e tráfego do tipo auto-similar. O primeiro modelo está baseado em uma cadeia de Markov bidimensional para representar o comportamento do escalonador WFQ alimentado por dois fluxos de prioridades diferentes. O segundo modelo faz uso de duas filas separadas com taxas de serviço ajustadas de modo a simular o comportamento do escalonador WFQ. As filas são do tipo M[X]/M/1/B para levar em conta o comportamento auto-similar do tráfego. Como resultado, mostra-se que o segundo modelo é capaz de estimar as métricas de desempenho, com erro aceitável, dentro de uma faixa adequada de valores dos parâmetros do sistema, conforme demonstra a validação de resultados conduzido com uso do software NS-2.
Internal routers of telecommunication networks employ a variety of queue management and packet discarding techniques. The development of models for analyzing performance of different protocols and devices is made difficult by the self-similar nature of network traffic. Traffic self-similarity stems from the action of predominant protocols and end-to-end congestion control systems, which are key factors in determining the behavior of data flow between layers of the TCP/IP protocol stack. This thesis proposes analytical models that allow for the evaluation of a (DiffServ, IntServ, IP, Multi Protocol Label Switching etc.) network node's performance at a low computational cost. Only TCP traffic is considered, since it accounts for most of current Internet traffic and therefore exhibits self-similar characteristics. Models were developed for the WFQ scheduler with Poisson and self-similar traffic inputs. The former is based on a bi-dimensional Markov chain representing the behavior of the WFQ scheduler with two input flows with different priorities. The latter consists in two separate queues whose service rates are tuned so as to simulate the behavior of a WFQ scheduler. M[X]/M/1/B queues are used to account for the self-similar nature of traffic. As a result, it is shown that the second model accurately estimates performance metrics for certain ranges of parameter values, as confirmed by NS-2 simulations.

APA, Harvard, Vancouver, ISO, and other styles

8

"Communication systems modeled by single server queue with interrupted services." Thesis, 2006. http://library.cuhk.edu.hk/record=b6074162.

Full text

Abstract:

Optical buffers are essential components of future optical switches for resolving contentions among arriving packets. Currently, optical buffers are composed of Fiber Delay Lines (FDL). Unlike the conventional electronic buffer, optical buffer only has finite time resolution, which introduces a void period between two successive buffered packets. The void period leads to service interruptions and deteriorates the buffer performance. We develop a queueing system with exceptional service for the first packet in each busy period to model the buffer behavior. For the first time, the closed-form expressions of packet blocking probability and mean delay of optical buffer are derived. We show that the packet blocking probability can be minimized by finding the optimal FDL time granularity. This optimal granularity is neither sensitive to packet length distribution, nor sensitive to the buffer length, it is mainly determined by the traffic load.
Service interruption is a special case of varying service rate. A current trend in wireless communication is to enable devices to operate using many different transmission rates. This motivates us to develop the queueing models with varying service rate. We apply the continuous time Markov chain to characterize the service rate varying process, and develop a queueing system with Markov-modulated service rate. In this kind of problem, due to the complex interaction between the rate varying process and packet arrival process, it is hard to characterize the server state evolvement; this makes it difficult to get an analytical solution, even the server only has two service rates. To escape the trap, first, we develop a discrete time Markov chain to model the server state transition process, which makes our problem to be easily manipulated. Second, apart from the previous methods, we concentrate on the moments of the packet number in system. We find the recursive relationship between the moments of packet number, this fundamental relationship widely exists in the birth-death queue systems. Our results provide a new methodology to the design of communication systems with varying service rate.
This thesis is aimed to study the interaction between service interruption and the operation of communication systems, and develop analytical methods to help the design and optimization of communication systems with interrupted services. Our work are focused on two systems: optical buffer and wireless sensor network. The common ground of these two problems is they both present the features of service interruption.
Wireless sensor network is an ad hoc network consisting of hundreds of sensor nodes equipped with limited power sources, transmission range and functionality. A simple and effective way to save energy and prolong the network lifetime is to let the nodes interrupt their sensing and data transmission process, enter sleep mode randomly. However, sleep mode corresponds to low power consumption as well as to reduced network capacity, increased latency and slowed system response. We develop a queueing model with server shutting down in a varying neighborhood to model the behavior of sensor nodes, Combining the node queueing model and the network flow balance model, we construct an analytical framework to model the network performance, derive the network capacity, packet delivery delay and node responsive property. We also develop a node power consumption model, which takes the node sleep to active transition frequency into consideration. Our results demonstrate that the sleep/active dynamics produces the predominant impact on the average power consumption and packet delay, and properly choosing the time scale of sleep/active cycle is vital to design a power-efficient sensor network.
Liu Jianming.
"Apr. 2006."
Adviser: Tony Tong Lee.
Source: Dissertation Abstracts International, Volume: 67-11, Section: B, page: 6623.
Thesis (Ph.D.)--Chinese University of Hong Kong, 2006.
Includes bibliographical references (p. 109-117).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstracts in English and Chinese.
School code: 1307.

APA, Harvard, Vancouver, ISO, and other styles

9

Kalyanarama, Sesha Sayee KCV. "Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels." Thesis, 2006. http://hdl.handle.net/2005/362.

Full text

Abstract:

Information-theoretic arguments focus on modeling the reliability of information transmission, assuming availability of infinite data at sources, thus ignoring randomness in message generation times at the respective sources. However, in information transport networks, not only is reliable transmission important, but also stability, i.e., finiteness of mean delay in- curred by messages from the time of generation to the time of successful reception. Usually, delay analysis is done separately using queueing-theoretic arguments, whereas reliable information transmission is studied using information theory. In this thesis, we investigate these two important aspects of data communication jointly by suitably combining models from these two fields. In particular, we model scheduled communication of messages , that arrive in a random process, (i) over multiaccess channels, with either independent decoding or joint decoding, and (ii) over degraded broadcast channels. The scheduling policies proposed permit up to a certain maximum number of messages for simultaneous transmission. In the ﬁrst part of the thesis, we develop a multi-class discrete-time processor-sharing queueing model, and then investigate the stability of this queue. In particular, we model the queue by a discrete-time Markov chain defined on a countable state space, and then establish (i) a sufficient condition for c-regularity of the chain, and hence positive recurrence and finiteness of stationary mean of the function c of the state, and (ii) a sufficient condition for transience of the chain. These stability results form the basis for the conclusions drawn in the thesis. The second part of the thesis is on multiaccess communication with random message arrivals. In the context of independent decoding, we assume that messages can be classified into a fixed number of classes, each of which specifies a combination of received signal power, message length, and target probability of decoding error. Each message is encoded independently and decoded independently. In the context of joint decoding, we assume that messages can be classified into a fixed number of classes, each of which specifies a message length, and for each of which there is a message queue. From each queue, some number of messages are encoded jointly, and received at a signal power corresponding to the queue. The messages are decoded jointly across all queues with a target probability of joint decoding error. For both independent decoding and joint decoding, we derive respective discrete- time multiclass processor-sharing queueing models assuming the corresponding information-theoretic models for the underlying communication process. Then, for both the decoding schemes, we (i) derive respective outer bounds to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) show for any mes- sage arrival rate vector that satisfies the outer bound, that there exists a stationary “state-independent” policy that results in a stable system for the corresponding message arrival process, and (iii) show that the stability region of information arrival rate vectors, in the limit of large message lengths, equals an appropriate information-theoretic capacity region for independent decoding, and equals the information-theoretic capacity region for joint de-coding. For independent decoding, we identify a class of stationary scheduling policies, for which we show that the stability region in the limit of large maximum number of simultane-ous transmissions is independent of the received signal powers, and each of which achieves a spectral efficiency of 1 nat/s/Hz in the limit of large message lengths. In the third and last part of the thesis, we show that the queueing model developed for multiaccess channels with joint decoding can be used to model communication over degraded broadcast channels, with superposition encoding and successive decoding across all queues. We then show respective results (i), (ii), and (iii), stated above.

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Queuing theory. Telecommunication"

1

Dattatreya, G. R. Performance analysis of queuing and computer networks. Boca Raton: Chapman & Hall/CRC, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dattatreya, G. R. Performance analysis of queuing and computer networks. Boca Raton: CRC Press/Taylor & Francis, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Queueing modelling fundamentals with applications in communication networks. 2nd ed. Chichester, West Sussex, England: Wiley, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Computer networks and systems: Queueing theory and performance evaluation. New York: Springer-Verlag, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Robertazzi, Thomas G. Computer networks and systems: Queueing theory and performance evaluation. 2nd ed. New York: Springer-Verlag, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Computer networks and systems: Queueing theory and performance evaluation. 3rd ed. New York: Springer, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lakatos, László. Introduction to Queueing Systems with Telecommunication Applications. Boston, MA: Springer US, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Switching processes in queueing models. London, UK : ISTE: John Wiley & Sons, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chang, Cheng-Shang. Performance Guarantees in Communication Networks. London: Springer London, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Intensity variations in telephone traffic. Amsterdam: North Holland, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Queuing theory. Telecommunication"

1

Giambene, Giovanni. "Introduction to Telecommunication Networks." In Queuing Theory and Telecommunications, 3–60. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Giambene, Giovanni. "Survey on Probability Theory." In Queuing Theory and Telecommunications, 265–317. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Giambene, Giovanni. "Markov Chains and Queuing Theory." In Queuing Theory and Telecommunications, 319–65. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Alfa, Attahiru Sule. "Single Node Queuing Models." In Queueing Theory for Telecommunications, 105–69. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-7314-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Giambene, Giovanni. "Legacy Digital Networks." In Queuing Theory and Telecommunications, 61–127. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Giambene, Giovanni. "IP-Based Networks and Future Trends." In Queuing Theory and Telecommunications, 129–262. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Giambene, Giovanni. "M/G/1 Queuing Theory and Applications." In Queuing Theory and Telecommunications, 367–413. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Giambene, Giovanni. "Local Area Networks and Analysis." In Queuing Theory and Telecommunications, 415–95. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Giambene, Giovanni. "Networks of Queues." In Queuing Theory and Telecommunications, 497–512. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Alfa, Attahiru Sule. "Advance Single Node Queuing Models." In Queueing Theory for Telecommunications, 171–236. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-7314-6_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Queuing theory. Telecommunication"

1

Caixia Li, Sreenatha Gopalarao Anavatti, and Tapabrata Ray. "A game theory based traffic assignment using queueing networks." In 2013 13th International Conference on ITS Telecommunications (ITST). IEEE, 2013. http://dx.doi.org/10.1109/itst.2013.6685547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yablokov, E. N. "Application of Queueing Theory to the Analysis of GigaSpaceWire Protocol." In 2020 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF). IEEE, 2020. http://dx.doi.org/10.1109/weconf48837.2020.9131460.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Han-klup, Worawut, and Taweesak Samanchuen. "Design and Simulation of Outbound Functions in Warehouse Operations with Queueing Theory." In 2021 18th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON). IEEE, 2021. http://dx.doi.org/10.1109/ecti-con51831.2021.9454905.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!