Load-aware Routing Research Articles

Priority based energy and load aware routing algorithms for SDN enabled data center network

Nowadays, to accommodate the swift expansion of cloud computing, big data, and other emerging technologies, integrating data center networks and SDN (Software Defined Network) is suggested, which also improves the network management’s convenience and flexibility. As network devices in these data centers continue to increase at a high rate, efficient route management to handle these devices’ vast amounts of data has emerged as a significant concern. This work suggests a novel admission and routing scheme considering the importance or priorities of the network flows, path energy, and routing path load. Using the SDN paradigm in DCN (Data Center Network), we first develop a Mixed Integer Linear Programming (MILP) formulation by jointly considering flow priority, path energy, and path load. The MILP formulation can maximize the number of flows as well as minimize the energy consumption and load variance in the network, or it can make a trade-off among all three. However, due to the potentially long running time, later, we introduce two greedy methods, Priority Based Energy Minimization Algorithm (PEMA) and Priority Based Evenly Load Distribution Algorithm (PEDL), where PEMA aims to maximize the flow with less energy, and PEDL focuses on maximizing the flow with reduced load variation. Finally, the developed routing strategies are implemented, and the simulation results demonstrate the out-performance of our work compared to the existing works in terms of successful flow ratio, energy savings, and load balancing.

Routing optimization in a wireless network using genetic algorithm and ILA routing metric

Wireless access technology is a popular means of delivering various telecommunication services to users in Nigeria. Wireless Mesh Networking and Wireless Sensor Networking have found useful applications in wireless access systems, surveillance and infrastructure Management. A key problem associated with this technology is performance degradation in terms of Quality of Service (QoS). Achieving good QoS in Wireless Networks design involves implementing a robust routing optimization technique. Genetic Algorithm (GA) technique in NS2 network simulator was used to implement routing optimization in order to solve the performance issues experienced in a campus-based Voice over Internet Protocol (VoIP) communication system. The Interference and Load Aware (ILA) routing metric was chosen as the fitness function which helps to select the best route from a set of identified traffic paths that best guarantees low delay, high throughput and low packet losses suitable for real time communication. Results show that the GA based route optimization produced a 23% improvement in Throughput, 11% less Delay and 16% less Packet loss in comparison to the non-GA route. This work shows that route optimization in wireless multi-hop networks based on GA and ILA improves its QoS.

Common network coding condition and traffic matching supported network coding aware routing for wireless multihop network

Network coding–based routing has been widely considered as a promising technology to improve the network throughput of wireless multihop network. However, existing network coding aware routings have the problem of failure decoding and usually neglect the transmission scheduling, which degrades the gain of network coding. In this article, a common network coding condition and traffic matching supported network coding aware routing is proposed for wireless multihop network. In this, common network coding condition is proposed to avoid the problem of failed decoding. In addition, traffic matching mechanism is presented to promote the occurrence of network coding. Besides, a coding and load aware routing metric, which jointly considers the network coding opportunity and node load, is designed to evaluate the discovered paths. Extensive simulations on NS2 demonstrate that CTNR increases the number of coding opportunities and network coding occurrence, and improves network throughput.

Modeling a Novel Network Coding Aware Routing Protocol for Enhancement of Network Performance in Wireless Mesh Network

