In recent years, QoS multicast routing has continued to be a very important research topic in the areas of networks. This paper presents a heuristic algorithm for the QoS multicast routing (HAQMR). This heuristic algo...In recent years, QoS multicast routing has continued to be a very important research topic in the areas of networks. This paper presents a heuristic algorithm for the QoS multicast routing (HAQMR). This heuristic algorithm deals with delay and bandwidth constraints and has low cost. The HAQMR attempts to significantly reduce the overhead for constructing a multicast tree, the proof for correctness of the HAQMR is given, and the performance of the HAQMR is evaluated by simulations. The study shows that HAQMR provides an available approach to QoS multicast routing.展开更多
The application environments of wireless Ad hoc networks require that it should support Quality of Service (QoS). However, that is very difficult because of the inherent characteristics of the wireless channel and the...The application environments of wireless Ad hoc networks require that it should support Quality of Service (QoS). However, that is very difficult because of the inherent characteristics of the wireless channel and the frequent changes of network topology caused by nodes movement. An Ad hoc QoS Multicasting (AQM) protocol can solve this problem by previously reserving the neighbor nodes for tracking resource availability. By considering QoS restrictions of transport delay, loss ratio, bandwidth requirement, delay jitter, and throughout, and by finding the adaptive routing, the AQM protocol can obviously improve the efficiency of multicastsession. The results of network simulation show that QoS is essentially applicable to Ad hoc networks.展开更多
The multicast routing problem with multiple QoS constraints in networks with uncertain parameters is discussed, and a network model that is suitable to research such QoS multicast routing problem is described. The QMR...The multicast routing problem with multiple QoS constraints in networks with uncertain parameters is discussed, and a network model that is suitable to research such QoS multicast routing problem is described. The QMRGA, a multicast routing policy for Internet, mobile network or other highperformance networks is mainly presented, which is based on the genetic algorithm(GA), and can provide QoSsensitive paths in a scalable and flexible way in the network environment with uncertain parameters. The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or nearoptimal solution within few iterations, even for the network environment with uncertain parameters. The incremental rate of computational cost can be close to a polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated by using simulations. The results show that QMRGA provides an available approach to QoS multicast routing in network environment with uncertain parameters.展开更多
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.展开更多
Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology ch...Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.展开更多
Most of the multimedia applications require strict Quality-of-Service (QoS) guarantee during the communication between a single source and multiple destinations. The paper mainly presents a QoS Multicast Routing algor...Most of the multimedia applications require strict Quality-of-Service (QoS) guarantee during the communication between a single source and multiple destinations. The paper mainly presents a QoS Multicast Routing algorithms based on Genetic Algorithm (QMRGA). Simulation results demonstrate that the algorithm is capable of discovering a set of QoS-based near optimized, non-dominated multicast routes within a few iterations, even for the networks environment with uncertain parameters.展开更多
A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicas...A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicast routing. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributed routing operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.展开更多
A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay an...A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth展开更多
为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,...为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,计算路径代价,将路径代价最小作为优化目标,建立QoS组播路由优化模型,并设置相关约束条件;最后,结合遗传算法和蚁群算法提出一种遗传-蚁群优化算法求解上述模型,输出最优路径,完成路由优化。实验结果表明,所提算法可有效降低路径长度与路径代价,提高搜索效率与路由请求成功率,优化后的路由时延抖动较小。展开更多
A wireless MANET is a self-configurable network in which mobile, battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support. It offers un...A wireless MANET is a self-configurable network in which mobile, battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support. It offers unique benefits for certain environments, but there are still several open issues to be resolved before realizing these benefits, including QoS routing, multicasting, and mobility management. Specifically, an efficient QoS multicast routing protocol is needed, This paper presents a hierarchical QoS multicast routing protocol （QMRP） for mobile ad hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed QMRP scheme, each local node only needs to maintain local multicast routing information and/or summary information of other clusters （or domains） but does not require any global ad hoc network states to be maintained. The QMRP also allows any ad hoc group member to join/leave the multicast group dynamically and supports multiple QoS constraints. This paper presents formal description and main procedures for realizing routing decision process of the QMRP and the proof of correctness and complexity analysis of the protocol. The performance measures of QMRP are evaluated using simulation. The simulation results verify the efficiency and availability of QMRP.展开更多
Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimiza...Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimization problem, a common solution to such problem is to merge the paths into a tree after finding paths from the source node to each destination node. This method maybe obtains the better result, but it can consume a lot of computational time. To solve the problem, a tree-based DE algorithm is introduced in this paper. The central operations of the algorithm are realized with tree structure. This method saves the time of finding paths and integrating them to construct a multicast tree. The experiments show that the proposed algorithm can achieve higher success rate than several common algorithms with much smaller running time for different networks.展开更多
基金National Natural Science Foundation of China(60172035)Natural Science Foundation of Hubei Province(2000J154)
文摘In recent years, QoS multicast routing has continued to be a very important research topic in the areas of networks. This paper presents a heuristic algorithm for the QoS multicast routing (HAQMR). This heuristic algorithm deals with delay and bandwidth constraints and has low cost. The HAQMR attempts to significantly reduce the overhead for constructing a multicast tree, the proof for correctness of the HAQMR is given, and the performance of the HAQMR is evaluated by simulations. The study shows that HAQMR provides an available approach to QoS multicast routing.
文摘The application environments of wireless Ad hoc networks require that it should support Quality of Service (QoS). However, that is very difficult because of the inherent characteristics of the wireless channel and the frequent changes of network topology caused by nodes movement. An Ad hoc QoS Multicasting (AQM) protocol can solve this problem by previously reserving the neighbor nodes for tracking resource availability. By considering QoS restrictions of transport delay, loss ratio, bandwidth requirement, delay jitter, and throughout, and by finding the adaptive routing, the AQM protocol can obviously improve the efficiency of multicastsession. The results of network simulation show that QoS is essentially applicable to Ad hoc networks.
文摘The multicast routing problem with multiple QoS constraints in networks with uncertain parameters is discussed, and a network model that is suitable to research such QoS multicast routing problem is described. The QMRGA, a multicast routing policy for Internet, mobile network or other highperformance networks is mainly presented, which is based on the genetic algorithm(GA), and can provide QoSsensitive paths in a scalable and flexible way in the network environment with uncertain parameters. The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or nearoptimal solution within few iterations, even for the network environment with uncertain parameters. The incremental rate of computational cost can be close to a polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated by using simulations. The results show that QMRGA provides an available approach to QoS multicast routing in network environment with uncertain parameters.
文摘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.
基金This project was supported by the National Natural Science Foundation of China (60172035 ,90304018) NSF of HubeiProvince (2004ABA014) and Teaching Research Project of Higher Educational Institutions of Hubei Province (20040231)
文摘Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.
基金Supported by the National Natural Science Foundation of China (No.90304018)Natural Science Foundation of Hubei Province (No.2004ABA014)Teaching Research Project of Higher Educational Institutions of Hubei Province (No.20040231).
文摘Most of the multimedia applications require strict Quality-of-Service (QoS) guarantee during the communication between a single source and multiple destinations. The paper mainly presents a QoS Multicast Routing algorithms based on Genetic Algorithm (QMRGA). Simulation results demonstrate that the algorithm is capable of discovering a set of QoS-based near optimized, non-dominated multicast routes within a few iterations, even for the networks environment with uncertain parameters.
文摘A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicast routing. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributed routing operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.
基金This project was supported by the National Natural Science Foundation of China (90304018)and the Natural ScienceFoundation of Hubei Province of China (2004ABA023)
文摘A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth
文摘为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,计算路径代价,将路径代价最小作为优化目标,建立QoS组播路由优化模型,并设置相关约束条件;最后,结合遗传算法和蚁群算法提出一种遗传-蚁群优化算法求解上述模型,输出最优路径,完成路由优化。实验结果表明,所提算法可有效降低路径长度与路径代价,提高搜索效率与路由请求成功率,优化后的路由时延抖动较小。
基金Supported by the National Natural Science Foundation of China(Grant Nos.60672137,60773211 and 60402028)the Specialized Research Fund for the Doctoral Program of Higher Education of China(Grant No.20060497015)the Key Project of Hubei Province(Grant No.2007AA101C63)
文摘A wireless MANET is a self-configurable network in which mobile, battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support. It offers unique benefits for certain environments, but there are still several open issues to be resolved before realizing these benefits, including QoS routing, multicasting, and mobility management. Specifically, an efficient QoS multicast routing protocol is needed, This paper presents a hierarchical QoS multicast routing protocol （QMRP） for mobile ad hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed QMRP scheme, each local node only needs to maintain local multicast routing information and/or summary information of other clusters （or domains） but does not require any global ad hoc network states to be maintained. The QMRP also allows any ad hoc group member to join/leave the multicast group dynamically and supports multiple QoS constraints. This paper presents formal description and main procedures for realizing routing decision process of the QMRP and the proof of correctness and complexity analysis of the protocol. The performance measures of QMRP are evaluated using simulation. The simulation results verify the efficiency and availability of QMRP.
基金supported by the National Natural Science Foundation of China (60774088)the Hi-Tech Research and Development Program of China (2009AA04Z132)the Specialized Research Foundation for the Doctoral Program of National Education Ministry (20090031110029)
文摘Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimization problem, a common solution to such problem is to merge the paths into a tree after finding paths from the source node to each destination node. This method maybe obtains the better result, but it can consume a lot of computational time. To solve the problem, a tree-based DE algorithm is introduced in this paper. The central operations of the algorithm are realized with tree structure. This method saves the time of finding paths and integrating them to construct a multicast tree. The experiments show that the proposed algorithm can achieve higher success rate than several common algorithms with much smaller running time for different networks.
