Least cost multicast spanning tree algorithm for local computer network

Authors:
Yong-Jin Lee;M. Atiquzzaman
Affiliations:
Department of Computer Science, Woosong University, Taejon, Korea;School of Computer Science, University of Oklahoma, Norman, OK
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 2
Cited 2

Topology Discovery by Active Probing

SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
On teleprocessing system design: part II a method for approximating the optimal network

IBM Systems Journal

Optimal multicast loop algorithm for multimedia traffic distribution

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Multimedia traffic distribution using capacitated multicast tree

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

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 applied to find the least cost multicast trees in the local computer network.