A performance model of deflection routing in multibuffer networks with nonuniform traffic

Deflection routing can be used in networks whose stations have the same number of input and output links. Fixed length packets arrive synchronously on the station's input links at the beginning of time slots, and each packet is routed via the output link that offers the shortest path to its destination. Since the number of packet buffers at each output link is finite, the simultaneous contention of two packets for the last buffer of a common output link must be resolved by "deflecting" one of the packets to another output link. Thus, the deflection of a packet could result in the packet following a route that is not a shortest path. The potentially unbounded number of routes that a given packet can take makes analyzing the performance of such networks difficult. In particular, there are no analytical models that can analyze multibuffer deflection-routing networks with nonuniform traffic. Using independence assumptions, the authors develop a performance model of deflection routing that allows to estimate accurately and efficiently the mean transport time and throughput in a network that has any given two-connected topology, multiple buffers at each output port, and an arbitrary traffic matrix. >

[1]  Ted H. Szymanski,et al.  An analysis of deflection routing in multi-dimensional regular mesh networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[2]  Leonard Kleinrock,et al.  Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .

[3]  Anthony S. Acampora,et al.  Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1992, IEEE Trans. Commun..

[4]  Flaminio Borgonovo,et al.  A Versatile Model for Predicting the Performance of Deflection-Routing Networks , 1992, Perform. Evaluation.

[5]  Flaminio Borgonovo,et al.  On the design of optical deflection-routing networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[6]  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.

[7]  David B. Wagner.  Approximate Mean Value Analysis of Deflection-routed Shuffle-loop Networks , 1992 .

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

[9]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[10]  Annie Gravey,et al.  On the Geo/D/1/and Geo/D/1/n Queues , 1990, Perform. Evaluation.

[11]  Flaminio Borgonovo,et al.  Unslotted deflection routing in all-optical networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[12]  Nicholas F. Maxemchuk,et al.  Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  A G Greenberg,et al.  Sharp approximation models of adaptive routing in mesh networks (preliminary report) , 1986 .

[14]  A. K. Choudhury,et al.  Performance analysis of deflection routing in the Manhattan Street network , 1991, ICC 91 International Conference on Communications Conference Record.

[15]  Analyzing Deflection Routing under Nonuniform Traffic , 1995 .

[16]  A. K. Choudhury,et al.  An Approximate Analysis of the Performance of Deflection Routing in Regular Networks , 1993, IEEE J. Sel. Areas Commun..

[17]  Thomas G. Robertazzi.  Nonuniform Traffic in the Manhattan Street Network , 1993 .

[18]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[19]  Flaminio Borgonovo,et al.  Deflection Networks: Architectures for Metropolitan and Wide Area Networks , 1992, Comput. Networks ISDN Syst..

[20]  Flaminio Borgonovo,et al.  Locally-optimal deflection routing in the Bidirectional Manhattan Network , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[21]  Flaminio Borgonovo,et al.  A procedure to evaluate the mean transport time in multibuffer deflection-routing networks with nonuniform traffic , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[22]  Rene L. Cruz,et al.  Nonuniform Traffic in the Manhattan Street Network , 1996, Perform. Evaluation.

[23]  Terence D. Todd,et al.  Performance modeling of the SIGnet MAN backbone , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[24]  Zhensheng Zhang,et al.  Performance analysis of multihop lightwave networks with hot potato routing and distance-age-priorities , 1994, IEEE Trans. Commun..

[25]  Jack Brassil.  Deflection routing in certain regular networks , 1992 .

[26]  Albert G. Greenberg,et al.  Deflection routing in hypercube networks , 1992, IEEE Trans. Commun..

[27]  Bruce E. Hajek,et al.  Performance of shuffle-like switching networks with deflection , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.