A Wireless Mesh Network (WMN) is a multi-hop network that gains the benefits of low deployment cost, fast access speed, expanded service coverage and large network capacity. However, the multi-hop communication in WMNs limits the throughput capacity due to increased number of packet transmissions. As a result, network coding is a recently emerged paradigm that can enhance the throughput capacity (i.e. network throughput) by minimizing the quantity of network workload and at the same time it ensures the data transfer among all the users. Further, with network coding the transmission effectiveness of a node can be improved by encoding (combining) several packets collectively and verifies whether the coding strategies is satisfied or not. Subsequently, if the coding strategies are satisfied then it transmits only the resultant encoded packet to the desired destination. In other words, network coding can improve the network throughput in WMNs by minimizing the transmission counts needed to transfer several packets to the destination. It should be noted that, while employing network coding in WMNs there are several challenges that should be compensated such as (i) identifying packets that can be combined (encoded) collectively and (ii) integrating the coding strategies in routing protocols. In this paper, we proposed a new mesh routing protocol that integrates network-coding called as Network Coding Aware Routing (Net-CART) protocol. Therefore, to enjoy the whole benefit of network coding a Net-CART protocol uses the innovative routing metric called Code-Aware and Load-Aware Routing Metric. Additionally, to identify numerous ‘coding structures’ and to support number of ‘packet encodings’ an improved set of coding strategies known as Enhanced Universal Coding Strategies is also proposed. The proposed Net-CART protocol comprising an improved set of coding strategies and a new routing-metric considers both the coding-opportunities and “network workload”. The simulation study carried out in wide forms of network configurations showed that Net-CART gives more fairness performances than other protocols.

Energy and Load Aware Routing Protocol for Internet of Things

<p>Maximizing the network lifetime is one of the major challenges in Low Power and Lossy Networks (LLN). Routing plays a vital role in it by minimizing the energy consumption across the networks through the efficient route selection for data transfer. IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) is a IETF standardized IPv6 routing protocol for LLN. In this paper, we propose Energy and Load aware RPL (EL-RPL) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on expected transmission count (ETX), Load and battery depletion index (BDI), for the route, selection. The COOJA simulator is used for performance evaluation. EL-RPL is compared with other similar protocols RER(BDI) RPL and fuzzy logic based RPL (OF-FL RPL). The simulation result shows that the EL-RPL improves the network lifetime by 8-12% and packet delivery ratio 2-4%.</p>

Efficient load aware evolutionary routing protocol in hybrid wireless network using MOEAD/D

The hybrid wireless network has developed as a promising solution, enabling mobile customers to accomplish higher execution and access service in a consistent way free of their reality in the range of wireless local area network (WLAN). In this paper, we have proposed the load aware routing protocol for the hybrid wireless network. Hybrid networks were having the combination of several networks such as MANET and VANET. In the hybrid network generally, the data transmission is very high and hence, it is necessary to create a reliable routing protocol for avoiding delay and to increase packet delivery ratio. Thus, we have implemented the optimal algorithm of MOEAD/D, i.e., a multi objective evolutionary algorithm based on decomposition combined with Djikstra. Here the MOEAD is used to find the best router for transmitting the data packets and the Djikstra algorithm is used to find the shortest path for the router. Thus, this combination of MOEAD and Djikstra has yielded a reliable load aware routing protocol. The simulation result shows that the performance of our proposed routing protocol is better than the existing protocol.

Efficient load aware evolutionary routing protocol in hybrid wireless network using MOEAD/D

The hybrid wireless network has developed as a promising solution, enabling mobile customers to accomplish higher execution and access service in a consistent way free of their reality in the range of wireless local area network (WLAN). In this paper, we have proposed the load aware routing protocol for the hybrid wireless network. Hybrid networks were having the combination of several networks such as MANET and VANET. In the hybrid network generally, the data transmission is very high and hence, it is necessary to create a reliable routing protocol for avoiding delay and to increase packet delivery ratio. Thus, we have implemented the optimal algorithm of MOEAD/D, i.e., a multi objective evolutionary algorithm based on decomposition combined with Djikstra. Here the MOEAD is used to find the best router for transmitting the data packets and the Djikstra algorithm is used to find the shortest path for the router. Thus, this combination of MOEAD and Djikstra has yielded a reliable load aware routing protocol. The simulation result shows that the performance of our proposed routing protocol is better than the existing protocol.

Load-aware multicast routing in multi-radio wireless mesh networks using FCA-CMAC neural network

