Fault Tolerance and Circuit Service in Deflection Networks

Deflection Networks are very attractive communications systems, since they are capable to extend to MANs and wide area networks the services provided by LANs. These networks are based on Mesh Topologies and use the Deflection Routing. Unlike ring and bus topologies, mesh networks provide multiple paths between sources and destinations and offer very high connection reliability and traffic-handling capability. If the network topology changes because of node and link failures, a further mechanism is needed to dynamically estimate the shortest-path distances required to guarantee the proper operation of the Deflection Algorithm. The aim of this paper is twofold. First we show the fault-tolerance capabilities of this architecture when the Backward Learning mechanism is used to update routing tables and second we present a distributed mechanism able to provide circuit services with guaranteed bandwidth.

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

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

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

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

[5]  F. Borgonovo,et al.  Packet-switching network architectures for very-high-speed service , 1990, International Zurich Seminar on Digital Communications, Electronic Circuits and Systems for Communications..

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

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