Efficient Algorithms for the Multicast Trees under the Packet-Replication Restrictions

Sung-Jin CHUNG  Sung-Pil HONG  Hoo-Sang CHUNG  

IEICE TRANSACTIONS on Communications   Vol.E84-B   No.9   pp.2670-2680
Publication Date: 2001/09/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
multicasting,  degree-constrained Steiner tree,  tree reconfiguration,  logical link,  relaxation algorithm,  

Full Text: PDF>>
Buy this Article

In this paper, we are concerned in obtaining multicast trees in packet-switched networks such as ATM nets, when there exist constraints on the packet (cell)-replication capabilities of the individual switching nodes. This problem can be formulated as the Steiner tree problem with degree bounds on the nodes, so we call it the Degree-Constrained Steiner Tree problem (DCST). Four heuristic algorithms are proposed: the first is a combined version of two well-known Steiner tree algorithms, heuristic Naive and the shortest path heuristic (SPH), and the second is a relaxation algorithm based on a mathematical formulation of the DCST, and the last two use a tree reconfiguration scheme based on the concept of 'logical link. ' We experimentally compare our algorithms with the previous ones in three respects; number of solved instances, objective value or tree cost, and computation time. The experimental results show that there are few instances unsolved by our algorithms, and the objective values are mostly within 5% of optimal. Computation times are also acceptable.