Multicasting is a useful network service in wireless mesh networks (WMNs) for delivering same data from a source to multiple destinations. An effective multicast routing protocol in multi-channel multi-radio WMNs (MCMR-WMNs) is required to satisfy the following criteria together: high network throughput, low end-to-end delay, low tree cost, low computational time, and load-aware routing. Furthermore, how to fully exploit channel diversity in MCMR-WMNs to accomplish low channel interference criteria is a critical issue in designing multicast routing protocol. In spite of its significance, multicast routing which satisfies all of the mentioned criteria, has not drawn much attention so far. Besides, major multicast routing protocols proposed in MCMR-WMNs are centralized or solve two problems of multicast tree construction and channel assignment sequentially. These protocols are time-consuming in addition to suffering from a single-point-of-failure. In this paper, we propose a distributed cross-layer algorithm for joint multicast routing and channel assignment in MCMR-WMNs. For the first time, we apply fuzzy credit assigned cerebellum model articulation controller (FCA-CMAC) neural network model to construct multicast routing tree considering load on the mesh nodes and the delay between neighboring mesh nodes. Moreover, we present a heuristic channel assignment algorithm aiming to reduce interference among the links of the multicast tree. FCA-CMAC converges quickly and creates minimal delay and load-aware multicast tree. Therefore, proposed method can optimize the network throughput, end-to-end delay, tree cost, and computational time. Additionally, channel assignment algorithm is subject to produce the minimal interference multicast tree. Simulation results show that in terms of aforementioned criteria, the proposed FCA-CMAC based multicast algorithm achieves better performance than those comparative references.

An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks

Ad-hoc network consists of a group of mobile nodes with a restricted power supply resources that can communicate with each other without any established infrastructure or centralized administration. The unbalanced distribution of traffic loads among network's nodes led to a power dissipation of overloaded nodes, the loss of these vital nodes causes link failure which could lead to critical topological changes, affect the network operations and its lifetime. This paper summarized the energy consumption problem in ad-hoc wireless networks and the existing power aware routing protocols classification. The main objective of this paper is to introduce and implement a new power and load-aware routing scheme that is based on DSR protocol's scheme. A new cost function was drawn, that allows source nodes to find a multiple node-disjoint power and load aware optimal paths to their destinations, as a way to extend the operational life of nodes and thereby maximize the network lifetime. Simulation results showed that the protocol that is based on this proposed scheme can prolong network lifetime by almost 30% with low traffic loads, and by 40% with high traffic loads compared to pure DSR.

Backpressure-based routing and scheduling protocols for wireless multihop networks: A survey

Backpressure-based routing and scheduling has been considered as a promising strategy for efficient resource allocation in wireless multihop networks. It has many attractive features such as throughput optimality, achievable adaptive resource allocation, support for agile load-aware routing, and simplicity. In this article, we first categorize existing backpressure-based protocols based on different design criteria and then summarize several key issues faced in the design of efficient backpressure-based protocols. We present a comprehensive survey of state-of-theart backpressure-based protocols for wireless multihop networks. We illustrate how each of the protocols works, and discuss their merits and deficiencies. Finally, we point out some future directions for supporting efficient backpressure- based routing and scheduling.

Survey on Load Aware and Energy Aware Routing in MANET

Survey on Load Aware and Energy Aware Routing in MANET

A Swarm Based Hybrid Multipath Load Aware Routing Algorithm for WMN

Background: Wireless Mesh Networks is an emerging field and versatile network infrastructure constitutes the collaboration of heterogeneous mesh routers managed by different users to extend network coverage. The performance of WMNs depends on the designing of a routing protocol. While implementing the routing protocols, allocation of routing metrics are done to different paths for calculating best paths which represents a function for the prediction of the best routing path. Methods: To select best path in WMNs, tree based routing protocols and hop count based routing protocols are proposed earlier. However, Poor scalability and throughput, high overhead owing to control packet flooding are still exists as drawbacks. Moreover, factors namely high number of forwarding nodes and load balancing factor are not focused. A novel routing protocol based on A* path finding algorithm and hybrid BAT algorithm is proposed to solve these issues. There are three phases namely discovery, path selection and route maintenance. In path discovery, the shortest path between the gateway and other nodes is found using A* path finding algorithm where more than five routes have been discovered. In second phase, the best path is selected for data transmission by considering load balancing as an important factor using hybrid BAT algorithm based on path relinking algorithm. During the joining of new nodes or node failures or nodes that are moving continuously in route is maintained through the other two phases. Results: The results of the proposed algorithm is attaining a higher packet delivery ratio, lesser end to end delay and lesser routing overhead than the existing routing protocols such as PAWMNet, FKAWMNet, HBWMnet, and these were obtained from their simulation results. Conclusion: The performances of the proposed algorithm were compared with other existing algorithm using other standard performance metrics which gives best results. The results show that the proposed approach is efficient to determine the parameters which affect the network.

