Universal algorithms for store-and-forward and wormhole routing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 356-365

  Cypher, Robert ^a   Der Heide, Friedhelm Meyer Auf ^b   Scheideier, Christian ^b   Vöcking, Berthold ^b  

^a Johns Hopkins University   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MESH NETWORKING; ROUTING ALGORITHMS; BANDWIDTH; BUFFER STORAGE; COMPUTER NETWORKS; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; GRAPH THEORY; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; TELECOMMUNICATION LINKS;

ARBITRARY NETWORKS; EDGE CONGESTION; ROUTE MESSAGES; SHORTEST PATH; STORE AND FORWARD; SYMMETRIC NETWORK; UNIVERSAL ALGORITHM; WORMHOLE ROUTING;

NETWORK ROUTING; ALGORITHMS;

EDGE CONGESTION; PATH COLLECTION; ROUTING ALGORITHMS; STORE AND FORWARD ROUTING; WORMHOLE ROUTING;

EID: 0029720068     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237982     Document Type: Conference Paper

References (20)

1. A. Acampora, S. Shah. Multihop Lightwave Networks: a Comparison of Store-and-Porward and Hot-Potato Routing. IEEE Transaction on Communications, pp. 1082-1090, 1992.
2. A. Broder, A. Frieze, E. Upfal. Existence and Construction of Edge Disjoint Paths on Expander Graphs. In Proc. of the 24th Symp. on Theory of Computing, pp. 140-149, 1992.
3. A. Bar-Noy, P. Raghavan, B. Schieber, H. Tamaki. Fast Deflection Routing for Packets and Worms. In Proc. of the 12th Symp. on Principles of Distributed Computing, pp. 75-86, 1993.
4. W. Dally. Virtual-Channel Flow Control. In Proc. of the 17th Intl. Symp. on Computer Architecture, pp. 60-68, 1990.
5. W. Dally, C. Seitz. Deadlock-Free Message Routing in Multicomputer Networks Using Virtual Channels. IEEE Trans. on Computers 36, pp. 547-553, 1987.
6. U. Feige, P. Raghavan. Exact Analysis of Hot-Potato Routing. In Proc. of the 33rd Symp. on Foundations of Computer Science, pp. 553-562, 1992.
7. S. Felperin, P. Raghavan, E. Upfal. A Theory of Wormhole Routing in Parallel Computers. In Proc. of the 33rd Symp. on Foundations of Computer Science, 1992.
8. A. Greenberg, B. Hajek. Deflection Routing in Hypercube Networks. IEEE Transactions on Communications, pp. 1070-1081, 1992.
9. R. Greenberg, H. C. Oh. Universal Wormhole Routing. Technical Report, University of Maryland, 1993.
10. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
11. T. Leighton, B. Maggs, S. Rao. Packet Routing and Job-Shop Scheduling in O (Congestion + Dilation) Steps. Combinatorica 14, pp. 167-186, 1994.
12. T. Leighton, B. Maggs, A. Ranade, S. Rao. Randomized Routing and Sorting on Fixed-Connection Networks. Journal of Algorithms 17, pp. 157-205, 1994.
13. N. Maxemchuk. Comparison of Deflection and Storeand-Forward Techniques in the Manhattan Street and Shuffle-Exchange Networks. In Proc. of the IEEE INFOCOM, pp. 800-809, 1989.
14. F. Meyer auf der Heide, C. Scheideier. Routing with Bounded Buffers and Hot-Potato R.outing in Vertex-Symmetric Networks. In 3rd European Symposium on Algorithms, pp. 341-354, 1995.
15. F. Meyer auf der Heide, B. Vöcking. A Packet Routing Protocol for Arbitrary Networks. In Proc. of the 12th Symp. on Theoretical Aspects of Computer Science, pp. 291-302, 1995.
16. F. Meyer auf der Heide, M. Westermann. Hot-Potato Routing on Multi-Dimensional Tori. To appear in Int. Workshop on Distributed Algorithms, 1995.
17. N. Pippenger. Parallel Communication with Limited Buffers. In Proc. of the 25th Symp. on Foundations of Computer Science, pp. 127-136, 1984.
18. A. Ranade, S. Schleimer, D. S. Wilkerson. Nearly Tight Bounds for Wormhole Routing. In Proc. of the 35th Symp. on Foundations of Computer Science, pp. 347-355, 1994.
19. M. Setiembre, F. Matera. All Optical Implementations of High Capacity TDMA Networks. Fiber and Integrated Optics 12, pp. 173-186, 1993.
20. L. G. Valiant. A Scheme for Fast Parallel Communication. SIAM Journal of Computing 11/2, pp. 350-361, 1982.