Efficient bufferless packet switching on trees and leveled networks

Journal of Parallel and Distributed Computing

Volumn 67, Issue 11, 2007, Pages 1168-1186

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

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Congestion; Dilation; Hot potato routing; Packet scheduling; Routing algorithms

Indexed keywords

BUFFER STORAGE; CONGESTION CONTROL (COMMUNICATION); FIBER OPTIC NETWORKS; MATHEMATICAL MODELS; PACKET NETWORKS; ROUTING ALGORITHMS; TREES (MATHEMATICS);

BUFFERLESS NETWORKS; DILATION; HOT POTATO ROUTING; PACKET SCHEDULING;

SWITCHING;

EID: 34548825099     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.06.005     Document Type: Article

References (55)

1. Acampora A.S., and Shah S.I.A. Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. Proceedings of IEEE INFOCOM (1991) 10-19
2. Alon N., Chung F.R.K., and Graham R.L. Routing permutations on graphs via matching. SIAM J. Discrete Math. 7 3 (1994) 513-530
3. Alstrup S., Holm J., de Lichtenberg K., and Thorup M. Direct routing on trees. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 98) (1998) 342-349
4. Aspens J., Azar Y., Fiat A., Plotkin S., and Waarts O. Online load balancing with applications to machine scheduling and virtual circuit routing. Proceedings of the 25th ACM Symposium on Theory of Computing (1993) 623-631
5. Awerbuch B., and Azar Y. Local optimization of global objectives. competitive distributed deadlock resolution and resource allocation. Proceedings of 35th Annual Symposium on Foundations of Computer Science. Santa Fe, New Mexico (1994) 240-249
6. Bar-Noy A., Raghavan P., Schieber B., and Tamaki H. Fast deflection routing for packets and worms. Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing. Ithaca, New York, USA (August 1993) 75-86
7. P. Baran, On distributed communications networks, IEEE Trans. Commun. (1964) 1-9.
8. C. Bartzis, I. Caragiannis, C. Kaklamanis, I. Vergados, Experimental evaluation of hot-potato routing algorithms on 2-dimensional processor arrays, in: EUROPAR: Parallel Processing, 6th International EURO-PAR Conference, Lecture Notes in Computer Science, 2000, pp. 877-881.
9. Ben-Aroya I., Eilam T., and Schuster A. Greedy hot-potato routing on the two-dimensional mesh. Distributed Comput. 9 1 (1995) 3-19
10. Ben-Aroya I., Newman I., and Schuster A. Randomized single-target hot-potato routing. J. Algorithms 23 1 (1997) 101-120
11. Ben-Dor A., Halevi S., and Schuster A. Potential function analysis of greedy hot-potato routing. Theory Comput. Systems 31 1 (1998) 41-61
12. P. Berenbrink, C. Scheideler, Locally efficient on-line strategies for routing packets along fixed paths, in: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, NY, January 17-19 1999, pp. 112-121.
13. Bhatt S.N., Bilardi G., Pucci G., Ranade A.G., Rosenberg A.L., and Schwabe E.J. On bufferless routing of variable-length message in leveled networks. IEEE Trans. Comput. 45 (1996) 714-729
14. Borodin A., and Hopcroft J.E. Routing, merging, and sorting on parallel models of computation. J. Comput. System Sci. 30 1 (1985) 130-145
15. Borodin A., Rabani Y., and Schieber B. Deterministic many-to-many hot potato routing. IEEE Trans. Parallel Distributed Systems 8 6 (1997) 587-596
16. Brassil J.T., and Cruz R.L. Bounds on maximum delay in networks with deflection routing. IEEE Trans. Parallel Distributed Systems 6 7 (1995) 724-732
17. Broder A., and Upfal E. Dynamic deflection routing on arrays. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (May 1996) 348-358
18. Busch C. Õ(congestion + dilation) hot-potato routing on leveled networks. Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures (August 2002) 20-29
19. Busch C., Herlihy M., and Wattenhofer R. Hard-potato routing. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (May 2000) 278-285
20. Busch C., Herlihy M., and Wattenhofer R. Routing without flow control. Proceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures (July 2001) 11-20
21. C. Busch, M. Magdon-Ismail, and M. Mavronicolas. Universal bufferless routing, in: Proceedings of the 2nd Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, vol. 3351, September 2004, pp. 239-252 (Extended version accepted to SIAM Journal on Computing).
22. Busch C., Magdon-Ismail M., Mavronicolas M., and Spirakis P. Direct routing: algorithms and complexity. Algorithmica 45 1 (2006) 45-68
23. Feige U. Nonmonotonic phenomena in packet routing. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (May 1-4 1999), ACM, New York 583-591
24. Feige U., and Raghavan P. Exact analysis of hot-potato routing. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. Pittsburgh, PN (October 1992), IEEE, New York 553-562
25. Greenberg A.G., and Goodman J. Sharp approximate models of deflection routing. IEEE Trans. Commun. 41 1 (1993) 210-223
26. Hajek B. Bounds on evacutation time for deflection routing. Distributed Comput. 1 (1991) 1-6
27. Hillis W.D. The Connection Machine (1985), MIT Press, Cambridge
28. Kaklamanis C., Krizanc D., and Rao S. Hot-potato routing on processor arrays. Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures. Velen, Germany (June 30-July 2 1993) 273-282
29. M. Kaufmann, H. Lauer, H. Schroder, Fast deterministic hot-potato routing on meshes, in: Proceedings of the 5th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, vol. 834, Springer, Berlin, 1994, pp. 333-341.
30. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes (1992), Morgan Kaufmann, San Mateo
31. Leighton F.T., Maggs B.M., and Rao S.B. Packet routing and job-scheduling in O (congestion + dilation) steps. Combinatorica 14 (1994) 167-186
32. Leighton F.T., Maggs B.M., Ranade A.G., and Rao S.B. Randomized routing and sorting on fixed-connection networks. J. Algorithms 17 1 (1994) 157-205
33. Leighton T., Maggs B., and Richa A.W. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19 (1999) 375-401
34. Maxemchuk N.F. Comparison of deflection and store and forward techniques in the Manhattan street and shuffle exchange networks. Proceedings of IEEE INFOCOM (1989) 800-809
35. F. Meyer auf der Heide, C. Scheideler, Routing with bounded buffers and hot-potato routing in vertex-symmetric networks, in: Paul G. Spirakis (Ed.), Proceedings of the Third Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 979, Corfu, Greece, 25-27 September 1995, pp. 341-354.
36. Meyer auf der Heide F., and Vöcking B. Shortest-path routing in arbitrary networks. J. Algorithms 31 1 (1999) 105-131
37. Mitzenmacher M. Constant time per edge is optimal on rooted tree networks. Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (1996) 162-169
38. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press, Cambridge
39. Newman I., and Schuster A. Hot-potato algorithms for permutation routing. IEEE Trans. Parallel Distributed Systems 6 11 (1995) 1168-1176
40. 1 + ε N) local control packet switching algorithms. Proceedings of the 29th Annual ACM Symposium Conference on the Theory of Computing. New York (May 1997) 644-653
41. Pantziou G.E., Roberts A., and Symvonis A. Many-to-many routing on trees via matchings. Theoret. Comput. Sci. 185 2 (1997) 347-377
42. R. Prager, An algorithm for routing in hypercube networks. Master's Thesis, University of Toronto, Computer Science Department, 1986.
43. Rabani Y., and Tardos E. Distributed packet switching in arbitrary networks. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing. Philadelphia, Pennsylvania (22-24 May 1996) 366-375
44. Raghavan P., and Thompson C.D. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987) 365-374
45. Ramaswami R., and Sivarajan K.N. Optical Networks, A Practical Perspective (1998), Morgan Kaufmann, Los Altos, CA
46. A. Roberts, A. Symvonis, D.R. Wood, Lower bounds for hot-potato permutation routing on trees, in: M. Flammini, E. Nardelli, G. Proietti, P. Spirakis (Eds.), Proceedings of the 7th International Colloquim Structural Information and Communication Complexity, SIROCCO, Carleton Scientific, 20-22 June 2000, pp. 281-295.
47. C.L. Seitz, The caltech mosaic C: an experimental, fine-grain multicomputer, in: Proceedings of the 4th Symposium on Parallel Algorithms and Architectures, June 1992. Keynote Speech.
48. Smith B. Architecture and applications of the HEP multiprocessor computer system. Proceedings of the 4th Symposium on Real Time Signal Processing IV (1981), SPIE 241-248
49. Spirakis P., and Triantafillou V. Pure greedy hot-potato routing in the 2-D mesh with random destinations. Parallel Process. Lett. 7 3 (1997) 249-258
50. A. Srinivasan, C-P. Teo, A constant factor approximation algorithm for packet routing, and balancing local vs. global criteria, in: Proceedings of the ACM Symposium on the Theory of Computing (STOC), 1997, pp. 636-643.
51. Symvonis A. Routing on trees. Inform. Process. Lett. 57 4 (1996) 215-223
52. Szymanski T. An analysis of "hot potato" routing in a fiber optic packet switched hypercube. Proceedings of IEEE INFOCOM (1990) 918-925
53. Wu J. Distributed System Design (1999), CRC Press, Boca Raton
54. Zhang L. Optimal bounds for matching routing on trees. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (1997) 445-453
55. Zhang Z., and Acampora A.S. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. Proceedings of IEEE INFOCOM (1991) 1012-1021