Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM

Volumn 48, Issue 1, 2001, Pages 39-69

  Andrews, Matthew ^a   Awerbuch, Baruch ^b,f   Fernández, Antonio ^c,g   Leighton, Tom ^c,i   Liu, Zhiyong ^c,e   Kleinberg, Jon ^d,h  

^a LUCENT TECHNOLOGIES   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Department of Obstetrics Gynecology   (United States)

^e INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^f Johns Hopkins University   (United States)

^g UNIVERSIDAD REY JUAN CARLOS   (Spain)

^h Department of Computer Science and School of Operations Research and Information Engineering   (United States)

ⁱ MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Adversarial queueing theory; End to end delay; Network stability; Packet scheduling

Indexed keywords

ADVERSARIAL QUEUEING THEORY; END-TO-END DELAY; NETWORK STABILITY; PACKET SCHEDULING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; PACKET NETWORKS; POISSON DISTRIBUTION; POLYNOMIAL APPROXIMATION; PROBABILITY; QUEUEING THEORY; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

PACKET SWITCHING;

EID: 0001780962     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/363647.363677     Document Type: Article

References (29)

1. AIELLO, W., KUSHILEVITZ, E., OSTROVSKY, R., AND ROSÉN, A. 1998. Adaptive packet routing for bursty adversarial traffic. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (Dallas, Tex., May 23-26). ACM, New York, pp. 359-368.
2. ANDREWS, M., AWERBUCH, B., FERNANDEZ, A., KLEINBERG, J., LEIGHTON, T., AND LIU, Z. 1996. Universal stability results for greedy contention-resolution protocols. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 380-389.
3. ANDREWS, M., AND ZHANG, L. 2000. The effects of temporary sessions on network performance. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 9-11). ACM, New York, pp. 448-457.
4. AWERBUCH, B., AND LEIGHTON, F. T. 1994. Improved approximations for the multi-commodity flow problem and local competitive routing in networks. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 487-498.
5. BORODIN, A., KLEINBERG, J., RAGHAVAN, P., SUDAN, M., AND WILLIAMSON, D. P. 2001. Adversarial queueing theory. J. ACM 48, 1 (Jan.), 13-38.
6. BRODER, A., AND UPFAL, E. 1996. Dynamic deflection routing on arrays. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 348-355.
7. BRODER, A. Z., FRIEZE, A. M., AND UPFAL, E. 1996. A general approach to dynamic packet routing with bounded buffers. In Proceedings of the 37th Annual IEEE Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, Calif.
8. CRUZ, R. L. 1991a. A calculus for network delay. Part I: Network elements in isolation. IEEE Trans. Inf. Theory 37, 1 (Jan.) 114-131.
9. CRUZ, R. L. 1991b. A calculus for network delay. Part II: Network analysis. IEEE Trans. Inf. Theory 37, 1 (Jan.) 132-141.
10. GAMARNIX, D. 1998. Stability of adversarial queues via fluid models. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif, pp. 60-70.
11. GAMARNIK, D. 1999. Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (Atlanta, Ga., May 1-4). ACM, New York, pp. 206-214.
12. GOEL, A. 1997. Stability of networks and protocols in the adversarial queueing model for packet routing. Tech. Rep. STAN-CS-97-59, Stanford Univ. Stanford, Calif.
13. HAJEK, B. 1982. Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Prob. 14, 502-525.
14. HARCHOL-BALTER, M., AND BLACK, P. E. 1994. Queueing analysis of oblivious packet-routing algorithms. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 9-11). ACM, New York, pp. 448-457.
15. HARCHOL-BALTER, M., AND WOLFE, D. 1995. Bounding delays in packet-routing networks. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 248-257.
16. KAHALE, N., AND LEIGHTON, T. 1995. Greedy dynamic routing on arrays. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 22-24). ACM, New York, pp. 558-566.
17. KELLY, F. P. 1979. Reversibility and Stochastic Networks. Wiley, New York.
18. KLEINROCK, L. 1975. Queueing Systems. Wiley, New York.
19. LEIGHTON, T. 1990. Average case analysis of greedy routing algorithms on arrays. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures (Island of Crete, Greece, July 2-6). ACM, New York, pp. 2-10.
20. LEIGHTON, F. T., MAGGS, B. M., AND RAO, S. B. 1994. Packet routing and job-shop scheduling in O (congestion + dilation) steps. Combinatorica 14, 2, 167-186.
21. MITZENMACHER, M. 1994. Bounds on the greedy routing algorithm for array networks. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures (Cape May, N.J., June 27-29). ACM, New York, pp. 346-353.
22. 1+ε N) Local Control Packet Switching Algorithm. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 644-653.
23. RABANI, Y., AND TARDOS, E. 1996. Distributed packet switching in arbitrary networks. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 366-375.
24. ROBERTSON, N., AND SEYMOUR, P. D. 1986. Graph minors. V. Excluding a planar graph. J. Combinat. Theory, Ser. B 41, 92-114.
25. ROBERTSON, N., AND SEYMOUR, P. D. 1990. Graph minors. IV. Tree-width and well-quasi-ordering. J. Combinat. Theory, Ser. B 48, 227-254.
26. ROBERTSON, N., AND SEYMOUR, P. D. 1995. Graph minors. XIII. The disjoint paths problem. J. Combinat. Theory, Ser. B 63, 65-110.
27. SCHEIDELER, C., AND VÖCKING, B. 1996. Universal continuous routing strategies. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (Padua, Italy, June 24-26). ACM, New York, pp. 142-151.
28. STAMOULIS, G. D., AND TSITSIKLIS, J. N. 1994. The efficiency of greedy routing in hypercubes and butterflies. IEEE Trans. Commun. 42, 11 (Nov.), 3051-3061.
29. TASSIULAS, L., AND GEORGIADIS, L. 1996. Any work-conserving policy stabilizes the ring with spatial re-use. IEEE/ACM Trans. Netw. 4, 2 (Apr.), 205-208.