Log in

Relevant bibliographies by topics / Telecommunication Queuing theory

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Telecommunication Queuing theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 30 January 2023

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 'Telecommunication Queuing theory.'

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 "Telecommunication Queuing theory"

1

Usman Moyi, Aliyu, Kabir Bello Gamagiwa, Olayemi Joshua Ibidoja, and Garba Muhammad. "Application of Queuing Theory in a University Clinic." International Journal of Science for Global Sustainability 8, no. 1 (March 21, 2022): 9. http://dx.doi.org/10.57233/ijsgs.v8i1.338.

Full text

Abstract:

Institutions such as banks, airlines, hospitals and telecommunication industries employ queuing theory to help in assisting the capacity levels needed to experience demand in a more optimized way for service improvement. In this article, we studied and employed the queuing theory activities of the Federal University Gusau Health Services Clinic. The distributions of patients’ arrival and service times were identified. The system was treated as a single, time-independent arrival with multiple service points. Based on the data obtained on the arrival and service processes, appropriate distributions were fitted and tested using the Chi-squared goodness of fit-test.

APA, Harvard, Vancouver, ISO, and other styles

2

Larionov, A. A., A. A. Mukhtarov, and A. M. Sokolov. "The calibration method of a tandem queueing model with PH service time using NS-3 simulation of a multihop wireless network." Journal of Physics: Conference Series 2091, no. 1 (November 1, 2021): 012030. http://dx.doi.org/10.1088/1742-6596/2091/1/012030.

Full text

Abstract:

Abstract End-to-end delay is one of the key characteristics of communication network performance. This characteristic determines the possibility of using the network for various delay-critical applications like voice or video transmission. One of the widely used approaches to estimating delays is the use of the queuing theory. According to this approach, a telecommunication network is modeled using a multiphase queuing system. Communication channels are modeled using service devices, and the incoming traffic is modeled with random distributions of the inter-arrival intervals between packets. The accuracy of this network model directly depends on how well the service time distributions are chosen. These distributions must consider the specifics of complex telecommunication protocols, size distributions of the transmitted packets, and, in case of wireless channels, the rate of collisions and retransmissions. The paper presents a study of the accuracy of estimates of end-to-end delays in a multi-hop wireless network using a queuing network with a phase-type (PH) service time distributions. To calibrate the model, PH distributions are found using the moments-matching method based on sample data on the duration of packet transmission in IEEE 802.11 channels. This sample data was obtained using a simulation model written in NS-3, taking into account the features of the IEEE 802.11 protocol and the presence of collisions in the network. To evaluate the accuracy, end-to-end delays are calculated using the queuing network and the wireless network simulation model. It is shown that it is possible to obtain reasonably accurate estimates for small networks, but with an increase in the size of the network, the accuracy decreases. In conclusion, recommendations are given to improve the accuracy of modeling.

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

Akhmetshina, Eleonora G. "MODELING DATA TRANSMISSION SYSTEMS USING MODERN INFORMATION TECHNOLOGIES." T-Comm 15, no. 8 (2021): 52–57. http://dx.doi.org/10.36724/2072-8735-2021-15-8-52-57.

Full text

Abstract:

When modeling data transmission systems for various purposes, including computer and telecommunication networks, both components of mathematical modeling are widely used. These are simulation modeling and analytical modeling based on queuing theory. At the same time, researchers can always compare the results obtained by means of simulation and analytical modeling. From modern technologies of simulation modeling, one can single out the IT GURU Academic Edition technologies, represented by the Opnet Modeler and Riverbed Modeler software products with powerful graphical editors. Graphic editors allow you to create simulation models of data transmission systems of any complexity, and launch and run their models to obtain statistics of the main performance indicators of these systems. Comparison of the simulation results with the results of queuing systems (QS) of the G/G/1 type makes it possible to assess the adequacy of those and other mathematical models. This article summarizes the results of the author’s publications on G/G/1 systems based on time-shifted distribution laws such as exponential, hyperexponential, and Erlang distribution. Thus, these distribution laws for the random variables used provide the coefficients of variation less than, equal or greater than one. This fact is important from the point of view of the queuing theory, because the average delay of claims in the system directly depends on the coefficients of variations in the time intervals for the arrival and servicing of claims.

