Authors
Habib Youssef, Abdulaziz Al-Mulhem, Sadiq M Sait, Muhammad Atif Tahir
Publication date
2002/7/1
Journal
Computer Communications
Volume
25
Issue
11-12
Pages
1140-1149
Publisher
Elsevier
Description
Many multimedia communication applications require a source to transmit messages to multiple destinations subject to Quality-of-Service (QoS) delay constraint. The problem to be solved is to find a minimum cost multicast tree where each source to destination path is constrained by a delay bound. This problem has been proven to be NP-complete. In this paper, we present a Tabu Search (TS) algorithm to construct a minimum cost delay bounded multicast tree. The proposed algorithm is then compared with many existing multicast algorithms. Results show that on almost all test cases, TS algorithm exhibits more intelligent search of the solution subspace and is able to find better solutions than other reported multicast algorithms.
Total citations
Scholar articles
H Youssef, A Al-Mulhem, SM Sait, MA Tahir - Computer Communications, 2002