This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Chaos Router
December 1994 (vol. 43 no. 12)
pp. 1386-1397

The Chaos router, a randomizing, nonminimal adaptive packet router is introduced. Adaptive routers allow messages to dynamically select paths, depending on network traffic, and bypass congested nodes. This flexibility contrasts with oblivious packet routers where the path of a packet is statically determined at the source node. A key advancement of the Chaos router over previous nonminimal routers is the use of randomization to eliminate the need for livelock protection. This simplifies adaptive routing to be of approximately the same complexity along the critical decision path as an oblivious router. The primary cost is that the Chaos router is probabilistically livelock free rather than being deterministically livelock free, but evidence is presented implying that these are equivalent in practice. The principal advantage is excellent performance for nonuniform traffic patterns. The Chaos router is described, it is shown to be deadlock free and probabilistically livelock free, and performance results are presented for a variety of work loads.

[1] K. Bolding, "Chaoting routing-Design and implementation of an adaptive multicomputer network router," Ph.D. thesis. Dep. of Comput. Sci. and Eng., Univ. of Washington, 1993.
[2] K. Bolding, S. Cheung, S. Choi, C. Ebeling, S. Hassoun, T. Ngo, and R. Willie, "The chaos router chip: Design and implementation of an adaptive router," inVLSI '93, 1993, pp. 311-320.
[3] K. W. Bolding and L. Snyder, "Overview of fault routing in the chaos router," inProc. IEEE Workshop on Defect and Fault-Tolerance in VLSI Syst., 1991, pp. 124-127.
[4] K. W. Bolding and L. Snyder, "Mesh and torus chaotic routing," inProc. MIT/Brown Conf. on Advanced Res. in VLSI, 1992, pp. 333-347.
[5] A. Borodin and J. E. Hopcroft, "Routing, merging and sorting on parallel models of computation,"J. Comput. Syst. Sci., vol. 30, pp. 130-145, 1985.
[6] A. A. Chien and J. H. Kim, "Planar-adaptive routing: Low-cost adaptive networks for multiprocessors," inProc. 19th Int. Symp. Comput. Architecture, 1992, pp. 268-277.
[7] Thinking Machines Corporation,The Connection Machine CM5 Technical Summary, Oct. 1991.
[8] B. Cypher and D. Gavano, "Requirements for deadlock-free, adaptive packet routing, " inProc. 11th ACM Symp. Principles of Distrib. Computing, 1992, pp. 25-33.
[9] D. Gelernter, "A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks,"IEEE Trans. Comput., vol. C-30, pp. 709-715, Oct. 1981.
[10] A. G. Greenberg and B. Hajek, "Deflection routing in hypercube networks,"IEEE Trans. Commun., vol. 40, pp. 1070-1081, 1992.
[11] D. C. Grunwald, "Circuit switched multicomputers and heuristic load placement," Ph.D. thesis, Dep. of Comput. Sci., Univ. of Illinois at Urbana-Champaign, Sept. 1989.
[12] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[13] C. Kaklamanis, D. Krizanc, and A. Tsantilas, "Tight bounds for oblivious routing in the hypercube," inProc. 1990 ACM Symp. Parallel Algorithms and Architectures, 1990.
[14] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Netw., pp. 267-286, Sept. 1979.
[15] S. Konstantinidou, "Adaptive, minimal routing in hypercubes," in6th MIT Conf. Advanced Res. VLSI, 1990, pp. 139-153.
[16] S. Konstantinidou, "Deterministic and chaotic adaptive routing in multicomputers," Ph.D. thesis, Dep. of Comput. Sci. and Eng., Univ. of Washington, 1991.
[17] S. Konstantinidou, "Priorities in nonminimal, adaptive rouling," inInt. Conf. Parallel Processing, vol. I, pp. 67-71, 1992.
[18] S. Konstantinidou and L. Snyder, "Chaos router: Architecture and performance," in18th Int. Symp. Comput. Architecture, 1991, pp. 212-221.
[19] E. D. Lazawskaet al., Quantitative System Performance--Computer System Analysis Using Queueing Network Models. Englewood Cliffs, NJ: Prentice-Hall, 1984.
[20] J. Y. Ngai and Ch. L. Seitz, "A framework for adaptive routing in multicomputer networks," inProc. 1989 ACM Symp. on Parallel Algorithms and Architectures, June 1989, pp. 1-9.
[21] L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks,"IEEE Comput., vol. 26, no. 2, pp. 62-76, 1993.
[22] D. A. Padua, D. J. Kuck, and D. H. Lawrie, "High-speed multiprocessors and compilation techniques,"IEEE Trans. Comput., vol. C-29, pp. 763-776, Sept. 1980.
[23] G. D. Pifarré, L. Gravano, S. A. Felperin, and J. L.C. Sanz, "Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks," inProc. 3rd Ann. ACM Symp Parallel Algorithms and Architectures, 1991.
[24] C. L. Seitzet al., "The architecture and programming of the Ametek Series 2010 Multicomputer," inProc. Third Conf. Hypercube Concurrent Comput. Appl., ACM, Jan. 1988, pp. 33-37.
[25] T. Szymanski, "An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube," inProc. IEEE Infocom '90, vol. III, 1990, pp. 918-925.
[26] Y. Tamir and G. L. Frazier, "High-performance multi-queue buffers for VLSI communication switches," inProc. 15th Annu. Int. Symp. Comput. Architecture, Honolulu, HI, May 1988, pp. 343-354.
[27] L. G. Valiant and G. Brebner, "Universal schemes for parallel communication," inProc. 13th Annu. ACM Symp. Theory Comput., 1981.

Index Terms:
multiprocessor interconnection networks; parallel processing; computational complexity; Chaos router; nonminimal adaptive packet router; network traffic; adaptive routing; deadlock free; probabilistically livelock free.
Citation:
S. Konstantinidou, L. Snyder, "The Chaos Router," IEEE Transactions on Computers, vol. 43, no. 12, pp. 1386-1397, Dec. 1994, doi:10.1109/12.338098
Usage of this product signifies your acceptance of the Terms of Use.