Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
X. Lu and W. Zhao (Eds.): ICCNMC 2005, LNCS 3619, pp. 268 275, 2005. Springer-Verlag Berlin Heidelberg 2005
 

Summary: X. Lu and W. Zhao (Eds.): ICCNMC 2005, LNCS 3619, pp. 268 275, 2005.
Springer-Verlag Berlin Heidelberg 2005
Least Cost Multicast Spanning Tree Algorithm
for Local Computer Network
Yong-Jin Lee1 and M. Atiquzzaman2
1
Department of Computer Science, Woosong University,
17-2 Jayang-Dong, Dong-Ku, Taejon 300-718, Korea
yjlee@woosong.ac.kr
2
School of Computer Science, University of Oklahoma,
200 Felgar Street, Norman, OK 73019, USA
atiq@ou.edu
Abstract. This study deals with the topology discovery for the capacitated
minimum spanning tree network. The problem is composed of finding the best
way to link nodes to a source node and, in graph-theoretical terms, it is to
determine a minimal spanning tree with a capacity constraint. In this paper, a
heuristic algorithm with two phases is presented. Computational complexity
analysis and simulation confirm that our algorithm produces better results than
the previous other algorithms in short running time. The algorithm can be

  

Source: Atiquzzaman, Mohammed - School of Computer Science, University of Oklahoma

 

Collections: Computer Technologies and Information Sciences