To see the other types of publications on this topic, follow the link: Telecommunication Queuing theory.

Journal articles on the topic 'Telecommunication Queuing theory'

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

Select a source type:

Consult the top 32 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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
11

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
12

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
13

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
14

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
15

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
16

Tarasov, V. N. "MATHEMATICAL DELAY MODEL BASED ON SYSTEMS WITH HYPERERLANGIAN AND ERLANGIAN DISTRIBUTIONS." Radio Electronics, Computer Science, Control 1, no. 1 (March 27, 2021): 87–96. http://dx.doi.org/10.15588/1607-3274-2021-1-9.

Full text
Abstract:
Context. Studies of G/G/1 systems in queuing theory are relevant because such systems are of interest for analyzing the delay of data transmission systems. At the same time, it is impossible to obtain solutions for the delay in the final form in the general case for arbitrary laws of distribution of the input flow and service time. Therefore, it is important to study such systems for particular cases of input distributions. We consider the problem of deriving a solution for the average queue delay in a closed form for two systems with ordinary and shifted hypererlangian and erlangian input distributions. Objective. Obtaining a solution for the main characteristic of the system – the average delay of requests in the queue for two queuing systems of the G/G/1 type with ordinary and with shifted hypererlangian and erlangian input distributions. 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 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, spectral expansions of the solution of the integral Lindley equation for two systems are obtained, with the help of which calculation formulas for the average delay in a queue in a closed form are derived. Thus, mathematical models of queuing delay for these systems have been built. Conclusions. These formulas expand and supplement the known queuing theory formulas for the average delay G/G/1 systems with arbitrary laws distributions of input flow 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 delay, 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 delay from its average value, the jitter can be determined through the variance of the delay.
APA, Harvard, Vancouver, ISO, and other styles
17

Likhttsinder, Boris Ya, and Yulia O. Bakai. "DELAYS IN QUEUES OF QUEUING SYSTEMS WITH STATIONARY REQUESTS FLOWS." T-Comm 15, no. 2 (2021): 54–58. http://dx.doi.org/10.36724/2072-8735-2021-15-2-54-58.

Full text
Abstract:
During all periods of the study of telecommunications systems traffic, the analysis was based on mass service theory. The subjects of the study here are request flows to be processed by some limited performance resources. Resource constraints and the random nature of requests’ receipt lead to refusals in processing or queues. The first works devoted to the analysis of teletraffic belong to A. K. Erlang. Request flows represented flows of requests for connections in networks with channel switching. Since requests were received from a large number of independent users, the flows of such requests could be defined as stationary, ordinary with no effect, or as recurring requests, with an exponential distribution of time intervals between neighboring requests. Connection request flows to a telephone exchange node are a superposition of a large number of low-intensity flows from independent users. Therefore, the fixed Poisson flow model describes the real flows in telephone exchanges with channel switching quite well. Therefore, the stationary Poisson flow model describes real flows in telephone exchanges with channel switching rather well. The emergence of telecommunications networks with packet switching, especially multiservice networks, showed the impossibility of using Poisson flow models for their analysis. The article is devoted to the analysis of delays in queues of queuing systems with correlated stationary flows of general type requests. The traffic of packets in multiservice networks is typically characterized by a high degree of correlation. On the basis of interval methods of analysis, the relations generalizing the Khinchin-Pollaczek formula for the average value of waiting time in queuing systems with flows of the general kind of requests are obtained. The main parameters to be analyzed when outputting the above formulas are time intervals between neighboring requests. It is shown that the values of time delays in queues depend on the dispersion and dispersion index of a random value characterizing the degree of additional maintenance of processed requests.
APA, Harvard, Vancouver, ISO, and other styles
18

Mochalov, Valery P., Gennady I. Linets, Natalya Yu Bratchenko, and Svetlana V. Govorova. "An Analytical Model of a Corporate Software-Controlled Network Switch." Scalable Computing: Practice and Experience 21, no. 2 (June 27, 2020): 337–46. http://dx.doi.org/10.12694/scpe.v21i2.1698.

Full text
Abstract:
Implementing the almost limitless possibilities of a software-defined network requires additional study of its infrastructure level and assessment of the telecommunications aspect. The aim of this study is to develop an analytical model for analyzing the main quality indicators of modern network switches. Based on the general theory of queuing systems and networks, generated functions and Laplace-Stieltjes transforms, a three-phase model of a network switch was developed. Given that, in this case, the relationship between processing steps is not significant, quality indicators were obtained by taking into account the parameters of single-phase networks. This research identified the dependencies of service latency and service time of incoming network packets on load, as well as equations for finding the volume of a switch’s buffer memory with an acceptable probability for message loss.
APA, Harvard, Vancouver, ISO, and other styles
19

