Abstract
The study of continuous time queueing systems goes back to the early work of Erlang. However a somewhat different model, that of discrete time queueing systems, has recently been the subject of increasing attention. In a discrete time model time is assumed to be “slotted”. That is, time consists of a concatenation of fixed length intervals known as slots. Events are constrained to take place during these slots. For instance, a discrete time queue might accept at most one packet during a slot and service at most one packet during a slot. On a network-wide basis, multiple events may occur during each slot.
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
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Robertazzi, T.G. (2000). Discrete Time Queueing Systems. In: Computer Networks and Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1164-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1164-8_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7029-4
Online ISBN: 978-1-4612-1164-8
eBook Packages: Springer Book Archive