Dynamic routing on networks with fixed-size buffers

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 771-780

  Aiello, William ^a   Ostrovsky, Rafail ^c   Kushilevitz, Eyal ^b   Rosén, Adi ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; QUEUEING THEORY; SCHEDULING; THROUGHPUT;

ADVERSARIAL QUEUING THEORY; DYNAMIC ROUTING; FIXED-SIZE BUFFERS;

ROUTERS;

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

References (31)

1. W. Aiello, Y. Mansour, S. Rajagopolan, A. Rosén, "Competitive Queue Policies for Differentiated Services," Proc. of 19th INFOCOM, pp. 431-440, 2000.
2. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu, "Universal Stability Results for Greedy Contention-Resolution Protocols", Proc. of 37th FOCS, pp. 380-389, 1996.
3. B. Awerbuch, Y. Azar, and S. Plotkin, "Throughput Competitive On-Line Routing," 34th FOCS, pp. 32-40, 1993.
4. B. Awerbuch, A. Brinkman, C. Scheideler, "Anycasting and Multicasting in Adversarial Systems: Routing and Admission Control," manuscript, http://www.cs.jhu.edu/~scheideler.
5. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis, Cambridge University Press, 1998.
6. A.Z. Broder, A.M. Frieze, and E. Upfal. "A General Approach to Dynamic Packet Routing with Bounded Buffers", Proc. of 37th FOCS, pp. 390-399, 1996.
7. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. Williamson, "Adversarial Queuing Theory", Proc. of 28th STOC, pp. 376-385, 1996.
8. A.Z. Broder, and E. Upfal. "Dynamic Deflection Routing on Arrays," Proc. of 28th STOC, pp. 348-355, 1996.
9. D. Gamarnik, Stability of Adaptive and non-Adaptive Packet Routing in Adversarial Queuing Networks. In Proc. of 31st STOC, pp. 206-214, 1999.
10. E. Hahne, A. Kesselman, Y. Mansour, "Competitive buffer management for shared-memory switches," Proc. of 13th SPAA, pp. 53-58, 2001.
11. M. Harchol-Balter and P. Black, "Queuing Analysis of Oblivious Packet-Routing Algorithms," Proc. of 5th SODA, pp. 583-592, 1994.
12. M. Harchol-Balter and D. Wolfe, "Bounding Delays in Packet Routing Networks," 27th STOC, pp. 248-257, 1995.
13. A. Kamath, O. Palman, and S. Plotkin, "Routing and Admission Control in General Topology Networks with Poisson Arrivals," Proc. of 7th SODA, pp. 269-278, 1996.
14. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, M. Sviridenko, "Buffer overflow management in QoS switches," Proc. of 33rd STOC, pp. 520-529, 2001.
15. J. Kleinberg and E. Tardos, "Disjoint Paths in Densely Embedded Graphs." Proc. of 36th FOCS, pp. 52-61, 1995.
16. F.T. Leighton, "Methods for message routing in parallel machines". Invited paper in 24th STOC, pp. 77-96, 1996.
17. T. Leighton, B. Maggs, S. Rao, "Packet Routing and Job-Shop Scheduling in O(congestion+dilation) Steps," Combinatorica, Vol. 14, No. 2, pp. 167-180, 1994.
18. T. Leighton, B. Maggs and A. Richa, "Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules," Combinatorica, to appear.
19. Y. Mansour, and B. Patt-Shamir, "Greedy Packet Scheduling on Shortest Paths", Journal of Algorithms, Vol. 14, No. 3, pp. 99-129, 1993.
20. Y. Mansour, B. Patt-Shamir, O. Lapid, "Optimal smoothing schedules for real-time streams," Proc. of 19th PODC, pp. 21-29, 2000.
21. M. Mihail, "Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders," Proc. of 30th FOCS, pp. 526-531, 1989.
22. M. Mitzenmacher, "Bounds on the Greedy Routing Algorithm for Array Networks", J. Comput. System Sci. 53 (1996), No. 3, pp. 317-327.
23. R. Ostrovsky and Y. Rabani, "Local Control Packet Switching Algorithm," Proc. of 29th STOC, pp. 644-653, 1997.
24. C. Partridge, The end of simple traffic models. IEEE Network, Vol. 7 No. 5, Editor note. 1993.
25. A. Parekh, and R. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case," IEEE/ACM Transactions on Networking, 1 (3) pp. 344-357, 1993.
26. A. Parekh and R. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple-Node Case," IEEE/ACM Transactions on Networking, 2 (2) pp. 137-150, 1994.
27. Y. Rabani and É. Tardos, "Distributed packet switching in arbitrary networks", 28th STOC, pp. 366-375, 1996.
28. A. Srinivasan and C.-P. Teo, "A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria". Proc. of 29th STOC, pp. 636-643, 1997.
29. G. Stamoulis and J. Tsitsiklis, "The Efficiency of Greedy Routing in Hypercubes and Butterflies," IEEE Transactions on Communications, 42(11), pp. 3051-208, 1994.
30. C. Scheideler and B. Vöcking, "Universal Continuous Routing Strategies," Proc. of 8th SPAA, 1996.
31. A. Veres and M. Boda, The chaotic nature of TCP congestion control. In Proc. of INFOCOM 2000, 2000.