Citation
A GRASP approach for the delay-constrained multicast routing problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 93-104, 2009.
Paper
Abstract
The rapid development of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained minimum Steiner tree problem in graphs as the underpinning mathematical model is a wellknown NP-complete problem. In this paper we investigate a GRASP (Greedy Randomized Adaptive Search Procedure) approach with VNS (Variable Neighborhood Search) as the local search strategy for the Delay-Constrained Least-Cost (DCLC) multicast routing problems. A large number of simulations carried out on the benchmark problems in the OR-library and a group of randomly generated graphs demonstrate that the proposed GRASP algorithm with VNS is highly efficient in solving the DCLC multicast routing problem. It outperforms other existing algorithms and heuristics in the literature.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2009-093-104-P, author = {Y. Xu and R. Qu},
title = {A GRASP approach for the delay-constrained multicast routing problem},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {93--104},
note = {Paper},
abstract = {The rapid development of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained minimum Steiner tree problem in graphs as the underpinning mathematical model is a wellknown NP-complete problem. In this paper we investigate a GRASP (Greedy Randomized Adaptive Search Procedure) approach with VNS (Variable Neighborhood Search) as the local search strategy for the Delay-Constrained Least-Cost (DCLC) multicast routing problems. A large number of simulations carried out on the benchmark problems in the OR-library and a group of randomly generated graphs demonstrate that the proposed GRASP algorithm with VNS is highly efficient in solving the DCLC multicast routing problem. It outperforms other existing algorithms and heuristics in the literature.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-093-104-P.pdf} }