Abstract
Contention trees constitute a popular class of algorithms to provide access to a shared resource for a random population of contenders. In particular, they can be used to transmit the request messages of a reservation procedure. In this chapter, we explore the basic properties of contention trees. The main original contribution of this chapter concerns our study of the delay experienced in the use of a contention tree. For this we introduce the notion of success instant. We give an approximation to the marginal empirical distribution of a success instant and show that this approximation is asymptotically exact for an increasing number of contenders.
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.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Basic Properties of Contention Trees. In: Multiaccess, Reservations & Queues. Philips Research Book Series, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69317-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-69317-8_3
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)