DocumentCode
2054483
Title
Solving conflicts of known multiplicity
Author
Del Angel, Guillermo ; Fine, Terrence L.
Author_Institution
Aware Inc., Bedford, MA, USA
fYear
2002
fDate
2002
Firstpage
152
Abstract
We consider collision resolution protocols for a random access collision channel with multiplicity feedback. By using Markov decision processes, we provide performance bounds for such systems in terms of the mean number of slots required to resolve a collision of a given multiplicity. We show that recursive binary splitting is strictly suboptimal for all collisions of size n>3, and we find the optimal protocol for the case n=4.
Keywords
Markov processes; optimisation; protocols; random processes; telecommunication channels; Markov decision processes; collision multiplicity feedback; collision resolution interval; collision resolution protocols; mean number of slots; optimal protocol; performance bounds; random access collision channel; Access protocols; Binary trees; Feedback; History; Military computing; Performance analysis; Road accidents; Throughput; Traffic control; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023424
Filename
1023424
Link To Document