Abstract
Networks of queues with priorities among job classes arise frequently as models for a wide variety of congestion phenomena. Simulation is usually the only available means for studying such networks. The underlying stochastic process of the simulation is defined in terms of a linear “job stack,” an enumeration by service center and job class of all the jobs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shedler, G.S. (1987). Markovian Networks of Queues. In: Regeneration and Networks of Queues. Applied Probability, vol 3. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1050-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1050-4_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6997-7
Online ISBN: 978-1-4612-1050-4
eBook Packages: Springer Book Archive