An Approximation Algorithm for Constructing Multicast Trees with Degree-Dependent Node Costs

This paper studies the problem of constructing a minimum-cost multicast tree (or Seiner tree) in which each node is associated with a cost that is dependent on the degree of the node on the multicast tree. The cost of a node may depend on its degree on the multicast tree due to a number of reasons....

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE Global Telecommunications Conference GLOBECOM 2010 pp. 1 - 5
Main Authors Hwa-Chun Lin, Hsiu-Ming Yang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Approximation algorithms
Approximation methods
IEEE Communications Society
Joining processes
Leg
Peer to peer computing
Steiner trees
Online AccessGet full text

Cover

More Information
Summary:This paper studies the problem of constructing a minimum-cost multicast tree (or Seiner tree) in which each node is associated with a cost that is dependent on the degree of the node on the multicast tree. The cost of a node may depend on its degree on the multicast tree due to a number of reasons. For example, a node may need to perform various processing for sending messages to each of its neighbors on the multicast tree. Thus, the overhead for processing the messages increases as the number of neighbors increases. This paper devises a novel technique to deal with the degree-dependent node costs and applies the technique to develop an approximation algorithm for the problem. The bound on the cost of the multicast tree constructed by the proposed approximation algorithm is derived.
ISBN:1424456363
9781424456369
ISSN:1930-529X
2576-764X
DOI:10.1109/GLOCOM.2010.5683842