Fault-tolerant convergence routing

This paper presents fault-tolerant protocols for fast packet switch networks with convergence routing. The objective is to provide, after a link or a node (switch) failure, fast reconfiguration and continuous host-to-host communication. Convergence routing is a variant of deflection routing, which combines in a dynamic fashion, the on-line routing decision with the traffic load inside the network. Unlike other deflection techniques, convergence routing guarantees that packets will reach or converge to their destinations. This fault-tolerant solution is designed for a switch-based (i.e., arbitrary topology) LAN architecture called MetaNet. The original MetaNet's convergence routing scheme has been modified in order to facilitate the property that the packet header need not be recomputed after a failure and/or a reconfiguration. This is achieved by having, at the network interface, a translator that maps the unique destination address to a virtual address. The virtual addresses are stored at the packet header, and used for convergence routing, with a global sense of direction over (i) a single spanning tree, and (ii) over two edge-disjoint spanning trees, for redundancy (fault tolerance) and greater efficiency.<<ETX>>

[1]  Yossi Shiloach,et al.  Edge-Disjoint Branching in Directed Multigraphs , 1979, Inf. Process. Lett..

[2]  Moti Yung,et al.  Topological design of loss-free switch-based LANs , 1995, Proceedings of INFOCOM'95.

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

[4]  Daniel P. Siewiorek.  Architecture of Fault-Tolerant Computers , 1984, Computer.

[5]  Radia Perlman,et al.  An algorithm for distributed computation of a spanningtree in an extended LAN , 1985, SIGCOMM '85.

[6]  B. Bollobás,et al.  Random Graphs of Small Order , 1985 .

[7]  Moti Yung,et al.  Principle for high speed network control: congestion-and deadlock-freeness, self-routing, and a single buffer per link , 1990, PODC '90.

[8]  Robert E. Tarjan,et al.  A Good Algorithm for Edge-Disjoint Branching , 1974, Inf. Process. Lett..

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

[10]  Moti Yung,et al.  Routing and Flow Control on the MetaNet: An Overview , 1994, Comput. Networks ISDN Syst..

[11]  Werner Bux,et al.  Architecture and Design of a Reliable Token-Ring Network , 1983, IEEE Journal on Selected Areas in Communications.

[12]  Moti Yung,et al.  Lossless asynchronous broadcast-with-feedback on the MetaNet architecture , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[13]  Moti Yung,et al.  Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks , 1990, WDAG.

[14]  Moti Yung,et al.  Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.