Adversarial queuing theory

Journal of the ACM

Volumn 48, Issue 1, 2001, Pages 13-38

  Borodin, Allan ^a   Kleinberg, Jon ^b,f   Raghavan, Prabhakar ^c,g   Sudan, Madhu ^d,h   Williamson, David P ^c,e  

^a UNIVERSITY OF TORONTO   (Canada)

^b Department of Population Medicine and Diagnostic Sciences   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e IBM T J WATSON RESEARCH CENTER   (United States)

^f University of Toronto ^*  (United States)

^g Verity   (United States)

^h MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Packet routing; Scheduling protocols; Stability

Indexed keywords

PACKET ROUTING; QUEUING SYSTEMS; SCHEDULING PROTOCOLS; STABILITIES;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER AIDED ANALYSIS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PACKET NETWORKS; PROBABILISTIC LOGICS; QUEUEING NETWORKS; ROUTERS;

QUEUEING THEORY;

EID: 0001806330     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/363647.363659     Document Type: Article

References (52)

1. AIELLO, W., KUSHILEVITZ, E., OSTROVSKY, R., AND ROSÉN, A. 1988. Adaptive packet routing for bursty adversarial traffic. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC) (Dallas, Tex., May 23-26). ACM, New York, pp. 359-368.
2. ANDREWS, M. 2000. Instability of FIFO in session-oriented networks. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 9-11). ACM, New York, pp. 440-447.
3. ANDREWS, M., AWERBUCH, B., FERNÁNDEZ, A., LEIGHTON, F. T., LIU, Z., AND KLEINBERG, J. 2001. Universal stability results for greedy contention-resolution protocols. J. ACM 48, 1 (Jan.), 39-69.
4. 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.
5. AWERBUCH, B., AND LEIGHTON, F. T. 1994. Improved approximations for the multicommodity 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-496.
6. BERTSIMAS, D., GAMARNIK, D., AND TSITSJKLIS, J. N. 1996. Stability conditions for multiclass fluid queuing networks. IEEE Trans. Automat. Cont. 41 (Nov.), 1618-1631.
7. BORODIN, A., KLEINBERG, J., RAGHAVAN, P., SUDAN, M., AND WILLIAMSON, D. 1996. Adversarial queuing theory. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 376-385.
8. BORODIN, A., OSTROVSKY, R., AND RABANI, Y. 2001. Routing networks with speeds and capacities. In Proceedings of the 12th Annual ACM-SIAM Symposium on Theory of Computing. ACM, New York.
9. BRAMSON, M. 1994a. Instability of FIFO queuing networks. Ann. Appl. Prob. 4, 414-431.
10. BRAMSON, M. 1994b. Instability of FIFO queuing networks with quick service times. Ann. Appl. Prob. 4, 693-718.
11. BRAMSON, M. 1996. Convergence to equilibria for fluid models of FIFO queuing networks. Que. Syst. 22, 5-45.
12. BRODER, A., FRIEZE, A., AND UPFAL, E. 1997. A general approach to dynamic packet routing with bounded buffers. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 390-399.
13. CRUZ, R. L. 1991a. A calculus for network delay, Part I. IEEE Trans. Inf. Theory 37 (Jan.), 114-131.
14. CRUZ, R. L. 1991b. A calculus for network delay, Part II. IEEE Trans. Inf. Theory 37 (Jan.), 132-141.
15. DAI, J. G. 1995. On positive Harris recurrence of multiclass queuing networks: A unified approach via fluid limit models. Ann. Appl. Prob. 5, 49-77.
16. DAI, J. G., AND MEYN, S. P. 1995. Stability and convergence of moments for multiclass queuing networks via fluid limit models. IEEE Trans. Automat. Cont. 40 (Nov.), 1889-1904.
17. DAI, J. G., AND WEISS, G. 1996. Stability and instability of fluid models for reentrant lines. Math. Oper. Res. 21 (Feb.).
18. DOWN, D. D., AND MEYN, S. P. 1995. Stability of acyclic multiclass queuing networks. IEEE Trans. Automat. Cont. 40, 5, 916-920.
19. DURRETT, R. 1995. Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont, Calif.
20. GAMARNIK, D. 1998. Stability of adversarial queues via fluid models. In Proceedings of the 39th Symposium on the Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 60-70.
21. GAMARNIK, D. 1999. Stability of adaptive and non-adaptive packet routing policies in adversarial queuing networks. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (Atlanta, Ga., May 1-4). ACM, New York, pp. 206-214.
22. GOEL, A. 1997. Stability of networks and protocols in the adversarial queuing model for packet routing. Stanford Univ. Tech. Note STAN-CS-TN-97-59. Stanford Univ., Stanford, Calif.
23. HAJEK, B. 1982. Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Prob. 14, 502-525.
24. HARCHOL-BALTER, M., AND BLACK, P. E. 1994. Queuing analysis of oblivious packet-routing networks. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (Arlington, Va., Jan. 23-25). ACM, New York, pp. 583-592.
25. 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, Nov., May 29-June 1). ACM, New York, pp. 248-257.
26. JACKSON, J. R. 1963. Jobshop-like queuing systems. Manage. Sci. 10, 131-142.
27. KAHALE, N., AND LEIGHTON, F. 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.
28. KELLY, F. P. 1979. Reversibility and stochastic networks. Wiley, New York.
29. KLEINROCK, L. 1975. Queuing Systems. Wiley, New York.
30. LEIGHTON, F. 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.
31. LEIGHTON, F. T., MAGGS, B. M., AND RAO, S. B. 1994. Packet routing and job-shop scheduling in O (congestion + dilation) steps. Combinatorica 14, 167-180.
32. LEIGHTON, F. T., MAGGS, B. M., AND RICHA, A. W. 1999. Fast algorithms for finding O (congestion + dilation) packet routing schedules. Combinatorica 19, 3, 375-401.
33. LOEVE, M. 1978. Probability Theory, vol. 2. Springer-Verlag, New York.
34. LU, S. H., AND KUMAR, P. R. 1991. Distributed scheduling based on due dates and buffer priorities. IEEE Trans. Automat. Cont. 36, 12, 1406-1416.
35. MANI CHANDY, K., HOWARD, J., AND TOWSLEY, D. 1977. Product form and local balance in queuing networks. J. ACM (Apr.). 250-263.
36. MANSOUR, Y., AND PATT-SHAMIR, B. 1991. Greedy packet scheduling on shortest paths. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (Montreal, Que., Canada, Aug. 19-21). ACM, New York, pp. 165-176.
37. MEYN, S. P., AND DOWN, D. 1994. Stability of generalized Jackson networks. Ann. Appl. Prob. 4, 124-148.
38. MITRA, D., AND CIESLAK, R. 1987. Randomized parallel communications on an extension of the omega network. J. ACM 34, 4 (Oct.), 802-824.
39. 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.
40. 1+ε N) local control packet switching algorithms. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 644-653.
41. PAREKH, A. K., AND GALLAGER, R. G. 1993. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Trans. Netw. 1, 3, 344-357.
42. PAREKH, A. K., AND GALLAGER, R. G. 1994. A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case. IEEE/ACM Trans. Netw. 2, 2, 137-150.
43. r. Tech. Rep. 9814. Dept. Statistics, Univ. Toronto, Toronto, Ont., Canada.
44. r. Stock. Proc. Their Appl. 82, 143-155.
45. PERKINS, J. R., AND KUMAR, P. R. 1989. Stable distributed real-time scheduling of flexible manufacturing/assembly/disassembly systems. IEEE Trans. Automat. Cont. 34, 139-148.
46. RABANI, Y., AND TARDOS, E. 1996. Distributed 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.
47. RYBKO, A. N., AND STOLYAR, A. L. 1992. Ergodicity of stochastic processes describing the operation of open queuing networks. Prob. Inf. Trans. 28, 199-220.
48. SEIDMAN, T. I. 1994. 'First come, first serve' can be unstable. IEEE Trans. Automat. Cont. 39, 2166-2171.
49. STAMOULIS, G. D., AND TSITSIKLIS, J. N. 1991. The efficiency of greedy routing in hypercubes and butterflies. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (Hilton Head, S.C., July 21-24). ACM, New York, pp. 248-260.
50. TASSIULAS, L., AND GEORGIADIS, L. 1996. Any work-conserving policy stabilizes the ring with spatial re-use. IEEE/ACM Trans. Netw. 4, 2, 205-208.
51. TSAPARAS, P. 1997. Stability in adversarial queuing theory. M.Sc dissertation. Dept. of Computer Science, Univ. of Toronto, Toronto, Ont. Canada.
52. WALRAND, J. 1988. An Introduction to Queuing Networks. Prentice-Hall, Englewood Cliffs, N.J.