Abstract
This paper studies a tandem queue with MAP inputs. A novel formulation is proposed to model it into a level-dependent quasi-birth–death process with expanding blocks. This allows us to analyze the joint time-dependent and steady-state queue length distributions efficiently. We also obtain the network sojourn time of an arbitrary customer.
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
