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.展开更多
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.展开更多
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.展开更多
The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The ...The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.展开更多
Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a ...Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a stable quality-of-service(QoS) multicast model for MANETs. The new model ensures the duration time of a link in a multicast tree is always longer than the delay time from the source node. A novel GA is designed to solve our QoS multicast model by introducing a new crossover mechanism called leaf crossover(LC), which outperforms the existing crossover mechanisms in requiring neither global network link information, additional encoding/decoding nor repair procedures. Experimental results confirm the effectiveness of the proposed model and the efficiency of the involved GA. Specifically, the simulation study indicates that our algorithm can obtain a better QoS route with a considerable reduction of execution time as compared with existing GAs.展开更多
An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although ...An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.展开更多
To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Geneti...To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Genetic Algorithm (CGA). The algorithm creates an initial population of service compositions based on the chaos theory,and then processes individuals which violate constraints in the initial population using repair strategies. Next,a new fitness function is designed to gradually eliminate the infeasible compositions generated in evolution. Finally,the algorithm makes minor chaotic disturbances on the evolved group to accelerate convergence and avoid local optimum. Experimental results demonstrate the effectiveness of the proposed algorithm.展开更多
In wireless mesh networks （WMNs）, gateway placement is the key to network performance, QoS and construction cost. This paper focuses on the optimization of the cost and load balance in the gateway placement strategy...In wireless mesh networks （WMNs）, gateway placement is the key to network performance, QoS and construction cost. This paper focuses on the optimization of the cost and load balance in the gateway placement strategy, ensuring the QoS requirements. Firstly, we define a metric for load balance on the gateways, and address the minimum cost and load balancing gateway placement problem. Secondly, we propose two algorithms for gateway placement. One is a heuristic algorithm, which is sensitive to the cost, selects the gateway candidates according to the capacity/cost ratio of the nodes, and optimizes the load balance on the gateways through scanning and shifting methods. The other is a genetic algorithm, which can find the global optimal solution. The two algorithms differ in their computing complexity and the quality of the generated solutions, and thus provide a trade-off for WMN design. At last, simulation is done, and experimental results show that the two algorithms outperform the others. Compared with OPEN/CLOSE, the average cost of gateway placement generated by our algorithms is decreased by 8%~32%, and the load variance on the gateways decreased by 77%-86%. For the genetic algorithm, the performance improvement is at the price of the increase of the CPU execution time.展开更多
In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicas...In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.展开更多
In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not sa...In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.展开更多
In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling pro...In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle type.First,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion time.Second,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle constraints.Third,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.展开更多
This paper focuses on solving the delay constrained least cost routing problem, and propose a simple, distributed heuristic solution, called distributed recursive delay constrained least cost (DR DCLC) unicast routing...This paper focuses on solving the delay constrained least cost routing problem, and propose a simple, distributed heuristic solution, called distributed recursive delay constrained least cost (DR DCLC) unicast routing algorithm. DR DCLC only requires local information to find the near optimal solution. The correctness of DR DCLC is proued by showing that it is always capable of constructing a loop free delay constrained path within finite time, if such a path exists. Simulation is also used to compare DR DCLC to the optimal DCLC algorithm and other algorithms.展开更多
为提升云环境下数据工作流的任务调度与处理效率,提出基于服务质量(quality of service,QoS)性能约束的任务调度算法,建立面向用户数据处理任务的QoS目标约束条件、云计算资源调度模型,将密集型工作流的多QoS目标约束问题转化为单目标...为提升云环境下数据工作流的任务调度与处理效率,提出基于服务质量(quality of service,QoS)性能约束的任务调度算法,建立面向用户数据处理任务的QoS目标约束条件、云计算资源调度模型,将密集型工作流的多QoS目标约束问题转化为单目标约束问题求解,并在CloudSim云计算模拟器中进行数据处理任务调度的仿真。仿真实验结果表明,通过在数据库可用性组(database availability group,DAG)随机产生实例、引入自适应种群迭代算法进行工作流数据的任务调度分配,可实现不同类型数据资源的最优配置,并降低数据处理与利用成本。展开更多
文摘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.
基金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.
文摘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.
基金Acknowledgements： This work is supported by National Natural Science Foundation of China （No. 60172035, 90304018）, NSF of Hubei Province （No. 2004ABA014）, and Teaching Research Project of Higher Educational Institutions of Hubei Province （No. 20040231）.
文摘The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.
基金supported in part by Supported by the National Natural Science Foundation of China (Grant No. 61370227)Research Foundation of Education Bureau of Hunan Province, China (Grant No. 17A070)
文摘Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a stable quality-of-service(QoS) multicast model for MANETs. The new model ensures the duration time of a link in a multicast tree is always longer than the delay time from the source node. A novel GA is designed to solve our QoS multicast model by introducing a new crossover mechanism called leaf crossover(LC), which outperforms the existing crossover mechanisms in requiring neither global network link information, additional encoding/decoding nor repair procedures. Experimental results confirm the effectiveness of the proposed model and the efficiency of the involved GA. Specifically, the simulation study indicates that our algorithm can obtain a better QoS route with a considerable reduction of execution time as compared with existing GAs.
文摘An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.
基金National Natural Science Fund of China(61672022,61272036)Graduate Innovation Program of Shanghai Polytechnic University(A01GY17F022)Key Discipline of Shanghai Polytechnic University(XXKZD1604)
文摘To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Genetic Algorithm (CGA). The algorithm creates an initial population of service compositions based on the chaos theory,and then processes individuals which violate constraints in the initial population using repair strategies. Next,a new fitness function is designed to gradually eliminate the infeasible compositions generated in evolution. Finally,the algorithm makes minor chaotic disturbances on the evolved group to accelerate convergence and avoid local optimum. Experimental results demonstrate the effectiveness of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China under Grant Nos.60773012 and 60873082
文摘In wireless mesh networks （WMNs）, gateway placement is the key to network performance, QoS and construction cost. This paper focuses on the optimization of the cost and load balance in the gateway placement strategy, ensuring the QoS requirements. Firstly, we define a metric for load balance on the gateways, and address the minimum cost and load balancing gateway placement problem. Secondly, we propose two algorithms for gateway placement. One is a heuristic algorithm, which is sensitive to the cost, selects the gateway candidates according to the capacity/cost ratio of the nodes, and optimizes the load balance on the gateways through scanning and shifting methods. The other is a genetic algorithm, which can find the global optimal solution. The two algorithms differ in their computing complexity and the quality of the generated solutions, and thus provide a trade-off for WMN design. At last, simulation is done, and experimental results show that the two algorithms outperform the others. Compared with OPEN/CLOSE, the average cost of gateway placement generated by our algorithms is decreased by 8%~32%, and the load variance on the gateways decreased by 77%-86%. For the genetic algorithm, the performance improvement is at the price of the increase of the CPU execution time.
文摘In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.
文摘In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.
基金Supported by the National High Technology Research and Development Programme of China(No.2009AA043000)the National Natural Science Foundation of China(No.61273035,71471135)
文摘In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle type.First,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion time.Second,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle constraints.Third,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.
文摘This paper focuses on solving the delay constrained least cost routing problem, and propose a simple, distributed heuristic solution, called distributed recursive delay constrained least cost (DR DCLC) unicast routing algorithm. DR DCLC only requires local information to find the near optimal solution. The correctness of DR DCLC is proued by showing that it is always capable of constructing a loop free delay constrained path within finite time, if such a path exists. Simulation is also used to compare DR DCLC to the optimal DCLC algorithm and other algorithms.
文摘为提升云环境下数据工作流的任务调度与处理效率,提出基于服务质量(quality of service,QoS)性能约束的任务调度算法,建立面向用户数据处理任务的QoS目标约束条件、云计算资源调度模型,将密集型工作流的多QoS目标约束问题转化为单目标约束问题求解,并在CloudSim云计算模拟器中进行数据处理任务调度的仿真。仿真实验结果表明,通过在数据库可用性组(database availability group,DAG)随机产生实例、引入自适应种群迭代算法进行工作流数据的任务调度分配,可实现不同类型数据资源的最优配置,并降低数据处理与利用成本。
