Some Models for Contention Resolution in Cable Networks
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Delay models for contention trees in closed populations
Performance Evaluation
Transient analysis of tree-Like processes and its application to random access systems
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Covert channels in ad-hoc wireless networks
Ad Hoc Networks
Collision reduction for heterogeneous wireless sensor networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
| Hi-index | 754.84 |
The Capetanakis-Tsybakov-Mikhailov (1978, 1979) contention tree algorithm provides an efficient scheme for multiaccessing a broadcast-communication channel. This paper studies the statistical properties of multiple-access contention tree algorithms with ternary feedback for an arbitrary degree of node. The particular quantities under investigation are the number of levels required for a random contender to have successful access, as well as the number of levels and the number of contention frames required to provide access for all contenders. Through classical Fourier analysis approximations to both the average and the variance are calculated as a function of the number of contenders n. It is demonstrated that in the limit of large n these quantities do not converge to a fixed mode, but contain an oscillating term as well