Tarasov, V. N., and N. F. Bakhareva. "QUEUEING SYSTEMS WITH TIME LAG." Radio Electronics, Computer Science, Control, no. 4 (January 10, 2022): 49–57. http://dx.doi.org/10.15588/1607-3274-2021-4-5.

Full text
Abstract:
Context. In the queuing theory of a research of the G/G/1 systems are relevant because it is impossible to receive decisions for the average waiting time in queue in a final form in case of arbitrary laws of distributions of an input flow and service time. Therefore, the study of such systems for particular cases of input distributions is important. The problem of deriving solutions for the average waiting time in a queue in closed form for systems with distributions shifted to the right from the zero point is considered. Objective. Getting solutions for the main characteristics of the systems – the average waiting time of requirements in the queue for queuing systems (QS) of type G/G/1 with shifted input distributions. Methods. 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 waiting time for the 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, spectral expansions are obtained for the solution of the Lindley integral equation for systems with delay, which are used to derive formulas for the average waiting time in a queue in closed form. The paper presents the final studies for the remaining eight delay systems. Conclusions. It is shown that in systems with delay, the average waiting time is less than in in the usual systems. The obtained formula for the average waiting time expands and complements the well-known queuing theory incomplete formula for the average waiting time for G/G/1 systems. This approach allows us to calculate the average latency 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
20

Grace, Adam W., Dirk P. Kroese, and Werner Sandmann. "Automated State-Dependent Importance Sampling for Markov Jump Processes via Sampling from the Zero-Variance Distribution." Journal of Applied Probability 51, no. 3 (September 2014): 741–55. http://dx.doi.org/10.1239/jap/1409932671.

Full text
Abstract:
Many complex systems can be modeled via Markov jump processes. Applications include chemical reactions, population dynamics, and telecommunication networks. Rare-event estimation for such models can be difficult and is often computationally expensive, because typically many (or very long) paths of the Markov jump process need to be simulated in order to observe the rare event. We present a state-dependent importance sampling approach to this problem that is adaptive and uses Markov chain Monte Carlo to sample from the zero-variance importance sampling distribution. The method is applicable to a wide range of Markov jump processes and achieves high accuracy, while requiring only a small sample to obtain the importance parameters. We demonstrate its efficiency through benchmark examples in queueing theory and stochastic chemical kinetics.
APA, Harvard, Vancouver, ISO, and other styles
21

Grace, Adam W., Dirk P. Kroese, and Werner Sandmann. "Automated State-Dependent Importance Sampling for Markov Jump Processes via Sampling from the Zero-Variance Distribution." Journal of Applied Probability 51, no. 03 (September 2014): 741–55. http://dx.doi.org/10.1017/s0021900200011645.

Full text
Abstract:
Many complex systems can be modeled via Markov jump processes. Applications include chemical reactions, population dynamics, and telecommunication networks. Rare-event estimation for such models can be difficult and is often computationally expensive, because typically many (or very long) paths of the Markov jump process need to be simulated in order to observe the rare event. We present a state-dependent importance sampling approach to this problem that is adaptive and uses Markov chain Monte Carlo to sample from the zero-variance importance sampling distribution. The method is applicable to a wide range of Markov jump processes and achieves high accuracy, while requiring only a small sample to obtain the importance parameters. We demonstrate its efficiency through benchmark examples in queueing theory and stochastic chemical kinetics.
APA, Harvard, Vancouver, ISO, and other styles
22

Bruno Klaus de Aquino Afonso and Lilian Berton. "QT-Routenet: Improved GNN generalization to larger 5G networks by fine-tuning predictions from queueing theory." ITU Journal on Future and Evolving Technologies 3, no. 2 (July 11, 2022): 134–41. http://dx.doi.org/10.52953/fbrb3688.

