Improving NSGA-II for Multi-Constrained QoS Routing

Author(s):  
Xin Liu ◽  
Jingyuan Zhao ◽  
Lin Zheng ◽  
Liying Li ◽  
Li Liu ◽  
...  

With the development of 5G technology, the traffics which need multiple quality of service (QoS) constraints greatly increase. The existing QoS routing algorithms either support a single QoS constraint or support multiple constraints are mixed with fixed weights. The latter is essentially a single-constrained QoS algorithm. Few studies can provide the quality of service guaranteed under the true sense of multiple constraints, by which only one solution can be provided. In this paper, we propose NSGAII-MCR: a multi-constrained QoS routing algorithm based on non-dominated sorting genetic algorithm II (NSGA-II). In NSGAII-MCR, three representative constraints are selected: delay, bandwidth, and packet loss rate. The validity of the routing is guaranteed by a designed encoding and decoding scheme and a novel individual generation method. Meantime, the original NSGA-II crossover and mutation operators are modified. We further enhance the selection strategy to improve the diversity of solutions and the robustness of NSGAII-MCR. At last, multiple optional routes in the Pareto-optimal front are obtained. The experiment demonstrates that the proposed NSGAII-MCR can achieve high success rate by up to 95%. Compared with the benchmarking methods, NSGAII-MCR can support more constraints and finds more multi-constrained routes.

2011 ◽  
Vol 15 (9) ◽  
pp. 1016-1018 ◽  
Author(s):  
Abdelhamid Mellouk ◽  
Said Hoceini ◽  
Sherali Zeadally

2014 ◽  
Vol 513-517 ◽  
pp. 994-998 ◽  
Author(s):  
Yue Gong ◽  
Jia Nan Wang

This paper mainly discusses the Multiple Constrained Qos Routing Algorithm, in the analysis of the basic on the basis of mathematical model of Qos routing. It has proposed a routing model with an objective function, integrated optimization of multiple Qos constraints. Finally, the optimization of ant colony algorithm applied to solve the problem of multiple constraints Qos. Through simulation experiments proved that the algorithm to find the path to maximum degree meets Qos requirements.


Author(s):  
Tran Minh Anh ◽  
Nguyen Chien Trinh

The scheme of Quality of Service (QoS) routing algorithms based on local state information has recently been proposed as an alternative approach to the traditional QoS routing algorithms. By implementing this localized QoS routing algorithm, each source node predetermines and maintains a set of candidate paths for each destination. These sets of paths will help the source node to decide the most appropriate path for a connection request. Hence, it helps to avoid the problems associated with the maintenance of the global network state information. In this paper, we propose a new and effective localized QoS routing algorithm, compare its performance with those of other localized algorithms and a traditional QoS routing algorithm under the same type of network topology, QoS requirements and traffic patterns. The simulations results show that our proposed algorithm can perform better than other routing algorithms. DOI: 10.32913/rd-ict.vol3.no14.258


2013 ◽  
Vol 427-429 ◽  
pp. 2664-2667
Author(s):  
Zhi Qiang Cai ◽  
Rong Sheng Lv ◽  
Shi Wen Sun

Quality of Service (QoS) routing is intent to find feasible routes according to QoS constraints and optimize utilization of whole network resources. In order to solve bandwidth-guaranteed QoS routing problem, a simple but effective routing algorithm based on precomputation scheme with load balancing consideration, is proposed. The algorithm is implemented and simulated using Network Simulator (NS2). Research results showed that the proposal can keep some links free from becoming bottlenecks earlier, avoid congestion caused by unbalanced traffic load distribution, and improve performance of IP backbone networks.


2015 ◽  
Vol 25 (3) ◽  
pp. 397-412 ◽  
Author(s):  
Marina Jeremic ◽  
Aleksandar Rakicevic ◽  
Ivana Dragovic

In order to improve the quality-of-service of distributed applications, we propose a multi-criteria algorithm based on interpolative Boolean algebra for routing in an overlay network. We use a mesh topology because it can be easily implemented, and it makes addressing of the cores quite simple during routing. In this paper, we consider four criteria: buffer usage, the distance between peers, bandwidth, and remaining battery power. The proposed routing algorithm determines the path which satisfies quality-of service requirements using interpolative Boolean algebra; the decision at each node is made based on the ranking of available options considering multiple constraints. The simulation shows that the proposed approach provides better results than the standard shortest path routing algorithm.


Sign in / Sign up

Export Citation Format

Share Document