Problems Arising from Deflection Routing: Live-lock, Lockout, Congestion and Message Reassembly

Deflection routing is a technique that has been proposed for slotted, metropolitan area networks. When there are no buffers available at an intermediate node in the network, packets of data are forced to take longer paths through the network. Because this technique only uses local information at a node, it is possible to apply it to high rate networks in which the propagation delay on a link is much greater than the time it takes to transmit a packet.

[1]  B. K. Penney,et al.  Survey of computer communications loop networks: Part 2 , 1979, Comput. Commun..

[2]  Israel Cidon,et al.  Distributed Store-and-Forward Deadlock Detection and Resolution Algorithms , 1987, IEEE Trans. Commun..

[3]  H. Ohnishi,et al.  ATM ring protocol and performance , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

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

[5]  Z.L. Budrikis,et al.  The QPSX MAN , 1988, IEEE Communications Magazine.

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

[7]  Pen-Chung Yew,et al.  Performance of packet switching in buffered single-stage shuffle-exchange networks , 1982, ICDCS.

[8]  D. Grillo,et al.  Flow Control in Local-Area Networks of Interconnected Token Rings , 1985 .

[9]  R. Prosser,et al.  Routing Procedures in Communications Networks-Part I: Random Procedures , 1962 .

[10]  Maxemchuk.  The Manhattan street network , 1985 .

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

[12]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[13]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[14]  Nicholas F. Maxemchuk,et al.  Improving the fairness of distributed-queue-dual-bus networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[15]  B. K. Penney,et al.  Survey of computer communications loop networks: Part 1 , 1979, Comput. Commun..

[16]  Inder S. Gopal.  Prevention of Store-and-Forward Deadlock in Computer Networks , 1985, IEEE Trans. Commun..

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

[18]  Nicholas F. Maxemchuk.  Distributed clocks in slotted networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[19]  Robert M. Newman,et al.  QPSX: A Queue Packet and Synchronous Circuit Exchange , 1986, ICCC.