Full text
Abstract:
In order to promote the use of machine learning in 5G, the International Telecommunication Union (ITU) proposed in 2021 the second edition of the ITU AI/ML in 5G challenge, with over 1600 participants from 82 countries. This work details the second place solution overall, which is also the winning solution of the Graph Neural Networking Challenge 2021. We tackle the problem of generalization when applying a model to a 5G network that may have longer paths and larger link capacities than the ones observed in training. To achieve this, we propose to first extract robust features related to Queueing Theory (QT), and then fine-tune the analytical baseline prediction using a modification of the Routenet Graph Neural Network (GNN) model. The proposed solution generalizes much better than simply using Routenet, and manages to reduce the analytical baseline's 10.42 mean absolute percent error to 1.45 (1.27 with an ensemble). This suggests that making small changes to an approximate model that is known to be robust can be an effective way to improve accuracy without compromising generalization.
APA, Harvard, Vancouver, ISO, and other styles
23

Kravets, Oleg Jakovlevich, Elena Ivanovna Danilina, Iana Ivanovna Malikova, and Dmitry Vladimirovich Gorelov. "Monitoring optimization of telecommunication networks for generation of reserve capacity in system." Nexo Revista Científica 34, no. 02 (June 9, 2021): 993–1007. http://dx.doi.org/10.5377/nexo.v34i02.11625.

Full text
Abstract:
This article discusses an approach to monitoring optimization in telecommunication networks with packet routing. Mathematical model of data networking with accounting for monitoring traffic structure is described, optimization task is determined. Main attention is paid to model development on the basis of queueing theory in order to generation of reserve capacity in system. The main concept is that comparatively simple structure of monitoring network is imposed on physical structure of telecommunication network. The modeling is aimed at selection of optimum parameters of monitoring system, solution techniques for similar task are proposed. The obtained optimization task is sufficiently complicated, subsequent attempts should be aimed at searching for conditions which would enable introduction of some constraints in order to simplify its solution without noticeable loss of the model adequacy. This is especially important for asynchronous task of monitoring, it should be based on selection of the most acceptable type of objective function (linear or quadratic). Management system structure of terminal equipment monitoring has been developed for railway sector on the basis of SNMP V3. The system would permit to improve confidence level of data received from measuring system about electrical parameters of route cables, thus decreasing human errors upon classification of emergency situations occurring in communication networks.
APA, Harvard, Vancouver, ISO, and other styles
24

Maharramov, Zakir, Vugar Abdullayev, and Tamilla Mammadova. "MODELLING SELF-SIMILAR TRAFFIC OF MULTISERVICE NETWORKS." EUREKA: Physics and Engineering 1 (January 31, 2019): 46–54. http://dx.doi.org/10.21303/2461-4262.2019.00841.

Full text
Abstract:
Simulation modelling is carried out, which allows adequate describing the traffic of multiservice networks with the commutation of packets with the characteristic of burstiness. One of the most effective methods for studying the traffic of telecommunications systems is computer simulation modelling. By using the theory of queuing systems (QS), computer simulation modelling of packet flows (traffic) in modern multi-service networks is performed as a random self-similar process. Distribution laws such as exponential, Poisson and normal-logarithmic distributions, Pareto and Weibull distributions have been considered. The distribution of time intervals between arrivals of packages and the service duration of service of packages at different system loads has been studied. The research results show that the distribution function of time intervals between packet arrivals and the service duration of packages is in good agreement with the Pareto and Weibull distributions, but in most cases the Pareto distribution prevails. The queuing systems with the queues M/Pa/1 and Pa/M/1 has been studied, and the fractality of the intervals of requests arriving have been compared by the properties of the estimates of the system load and the service duration. It has been found out that in the system Pa/M/1, with the parameter of the form a> 2, the fractality of the intervals of requests arriving does not affect the average waiting time and load factor. However, when 𝑎≤2, as in the M/Pa/1 system, both considered statistical estimates differ. The application of adequate mathematical models of traffic allows to correctly assess the characteristics of the quality of service (QoS) of the network.
APA, Harvard, Vancouver, ISO, and other styles
25

Yula, O., O. Bidnyi, A. Vakula, O. Petrov, and O. Kravchuk. "ANALYSIS OF APPROACHES OF IMPACT OF ELECTRONIC WARFARE MEANS ON THE NETWORK–CENTRIC CONTROL SYSTEM." Наукові праці Державного науково-дослідного інституту випробувань і сертифікації озброєння та військової техніки, no. 7 (May 21, 2021): 101–14. http://dx.doi.org/10.37701/dndivsovt.7.2021.12.

