Abstract
We consider a single server queueing system whose customers belong to certain types indexed by j ∈ ε (a countable space), the switching mechanism between different types of customers being governed by a Markov chain J = {J n , n ≥ 0} with the state space ε. Customers of each type have their own interarrival time and service time distributions determined by the state of J at the epoch of arrival. We assume that J is irreducible and persistent nonnull. The queue discipline is first come, first served.
This is a preview of subscription content, log in via an institution to check access.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Prabhu, N.U. (1998). The Markov-Modulated Single Server Queue. In: Stochastic Storage Processes. Applications of Mathematics, vol 15. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1742-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1742-8_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7260-1
Online ISBN: 978-1-4612-1742-8
eBook Packages: Springer Book Archive