Contention resolution with constant expected delay

Journal of the ACM

Volumn 47, Issue 6, 2000, Pages 1048-1096

  Goldberg, Leslie Ann ^a,c   Mackenzie, Philip D ^b,d   Paterson, Mike ^a   Srinivasan, Aravind ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b NOKIA RESEARCH CENTER   (United States)

^c UNIVERSITY OF WARWICK   (United Kingdom)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

Contention resolution; Cthernet; Markov chains; Multiple access channel

Indexed keywords

CONSTANT EXPECTED DELAYS; CONTENTION RESOLUTION; ETHERNET; MULTIPLE-ACCESS CHANNELS;

ALGORITHMS; COMPUTATION THEORY; COMPUTER SIMULATION; MARKOV PROCESSES; NETWORK PROTOCOLS; PARAMETER ESTIMATION; POISSON DISTRIBUTION; PROBABILITY; SYNCHRONIZATION;

CHANNEL CAPACITY;

EID: 0002919403     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/355541.355567     Document Type: Article

References (22)

1. ABRAMSON, N. 1973. The ALOHA system. In Computer-Communication Nehvorks. N. Abramson and F. Kuo, Eds., Prentice-Hall, Englewood Cliffs, N.J., pp. 501-517.
2. ALDOUS, D. 1987. Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels. IEEE Trans. Inf. Theory IT-33, 2, 219-223.
3. ALON, N., SPENCER, J. H., ERDOS, P. 1992. Tlie Probabilistic Method. Wiley-Interscience Series, Wiley, New York.
4. ANDERSON, R. J., MILLER, G. L. 1988. Optical communication for pointer-based algorithms. Tech. Rep. CRI 88-14, Computer Science Dept. Univ. Southern California, Los Angeles, Calif.
5. BOLLOBAS, B. 1988. Martingales, isoperimetric inequalities and random graphs. In Combinatorics, Colloq. Math. Soc. János Bolyai, A. Hajnal, L. Lovász, and V. T. Sós Eds., Vol. 52, North-Holland, Amsterdam, The Netherlands, pp. 113-139.
6. CHERNOFF, H. 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493-509.
7. DIETZFELBINGER, M., MEYER AUF DER HEIDE, F. 1993. Simple, efficient shared memory simulations. In Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures (SPAA '93) (Velen, Germany, June 30-July 2). ACM, New York, pp. 110-119.
8. GERÉB-GRAUS, M., TSANTILAS, T. 1992. Efficient optical communication in parallel computers. In Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA '92) (San Diego, Calif., June 29-JuIy 1). ACM, New York, pp. 41-48.
9. GOLDBERG, L., JERRUM, M., LEIGHTON, T., RAO, S. 1997. A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. SIAM J. Comput. 26, 4, 1100-1119.
10. GOLDBERG, L., MATIAS, Y., RAO, S. 1999. An optical simulation of shared memory. SIAM J. Comput. 28, 5, 1829-1847.
11. GREENBERG, A. G., FLAJOLET, P., LADNER, R. E. 1987. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. /. ACM 34, 2, 289-325.
12. HAsTAD, J., LEIGHTON, T., ROGOFF, B. 1996. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. SLAM J. Comput. 25, 4, 740-774.
13. HOEFFDING, W. 1963. Probability inequalities for sums of bounded random variables. Amer. Stat. Assoc. 1. 58, 13-30.
14. IEEE TRANS. INF. THEORY. 1985. IT-31, special issue.
15. KELLY, F. P. 1985. Stochastic models of computer communication systems. /. Roy. Stat. Soc. B 47, 3, 379-395.
16. MACKENZIE, P. D., PLAXTON, C. G., RAJARAMAN, R. 1998. On contention resolution protocols and associated probabilistic phenomena. /. ACM 45, 2, 325-378.
17. McDIARMID, C. 1989. On the method of bounded differences. In Surveys in Combinatorics, London Math. Soc. Lecture Notes Series, Vol. 141. Cambridge University Press, Cambridge, England, pp. 148-188.
18. METCALFE, R., BOGGS, D. 1976. Distributed packet switching for local computer networks. Commun. ACM 19, 395-404.
19. PIPPENGER, N. 1981. Bounds on the performance of protocols for a multiple access broadcast channel. IEEE Trans. Inf. Theory IT-27, 145-151.
20. RAGHAVAN, P., UPFAL, E. 1999. Stochastic contention resolution with short delays. SIAM J. Comput. 28, 2, 709-719.
21. TSYBAKOV, B., LiKHANOV, N. 1987. Upper bound on the capacity of a random multiple-access system. Problemy Peredachi Informais 23, 3, 64-78.
22. VVEDENSKAYA, N. D., PiNSKER, M. S. 1983. Non-optimality of the part-and-try algorithm. In Abstracts of the International Workshop on Comolutional Codes, Multiuser Communication, Sochi, USSR (1983), pp. 141-148.