KFUPM ePrints

QoS-driven multicast tree generation using tabu search

Youssef, H. and Al-Mulhem, Abdulaziz and Sait, Sadiq M. and TAHIR, MUHAMMAD ATIF QoS-driven multicast tree generation using tabu search. COMPUTER COMMUNICATIONS 25 (11-12): 1140-1149 Sp. Iss. SI JUL 1 2002.

[img]
Preview
PDF
500Kb

Abstract

��������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 treee where each source to destination path is contrained by a delay bound. This problem to be solved is to find a minimum cost multicast treee 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 multiacst 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.



Item Type:Article
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Youssef, H. and Al-Mulhem, Abdulaziz and Sait, Sadiq M. and TAHIR, MUHAMMAD ATIF
Email:youssef@kfupm.edu.sa, UNSPECIFIED, sadiq@kfupm.edu.sa, UNSPECIFIED
ID Code:273
Deposited By:AbdulRahman
Deposited On:09 Mar 2008 16:16
Last Modified:12 Apr 2011 13:08

Repository Staff Only: item control page