Q-ary Collision Resolution Algorithms in Random-Access Systems with Free or Blocked Channel Access

IEEE Transactions on Information Theory

Volumn 31, Issue 2, 1985, Pages 217-243

  Mathys, Peter ^a   Flajolet, Philippe ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSMISSION - PACKET SWITCHING; INFORMATION THEORY - COMMUNICATION CHANNELS; RADIO TRANSMISSION - MULTIPLEX SYSTEMS;

FREE OR BLOCKED CHANNEL ACCESS; PACKET DELAY ANALYSIS; Q-ARY COLLISION RESOLUTION ALGORITHMS; RANDOM ACCESS SYSTEMS (RAS);

DIGITAL COMMUNICATION SYSTEMS;

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

References (34)

1. N. Abramson, “The ALOHA system—Another alternative for computer communications,” in Proc. A FIPS Conf. Fall Joint Comp. Conf. 1970, vol. 37, pp. 281–285.
2. M. Amati, “Recursive analysis of certain random access algorithms,” Ph.D. dissertation, Univ. of Calif., Los Angeles, June 1981.
3. J. I. Capetanakis, “The multiple access broadcast channel: Protocol and capacity considerations,” Ph.D. dissertation, Mass. Inst. Tech., Cambridge MA, Aug. 1977; also presented at IEEE Int. Symp. Inform. Theory, Ithaca, NY, Oct. 1977.
4. J. I. Capetanakis, “Tree algorithms for packet broadcast channels,” IEEE Trans. vol. no. 1979.
5. J. I. Capetanakis, “Generalized TDMA: The multi-accessing tree protocol,” IEEE Trans. Commun, vol. COM-27, no. 10, pp. 1476–1484, Oct. 1979.
6. B. Davies, Integral Transforms and their Applications, Applied Mathematical Sciences Vol. 25. New York: Springer, 1978.
7. G. Doetsch, Handbuch der Laplace-Transformation, Band I. Basel: Birkhauser, 1950.
8. G. Doetsch, Handbuch der Laplace-Transformation, Band II. Basel: Birkhäuser 1955.
9. B. V. Faltings “On the behavior of certain random-access protocols with free access,” submitted to IEEE Trans. Inform. Theory Mar. 1983.
10. G. Fayolle, P. Flajolet, and M. Hofri, “On a functional equation arising in the analysis of a protocol for a multiaccess broadcast channel,” internal rep. 131, INRIA, Le Chesnay Cedex, France, Apr. 1982; Adv. Appl. Prob., 1985, to appear.
11. G. Fayolle, P. Flajolet, M. Hofri, and P. Jacquet, “Analysis of a stack algorithm for random multiple access communication,” IEEE Trans. Inform. Theory, this issue.
12. G. Fayolle and M. Hofri, “On the capacity of a collision channel under stack-based collision resolution algorithms,” internal rep., Technion Univ., Haifa, Israel, Oct. 1983; submitted to T. Ass. Mach.
13. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed. New York: Wiley, 1968.
14. P. Flajolet, M. Regnier, and R. Sedgewick, “Mellin transform techniques for the analysis of algorithms,” preliminary manuscript.
15. P. Flajolet and D. Sotteau, “A recursive partitioning process of computer science,” in Proc. 2nd World Conf. on Mathematics at the Service of Man, Las Palmas, Spain, June 1982.
16. R. G. Gallager, “Conflict resolution in random access broadcast networks,” in Proc. A FOSR Workshop on Commun. Theory and Provincetown, MA, 1978, 74–76.
17. D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms, 2nd ed. Boston: Birkhäuser 1982.
18. B. Hajek, “Expected number of slots needed for the Capetanakis collision-resolution algorithm,” preliminary manuscript, Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, July 25, 1980.
19. P. Henrici, Applied and Computational Complex Analysis, Vol, 1. New York: Wiley, 1974.
20. M. Hofri, “Stack algorithms for collision-detecting channels and their analysis: A limited survey,” Internal Rep., Technion Univ., Haifa, Israel, Sept. 1982.
21. P. A. Humblet and J. Mosely, “Efficient accessing of a multiaccess access channel,” Proc. 19th IEEE Conf. Decision and Control, Albuquerque, NM, Dec. 10–12, 1980, pp. 624–627.
22. L. Kleinrock, Queueing Systems, Volume II: Computer Applications. New York: Wiley, 1976.
23. D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA: Addision-Wesley, 1973.
24. M. Kuczma, Functional Equations in a Single Variable. Warsaw: 1968.
25. J. L. Massey, “ Collision-resolution algorithms and random-access communications,” in Multi-User Communication Systems, G. Longo, Ed., CISM Courses and Lectures No. 265. New York: Springer, 73–137.
26. P. Mathys, “A comparison of Q-ary tree algorithms for collision resolution,” presented at IEEE Int. Symp. Inform. Theory, Les Arcs, France, June 1982.
27. “Analysis of random-access algorithms,” Ph.D. dissertation, Dept. of Elec. Engr., Eidgenössicche Technische Hochschule, Zürich Dec. 1984.
28. P. Mathys, B. S. Tsybakov, and N. D. Vvedenskaya, “Packet delays and related characteristics of free access random-access systems with Q-ary collision resolution algorithms,” preliminary manuscript.
29. B. S. Tsybakov and M. A. Berkovskii, “Multiple access with reservation”, pp. 35–54 in Plenum Press translation of article in Problemy Peredachi Informatsii, vol. 16, no. 1, pp. 50–76, Jan.-Mar. 1980.
30. B. S. Tsybakov and V. A. Mikhailov, “Free synchronous packet access in a broadcast channel with feedback,” pp. 259–280 in Plenum Press translation of article in Problemy Peredachi Informatsii, matsii, vol. 14, no. 4, 32–59, Oct.-Dec. 1978.
31. B. S. Tsybakov and V. A. Mikhailov, “Random multiple packet access: Part-and-try algorithm,” 305–317 in Plenum Press translation of article in Problemy
32. B. S. Tsybakov and N. D. Vvedenskaya, “Random multiple-access stack algorithm, ” pp. 230–243 in Plenum Press translation of article in Problemy Peredachi Informatsii, vol. 16, no. 3, pp. 80–94, 1980
33. Peredachi Informatsii, vol. 16, no. 4, pp. 65–79, Oct.-Dec. 1980. [32] B. S. Tsybakov and N. D. Vvedenskaya, “Random multiple-access stack algorithm,” pp. 230–243 in Plenum Press translation of article in Problemy Peredachi Informatsii, vol. 16, no. 3, pp. 80–94, 1980.
34. N. D. Vvedenskaya and B. S. Tsybakov, “Random multiple access of packets to a channel with errors,” pp. 131–147 in Plenum Press translation of article in Problemy Peredachi Informatsii, vol. 19, no. 1983.