A fast algorithm for computing minimum routing cost spanning trees

Communication networks have been developed based on two networking approaches: bridging and routing. The convergence to an all-Ethernet paradigm in Personal and Local Area Networks and the increasing heterogeneity found in these networks emphasizes the current and future applicability of bridging. When bridging is used, a single active spanning tree needs to be defined. A Minimum Routing Cost Tree is known to be the optimal spanning tree if the probability of communication between any pair of network nodes is the same. Given that its computation is a NP-hard problem, approximation algorithms have been proposed. We propose a new approximation Minimum Routing Cost Tree algorithm. Our algorithm has time complexity lower than the fastest known approximation algorithm and provides a spanning tree with the same routing cost in practice. In addition, it represents a better solution than the current spanning tree algorithm used in bridged networks.

[1]  Chuan Yi Tang,et al.  A polynomial time approximation scheme for minimum routing cost spanning trees , 1998, SODA '98.

[2]  Francesco De Pellegrini,et al.  Scalable cycle-breaking algorithms for gigabit Ethernet backbones , 2004, IEEE INFOCOM 2004.

[3]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[4]  Klara Nahrstedt,et al.  STAR: a transparent spanning tree bridge protocol with alternate routing , 2002, CCRV.

[5]  Chandramohan A. Thekkath,et al.  SmartBridge: a scalable bridge architecture , 2000, SIGCOMM.

[6]  Alan L. Cox,et al.  Etherfuse: an ethernet watchdog , 2007, SIGCOMM '07.

[7]  Richard T. Wong,et al.  Worst-Case Analysis of Network Design Problem Heuristics , 1980, SIAM J. Algebraic Discret. Methods.

[8]  Nen-Fu Huang,et al.  An Effective Spanning Tree Algorithm for a Bridged LAN , 1992, [1992] Proceedings International Workshop on Advanced Communications and Applications for High Speed Networks.

[9]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[12]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[13]  Ralph E. Droms,et al.  Dynamic Host Configuration Protocol , 1993, RFC.

[14]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[15]  Michael Bahr,et al.  Update on the Hybrid Wireless Mesh Protocol of IEEE 802.11s , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[16]  Piet Van Mieghem,et al.  Phase transition in the link weight structure of networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Gustavo Alonso,et al.  Computing throughput capacity for realistic wireless multihop networks , 2006, MSWiM '06.

[18]  David C. Plummer,et al.  Ethernet Address Resolution Protocol: Or Converting Network Protocol Addresses to 48.bit Ethernet Address for Transmission on Ethernet Hardware , 1982, RFC.

[19]  Radia J. Perlman,et al.  Rbridges: transparent routing , 2004, IEEE INFOCOM 2004.

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[21]  G. Zocchi,et al.  Local cooperativity mechanism in the DNA melting transition. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Manuel Ricardo,et al.  Dynamic and automatic connection of personal area networks to the global internet , 2006, IWCMC '06.

[23]  Vic Grout,et al.  Principles of Cost Minimisation in Wireless Networks , 2005, J. Heuristics.