A fast algorithm for computing minimum routing cost spanning trees

Computer Networks

Volumn 52, Issue 17, 2008, Pages 3229-3247

  Campos, Rui ^a   Ricardo, Manuel ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Bridging; Minimum Routing Cost Tree; Minimum Spanning Tree; Routing; Shortest Path Tree

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; COSTS; ETHERNET; LOCAL AREA NETWORKS; NETWORK PROTOCOLS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS;

BRIDGING; MINIMUM ROUTING COST TREE; MINIMUM SPANNING TREE; ROUTING; SHORTEST PATH TREE;

TREES (MATHEMATICS);

EID: 54049155640     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2008.08.013     Document Type: Article

References (30)

1. IEEE 802.11 Work Group, Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, 1999.
2. Bluetooth SIG, Personal Area Networking Profile, Version 1.0, 2003.
3. Standard ECMA-368, High Rate Ultra Wideband PHY and MAC Standard, first ed., 2005.
4. B. Brackenridge, UWB the WiMedia Way, 2007. .
5. IEEE 802.1D Work Group, IEEE Standard for Local and Metropolitan Area Networks: Media Access Control (MAC) Bridges, 2004.
6. M. Bahr, Update on the hybrid wireless mesh protocol of IEEE 802.11s, in: Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS 2007), Pisa, 2007, pp. 1-6.
7. Droms R. Dynamic host configuration protocol. IETF RFC 2131 (1997)
8. Plummer D.C. An Ethernet address resolution protocol. IETF RFC 826 (1982)
9. Mieghem P., and Langen S. Influence of the link weight structure on the shortest path. Physical Review E 71 056113 (2005) 1-13
10. Mieghem P., and Magdalena S.M. Phase transition in the link weight structure of networks. Physical Review E 72 056138 (2005) 2-7
11. Wu B.Y., and Chao K. Spanning Trees and Optimization Problems (2004), Chapman & Hall
12. B.Y. Wu et al., A polynomial time approximation scheme for minimum routing cost spanning trees, in: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1998, pp. 21-32.
13. Wong R. Worst-case analysis of network design problem heuristics. SIAM Journal of Algebraic Discrete Mathematics 1 (1980) 51-63
14. Grout V. Principles of cost minimization in wireless networks. Journal of Heuristics 11 (2005) 115-133
15. Gupta P., and Kumar P. Capacity of wireless networks. IEEE Transactions on Information Theory 46 2 (2000) 388-404
16. P. Stuedi, G. Alonso, Computing throughput capacity for realistic wireless multihop networks, in: Proceedings of the Ninth ACM International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, Terromolinos, Spain, 2006, pp. 191-198.
17. Lui K., Lee W.C., and Nahrstedt K. STAR: a transparent spanning tree bridge protocol with alternate routing. ACM SIGCOMM Computer Communication Review 32 3 (2002) 33-46
18. T.L. Rodeheffer, C.A. Thekkath, D.C. Anderson, SmartBridge: a scalable bridge architecture, in: Proceedings of ACM SIGCOMM, Stockholm, 2000, pp. 205-216.
19. R. Perlman, Rbridges: transparent routing, in: Proceedings of INFOCOM, vol. 2, Hong Kong, 2004, pp. 1211-1218.
20. F.D. Pellegrini, D. Starobinski, M.G. Karpovsky, L.B. Levitin, Scalable cycle-breaking algorithms for gigabit ethernet backbones, in: Proceedings of INFOCOM, vol. 4, Hong Kong, 2004, pp. 2175-2184.
21. N. Huang, Y. Cheng, An effective spanning tree algorithm for a bridged LAN, in: Proceedings of the International Workshop on Advanced Communication and Applications for High Speed Networks, Munich, 1992, pp. 43-49.
22. K. Elmeleegy, A.L. Cox, T.S. Eugene Ng, EtherFuse: an ethernet watchdog, in: Proceedings of ACM SIGCOMM, Kyoto, 2007, pp. 253-264.
23. Prim R. Shortest connection networks and some generalizations. Bell System Technical Journal 36 (1957) 1389-1401
24. Fredman M., and Tarjan R. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM) 34 3 (1987) 596-615
25. J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, in: Proceedings of the American Mathematical Society, vol. 7, 1956, pp. 48-50.
26. E.W. Dijkstra, A note on two problems in connexion with graphs, in: Numerische Mathematik, vol. 1, 1959, pp. 269-271.
27. Boost Graph Library (BGL). .
28. Erdos P., and Renyi A. On random graphs I. Publicationes Mathematicae Debrecen 6 (1959) 290-297
29. Rui Campos. .
30. R. Campos, M. Ricardo, Dynamic and automatic connection of personal area networks to the global internet, in: Proceedings of the 2006 International Conference on Wireless communications and mobile computing, Vancouver, 2006, pp. 581-586.