Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A polynomial time approximation scheme for minimum routing cost spanning trees
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SmartBridge: a scalable bridge architecture
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
STAR: a transparent spanning tree bridge protocol with alternate routing
ACM SIGCOMM Computer Communication Review
Dynamic and automatic connection of personal area networks to the global internet
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Computing throughput capacity for realistic wireless multihop networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Etherfuse: an ethernet watchdog
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Self Organized Dynamic Tree Neural Network
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
An approach of ant algorithm for solving minimum routing cost spanning tree problem
Proceedings of the Second Symposium on Information and Communication Technology
Enhanced self organized dynamic tree neural network
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Efficient content-based routing with network topology inference
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.01 |
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.