Least Cost Multicast Spanning Tree Algorithm for Local Computer Network

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.

[1]  K. Claffy,et al.  Topology discovery by active probing , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT) Workshops.

[2]  Jean-Pierre P. Bricault,et al.  On Teleprocessing System Design Part III: An Analysis of a Request-Queued Buffer Pool , 1966, IBM Syst. J..

[3]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[4]  Yong-Jin Lee.  Minimal cost heuristic algorithm for delay constrained loop network , 2004, Comput. Syst. Sci. Eng..

[5]  Rajeev Rastogi,et al.  Physical topology discovery for large multisubnet networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  A. Kershenbaum,et al.  Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design , 1980, IEEE Trans. Commun..

[7]  P. Gács,et al.  Algorithms , 1992 .