QoS Routing Optimization Based on Deep Reinforcement Learning in SDN

To enhance the efficiency and expediency of issuing e-licenses within the power sector, we must confront thechallenge of managing the surging demand for data traffic. Within this realm, the network imposes stringentQuality of Service (QoS) requirements, revealing the inadequacies of traditional routing allocation mechanismsin accommodating such extensive data flows. In response to the imperative of handling a substantial influx of datarequests promptly and alleviating the constraints of existing technologies and network congestion, we present anarchitecture forQoS routing optimizationwith in SoftwareDefinedNetwork (SDN), leveraging deep reinforcementlearning. This innovative approach entails the separation of SDN control and transmission functionalities, centralizingcontrol over data forwardingwhile integrating deep reinforcement learning for informed routing decisions. Byfactoring in considerations such as delay, bandwidth, jitter rate, and packet loss rate, we design a reward function toguide theDeepDeterministic PolicyGradient (DDPG) algorithmin learning the optimal routing strategy to furnishsuperior QoS provision. In our empirical investigations, we juxtapose the performance of Deep ReinforcementLearning (DRL) against that of Shortest Path (SP) algorithms in terms of data packet transmission delay. Theexperimental simulation results show that our proposed algorithm has significant efficacy in reducing networkdelay and improving the overall transmission efficiency, which is superior to the traditional methods.

Research on Neural Network Based QoS Routing

In this paper, the requirements of routing due to the multimedia applications are briefly discussed. In order to solve the QoS constrained routing effectively and efficiently, the scheme of routing based on Hopfield neural network is proposed after the analysis of related work. Then the QoS routing algorithm for unicast based on Hopfield NN is described and the result of emulation is given. At last, multicast QoS routing considerations based on Hopfield NN are proposed.

SI-INSPIRED ENERGY AWARE QoS ROUTING TREE FOR WSN

A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.

On-demand QoS routing protocol based on energy and bandwidth requirement in Ad Hoc networks

Along with the emergence of real-time multi-media,interactive service,real-time voice and other services calling for high quality of service,there should be a good network to support those services.Most present route algo- rithms with computational complexity hardly consider the restriction of node energy,so it degrades the whole capabil- ity of network.Bandwidth guarantee is one of the most crucial factors in real-time application,and this paper brings forward a distributed on-demand QoS routing protocol based on energy and bandwidth requirement.This QoS routing protocol makes use of bandwidth calculation algorithm and analyzes its route mechanism.The simulation results veri- fy its validity.The QoS routing protocol improves the packet delivery fraction and average end-to-end delay,prolongs the network lifetime,enhances the network performance and satisfies the route requirement for ad hoc networks.

QoS multicast routing algorithm based on GA

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.

Multiple constraints-based QoS multicast routing: model and algorithms

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.

Anycast service model and its QoS routing algorithm

In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify certain applications. In this paper, the authors described a simple anycast service model in the Internet without significant affecting the routing and protocol processing infrastructure that was already in place, and proposed an anycast QoS routing algorithm for this model. The algorithm used randomized method to balance network load and improve its performance. Several new techniques are proposed in the algorithm, first, theminimum hops for each node are used in the algorithm, which are used as metric for computing the probability of possible out links. The metric is pre computed for each node in the network, which can simplify the network complexity and provide the routing process with useful information. Second, randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the delay of the routing path. the authors assess the quality of QoS algorithm in terms of the acceptance ratio on anycast QoS requests, and the simulation results on a variety of network topologies and on various parameters show that the algorithm has good performances and can balance network load effectively.

Ant Colony Algorithm for Solving QoS Routing Problem

Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least\|cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss\|constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.

An ACO Look-Ahead Approach to QOS Enabled FaultTolerant Routing in MANETs

MANET routing is critical and routing decision should be made sooner before the node leaves the network.Fast decisions always compensate network performance.In addition,most MANET routing protocols assume a friendly and cooperative environment,and hence are vulnerable to various attacks.Trust and Reputation would serve as a major solution to these problems.Learning the network characteristics and choosing right routing decisions at right times would be a significant solution.In this work,we have done an extensive survey of fault tolerant protocols and ant colony algorithms applied to routing in MANETs.We propose a QoS constrained fault tolerant ant lookahead routing algorithm which attempts to identify valid route and look-ahead route pairs which might help in choosing the alternate path in case of valid route failure.The results prove that the proposed algorithm takes better routing decisions with 20-30 percent improvement compared with existing ant colony algorithms.

Multicast routing algorithm of multiple QoS based on widest-bandwidth

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

A DISTRIBUTED QOS ROUTING BASED ON ANT ALGORITHM FOR LEO SATELLITE NETWORK

Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound.

Distributed QoS multicast routing protocol in ad hoc networks

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.

