Title :
Analytic properties of contention tree-algorithms
Author :
de Jong, M.J.M. ; Janssen, A. J E M
Author_Institution :
Philips Res. Lab., Eindhoven, Netherlands
Abstract :
This article studies the statistical properties of multiple-access contention tree-algorithms with ternary feedback for an arbitrary degree of node. Accurate analytical approximations are given for the expectation value of the number of levels required for a random contender to have successful access, as well as of the number of levels and of the number of contention frames required to provide access for all contenders
Keywords :
access protocols; approximation theory; broadcast channels; channel allocation; multi-access systems; random processes; trees (mathematics); accurate analytical approximations; broadcast-communication channel; channel allocation; contention frames; multiple-access contention tree-algorithms; random contender; random multiple access protocol; statistical properties; successful access; ternary feedback; Access protocols; Availability; Broadcasting; Centralized control; Channel capacity; Delay; Feedback; Laboratories; Stochastic processes; Transmitters;
Conference_Titel :
Information Theory Workshop, 1998
Conference_Location :
Killarney
Print_ISBN :
0-7803-4408-1
DOI :
10.1109/ITW.1998.706471
