loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Conference on Tools with Artificial Intelligence - Vol.1 (ICTAI 2007)
A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem
Paris, France
October 29-October 31
ISBN: 0-7695-3015-X
ASCII Text
x 
 
Nejla Ghaboosi, Abolfazl Toroghi Haghighat, "A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem," Tools with Artificial Intelligence, IEEE International Conference on, vol. 1, pp. 383-390, 19th IEEE International Conference on Tools with Artificial Intelligence - Vol.1 (ICTAI 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ICTAI.2007.17,
author = {Nejla Ghaboosi and Abolfazl Toroghi Haghighat},
title = {A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem},
journal ={Tools with Artificial Intelligence, IEEE International Conference on},
volume = {1},
year = {2007},
issn = {1082-3409},
pages = {383-390},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICTAI.2007.17},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Tools with Artificial Intelligence, IEEE International Conference on
TI - A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem
SN - 1082-3409
SP383
EP390
A1 - Nejla Ghaboosi,
A1 - Abolfazl Toroghi Haghighat,
PY - 2007
VL - 1
JA - Tools with Artificial Intelligence, IEEE International Conference on
ER -
 
Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The NP-complete Steiner tree problem is a fundamental component of many real world telecommunication applications and is a critical structure underlying multicast communications. This paper describes a novel path relinking algorithm for the delay- constrained least-cost multicast routing problem. Computational results on various random generated networks indicate that our proposed path relinking algorithm results in the best overall performance with regard to total tree cost in comparison with other existing algorithms and heuristics. Keywords: Path relinking, Multicast routing, Quality of Service, Constrained Steiner tree
Citation:
Nejla Ghaboosi, Abolfazl Toroghi Haghighat, "A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem," ictai, vol. 1, pp.383-390, 19th IEEE International Conference on Tools with Artificial Intelligence - Vol.1 (ICTAI 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.