Share Email Print

Proceedings Paper

Multiple constraints-based QoS multicast routing: model and algorithms
Author(s): Hua Chen; Baolin Sun
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Providing quality of service (QoS) guarantees in packet networks gives rise to several challenging issues. In general, multi-constrained path selection with or without optimization, is a NP-complete problem that cannot be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS Multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.

Paper Details

Date Published: 24 June 2005
PDF: 6 pages
Proc. SPIE 5960, Visual Communications and Image Processing 2005, 596007 (24 June 2005); doi: 10.1117/12.631415
Show Author Affiliations
Hua Chen, Wuhan Univ. of Science and Engineering (China)
Baolin Sun, Wuhan Univ. of Science and Engineering (China)

Published in SPIE Proceedings Vol. 5960:
Visual Communications and Image Processing 2005
Shipeng Li; Fernando Pereira; Heung-Yeung Shum; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top