Analysis of practical backoff protocols for contention resolution with multiple servers

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 554-563

  Goldberg, Leslie Ann ^a   MacKenzie, Philip D ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); ETHERNET; FIBER OPTIC NETWORKS; NETWORK ROUTING; POLYNOMIALS; STOCHASTIC SYSTEMS;

AVERAGE WAITING-TIME; BERNOULLI DISTRIBUTIONS; CONTENTION RESOLUTION; MULTIPLE ACCESS CHANNELS; MULTIPLE SERVERS; PROOF OF STABILITY; STOCHASTIC BEHAVIOR; THE STANDARD MODEL;

DYNAMIC ROUTING ALGORITHMS;

EID: 32144436199     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. R. J. Anderson and G. L. Miller. Optical communication for pointer based algorithms. Technical Report CRI 88-14, University of Southern California, 1988.
2. J. Goodman, A. G. Greenberg, N. Madras, and P. March. Stability of binary exponential backoff. J. Assoc. Comput. Mach., 35(3):579-602, 1988. A preliminary version appeared in STOC 85.
3. J. Håstad, T. Leighton, and B. Rogoff. Analysis of backoff protocols for multiple access channels. Preprint - a preliminary version appeared in STOC 87, 1993.
4. R. Metcalfe and D. Boggs. Distributed packet switching for local computer networks. Comm. ACM, 19:395-404, 1976.
5. M. Paterson and A. Srinivasan. Contention resolution with bounded delay. To appear in FOCS 95, 1995.
6. P. Raghavan and E. Upfal. Stochastic contention resolution with short delays. In Proc. STOC 95, 1995.
7. S. Rao and T. Tsantilas. Optical interprocessor communication protocols. In Proc. 1st Symp. on Massively Para. Proc. Using Optical Interconnects, 1994.
8. S. Stidham. The last word on L = λW. Operations Research, 22:417-421, 1974.