Translator Disclaimer
Paper
24 June 2005 Multiple constraints-based QoS multicast routing: model and algorithms
Author Affiliations +
Proceedings Volume 5960, Visual Communications and Image Processing 2005; 596007 (2005) https://doi.org/10.1117/12.631415
Event: Visual Communications and Image Processing 2005, 2005, Beijing, China
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hua Chen and Baolin Sun "Multiple constraints-based QoS multicast routing: model and algorithms", Proc. SPIE 5960, Visual Communications and Image Processing 2005, 596007 (24 June 2005); https://doi.org/10.1117/12.631415
PROCEEDINGS
6 PAGES


SHARE
Advertisement
Advertisement
Back to Top