Efficient implementations of a delay-constrained least-cost multicast algorithm
Article
Feng, G, Makki, K, Pissinou, N. (2002). Efficient implementations of a delay-constrained least-cost multicast algorithm
. JOURNAL OF COMMUNICATIONS AND NETWORKS, 4(3), 246-255. 10.1109/JCN.2002.6596917
Feng, G, Makki, K, Pissinou, N. (2002). Efficient implementations of a delay-constrained least-cost multicast algorithm
. JOURNAL OF COMMUNICATIONS AND NETWORKS, 4(3), 246-255. 10.1109/JCN.2002.6596917
Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimum-delay tree, and then iteratively uses a k-shortest-path (KSP) algorithm to search for a better path to replace a "superedge" in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.
