Analysis and estimation of overflow probability in Jackson queueing networks

In this paper we consider a single M/M/1 queue and two M/M/1 queue in tandem Jackson networks for analyzing and estimating the overflow probability in a telecommunication networks. The arrival and service rates in a Jackson networks are modulated by finite state Markov process. First we estimated the buffer overflow in a single M/M/1 queueing network then we estimated the buffer overflow in two queues in tandem queueing network. Numerical and experimental results of buffer overflow on a single M/M/1 queue and a two queue in tandem are discussed.