Abstract
For modelling data transfer organised via a reservation procedure, we proposed in Sect. 2.3 two models, referred to as fixed boundary model and flexible boundary model. For these models, time is divided into slots, and slots are grouped into frames. The fixed boundary model divides each frame into a fixed number of request and data slots. The flexible boundary model also uses this division, but additionally, the unused data slots (due to lack of data packets) are turned into request slots. For both models, we first consider the queue length at frame boundaries. The stationary queue length distribution in either model can be determined from a rather standard application of the generating function technique (demonstrated in Sect. 6.2 for the discrete bulk service queue). Due to the periodic scheduling, however, it is far less straightforward to analyse the stationary delay. By adopting a technique developed in Bruneel and Kim [28] and Kang and Steyaert [92], we succeed in deriving the probability generating function of the stationary delay.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Periodic Scheduling. In: Multiaccess, Reservations & Queues. Philips Research Book Series, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69317-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-69317-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69316-1
Online ISBN: 978-3-540-69317-8
eBook Packages: Computer ScienceComputer Science (R0)