Abstract
A single node queue is a system in which a customer comes for service only at one node. The service may involve feedback into the same queue. When it finally completes service, it leaves the system. If there is more than one server then they must all be in parallel. It is also possible to have single node queues in which we have several parallel queues and a server (or several servers) move around from queue to queue to process the items waiting; an example is a polling system to be discussed later. Polling systems are used extensively to model medium access control (MAC) in telecommunications. However, when we have a system where an item arrives for service and after completing the service at a location the item joins another queue in a different location for processing.
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Alfa, A. (2010). Single Node Queuing Models. In: Queueing Theory for Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7314-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7314-6_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-7313-9
Online ISBN: 978-1-4419-7314-6
eBook Packages: Computer ScienceComputer Science (R0)