Full text
Abstract:
The intensive development of information and control technologies, as well as their integration into a single information space, leads to an increase in the role of such technologies in the processes of control of troops (forces) and weapons, including high-precision ones. At the same time, the electronic material base of the information infrastructure created within the concept of network-centric warfare is potentially vulnerable to electronic warfare. In this article, the authors analyze the approaches to the impact of electronic warfare on network-centric control systems. In the course of the study, the authors solved the following interrelated tasks: identified information restrictions on the implementation of the network-centric war concept; the prospects for the development of electronic warfare systems that are focused on disruption of the operation of network-centric systems of military control and the prospective scientific and methodological approaches to substantiate the methods of radio-electronic impact on network-centric control systems. In the course of this research, the authors used the basic principles of electronic warfare theory, signal theory, communication theory, queuing systems and classical methods of scientific cognition – analysis and synthesis. According to the results of the study, the following conclusions can be drawn: perspective directions for the development of radio-electronic impact, oriented on the transport layer of communication networks, can be implemented as complexes of territorially distributed means of electronic control, implementing fundamentally new methods of suppression, and special software and bookmarks software (viruses) that are introduced into the telecommunications network equipment. It should be noted that the use of all the above radio-electronic effects is advisable only against packet networks with advanced topology. The use of such impacts against networks with tree topology is pointless since there is a possibility of attaining the suppression effect by“classical” channel suppression.
APA, Harvard, Vancouver, ISO, and other styles
26

Shyshatskyi, A., O. Sova, Yu Zhuravskyi, O. Nalapko, Yu Sokil, and Yu Ryndin. "ANALYSIS OF APPROACHES OF INFLUENCE OF ELECTRONIC WARFARE MEANS ON THE ON THE NETWORK-CENTRIC CONTROL SYSTEM." Системи управління, навігації та зв’язку. Збірник наукових праць 6, no. 58 (December 28, 2019): 129–39. http://dx.doi.org/10.26906/sunz.2019.6.129.

Full text
Abstract:
The intensive development of information and control technologies, as well as their integration into a single information space, leads to an increase in the role of such technologies in the processes of control of troops (forces) and weapons, including high-precision ones. At the same time, the electronic material base of the information infrastructure created within the concept of network-centric warfare is potentially vulnerable to electronic warfare. In this article, the authors analyze the approaches to the influence of electronic warfare on network-centric control systems. In the course of the study, the authors solved the following interrelated tasks: identified information restrictions on the implementation of the network-centric war concept; the prospects for the development of electronic warfare systems that are focused on disruption of the operation of network-centric systems of military control and the prospective scientific and methodological approaches to substantiate the methods of radio-electronic influence on network-centric control systems. In the course of this research, the authors used the basic principles of electronic warfare theory, signal theory, communication theory, queuing systems and classical methods of scientific cognition - analysis and synthesis. According to the results of the study, the following conclusions can be drawn: perspective directions for the development of radio-electronic influences, oriented on the transport layer of communication networks, can be implemented as complexes of territorially distributed means of electronic control, implementing fundamentally new methods of suppression, and special software and bookmarks software (viruses) that are introduced into the telecommunications network equipment. It should be noted that the use of all the above radio-electronic effects is advisable only against packet networks with advanced topology. The use of such influences against networks with tree topology is pointless given the possibility of attaining the suppression effect of “classical” channel suppression
APA, Harvard, Vancouver, ISO, and other styles
27

Ibrahimov, Bayram G., Mehman F. Binnatov, and Yalchin S. Isayev. "THE INVESTIGATION AND EVALUATION MULTISERVICE NETWORK NGN/IMS FOR MULTIMEDIA TRAFFIC." SYNCHROINFO JOURNAL 6, no. 3 (2020): 10–13. http://dx.doi.org/10.36724/2664-066x-2020-6-2-10-13.

