QoS-driven multicast tree generation using tabu search. COMPUTER COMMUNICATIONS 25 (11-12): 1140-1149 Sp. Iss. SI JUL 1 2002.
|
PDF
J_Youssef_CC_July2002.pdf Download (512kB) | Preview |
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 |
| Department: | College of Computing and Mathematics > Computer Engineering |
| Depositing User: | AbdulRahman |
| Date Deposited: | 09 Mar 2008 13:16 |
| Last Modified: | 01 Nov 2019 13:23 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/273 |