Analysis of contention tree algorithms

IEEE Transactions on Information Theory

Volumn 46, Issue 6, 2000, Pages 2163-2172

  Janssen, Augustus J E M ^a,b,c   De Jong, Marc J M ^b,c  

^a IEEE

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

^c MCKINSEY AND COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); STATISTICAL METHODS; TREES (MATHEMATICS);

CAPETANAKIS-TSYBAKOV-MIKHAILOV CONTENTION TREE ALGORITHMS; CONTENTION FRAMES;

BROADCASTING;

EID: 0034269339     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.868486     Document Type: Article

References (30)

1. N. Abramson, Development of the ALOHANET, IEEE Trans. Inform. Theory, vol. IT-31, pp. 119-123, Mar. 1985.
2. L. Kleinrock and F. A. Tobagi, Packet switching in radio channels:-Part 1: CSMA modes and their throughput-delay characteristics, IEEE Trans. Commun., vol. COM-23, pp. 1400-1416, 1975.
3. J. I. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Trans. Inform. Theory, vol. IT-25, pp. 505-515, Sept. 1979.
4. B. S. Tsybakov and V. A. Mikhailov, Free synchronous packet access in a broadcast channel with feedback, Probl. Pered. Inform., vol. 14, no. 4, pp. 32-59, 1978.
5. M. J. M. de Jong and A. J. E. M. Janssen, Analytic properties of contention tree-algorithms, in Proc. Inform. Theory Workshop, Killarney, Ireland, 1998, pp. 128-129.
6. B. S. Tsybakov and V. A. Mikhailov, Random multiple access of packets: Part and try algorithm, Probl. Pered. Inform., vol. 16, no. 4, pp. 65-79, 1980.
7. T. Berger, The Poisson multiple-access conflict resolution problem, in Multi-User Communication Systems, ser. CISM Course and Lecture Notes, G. Longo, Ed. New York: Springer Verlag, 1981, vol. 265, pp. 1-27.
8. J. L. Massey, Collision resolution algorithms and random access algorithms, in Multi-User Communication Systems, ser. CISM Course and Lecture Notes, G. Longo, Ed. New York: Springer Verlag, 1981, vol. 265, pp. 73-137.
9. G. Rüget, Some tools for the study of channel sharing algorithms, in Multi-User Communication Systems, ser. CISM Course and Lecture Notes, G. Longo, Ed. New York: Springer Verlag, 1981, vol. 265, pp. 201-231.
10. R. G. Gallager, A perspective on multiple access channels, IEEE Trans. Inform. Theory, vol. IT-31, pp. 124-142, Mar. 1985.
11. B. S. Tsybakov and N. D. Vvedenskaya, Random multiple-access stack algorithms, Probl. Pered. Inform., vol. 16, no. 3, pp. 80-94, 1980.
12. _, Packet delay in the case of a multiple-access stack algorithm, Probl. Pered. Inform., vol. 20, no. 2, pp. 77-97, 1984.
13. G. Fayolle, P. Flajolet, M. Hofri, and P. Jacquet, Analysis of a stack algorithm for random multiple-access communication, IEEE Trans. Inform. Theory, vol. IT-31, pp. 244-254, Mar. 1985.
14. B. S. Tsybakov and M. A. Burkovskii, Multiple access with reservation, Probl. Pered. Inform., vol. 16, no. 1, pp. 50-76, 1980.
15. W. Xu and G. Campbell, A distributed queueing random access protocol for a broadcast protocol, SIGCOMM, Computer Commun. Rev., vol. 23, no. 4, pp. 270-278, 1993.
16. IEEE, Project 802.14, Draft 2, Revision 2, Jan. 1998.
17. DAVIC 1.3 specification, pt. 8, Sept. 1997.
18. B. Hajek, N. B. Likhanov, and B. S. Tsybakov, On the delay in a multiple-access system with large propagation delay, IEEE Trans. Inform. Theory, vol. 40, pp. 1158-1166, July 1994.
19. B. S. Tsybakov and N. B. Likhanov, An upper bound on packet delay in a multiple access channel, Probl. Pered. Inform., vol. 18, no. 4, pp. 76-84, 1982.
20. P. Mathys and P. Flajolet, Q-ary collision resolution algorithms in random-access systems with free or blocked channel access, IEEE Trans. Inform. Theory, vol. IT-31, pp. 217-243, Mar. 1985.
21. M. A. Kaplan and E. Gulko, Analytic properties of multiple-access trees, IEEE Trans. Inform. Theory, vol. IT-31, pp. 255-263, Mar. 1985.
22. J.-C. Huang and T. Berger, Delay analysis of interval searching contention resolution algorithms, IEEE Trans. Inform. Theory, vol. IT-31, pp. 264-273, Mar. 1985.
23. J. I. Capetanakis, Generalized TDMA, IEEE Trans. Commun., vol. COMM-27, pp. 1476-1484, 1979.
24. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions. Washington, DC: Nat. Bur. Stand., 1964, pp. 257-259.
25. B. S. Tsybakov and V A. Mikhailov, Free synchronous packet access in a broadcast channel with feedback, Probl. Inform. Transm., vol. 14, pp. 259-280, 1978.
26. _, Random multiple access of packets: Part and try algorithm, Probl. Inform. Transm., vol. 16, pp. 305-317, 1980.
27. B. S. Tsybakov and N. D. Vvedenskaya, Random multiple-access stack algorithms, Probl. Inform. Transm., vol. 16, pp. 230-243, 1980.
28. N. D. Vvedenskaya and B. S. Tsybakov, Packet delay in the case of a multiple-access stack algorithm, Probl. Inform. Transm., vol. 20, pp. 137-153, 1984.
29. B. S. Tsybakov and M. A. Burkovskii, Multiple access with reservation, Probl. Inform. Transm., vol. 16, pp. 35-54, 1980.
30. B. S. Tsybakov and N. B. Likhanov, An upper bound on packet delay in a multiple access channel, Probl. Inform. Transm., vol. 18, pp. 279-285, 1982.