Efficient algorithms for the multicast trees under the packet-replication restrictions
- Authors
- Chung, SJ; Hong, SP; Chung, HS
- Issue Date
- Sep-2001
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- multicasting; degree-constrained steiner tree; tree reconfiguration; logical link; relaxation algorithm
- Citation
- IEICE TRANSACTIONS ON COMMUNICATIONS, v.E84-B, no.9, pp 2670 - 2680
- Pages
- 11
- Journal Title
- IEICE TRANSACTIONS ON COMMUNICATIONS
- Volume
- E84-B
- Number
- 9
- Start Page
- 2670
- End Page
- 2680
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/66200
- ISSN
- 0916-8516
1745-1345
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/66200)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.