ANALYSIS OF QUEUEING NETWORK THEORY IN TELECOMMUNICATION

Abstract

Queueing network models are cost effective tools to analyze modern computer systems. This analysis shows the basic results using the operational research, which allows the analyst to test whether each assumption is meeting in a provided system. In the early section, we described the nature and basics of queueing network models. The basic performance terminologies like queue length, mean queue lengths, and mean response times, and operational relationships among them are derived. Following this, the concept of Markov chain, birth-death process is introduced. The proportions of time spent in each system state are then linked to job demand parameters and device characteristics using the concepts of state transition balance, one-step behavior, and homogeneity. Eventually, Markov models along with performance probabilities in transition while switching are discussed. Efficient methods for computing optimized path are also described for the transmission.