Abstract
The queue length distribution at a random point in time in the stationary BMAP/G/1 queue is shown to be identical to the stationary distribution of a certain imbedded Markov chain related to the corresponding BMAP/G/1 queue with multiple vacations and exhaustive services. This observation leads to an alternative recursion formula to compute the queue length distribution at a random point in time in the stationary BMAP/G/1 queue, which is simpler than the known formula yet numerically stable
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