APA, Harvard, Vancouver, ISO, and other styles

5

Nalapko, Oleksii, Oleg Sova, Andrii Shyshatskyi, Nadiia Protas, Serhii Kravchenko, Andriy Solomakha, Yevhenii Neroznak, Oleksandr Gaman, Dmytro Merkotan, and Hennadii Miahkykh. "Analysis of methods for increasing the efficiency of dynamic routing protocols in telecommunication networks with the possibility of self-organization." Technology audit and production reserves 5, no. 2(61) (September 23, 2021): 44–48. http://dx.doi.org/10.15587/2706-5448.2021.239096.

Full text

Abstract:

The object of research is the military radio communication system. Effective operation of routing protocols is possible only if there is reliable information about the network topology for network nodes, given that the mobility of individual nodes is insignificant in special purpose wireless networks. Because nodes in the network demonstrate the mobility property of the node groups. This paper solves the problem of the analysis (decomposition) of methods of protocols efficiency increase of dynamic routing in telecommunication networks with a possibility to self-organization. In the course of the research, the authors used the main provisions of the queuing theory, the theory of automation, the theory of complex technical systems and general scientific methods of cognition, namely analysis and synthesis. This research analyzes various methods to increase the efficiency of dynamic routing protocols. Energy efficiency methods focus on three main components in energy management: battery management, transmission energy management and system energy management methods. Reliable multicast has become indispensable for the successful deployment of special purpose wireless networks, such as in tactical military operations and emergency operations. The results of the research will be useful in: – development of new routing algorithms; – substantiation of recommendations for improving the efficiency of the route selection process in networks with the possibility of self-organization; – analysis of the electronic situation during hostilities (operations); – while creating promising technologies to increase the efficiency of mobile radio networks. Areas of further research will focus on the development of a methodology for the operational management of interference protection of intelligent military radio communication systems.

APA, Harvard, Vancouver, ISO, and other styles

6

Tarasov, V. N., and N. F. Bakhareva. "Mathematical Model of the Delay in Communication Networks Based on QS with a Time Lag." Informacionnye Tehnologii 27, no. 12 (December 8, 2021): 634–41. http://dx.doi.org/10.17587/it.27.634-641.

Full text

Abstract:

In the mathematical modeling of modern computer networks, telecommunication networks, traffic flows, logistics and many others, the methods of queuing theory are widely used. In turn, in studies of queuing systems (QS) G/G/1 with arbitrary distribution laws of intervals between adjacent requirements of the incoming flow and their service time, the spectral decomposition method (MSD) of solving the Lindley integral equation is often used. This method is based on the search for zeros and poles of the constructed spectral decomposition in the form of some fractional-rational function using numerical methods to determine the roots of polynomials. In this case, the coefficients of the polynomial in the numerator of the expansion are expressed through the unknown parameters of the distribution laws used to describe the QS. In the case of teletraffic research, usually these unknown parameters of the distribution laws can be determined through the numerical characteristics of the intervals between traffic packets by the method of moments. The purpose of this article is to present a fundamentally new mathematical model of a system formed by two flows with distribution laws shifted to the right. This is possible only for those probability distribution laws whose density functions are Laplace transformable. The main advantages of such systems, let us call them time lag systems, are that they provide less queue latency compared to conventional systems, and that they extend the range of traffic parameters. The article presents the results obtained on the average delay of requests in the queue for a system with exponential and hyper-Erlang distributions, an algorithm for calculating the average delay and the results of computational experiments in the Mathcad package.

APA, Harvard, Vancouver, ISO, and other styles

