Multiple constraints-based QoS multicast routing: model and algorithms

作     者：SunBaolin LiLayuan 

作者机构：DepartmentofComputerScienceandTechnologyWuhanUniversityofTechnologyWuhan430063P.R.China//DepartmentofMathematicsandPhysicsWuhanUnivereityofScienceandEngineeringWuhan430073P.R.China DepartmentofComputerScienceandTechnologyWuhanUniversityofTechnologyWuhan430063P.R.China 

出 版 物：《Journal of Systems Engineering and Electronics》 (系统工程与电子技术（英文版）)

年 卷 期：2005年第16卷第1期

页      面：187-193页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 0802[工学-机械工程] 081001[工学-通信与信息系统] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：ThisprojectwassupportedbytheNationalNaturalScienceFoundationofChina(60172035,90304018) NSFofHubeiProvince(2004ABA014) KeyScientificProjectofWuhanCity(20041001001)andKeyScientificResearchProjectofHubeiEducationDepartment(2003A002) 

主　　题：multicast routing algorithm multiple constraints QoS routing NP-complete. 

摘      要：Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not 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.