Survey of USSR Contributions to Random Multiple-Access Communications

IEEE Transactions on Information Theory

Volumn 31, Issue 2, 1985, Pages 143-165

  Tsybakov, Boris S ^a  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

TELECOMMUNICATION - USSR;

ALOHA ALGORITHM; PART- AND TRY ALGORITHM; RANDOM MULTIPLE-ACCESS (RMA) COMMUNICATIONS; RMA ALGORITHM; RMA CHANNEL SHARING THEORY;

RADIO TRANSMISSION;

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

References (30)

1. B. S. Tsybakov, “New algorithms of random multiple access,” in Problems in Cybernetics, Reliability of Information Exchange in Computer Networks. Moscow: Ac. Sci. USSR, Sci. Conc. Cybern., 1980, pp. 122–140 (in Russian).
2. B. S. Tsybakov and V. A. Mihailov, “Slotted multiaccess packet-broadcasting broadcasting feedback channel,” Probl. Peredachi Inform., vol. 14, pp. 32–59, Oct—Dec. 1978.
3. B. S. Tsybakov and V. A. Mihailov, “Ergodicity of slotted ALOHA-system,” Probl. Peredachi Inform., vol. 15, pp. 73–87, Oct.—Dec. 1979.
4. L. Kleinrock and J. Silvester, “Optimum transmission radii for packet radio networks or why. six is a magic number,” Preliminary manuscript, 1980.
5. N. Abramson, “The throughput of packet broadcasting channels,” IEEE Trans. Commun., vol. COM-25, pp. 117–128, Jan. 1977.
6. M. J. Ferguson, “A study of unslotted ALOHA with arbitrary message length,” in Proc. 4th Data Commun. Symp., PQ, Canada, 1975, pp. 520–525.
7. D. Sant, “Throughput of unslotted ALOHA channels with arbitrary packet interarrival time distributions,” IEEE Trans. Commun., vol. COM-28, pp. 1422–1425, Aug. 1980.
8. B. S. Tsybakov and V. L. Bakirov, “Stability of random ALOHA,” Probl. Peredachi Inform., vol. 20. pp. 82–94, Jan—Mar. 1984.
9. J. L. Massey, “The capacity of the collision channel without feedback,” in Abstracts of Papers, IEEE Int. Symp. Inform. Theory, Les Arcs, France, 1982, pp. 101.
10. B. S. Tsybakov and N. B. Likhanov, “Packet switching in a channel without feedback,” Probl. Peredachi Inform., vol. 19, pp. 69–84, Apr.—June 1983.
11. R. G. Gal lager, “Conflict resolution in random access broadcast networks,” in Proc. AFOSR Workshop Commun. Theory and Applications, 1978, pp. 76–74.
12. B. S. Tsybakov and V. A. Mihailov, “Random multiple access of packets. Part-and-try algorithm,” Probl. Peredachi Inform., vol. 16, pp. 65–79, Oct.—Dec. 1980.
13. B. S. Tsybakov and N. D. Vvedenskaya, “Stack-algorithm for random multiple access,” Probl. Peredachi Inform., vol. 16, pp. 80–94, July—Sept. 1980.
14. V. A. Mihailov, “Adaptive random access to a broadcast channel,” in Methods for Transmission and Processing of Information. Moscow: Nauka, 1980, pp. 109–114 (in Russian).
15. N. Pippenger, “ Bounds on the performance of protocols for a multiple-access broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 145–151, Mar. 1981.
16. V. A. Mihailov and B. S. Tsybakov, “An upper bound to capacity of random multiple access system,” Probl. Peredachi Inform., vol. 17, pp. 90–95, Jan—Mar., 1981.
17. B. S. Tsybakov, V. A. Mihailov, and N. B. Lihanov, “Bonds to packet rate in multiple random-access communication system,” Probl. Peredachi Inform., vol. 19, pp. 61–81, Jan.—Mar. 1983.
18. J. L. Massey, “Resolution algorithms and random-access communications,” in Multi-User Communication System, CISM Courses and Lectures Series no. 265. New York: Springer, 1981, pp. 73–137.
19. G. S. Evssev and N. G. Ermolaev, “Collision resolution performance evaluation for random access noisy Channel,” Probl. Peredachi Inform., vol. 18, pp. 1017105, Apr.—June 1982.
20. N. D. Vvedenskaya and B. S. Tsybakov, “Packet random multiple access in channel with errors,” Probl. Peredachi Inform., vol. 19, pp. 52–68, Apr.—June 1983.
21. B. S. Tsybakov and N. D. Vvedenskaya, “Random multiple access of impatient packets to broadcast channel,” Probl. Peredachi Inform., vol. 19, pp. 74-83, Oct.-Dec. 1983.
22. J. I. Capetanakis, “Tree algorithms for packet broadcast channels,” IEEE Trans. Inform., Theory, vol. IT-25, pp. 505–515, Sept. 1979.
23. N. D. Vvedenskaya and B. S. Tsybakov, “Packet delay for multiaccess access stack-algorithm,” Probl. Peredachi Inform., vol. 20, pp. 89–101, Apr.-June 1984.
24. N. D. Vvedenskaya and B. S. Tsybakov, “Packet delay in stack-algorithm of multiple access,” in Abstracts of Papers, Int. Workshop on Convolutional Codes and Multiuser Communication, Sochi, USSR, 1983, pp. 149–156.
25. B. S. Tsybakov and M. A. Berkovsky, “Multiple access with reservation,” Probl. Peredachi Inform., vol. 16, pp. 50–76, Jan.-Mar. 1980.
26. B. S. Tsybakov, V. A. Mihailov, and S. P. Fedortsev, “Consideration of packet propagation delay in random multiple access channel,” Probl. Peredachi Inform., vol. 17, pp. 75–78, Apr.-June 1981.
27. B. S. Tsybakov and N. B. Likhanov, “An upper bound on packet delay in a multiple access channel,” Probl. Peredachi Inform., vol. 18, pp. 76–84, Oct.-Dec. 1982.
28. N. D. Vvedenskaya and M. S. Pinsker, “Nonoptimality of the part-and-try algorithm,” in Abstracts of Papers, Int. Workshop on Convolutional Codes and Multiuser Communication, Sochi, USSR, 1983, pp. 141–148.
29. G. I. Falin, “Performance for a class of algorithms of random multiple access to a radio channel,” Probl. Peredachi Inform., vol. 18, pp. 85–90, July-Sept. 1982.
30. B. S. Tsybakov, “Resolution of a conflict of known multiplicity,” Probl. Peredachi Inform., vol. 16, pp. 69–82, Apr.-June 1980.