Single Node Queueing Models with Server Vacations

Alfa, Attahiru S.

doi:10.1007/978-1-4939-3420-1_8

Attahiru S. Alfa^2,3

1172 Accesses

Abstract

Vacation queues are a very important class of queues in real life, especially in telecommunication systems where medium access control (MAC) is a critical component of managing a successful network.By definition, a vacation queue is a queueing system in which the server is available only a portion of the time.At other times it is busy serving other stations or just not available may be due to maintenance activities (either routine or due to a breakdown).Polling systems are a class of queueing systems in which a server goes to attend to different queues based on a schedule, which implies that the server is not always available to a particular queue. Hence when the server is attending to other queues then it is away on vacation as far as the queue not receiving service is concerned.Vacation queues are used extensively to approximate polling systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 84.99; Price excludes VAT (USA)

Softcover Book: USD 109.99; Price excludes VAT (USA)

Hardcover Book: USD 109.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

Alfa AS (2014) Decomposition results for a class of vacation queues. Operations Research Letters 42:140–144
Article MathSciNet Google Scholar
Doshi BT (1985) A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times. J Appl Prob 22:419–428
Article MathSciNet MATH Google Scholar
Doshi BT (1986) Queueing systems with vacations - a survey. Queueing Systems 1:29–66
Article MathSciNet MATH Google Scholar
Fuhrman SW, Cooper RB (1985) Stochastic decomposition in the M/G/1 queue with generalized vacations. Oper Res 33:1117–1129
Article MathSciNet MATH Google Scholar
Latouche G, Ramaswami V (1993) A logarithmic reduction algorithm for quasi-birth-and-death processes. J Appli Probab 30:650–674
Article MathSciNet MATH Google Scholar
Meini B (1998) Solving M/G/1 type markov chains: Recent advances and applications. Stochastic Models 14:479–496
Article MathSciNet MATH Google Scholar
Tian N, Zhang ZG (2002) The discrete-time GI/Geo/1 queue with multiple vacations. Queueing Systems 40:283–294
Article MathSciNet MATH Google Scholar

Download references

Author information

Authors and Affiliations

Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada
Attahiru S. Alfa
Department of Electrical, Electronic and Computer Engineering, University of Pretoria, Pretoria, South Africa
Attahiru S. Alfa

Authors

Attahiru S. Alfa
View author publications
You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Alfa, A.S. (2016). Single Node Queueing Models with Server Vacations. In: Applied Discrete-Time Queues. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-3420-1_8

Download citation

DOI: https://doi.org/10.1007/978-1-4939-3420-1_8
Published: 11 March 2016
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-3418-8
Online ISBN: 978-1-4939-3420-1
eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics