Abstract
The central feature of the present work is an algorithm for computing numerically the time dependent probabilities for discrete parameter Markov chains. The algorithm has been obtained by employing the concept of sweeping of probabilities in certain subspaces of the state space. It has been applied to examine the behaviour of a sizable class of bulk queues and queues with non-stationary input and service conditions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 1972 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Bagchi, T.P., Templeton, J.G.C. (1972). Conclusions and Directions for Further Research. In: Numerical Methods in Markov Chains and Bulk Queues. Lecture Notes in Economics and Mathematical Systems, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80712-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-80712-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05996-7
Online ISBN: 978-3-642-80712-1
eBook Packages: Springer Book Archive