Optimal multicast loop algorithm for multimedia traffic distribution

Authors:
Yong-Jin Lee;M. Atiquzzaman
Affiliations:
Department of Technology Education, Korea National University of Education, Chungbuk, Korea;School of Computer Science, University of Oklahoma, Norman, OK
Venue:
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Year:
2005

Citing 2
Cited 1

Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

Computer Communications
Least cost multicast spanning tree algorithm for local computer network

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile 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

We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, the objective function is to minimize the total link cost. The proposed algorithm is composed of two phases: in the first phase, it generates feasible paths to satisfy the traffic capacity constraint, and finds the exact solution through matching in the second phase. In addition, we have derived several properties of the proposed algorithm. Performance evaluation shows that the proposed algorithm has good efficiency for small network with light traffic. Our proposed algorithm can be applied to find multicast loops for real-time multimedia traffic distribution.