A GRASP approach for the delay-constrained multicast routing problem

@inproceedings{Xu2009AGA,
  title={A GRASP approach for the delay-constrained multicast routing problem},
  author={Ying Xu and Rong Qu},
  year={2009}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 34 references

An efficient QoS dependent multicast routing algorithm

  • L. Guo, I. Matta, QDMR
  • Proceedings of the 5 IEEE RealTime Technology and…
  • 1999
Highly Influential
4 Excerpts

9th International Conference on Information Technology, pp

  • N. Ghaboosi, Haghighat A.T., A tabu search based algorithm for multicast routing constraints, In
  • 18--21
  • 2006
1 Excerpt

Proceedings international and applications, pp

  • Wang X.L., Z. Jiang, QoS multicast routing based on simulated annealing algorithm, In
  • 511--516
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…