Adversarial contention resolution for simple channels

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 325-332

  Bender, Michael A ^a   Farach Colton, Martin ^b   He, Simai ^a   Kuszmaul, Bradley C ^c   Leiserson, Charles E ^c  

^a Stony Brook University   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Batch; Exponential Back off; On line; Polynomial Backoff; Worst Case Backoff Performance

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS; ONLINE SYSTEMS; POLYNOMIALS; STATISTICAL METHODS;

BATCH; EXPONENTIAL BACK-OFF; POLYNOMIAL BACKOFF; WORST-CASE BACKOFF PERFORMANCE;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 32144452400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1074023     Document Type: Conference Paper

References (44)

1. N. Abramson. The ALOHA system - another alternative for computer Communications. In Proc. of AFIPS FJCC, vol. 37, pp. 281-285, 1970.
2. A. Agarwal, M. Cherian. Adaptive backoff synchronization techniques. In ISCA'89, pp. 396-406, 1989.
3. D. J. Aldous. Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. IEEE Trans. on Inform. Theory, IT-33(2):219-223, 1987.
4. D. J. Bernstein, qmail - an email message transfer agent, http://cr.yp.to/qmail.html, 1998.
5. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, D. P. Williamson. Adversarial queuing theory. J. ACM, 48(1):13-38, 2001.
6. B. Costales, E. Allman. Sendmail. O'Reilly, third ed., 2002.
7. R. Fielding, J. Gettys, J. Mogul, H. Frystyk, L. Masinter, P. Leach, T. Berners-Lee. Hypertext transfer protocol - http/1.1. Internet RFC 2616, 1999.
8. K. Finkenzeller. RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification. John Wiley & Sons, second ed., 2003. E-book at books24×7.com.
9. M. Geréb-Graus, T. Tsantilas. Efficient optical communication in parallel computers. In SPAA'92, pp. 41-48, 1992.
10. L. A. Goldberg. Notes on contention resolution, http://www.dcs.warwick. ac.uk/~leslie/contention.html, viewed Oct. 2003.
11. L. A. Goldberg, M. Jerrum, T. Leighton, S. Rao. Doubly logarithmic communication algorithms for optical-communication parallel computers. SIAM J. Comput., 26(4):1100-1119, 1997.
12. L. A. Goldberg, P. D. MacKenzie. Analysis of practical backoff protocols for contention resolution with multiple servers. In SODA'96, pp. 554-563, 1996.
13. L. A. Goldberg, P. D. MacKenzie, M. Paterson, A. Srinivasan. Contention resolution with constant expected delay. J. ACM, 47(6): 1048-1096, 2000.
14. L. A. Goldberg, Y. Matias, S. Rao. An optical simulation of shared memory. SIAM J. Comput., 28(5): 1829-1847, 1999.
15. J. Goodman, A. G. Greenberg, N. Madras, P. March. Stability of binary exponential backoff. J. ACM, 35(3):579-602, 1988.
16. A. G. Greenberg, P. Flajolet, R. E. Ladner. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. J. ACM, 34(2):289-325, 1987.
17. A. G. Greenberg, S. Winograd. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM, 32(3):589-596, 1985.
18. R. I. Greenberg, C. E. Leiserson. Randomized routing on fat-trees. Advances in Computing Research, 5:345-374, 1989.
19. R. Gusella. A measurement study of diskless workstation traffic on an ethernet. IEEE Trans. on Commun., 38(9): 1557-1568, 1990.
20. J. Hastad, T. Leighton, B. Rogoff. Analysis of backoff protocols for multiple access channels. In STOC'87, pp. 241-253, 1987.
21. M. Herlihy. A methodology for implementing highly concurrent data objects. ACM Trans. Prog. Lang. Syst., 15(5):745-770, 1993.
22. M. Herlihy, J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In ISCA'93, pp. 289-300, 1993.
23. M. P. Herlihy, V. Luchangco, M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In ICDCS 2003, pp. 522-529, 2003.
24. M. P. Herlihy, V. Luchangco, M. Moir, W. M. Scherer III. Software transactional memory for dynamic-sized data structures. In PODC 2003, pp. 92-101, 2003.
25. IEEE 802.11 Working Group. ANSI/IEEE Std. 802.11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Computer Society, 1999.
26. A. Juels, R. L. Rivest, M. Szydlo. The blocker tag: Selective blocking of RFID tags for consumer privacy. In Conference on Computer and Communications Security, pp. 103-111, 2003.
27. R. M. Karp, M. Luby, F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In STOC'92, pp. 318-326, 1992.
28. P. Kumar, L. Merakos. Distributed control of broadcast channels with acknowledgement feedback: Stability and performance. In CDC'84, 1984.
29. W. E. Leland, M. S. Taqqu, W. Willinger, D. V. Wilson. On the self-similar nature of ethernet traffic. Comput. Commun. Rev., 23(4), 1993.
30. P. D. MacKenzie, C. G. Plaxton, R. Rajaraman. On contention resolution protocols and associated probabilistic phenomena. J. ACM, 45(2):324-378, 1998.
31. R. M. Metcalfe, D. R. Boggs. Ethernet: Distributed packet switching for local computer networks. CACM, 19(7):395-404, 1976.
32. R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, England, 1995.
33. F. M. Pittelli, H. Garcia-Molina. Reliable scheduling in a TMR database system. ACM Trans. Comput. Syst., 7(1):25-60, 1989.
34. J. Postel. Transmission control protocol. Internet RFC 793, 1981.
35. P. Raghavan, E. Upfal. Stochastic contention resolution with short delays. SIAM J. Comput., 28(2):709-719, 1999.
36. R. Rajwar, J. R. Goodman. Transactional lock-free execution of lock-based programs. In ASPLOS-X, pp. 5-17, 2002.
37. A. G. Ranade. How to emulate shared memory. J. Comput. and Syst. Sciences, 42(3):307-326, 1991.
38. A. O. Ranade. The delay sequence argument. In Handbook of Randomized Algorithms, chapter 1. Kluwer Academic Publishers, 2001.
39. S. Sarma. Towards the five-cent tag. Tech Report MIT-AUTOID-WH-006, MIT Auto-ID Center, 2001. http://www.autoidlabs.org/whitepapers/MIT-AUTOID-WH-006. pdf.
40. Sleepycat Software. The Berkeley Database version 2. http://sleepycat. com, 1997.
41. Sun Microsystems. RPC: Remote procedure call protocol specification version 2. Internet RFC 1057, 1988.
42. Y. T'Joens, C. Hublet, P. De Schrijver. DHCP reconfiguration extension. Internet RFC 3203, 2001.
43. D. E. Willard. Log-logarithmic protocols for resolving ethernet and semaphore conflicts. In STOC'84, pp. 512-521, 1984.
44. Wiseband. Intelligent amplifiers. http://www.wiseband.com/ Intelligent_amplifiers.pdf (viewed October 2003), 2002.