loading...
A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints
Bhubaneswar, India December 18-December 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIT.2006.229th International Conference on Infor ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nejla Ghaboosi, Islamic Azad University, Tehran-South Unit, Tehran, Iran
Abolfazl T. Haghighat, Islamic Azad University, Qazvin Unit, Qazvin, Iran
The advent of various real-time multimedia applications in high-speed networks prompt the necessity of quality of service (QoS) based multicast routing and the constrained Steiner tree as the mathematical structure behind it which is a wellknown NP-complete problem. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. In this paper, an algorithm is proposed to solve the bandwidth-delayconstrained least-cost multicast routing problem based on Tabu Search (TS). Computational results for various random generated networks show that the proposed algorithm outperforms other existing TS-based algorithms and heuristics.
Index Terms:
Multicast routing, Quality of Service, Tabu Search, Constrained Steiner tree
Citation:
Nejla Ghaboosi, Abolfazl T. Haghighat, "A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints," icit, pp.33-39, 9th International Conference on Information Technology (ICIT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.