Full text
Abstract:
The subject of the study is multiservice communication network using the concept NGN (Next Generation Network) based on the open network architecture IMS (Internet Protocol Multimedia Subsystem), supporting a wide range services. The basis of this architecture is the IMS core, consisting of a set of specialized modules responsible for various functions for customer service. The purpose of the article is to analyze the existing technical capabilities of the IMS multimedia messaging subsystem and perspective solutions for the functioning of the NGN/IMS network efficiency in providing multimedia service. As the efficiency of the system, the capacity NGN/IMS networks is selected using the signaling system and protocols NGN. The capacity NGN/IMS networks during the establishment of a multimedia session was analyzed and the functional architecture of the IMS multimedia messaging subsystem that determine the interaction NGN signaling systems an protocols was explored. Manage the presentation Triple Play services to subscribers and simultaneously modify the media stream within the session allows the protocol for the initialization of the SIP and Diameter sessions, which are the main IMS signaling protocol. One of the important requirements for the IMS subsystem is the maintenance QoS (Quality of Service). A mathematical model for estimating the quality of communication services using a system GI/G/1/N based on the theory diffusion approximation is proposed. The research presented in this paper is very important for the theory queuing systems, since the article proposes a method for investigating multiservice communication networks with non-Poisson incoming flow and effective results are obtained for NGN/IMS networks. On the basis of the model analytical expressions are obtained, which allow evaluating the performance indicators of the Triple Play service. The proposed mathematical model can be used to solve a wide range of practical problems, including the management multiservice traffic in the process its transmission in multiservice telecommunications networks, taking into account the quality of service classes. Thus, studies NGN/IMS network capacity indicators using SIP protocols are relevant.
APA, Harvard, Vancouver, ISO, and other styles
28

Kazansky, N. A., and P. I. Lysyuk. "Methods of Analysis and Synthesis of Switching Circuits of Photonic Switches Using the Example of Spanke Architecture." World of Transport and Transportation 19, no. 5 (July 8, 2022): 17–22. http://dx.doi.org/10.30932/1992-3252-2021-19-5-2.