An efficient QoS routing algorithm for multi-constrained path selection

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.

QoS Routing Algorithm with Multi-Dimensions for Overlay Networks

Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network infrastructure.Overlay routing has been used as an alternative to the default best effort Internet routing for the absence of end-to-end Quality of Service(QoS). While the former has recently been investigated, the conflict of QoS restraints and resource optimization remains unsolved. Recent studies have shown that overlay paths can give better latency, loss rate and TCP throughput. In this paper, a multi-dimensional QoS objective model based on the analysis of multiple QoS constraints has been presented, and a routing algorithm to optimise the overlay resource of its nodes and links is then proposed.In fact, the algorithm obtained multiple QoS values using probability theory to achieve the routing according to the multi-dimensional QoS objective vector of the QoS objective model. Simulation results reveals that the algorithm works better than other existing algorithms in balancing the network resources, and applications with stringent QoS requirements could be run.

Design of QoS Aware Routing Protocol for IoT Assisted Clustered WSN

In current days,the domain of Internet of Things(IoT)and Wireless Sensor Networks(WSN)are combined for enhancing the sensor related data transmission in the forthcoming networking applications.Clustering and routing techniques are treated as the effective methods highly used to attain reduced energy consumption and lengthen the lifetime of the WSN assisted IoT networks.In this view,this paper presents an Ensemble of Metaheuristic Optimization based QoS aware Clustering with Multihop Routing(EMOQoSCMR)Protocol for IoT assisted WSN.The proposed EMO-QoSCMR protocol aims to achieve QoS parameters such as energy,throughput,delay,and lifetime.The proposed model involves two stage processes namely clustering and routing.Firstly,the EMO-QoSCMR protocol involves crossentropy rain optimization algorithm based clustering(CEROAC)technique to select an optimal set of cluster heads(CHs)and construct clusters.Besides,oppositional chaos game optimization based routing(OCGOR)technique is employed for the optimal set of routes in the IoT assisted WSN.The proposed model derives a fitness function based on the parameters involved in the IoT nodes such as residual energy,distance to sink node,etc.The proposed EMOQoSCMR technique has resulted to an enhanced NAN of 64 nodes whereas the LEACH,PSO-ECHS,E-OEERP,and iCSHS methods have resulted in a lesser NAN of 2,10,42,and 51 rounds.The performance of the presented protocol has been evaluated interms of energy efficiency and network lifetime.

Comparative Review of QoS-Aware On-Demand Routing in Ad Hoc Wireless Networks

In this paper, a representative set of QoS models and QoS-aware on-demand routing protocols are reviewed with emphasis on their ability to support QoS in mobile ad-hoc networks (MANETs) possibly used in WSNs. In particular IntServ, DiffServ, FQMM, and SWAN QoS models are reviewed followed by different QoS-aware on-demand routings in MANETs from different perspectives such as the challenges, classifications, algorithmic aspects in QoS provisions. Tradeoff in providing support to real time (RT) and best effort (BE) traffic is highlighted. Finally, a detailed and comprehensive comparison table is provided for better understanding of QoS provision in MANETs.

A Heuristic Algorithm for QoS Multicast Routing

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.

QoS-aware multicast routing protocol for Ad hoc networks

Ad hoe wireless networks consist of mobile nodes interconnected by multihop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting Quality of Service （QoS） is an inherently complex, difficult issue and very important research issue. MAODV （Multicast Ad hoc Ondemand Distance Vector） routing protocol provides fast and efficient route establishment between mobile nodes that need to communicate with each other. MAODV has minimal control overhead and route acquisition latency. In addition to unicast routing, MAODV supports multicast and broadcast as well. The multicast routing problem with multiple QoS constraints, which may deal with the delay, bandwidth and packet loss measurements is discussed, and a network model for researching the ad hoc network QoS multicast routing problem is described. It presents a complete solution for QoS multicast routing based on an extension of the MAODV routing protocol that deals with delay, bandwidth and packet loss mesurements. The solution is based on lower layer specifics. Simulation results show that, with the proposed QoS multicast routing protocol, end-to-end delay, bandwidth and packet loss on a route can be improved in most of cases. It is an available approach to multicast routing decision with multiple QoS constraints.

Study on QOS Routing in Network Centric Warfare

The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis of network resource, the QOS （Quality of Service） parameters and their characters, the high requirement of real-time synchronization in NCW, the single QOS routing constraint, and the network latency between the detector and weapon control station, are presented. To take an example for 3-node brigade （regiment） level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest. This paper solves the key issue and satisfies the needs on network latency in NCW. The study results can be widely applied in the decision of the optimal path which is based on multiple service provision points.

QOS-BASED MULTICAST ROUTING OPTIMIZATION ALGORITHMS FOR INTERNET

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.