By Topic

Approximation and Heuristic Algorithms for End-System Based Application-Layer Multicast for Voice Conferences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hwa-Chun Lin ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Hsiu-Ming Yang

This paper studies the problem of constructing application-layer multicast trees for end-system based voice conferences in which voice mixing and replication are performed at end systems. This problem is formulated as a degree-constrained node-weighted Steiner tree problem with a degree-dependent cost associated with each node, which is a generalization of the degree-constrained node-weighted Steiner tree problem with a fixed cost associated with each node. This paper devises a novel technique to deal with degree-dependent nodal costs and develops a bicriteria approximation algorithm, with the degree of each node and the cost of the tree as two objectives, for this more general Steiner tree problem. The bound on the degree of each node and the bound on the cost of the tree constructed by the bicriteria approximation algorithm are derived. Two heuristic algorithms which construct multicast trees that obey the degree constraint on each node are obtained by modifying the bicriteria approximation algorithm. The performances of the two heuristic algorithms are studied via simulations.

Published in:

Advanced Information Networking and Applications (AINA), 2011 IEEE International Conference on

Date of Conference:

22-25 March 2011