Abstract
In this chapter we extend the study of stand-alone contention trees to more practical settings. In such a setting, one must take into account that stations alternate between activity periods and idle periods, and the splitting procedure must be complemented with a channel access protocol to accommodate newcomers. We describe the standard algorithms to do this, free access and blocked access, and propose a novel mechanism: Scheduled blocked access.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Delay Models for Contention Trees in Closed Populations. In: Multiaccess, Reservations & Queues. Philips Research Book Series, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69317-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-69317-8_4
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)