Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
