Design and performance of convergence routing on multiple spanning trees

This paper presents a new design, and a performance study for convergence routing in a general network with multiple spanning trees suggested as a switch-based LAN. In particular, a new algorithm for constructing two edge-disjoint spanning trees of a given network is presented, and the resulting trees are used for convergence routing (a variant of deflection routing with destination convergence guaranteed). It is shown empirically that convergence routing on two edge-disjoint spanning trees yields a better bound than a single spanning tree, on the maximum route length. The construction of the two edge-disjoint spanning trees is done with specific strategies for achieving certain tree properties that improve the system's performance.

[1]  Stephen M. Chase,et al.  An implemented graph algorithm for winning Shannon Switching Games , 1972, CACM.

[2]  Moti Yung,et al.  The integrated MetaNet architecture: a switch-based multimedia LAN for parallel computing and real-time traffic , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[3]  Yoram Ofek,et al.  MetaRing-a full-duplex ring with fairness and spatial reuse , 1993, IEEE Trans. Commun..

[4]  W. D. Farmer,et al.  An experimental distributed switching system to handle bursty computer traffic , 1969, Symposium on Problems in the Optimization of Data Communications Systems.

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

[6]  Tiko Kameda,et al.  Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) , 1973, SWAT.

[7]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[8]  Yoram Ofek,et al.  A Local Fairness Algorithm for Gigabit LAN's/MAN's with Spatial Reuse , 1993, IEEE J. Sel. Areas Commun..

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

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

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

[12]  Moti Yung,et al.  Configuration and performance issues in the MetaNet design , 1993, 1993 18th Conference on Local Computer Networks.

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

[14]  Yoram Ofek,et al.  Overview of the MetaRing Architecture , 1994, Comput. Networks ISDN Syst..

[15]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[17]  E. E. Newhall,et al.  An experimental distributed switching system to handle bursty computer traffic , 1969, Symposium on Problems in the Optimization of Data Communications Systems.

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

[19]  Y. Kajitani,et al.  Maximally Distant Trees and Principal Partition of a Linear Graph , 1969 .

[20]  H. Watanabe,et al.  Topological degrees of freedom and mixed analysis of electrical networks , 1970 .

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