Least Cost Multicast Spanning Tree Algorithm for Local Computer Network | Zendy

Yongjin Lee | Zendy; Mohammed Atiquzzaman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Least Cost Multicast Spanning Tree Algorithm for Local Computer Network

Author(s) -

Yongjin Lee,

Mohammed Atiquzzaman

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-28102-9

DOI - 10.1007/11534310_30

Subject(s) - multicast , computer science , spanning tree , distributed minimum spanning tree , minimum spanning tree , steiner tree problem , tree (set theory) , prim's algorithm , heuristic , network topology , node (physics) , reverse delete algorithm , algorithm , graph , kruskal's algorithm , theoretical computer science , mathematical optimization , distributed computing , computer network , mathematics , discrete mathematics , combinatorics , artificial intelligence , structural engineering , engineering

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research