Universal bufferless routing

Lecture Notes in Computer Science

Volumn 3351, Issue , 2005, Pages 239-252

  Busch, Costas ^a   Magdon Ismail, Malik ^a   Mavronicolas, Marios ^b  

^a Rensselaer Polytechnic Institute   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); COSTS; DISTRIBUTED COMPUTER SYSTEMS; PACKET NETWORKS; RANDOM PROCESSES;

ARBITRARY NETWORKS; BUFFERED ALGORITHMS; POLY-LOGARITHMIC FACTORS; ROUTING ALGORITHMS;

ROUTERS;

EID: 23944515358     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31833-0_20     Document Type: Conference Paper

References (26)

1. Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, and Adi Rosen. Time-constrained scheduling of weighted packets on trees and meshes. In Proceedings of 11th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-12, 1999.
2. N. Alon, F.R.K. Chung, and R.L.Graham. Routing permutations on graphs via matching. SIAM Journal on Discrete Mathematics, 7(3):513-530, 1994.
3. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Direct routing on trees. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 98), pages 342-349, 1998.
4. A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki. Fast deflection routing for packets and worms. In Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, pages 75-86, Ithaca, New York, USA, August 1993.
5. P. Baran. On distributed communications networks. IEEE Transactions on Communications, pages 1-9, 1964.
6. A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. Theory of Computing Systems, 31(1):41-61, January/February 1998.
7. Petra Berenbrink and Christian Scheideler. Locally efficient on-line strategies for routing packets along fixed paths. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 112-121, N.Y., January 17-19 1999. ACM-SIAM.
8. Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, and Eric J. Schwabe. On bufferless routing of variable-length message in leveled networks. IEEE Trans. Comput., 45:714-729, 1996.
9. J. T. Brassil and R. L. Cruz. Bounds on maximum delay in networks with deflection routing. IEEE Transactions on Parallel and Distributed Systems, 6(7):724-732, July 1995.
10. A. Broder and E. Upfal. Dynamic deflection routing on arrays. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 348-358, May 1996.
11. C. Busch. Õ(Congestion + Dilation) hot-potato routing on leveled networks. In Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, pages 20-29, August 2002.
12. C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278-285, May 2000.
13. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, and Paul Spirakis. Direct routing: algorithms and complexity. In Proceedings of the 12th Annual European Symposium on Algorithms ESA 2004, Bergen, Norway, September 2004.
14. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, and Roger Wattenhofer. Near-optimal hot-potato routing on trees. In Proceedings of the 10th International Conference on Parallel and Distributed Computing (Euro-par), pages 820-827, September 2004.
15. Robert Cypher, Priedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. Universal algorithms for store-and-forward and wormhole routing. In Proceedings of the 28th ACM Symp. on Theory of Computing (STOC), pages 356-365, 1996.
16. U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In IEEE, editor, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 553-562, Pittsburgh, PN, October 1992.
17. Ronald I. Greenberg and Hyeong-Cheol Oh. Universal wormhole routing. IEEE Transactions on Parallel and Distributed Systems, 8(3):254-262, 1997.
18. B. Hajek. Bounds on evacutation time for deflection routing. Distributed Computing, 1:1-6, 1991.
19. Ch. Kaklamanis, D. Krizanc, and S. Rao. Hot-potato routing on processor arrays. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 273-282, Velen, Germany, June 30-July 2, 1993.
20. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-scheduling in O(congestion + dilation) steps. Combinatorica, 14:167-186, 1994. (preliminary version appears in FOGS 1988).
21. Friedhelm Meyer auf der Heide and Christian Scheideler. Routing with bounded buffers and hot-potato routing in vertex-symmetric networks. In Proceedings of the Third Annual European Symposium on Algorithms, volume 979 of LNCS, pages 341-354, Corfu, Greece, 25-27 September 1995.
22. Friedhelm Meyer auf der Heide and Berthold Vöcking. Shortest-path routing in arbitrary networks. Journal of Algorithms, 31(1):105-131, April 1999.
23. 1+ε N) local control packet switching algorithms. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 644-653, New York, May 1997.
24. Yuval Rabani and Eva Tardos. Distributed packet switching in arbitrary networks. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 366-375, Philadelphia, Pennsylvania, 22-24 May 1996.
25. Alan Roberts, Antonios Symvonis, and David R. Wood. Lower bounds for hotpotato permutation routing on trees. In Proceedings of the 7th Int. Coll. Structural Information and Communication Complexity, SIROCCO, pages 281-295, 20-22 June 2000.
26. L. Zhang. Optimal bounds for matching routing on trees. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 445-453, 1997.