7

Иванов, А. Ю., В. И. Комашинский, 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

8

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

9

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

10

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

More sources

Dissertations / Theses on the topic "Telecommunication Queuing theory"

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

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

4

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

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

Yunus, Muhammad Naim. "Blocking in teletraffic systems under nonstationary arrival and service conditions / by Muhammad Naim Yunus." Thesis, 1985. http://hdl.handle.net/2440/20402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Frater, Michael R. "Estimation of the statistics of rare events in data communications systems." Phd thesis, 1990. http://hdl.handle.net/1885/138196.

Full text

Abstract:

There are many examples of rare events in telecommunications systems, including buffer overflows in queueing systems, cycle slipping in phase-locked loops and the escape of adaptive equalizers from local (possibly incorrect) equilibria. In many cases, factors such as the high cost of the occurrence of these events mean that their statistics are of interest in spite of their rarity. The estimation of the statistics of these rare events via direct simulation is very time consuming, simply because of their rarity. In fact, the required simulation time can be so high as to make simulation not just difficult, but impossible. One technique that can be used to speed up simulations of rare events is importance sampling, in which the statistics of the event in which we are interested are inferred from the statistics (obtained by simulation) of some (less rare) event in a different system. Because the events are less rare, the simulation time is reduced. However, there remains the problem of maximizing the speedup to ensure that the simulation time is minimized. It has been shown previously that as the rarity of the events increases, large deviations theory can be used to create a simulation system that is optimal in the sense of minimizing the variance of a probability estimator in the simulation of a rare event. In this thesis, we extend these results, and also apply them to a number of specific applications for which we obtain analytic expressions for an asymptotically optimal simulation system. Examples studied include multiple-priority data streams and a number of queues with deterministic servers, which can be used in the modeling of asynchronous transfer mode (ATM) switches. In the case of buffer overflows in queueing systems, it will be shown that the required simulation time is reduced from being exponential in the buffer size for direct simulation , to being linear in the buffer size using the asymptotically optimal simulation system, and that this holds even for relatively small buffer sizes. While much of the previous work on fast simulation of rare events has concentrated on the use of large deviations and expon-ential changes of measure, we look beyond this class, and show that it is possible to obtain larger increases in simulation speed, using, for example, the reverse-time model of the system being studied. In fact , it is possible to obtain an infinite speedup. However, doing this may require omniscience, i.e. effectively knowing the answer before we start. In addition to the investigation of methods for performing fast simulation, the relationship between optimal control, large deviations and reverse-time modeling is explored, with particular reference to rare events. It is shown that, in addition to the previously known relationship between optimal control and large deviations, a similar relationship exists between optimal control and reverse-time modeling, in which the trajectory defining the solution of the optimal control problem in which control energy is minimized defines the mean path of the reverse-time model of the process.

APA, Harvard, Vancouver, ISO, and other styles

10

"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

Books on the topic "Telecommunication Queuing theory"

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

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

5

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

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

Bonald, Thomas. Network performance analysis. Hoboken, NJ: John Wiley, 2011.

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 "Telecommunication Queuing theory"

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. "Markov Chains and Queuing Theory." In Textbooks in Telecommunication Engineering, 235–82. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75973-5_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Giambene, Giovanni. "M/G/1 Queuing Theory and Applications." In Textbooks in Telecommunication Engineering, 283–331. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75973-5_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

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

6

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

7

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

8

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

9

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

10

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

Conference papers on the topic "Telecommunication Queuing theory"

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

Keramidi, Irene, Ioannis Moscholios, Michael Logothetis, and Panagiotis Sarigiannidis. "Estimating the Required Resources in a Vehicular Ad Hoc Network Using Queueing Theory Models." In 2022 Panhellenic Conference on Electronics & Telecommunications (PACET). IEEE, 2022. http://dx.doi.org/10.1109/pacet56979.2022.9976325.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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!