Full text
Abstract:
The development of high-speed rail requires introduction of new telecommunications technology implemented in an integrated digital technological communication system (IDTC). Features of building such systems comprise provision of switching optical data channels using photonic switches (PS). Switching processes in PS occur at the photon (optical) level. A feature of construction of PS is the use of multi-tier topologies, performed using binary switches (BSs). BS is the simplest switching element with the number of input/output ports equal to one or two. The concepts for constructing PS are based on the technology of the well-known switching circuits using BS whose architecture and topology are assigned the names of their creators (Benes, Spanke, Spanke–Benes architecture, Clos network, etc. With an increase in PS capacity, its structure becomes more complicated: the number of links in the switching circuit, the total number of BSs, the length of switching routes, and the redundancy factor increase. In addition, it becomes necessary to calculate the probabilities of the occurrence of internal blocking in switching circuits, speed of switching optical signals, the value of attenuation of the optical signal in PS circuit, etc. The objective of the study was to develop methods of analysis and synthesis of switching circuits of photonic switches using the example of a circuit of Spanke architecture of a given capacity with calculation of the probabilities of occurrence of internal blocking. The authors used general scientific and engineering methods of mathematical modelling, probability and queuing theory and an example of an algorithm for analysing the structures of Spanke topology with capacities from 4×4 to 128×128. Their topological and probabilistic characteristics (the number of links in the switching circuit, the total number of BS, the length of the switching routes, the probability of occurrence of internal blocking in PS circuits) have been determined. The results of calsulations are presented in the form of tables. The developed methods of analysis and synthesis can be used in the study of similar switching circuits built using BS.
APA, Harvard, Vancouver, ISO, and other styles
29

Dalalah, Doraid. "Benchmarking of Six Sigma in telecom services." Benchmarking: An International Journal 26, no. 6 (August 5, 2019): 1799–822. http://dx.doi.org/10.1108/bij-07-2017-0190.

Full text
Abstract:
Purpose The purpose of this paper is to assess and benchmark Six Sigma strategies in services sector, namely, the telecom field, by establishing tables of fallouts of non-conforming services and their associated costs along with a custom data envelopment model for benchmarking the different strategic alternatives. Design/methodology/approach Under normality assumption, process fallout in Six Sigma is around 0.002/3.4 part per million for a centered/shifted process. By introducing Six Sigma to applications in services sector, normality assumption may no longer be valid; hence, fallouts of non-normal attributes are computed for different one-sided quality levels. The associated costs of strategy deployment, fallout and transaction completion are all considered. Data envelopment analysis model is also established to benchmark the Six Sigma strategic plans. The strategies are detailed down to processes and to quality characteristics which constitute the decision-making units. The efficiency of each service unit is computed using both CCR and super efficiency models. Findings The amount of efforts/costs needed to reduce the variation in a service may differ according to the targeted quality level. For the same Six Sigma quality level, services demonstrate different performance/efficiencies and hence different returns. In some scenarios, moderate quality levels could present high efficiencies as compared to services of higher levels. It was also found that the required improvement is less in the case of Log-normal as compared to normal distributions at some quality levels. This observation is also noted across the presented distributions of this study (Normal, Log-normal, Exponential, Gamma and Weibull). Social implications The deployment of Six Sigma in services is mostly found in time-related concepts such as timeliness of billing, lifetimes in reliability engineering, queueing theory, healthcare and telecommunication. Originality/value The paper contributes to the existing research by presenting an assessment model of Six Sigma strategies in services of non-normal distributions. Strategies of different quality levels present diverse efficiencies; hence, higher quality levels may not be the best alternatives in terms of the returns on investment. The computed fallout rates of the different distributions can serve as palm lines for further deployment of Six Sigma in services. Besides, the combination of optimization and Six Sigma analysis provides additional benchmarking tool of strategic plans in both manufacturing and services sector.
APA, Harvard, Vancouver, ISO, and other styles
30

Mohammed, Mohialdeen Mustafa, Zaika Viktor, Khlaponin Yurii, Berkman Lyubov, Polonskyi Konstiantyn, and Oleksandr Leonidovich Turovsky. "Methods for assessing the impact of bandwidth of control channels on the quality of telecommunications networks in the transmission of data packets of different types." International Journal of Communication Networks and Information Security (IJCNIS) 13, no. 2 (April 15, 2022). http://dx.doi.org/10.17762/ijcnis.v13i2.5034.

Full text
Abstract:
Abstract: It is known that since the early 2000s there has been a rapid increase in data traffic and a significant increase in the need for information flows in the process of providing new types of telecommunications services. This has led to the fact that the existing telecommunications networks have failed or approached the limit of their ability to serve subscribers with specified quality of service. The problem of improving the network architecture of such networks and improving the quality of their operation based on the use of modern methods and principles has arisen and needs constant solution. In this paper the requirements to the bandwidth of the channels of the telecommunication network management system in modern conditions are analyzed and their formalized description is given. In order to assess the bandwidth of the channel of the control network of the telecommunications network on the indicators of the quality of its work in the transmission of various types of data in the work developed and submitted an appropriate methodology. The method is based on mathematical dependences that describe the process of functioning of the telecommunication network management system based on the application of the laws and rules of queuing theory.
APA, Harvard, Vancouver, ISO, and other styles
31

Kniazievа, Nina, and Serhii Shestopalov. "EVALUATION OF SERVICES QUALITY IN IMS." Visnyk Universytetu “Ukraina”, 2019. http://dx.doi.org/10.36994/2707-4110-2019-1-22-22.

Full text
Abstract:
The main stages of the historical development of telecommunication networks are shown. It is noted that today the most common concepts are NGN (Next Generation Network), supporting the functionality of Triple-Play Services (triple services – voice, video and data transmission), as well as IMS (IP Multimedia Subsystem), which combines cellular technology and landline communications. They are able to provide a wide range of services: basic, additional, intelligent. In addition, IMS is able to provide mobile services. The IMS architecture layers are presented – transport layer, control layer; layer of service and application servers. Particular attention is paid to the layer of service and application servers. Based on the analysis of ITU recommendations, the main telecommunication services quality indexes are determined, namely, the time of service provision, the length of the queue that the service request falls into to wait for service on the server, and the probability of refusing to provide services. Based on the proposed mathematical models of the NGN intelligent superstructure, analytical expressions are presented for calculating the quality indexes of intelligent services in NGN for one type of service and for K types of services, taking into account the self-similarity of traffic, and without taking into account. To evaluate the quality of services in IMS, it is proposed to use the approaches of queuing theory and tensor analysis. Tensor analysis offers a mathematical apparatus for transforming coordinate systems, considering IMS as a set of geometric objects whose projections are different in different coordinate systems, but the physical properties of the objects themselves do not change. Expressions are proposed that make it possible to calculate the following QoS indexes in IMS: average queue length, average residence time of an application in the system for all types of services in IMS. It is considered that the incoming traffic is the simplest. Further development of the work is to take into account the self-similar nature of traffic, which is created by the flow of requests for services that come to IMS, as well as the limitations of the server buffer, which will allow a more accurate assessment of the quality of services in IMS.
APA, Harvard, Vancouver, ISO, and other styles
32

"Queueing theory for telecommunications." Choice Reviews Online 29, no. 08 (April 1, 1992): 29–4562. http://dx.doi.org/10.5860/choice.29-4562.

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!

To the bibliography