A fast algorithm for computing minimum routing cost spanning trees

• Type: Article in International Scientific Journal
• Date: 2008

Authors

Rui Campos (Author) Other; Manuel Ricardo (Author) FEUP

Journal

Title: Computer Networks

Vol. 52 No. 17

Pages: 3229-3247

ISSN: 1389-1286

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 22 Citations

Scopus - 26 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

CORDIS: Technological sciences > Engineering > Communication engineering > Telecommunications engineering

Other information

Authenticus ID: P-003-T9A

DOI: 10.1016/j.comnet.2008.08.013

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 19