Analysis of a Stack Algorithm for Random Multiple-Access Communication

IEEE Transactions on Information Theory

Volumn 31, Issue 2, 1985, Pages 244-254

  Fayolle, Guy ^a   Flajolet, Philippe ^a   Jacquet, Philippe ^a   Hofri, Micha ^b  

^a INRIA   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSMISSION - PACKET SWITCHING; INFORMATION THEORY - COMMUNICATION CHANNELS;

COLLISION RESOLUTION ALGORITHM; PACKET DELAY; RANDOM MULTIPLE-ACCESS COMMUNICATION; SINGLE-CHANNEL PACKET-SWITCHING; STACK ALGORITHM;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0022037939     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1985.1057014     Document Type: Article

References (11)

1. J. I. Capetanakis, “Tree algorithms for packet broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 505–515, Sept. 1979.
2. G. Fayolle, P. Flajolet, and M. Hofri, “On a functional equation arising in the analysis of a protocol for a multiple access channel,” to appear in Ann. Appl. Prob., 1985
3. G. Fayolle, E. Gelenbe, and J. Labetoulle, “Stability and optimal control of the packet switching broadcast channel,” JA CM, vol. 24, pp. 375–386, 1977.
4. G. Fayolle, and M. Hofri, “On the capacity of a collision resolution channel under stack-based collision resolution algorithms,” Technion, Haifa, Israel, Rep. 237, Oct. 1983.
5. A. Greenberg, P. Flajolet, and R. Ladner, “Estimating the multiplicities of conflicts in multiple access channels,” INRIA, Le Chesnay, France, INRIA Res. Rep., 1984.
6. P. Jacquet, “Proprietes moyennes du protocole Capetanakis” Le Chesnay, France, INRIA Res. Rep., 1983.
7. G. Longo (Ed.), Multi-User Communication Systems, CISM Courses and Lecture Notes 265. New York: Springer-Verlag, 1981.
8. J. Massey, “Collision resolution algorithms and random access algorithms,” in Multi-User Communication Systems, G. Longo, Ed., CISM Courses and Lecture Notes 265. New York: Springer-Verlag, 1981, pp. 73–137.
9. P. Mathys and P. Flajolet, “Q-ary collision resolution algorithms in random-access systems with free or blocked channel-access,” IEEE Trans. Inform. Theory, this issue.
10. B. Tsybakov and V. Mikhailov, “Free synchronous packet access in a broadcast channel with feedback,” Prob. Inform. Trans., vol. 14, pp. 259–280, Oct.—Dec. 1978.
11. B. Tsybakov and N. Vvedenskaya, “Random multiple access stack algorithms,” Prob. Inform. Trans., vol. 16, pp. 230–243, July—Sept. 1980.