Techniques to Enhance the Quality of Service of Multi Hop Relay Networks

Broadband internet access through the user equipment has become the hot research topic. The shadowing and multipath issues restrict the high performance nature of 4G cells. In Multi hop Relay (MHR) networks, Relay Stations (RS) are introduced to improve coverage and capacity of the system. There exist some issues like path selection and RSs deployment, which severely affects the Quality of Service (QoS) of the system. In this paper, to improve the QoS of MHR networks, Load Aware Routing Metric (LARM) based path selection and a low complex Burst Profile (BP) based RS deployment schemes are discussed.

A Load-Balanced On-Demand Routing for LEO Satellite Networks

Due to population distribution and economic flourish diversity, the low earth orbit (LEO) satellite network carries unbalanced traffic load, which leads that parts of satellite links are congested while others are underutilized. Furthermore, the congested inter-satellite links result in high queuing delay and packet dropping ratio. To ensure an intelligent scheduling of traffic over entire satellite networks, a load-aware routing protocol named load-balanced on-demand routing (LBR) for LEO satellite networks is proposed in this paper. LBR integrates load judgment mechanism and location assistance strategy, which can reduce the time for path discovery and the control overhead. To evaluate the performance of the proposed protocol, the simulation is conducted on the platform of NS-2. Simulation results verify that, comparing with the existing protocols, LBR can achieve better load balancing, lower end-to-end delay and packet dropping ratio, and higher network throughput with the acceptable control overhead

Multi-criteria based multipath OLSR for battery and queue-aware routing in multi-hop ad hoc wireless networks

The unbalanced distribution of load among nodes is a critical issue of routing in multi-hop ad hoc wireless networks. The multipath OLSR (MP-OLSR) routing protocol offers an effective solution to the problem by providing multiple paths to the destination. However, in this protocol, there is no simultaneous consideration for energy and QoS metrics to measure the quality of links during route computation. Thus, the failure of node caused by battery depletion restricts its ability to relay packets and degrades the QoS performance of the MP-OLSR. In this paper, we propose a Multipath Battery and Queue Aware-OLSR (MBQA-OLSR) for energy efficient and load-aware routing, to conserve energy, balance load, and improve QoS performance. This was achieved by introducing a new Multi-Criteria Node Rank metric (MCNR), which comprises three node's metrics related to energy and QoS, namely: residual battery, idle time, and queue length, to measure the quality of links between nodes based on a new link cost function, and therefore, selecting the most efficient and reliable paths to the destination. Additionally, an Energy Aware Multi-Point Relay (EA-MPR) mechanism was exploited in the MBQA-OLSR, to select the MPR set, to optimize the topological information flooding according to energy resources and nodes status. The MBQA-OLSR was evaluated under various simulation environments and the results demonstrate its superiority compared with original schemes. It achieved a packet delivery ratio gain up to 54.4 % and significantly reduced the end-to-end delay, number of dead nodes and the energy cost per packet in dense static networks.

An adaptive load-aware routing algorithm for multi-interface wireless mesh networks

In wireless mesh networks, the number of gateway nodes are limited, when the nodes access to the internet by fixed gateway node, different requirements of nodes lead to the dataflow shows heterogeneity. Many new routing metrics and algorithms existing in traditional wired networks and the Ad Hoc network, can not be directly applied to wireless mesh networks, so how to design a routing metric and algorithm which can dynamically adapt to current networks topology and dataflow changes, avoid bottleneck node, and select the most stable and least congestion link to establish a route is very important. In this paper, we presented a new dynamic adaptive channel load-aware metric (LAM) to solve the link load imbalance caused by inter-flow and inner-flow interference, designed a self-adaptive dynamic load balancing on-demand routing algorithm through extending and improving AODV routing method with the LAM, to achieve flow balance, reduce the high packet loss ratio and latency because congestion and Packet retransmission, and can increase Network Throughput.

