Deflection routing in hypercube networks

An approximate analysis of the transient and steady state behavior of deflection routing in hypercube networks is presented, under a uniform traffic model. In deflection routing congestion causes packets admitted to the network to be temporarily misrouted rather than buffered or dropped. The approximations show that deflection routing performs remarkably well in hypercube networks, for small as well as large networks and for the whole range from light to heavy load. Simulations suggest that the approximations are quite accurate. >

[1]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[2]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[3]  Allan Borodin,et al.  Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[4]  Burton J. Smith.  Architecture And Applications Of The HEP Multiprocessor Computer System , 1982, Optics & Photonics.

[5]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[6]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[7]  N. F. Maxemchuk,et al.  Regular mesh topologies in local and metropolitan area networks , 1985, AT&T Technical Journal.

[8]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[9]  X.-N. Tan,et al.  Optimal routing in the shuffle-exchange networks for multiprocessor systems , 1988, [Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools.

[10]  Ted H. Szymanski.  An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  Arvind Krishna.  Communication with few buffers: analysis and design , 1991 .

[12]  Thomas G. Robertazzi.  An Analysis of HotPotato Routing in a Fiber Optic Packet Switched Hypercube , 1993 .