Abstract
The algorithm for the transient solution for the denumerable state Markov process with an arbitrary initial distribution is given in this paper. The transient queue length distribution for a general Markovian queueing system can be obtained by this algorithm. As examples, some numerical results are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
