QoS-aware Routing Algorithm Research Articles

FybrrLink: Efficient QoS-Aware Routing in SDN Enabled Future Satellite Networks

Providing high-speed Internet services using satellite networks have attracted researchers from both academia and industry mainly due to the characteristics of Low Earth Orbit (LEO) satellite networks such as global coverage, scalability, and lower transmission delays. Implementation of Software-Defined Networking (SDN) in Non-Terrestrial Networks (NTNs) can help to achieve the goals set for 5G and beyond networks. Since satellite networks have a specific architecture, some of the legacy protocols no longer remain useful. Therefore, to satisfy the diverse Quality of Service (QoS) requirements for a variety of applications, we propose a novel and centralized QoS-aware routing algorithm, called fybrrLink in which the global view of the network in SDN is utilized. We implement a modified Bresenham’s algorithm and Dijkstra’s algorithm to find the optimal path in a significantly reduced computation time. Also, taking advantage of the deterministic satellite constellation, we propose a flow rule transfer algorithm and a topology monitoring algorithm. Further, fybrrLink is evaluated with multiple NS3 simulations, and results confirm that our approach outperforms other state-of-the-art algorithms.

A QoS-aware routing in SDN hybrid networks

Changing the whole network into a software defined network (SDN) is impractical due to high replacement cost. Therefore, there exist SDN hybrid networks, where SDN switches and legacy switches coexist at the same time. In this paper, we propose an SDN hybrid network architecture which can discover existence of legacy switches by using the Spanning Tree Protocol and thus have a global view of the SDN hybrid network. We also enable OpenFlow switches to cooperate with legacy switches by using the Learning Bridge Protocol without requiring any modification on legacy switches. By utilizing the characteristics of SDN, SDN applications can dynamically find routing paths according to pre-defined QoS requirements and current network status. We also propose a simulated annealing based QoS-aware routing (SAQR) algorithm which can adaptively adjust weights of delay, loss rate and bandwidth requirements in a cost function to find the best fit path according to QoS requirements. We evaluate the proposed SAQR in a simulated SDN hybrid network which runs applications with different QoS requirements. Simulation results show that the SAQR performs better than related work MINA in terms of the fitness ratios of delay, loss rate and bandwidth, with 88%, 90.8% and 86.5% of flows meeting their respective QoS requirements, in contrast to MINA, with only 63%, 82.4% and 87.5% of flows meeting their respective QoS requirements.

Performance enhancement of wireless ad-hoc networks using PLR-based routing protocols

This paper proposes a packet loss ratio-based routing protocol (PLRRP), comprising of admission control and QoS-aware routing algorithm, contention aware admission control and adaptive transmission metric for enhancing the performance of mobile ad-hoc networks. Admission control algorithm optimises the placement of data in each of its reserved bandwidth which avoids collision. Adaptive transmission checks for the available bandwidth and active links for transmission and initiates fragmentation or de-fragmentation ensuring minimum drops and retransmissions. In a low TTL-based wireless network, the node drops all its energy before actually transferring the data given to it. To address this problem a new routing technique is proposed by which the data from one part is scheduled to reach the destination based on the computed TTL and residual energy. The parameters simulated are throughput, delay, transmit energy and packet delivery ratio.

Secure and Robust Multi-Constrained QoS Aware Routing Algorithm for VANETs

Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In vehicular ad hoc networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the ant colony optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented evolving graph (VoEG) model to perform plausibility checks on the routing control messages exchanged among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service.

QoS-Aware Routing for Multi-Sink WMSNs

With the development of Wireless Multimedia Sensor Networks (WMSNs), it is difficult to meet the various QoS requirements in single sink network. Multi-Sink nodes in the network can effectively reduce the average hop count and balance network energy. A QoS aware routing algorithm based on improved ant colony is proposed to meet the QoS requirements. Compared with other protocols, simulation results show that the new algorithm can effectively balance the traffic load and extend the network lifetime.

AQTR: The Ant Based Qos Aware Improved Temporally Ordered Routing Algorithm for MANETs

Mobile ad hoc network is an autonomous system of mobile nodes connected by wireless links. Here the node acts as both router and host. The node moves unpredictably and randomly. Due to this nodal mobility routing in MANET is a very challenging issue. Routing is the act of moving information across the network from source to destination. In case of MANET it is very difficult due to dynamic topology, limited resources, limited energy of nodes, different QoS requirements. Providing QoS routing in MANET is an important task an also it is a challenging task to find paths which satisfies user's QoS requirements. In this paper we have developed AQTR, a new energy efficient ant colony optimization QoS aware on-demand multipath routing algorithm for MANETs. It is a modification of classical temporally ordered routing which reduces the control overhead and it has better route failure management technique.

