Some Optimal Algorithms of Random Multiple Access
Rafail Zalmanovich Khas'minskii · Theory of Probability and Its Applications · 1990
Previous article Next article Some Optimal Algorithms of Random Multiple AccessR. Z. Khas’minskiiR. Z. Khas’minskiihttps://doi.org/10.1137/1134053PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] R. G. Gallager, Conflict resolution in random access broadcast networks, Proceedings of the AFOSP Workshop on Communication Theory, Massachusetts Institute of Technology, Cambridge, MA, 1979, 74–76 Google Scholar[2] B. S. Tzybakov and , V. A. Mikhailov, Random multiple access of packets, crushing algorithm, Problemy Feredachi Informatsii, 16 (1980), 65–79, (In Russian.) Google Scholar[3] J. Mosely, An efficient contention resolution algorithm for multiple access channels, 1979, preprint No. LIDS-Th-918, Massachusetts Institute of Technology, Cambridge, MA Google Scholar[4] S. Panvar, , D. Towsley and , J. Wolf, On the throughput of degenerate intersection and first-come first-served collision resolution algorithms, IEEE Trans. Inform. Theory, 31 (1985), 274–279 10.1109/TIT.1985.1057017 86i:94022 CrossrefGoogle Scholar[5] J. Mosely and , P. Humblet, A class of efficient contention resolution algorithms for multiple access channels, IEEE Trans., COM-33 (1985), 145–151 CrossrefGoogle Scholar[6] Amedeo R. Odoni, On finding the maximal gain for Markov decision processes, Operations Res., 17 (1969), 857–860 44:1421 0184.23202 CrossrefGoogle Scholar[7] Ronald A. Howard, Dynamic programming and Markov processes, The Technology Press of M.I.T., Cambridge, Mass., 1960viii+136 22:9287 0091.16001 Google Scholar[8] E. B. Dynkin and , A. A. Yushkevich, Controlled Markov processes, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Vol. 235, Springer-Verlag, Berlin, 1979xvii+289, New York 80k:90037 CrossrefGoogle Scholar[9] A. A. Yushkevich, On a class of strategies in general controlled Markov models, Theory Probab. Appl., 18 (1973), 777–779 10.1137/1118099 0311.90081 LinkGoogle Scholar[10] N. Ya. Petrakov and , V. I. Rotar', Uncertainty Factor and Control of Economic Systems, Nauka, Moscow, 1985, (In Russian.) Google Scholar[11] B. S. Tsybakov, , V. A. Mikhailov and , N. B. Likhanov, Bounds for packet transmission rate in a random-multiple-access system, Problemy Peredachi Informatsii, 19 (1983), 61–81, (In Russian.) 85f:94012 0528.94001 Google Scholar[12] Peter Mathys and , Philippe Flajolet, Q-ary collision resolution algorithms in random-access systems with free or blocked channel access, IEEE Trans. Inform. Theory, 31 (1985), 217–243 10.1109/TIT.1985.1057013 86k:94026 0566.94001 CrossrefGoogle Scholar[13] N. D. Vvedenskaya and , M. S. Pinsker, Nonoptimality of crushing algorithm, Proceedings of the International Seminar “Convolution Codes: Connection With Many Users,” Sochi, 1987, IPPI Akad. Nauk SSSR, Moscow, 1983, 137–140, (In Russian.) Google Scholar[14] N. D. Vvedenskaya and , M. S. Pinsker, Throughput of class FCFS algorithms, Proceedings of International Seminar on Information Theory, Sochi, 1987, IPPI Akad. Nauk SSR, Moscow, 1987, 32–34, (In Russian.) Google Scholar[15] R. Z. Khas'minskii, Controllable Markov processes and optimization of random multiple access algorithms, Dokl. Akad. Nauk SSSR, 301 (1988), 1057–1060, (In Russian.) 89j:93147 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Stability of multiple access communication networksSadhana, Vol. 15, No. 4-5 Cross Ref Volume 34, Issue 3| 1990Theory of Probability & Its Applications History Submitted:28 April 1987Published online:17 July 2006 InformationCopyright © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1134053Article page range:pp. 454-463ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics