With the rapid development of Intemet, mobile networks and high-performance networking technology, multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very import...With the rapid development of Intemet, mobile networks and high-performance networking technology, multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. It is also a challenging and hard problem to the next generation Intemet and high-performance networks, and has attracted the interests of many people. This paper discusses the multiple constrained QoS multicast routing problem, which may deal with the delay, delay jitter, bandwidth and packet loss metrics, and describes a network model for researching the routing problem. The paper mainly presents multiple constrained QoS multicast routing algorithm (MCQMRA), a QoS multicast routing policy for Intemet, mobile network or other high-performance networks, which is based on the genetic algorithm (GA) and can provide QoS-sensitive paths in a scalable and flexible wayin the network environment with uncertain parameters. The MCQMRA can also optimize the network resources such as bandwidth, delay, packet loss metrics and can converge to the optimal or near-optimal solution within few iterations, even for the network environment with uncertain parameters. Simulation results show that MCQMRA is an available approach to QoS multicast routing decision.展开更多
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 sy...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.展开更多
文摘With the rapid development of Intemet, mobile networks and high-performance networking technology, multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. It is also a challenging and hard problem to the next generation Intemet and high-performance networks, and has attracted the interests of many people. This paper discusses the multiple constrained QoS multicast routing problem, which may deal with the delay, delay jitter, bandwidth and packet loss metrics, and describes a network model for researching the routing problem. The paper mainly presents multiple constrained QoS multicast routing algorithm (MCQMRA), a QoS multicast routing policy for Intemet, mobile network or other high-performance networks, which is based on the genetic algorithm (GA) and can provide QoS-sensitive paths in a scalable and flexible wayin the network environment with uncertain parameters. The MCQMRA can also optimize the network resources such as bandwidth, delay, packet loss metrics and can converge to the optimal or near-optimal solution within few iterations, even for the network environment with uncertain parameters. Simulation results show that MCQMRA is an available approach to QoS multicast routing decision.
文摘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.