A QoS-aware routing algorithm based on ant-cluster in wireless multimedia sensor networks

QoS-aware routing algorithm is important in wireless multimedia sensor networks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first introduce a 2D plain-based routing algorithm IPACR which improves the standard ant colony algorithm by optimizing the initial distribution of artificial pheromone in order to accelerate the algorithm convergence rate. Then a clustering-based routing algorithm ICACR is presented which can be well applied in a large scale network. ICACR is a variation of IPACR because it can be suitable for clustering cases to satisfy the larger scale situations. Both the numerical algorithm performance analysis and simulation of IPACR and ICACR are given. The results show that ICACR outperforms IPACR in terms of both network lifetime and QoS-aware routing metrics in large scale wireless multimedia sensor networks. Moreover, the simulation based on the real video traces shows that by extending the multi-path to ICACR for different priorities of video frames better performance can be achieved.

QUALITY OF SERVICE AWARE REVERSE PATHAD-HOC ON-DEMAND DISTANCE VECTOR PROTOCOL

Mobile Ad-hoc Network (MANET) is aninfra structureless network that does not require any built-in infra structure and central control. Due to very fast mobility of nodes, there will be drastic changes in the network topology. So an adaptive routing protocol is needed for effective and reliable routing in MANET. Ad-hoc On-demand Distance Vector (AODV) routing protocol is the efficient and prominent routing protocol which may satisfy the above said issue. While making routing process in traditional AODV,onlyone route information will be sent as reply in the reverse path. This reply from the destination may be lost due to fast mobility of modes which in turn leads to the retransmission of route request packets to establish routes.The main cause of this problem is increased communication delay and reduction of several QoS metrics. The main goal of the new Novel QoS aware reliable routing algorithm is to send multiple route replies and establishes reliable data transmission between source and destination. The new NQARR-AODV protocol establishes paths on-request using a reliable reverse pathestablishment method. During pathestablishmentphase, the source node first sends the route requests through all available paths to the destination. The destination node,upon receiving the path requests,inturn rebroadcasts the reverse path requestsas like sender node has done. Upon receiving the multiple route replies from the destination, a path with high reliability is choosen by the source node using the three parameters, the MAC overhead, the Eminence of Link, node residual energy. NQARR-AODV path establishment method works well and requires only minimum steps. It also provides high energy efficiency and load balancing thus prolongs the network life time and makes up high reliability communications. The experimental values prove that the NQARR-AODV algorithmis more reliable and stable and outperforms AODV by reducing energy consumption, overhead and delay. Also NQARR-AODV gains bestratio of packets delivered than that of normal AODV. In our proposed NQARR-AODV protocol, the source node can find QoS aware reliable route to the destination.

A degree-constrained QoS-aware routing algorithm for application layer multicast

Application layer multicast (ALM) provides a low-cost solution for multicast over the Internet. It overcomes the deployment hurdle of IP multicast by moving all multicast related functions from network routers to end-hosts. However, since packet replication is performed on end-hosts, the system performance of an ALM is limited by the bandwidth of end-hosts. Therefore, degree-constrained QoS-aware multicast routing becomes one of the key concerns for implementing realtime multicast services, such as continuous streaming applications. In this paper, we claim that the QoS gained by most users will be better evaluated using the overall latency, and we explore the optimization of Degree-Constrained Minimum Overall Latency Spanning Tree (DCMOLST). The process for optimizing the overall latency is divided into two phases, i.e., the initialization phase and the dynamic adjustment phase. In the former phase, we present a heuristic DCMOLST algorithm which negotiates both transmission delay and node bandwidth simultaneously, so as to avoid QoS degradation caused by any single metrics. In the later phase, we define a set of distributed iterative optimizing operations to swap the position between nearby end-hosts for further optimization. Experimental results show that the proposed degree-constrained QoS-aware routing algorithm could improve the overall performance of application layer multicast services.

QoS-aware routing in emerging heterogeneous wireless networks[Quality-of-Service-Based Routing Algorithms for Heterogeneous Networks

The integration of different kinds of wireless mobile networks, or heterogeneous wireless networks (HWNs), is emerging. However, a systematic discussion with regard to the special requirements and the complexity of QoS-aware routing in such networks and how QoS is blended with routing is still largely missing. This article aims to cast some light on these aspects. Based on an analysis of the basic architecture of an emerging heterogeneous wireless network and its new requirements on QoS-aware routing, a policy-based QoS supporting system infrastructure and a QoS-aware routing algorithm called QRA are presented in this article. The presentation is specifically given to these issues and components that are unique to HWNs and its QoS routing. The evaluation results show the impact of different network parameters on the performance of QoS-aware routing in HWNs