Design and Performance Verification of Dynamic Load Aware Geographic Routing Protocol in IEEE 802.15.4a Networks

Although the IEEE 802.15.4a network provides accuracy localization for sensor nodes, it still suffers from congestion and bottleneck problems since the data traffic tends to concentrate on a certain intermediate node due to the shortest path first criteria when it utilizes a greedy routing method. Furthermore, the limited network bandwidth and node mobility features exacerbate this problem in wireless sensor networks with tiny sensor platforms. In this paper, we propose a new dynamic load aware geographical routing protocol, named DLAG, which periodically monitors the channel condition of each node and forwards a packet to the neighboring node with the least traffic load by defining new buffer threshold values for controlling the congestion. In addition, the proposed protocol also introduces traffic adaptive backoff and frame retransmission tuning techniques to provide prioritized channel access for congested nodes. In order to verify the performance of the proposed protocol, we conduct simulation verification experiments and the results show that the proposed protocol provides better performance than the legacy geographical routing schemes in terms of packet delivery ratio, end-to-end delay, network lifetime, and so forth.

Fuzzy Based Load and Stability Aware Routing for Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are very promising wireless technology and they support wide range of applications. Due to the dynamic nature of MANETS, their routing process faces several challenges. In this paper, we propose a new, Load and Stability Aware Ad Hoc on-demand Distance Vector protocol (LSA-AODV) for efficient data transmission in MANET. It applies fuzzy logic to stability metric and traffic density of the route. The ultimate intend is to select a reliable path for data communication and to reduce the number of route breakages, collisions and contention. It also utilizes stability and traffic density metrics to control broadcasting of routing messages. This protocol is compared with other similar routing protocols: LBAR and AODV. We use ns-2 for simulation. Our simulation results show that, the proposed protocol outperforms the existing routing protocols in terms of end-to-end delay and packet delivery ratio. It also considerably reduced the routing overhead.

Proposal of Load Aware Routing for OSPF Routing Protocol

This paper deals with route cost assignment using one of the most commonly used routing protocols - Open Shortest Path First (OSPF). The limitation of this protocol is that the algorithm does not take actual link load into consideration. This paper proposes using an alternate costing strategy to avoid this problem. The alternate strategy uses an integer value representing the load of a link as the additive component of metric. Since the link load is a dynamic variable, Exponential Weighted Moving Average is used to counter quick changes. This paper proposes a novel approach to calculate OSPF metrics, aimed to better distribute the load in network.

Geographic routing protocol for vehicular ad hoc networks in city scenarios: a proposal and analysis

SUMMARYThe characteristics of vehicular ad hoc networks (VANETs) make the design of routing protocol a great challenge. In this paper, we propose a vehicle density and load aware routing protocol for VANETs called VDLA. VDLA adopts sequential selection of junctions to construct the route. The selection is based on the real‐time vehicle density, the traffic load, and the distance to the destination. The network information is collected by a decentralized mechanism. Through factoring in these metrics, the packets are avoided being sent to roads where network is disconnected, and the network load is balanced to mitigate network congestion. The intermediate junctions are selected before the packet reaches a junction to reduce the unnecessary hops. Our study also investigates the impact of the high mobility of the nodes. An analytical framework is proposed to analyze the mobility. Based on the analysis, the traditional Hello scheme is enhanced to improve the accuracy of the neighbor table. In the simulation, we compare VDLA with greedy perimeter coordinator routing and GpsrJ+, which are geographic routings protocols proposed for VANETs. The results validate the superiority of VDLA in terms of end‐to‐end delay and packet delivery rate. And the superiority holds in different scenarios. Copyright © 2013 John Wiley & Sons, Ltd.