Dynamic Multi-path Routing Algorithm Research Articles

Dynamic multipath routing for energy‐efficient and reliable communication in 6G networks with MIMO

AbstractIn the era of 6G networks, Multiple Input Multiple Output (MIMO) technology offers unprecedented opportunities for high‐throughput and low‐latency communication. Existing communication frameworks, however, have difficulty optimizing both energy efficiency and reliability at the same time. In most cases, conventional routing protocols fail to meet the needs of MIMO systems, making them inefficient and prone to reliability problems due to their inability to dynamically adapt to different network conditions. This research addresses the intricate interplay between energy efficiency and reliability within the context of 6G networks with MIMO. The motivation for this research arises from the imperative to unlock the full potential of 6G networks with MIMO for achieving energy‐efficient and reliable communication. With the advancement of communication technology, seamless connectivity, minimal energy consumption, and robust reliability become increasingly critical. Currently, solutions cannot adapt dynamically to the diverse and dynamic conditions of a 6G environment. Through this research, we aim to bridge this gap, enhancing 6G network performance and sustainability with unprecedented gains in energy efficiency and reliability. We have developed the Dynamic Multipath Routing (DMR) algorithm by harnessing the advanced features of MIMO technology. The DMR algorithm strategically chooses paths to minimize the effects of fading, interference, and channel impairments, creating a resilient communication network. This improvement is essential for meeting the demanding connectivity needs of various 6G applications, covering ultra‐reliable low‐latency communication and massive machine‐type communication.

An Enhanced Dynamic Multi-Path Routing Algorithm for Software Defined Networks

Software-defined networking (SDN) is an emerging technology that addresses the limitations of legacy networks when handling the growing traffic demands. Legacy networks face issues like heavy traffic loads, congestion and delays. SDN offers a solution to these challenges. However, an efficient routing algorithm is required to transmit data packets through the network. While there are existing routing algorithms, there remains a need for a highly efficient one that minimizes packet loss and optimizes link utilization. One commonly used routing for mitigating issues, such as packet loss, delay and bandwidth allocation, is multipath routing. The inherent flexibility of SDN, which provides a comprehensive overview of network status, empowers routing algorithms to generate efficient routing paths. We introduce the enhanced dynamic multipath routing (EDMR) algorithm in this context. This algorithm dynamically generates and updates routing paths within the network's switches. Its dynamic nature significantly reduces packet loss and minimizes end-to-end delays.

Probabilistic Connectionless Multipath Routing Algorithm for Reliability and Stability Evaluation

Aiming at the dynamic topology characteristics of mobile ad hoc networks, a dynamic multi-path routing algorithm based on improved probability disconnect multiple routing (IDPMR) performance is proposed, which can derive the classification of link cost function by considering real-time parameters, so as to flexibly allocate resources for transmission and reduce the impact between traffic categories. Based on the statistical characteristics of path remaining lifetime, the algorithm takes into account the correlation of adjacent link lifetime, so as to eliminate the theoretical error of existing algorithms in path stability estimation, and uses the optimized stability criterion to realize the multi-path selection of route discovery process and fast route repair based on backup path support. The simulation results show that the algorithm has fast convergence speed, can effectively improve the network throughput, shorten the data transmission delay and reduce the routing overhead, and better ensure the stability of data transmission under high node mobility.

PDMR: priority‐based dynamic multi‐path routing algorithm for a software defined network

The ever changing traffic and Quality-of-Service (QoS) requirements of different traffic classes in multimedia applications impose tremendous challenges to the routing algorithm design. To address these challenges, a novel priority-based dynamic multi-path routing algorithm (PDMR) over Software Defined Network (SDN) is proposed in this paper. PDMR comprehensively considers the priorities of multimedia streams and the real-time status of the link. The goal of PDMR is to determine what resources to be allocated to a set of flows keeping their priority, improving the utilization of network resources for satisfying stringent QoS requirements of the traffic flow. According to different QoS requirements in multimedia applications, traffic is classified into two classes and allocated their respective priorities. In addition, we derive a classification of the link cost function by considering the real-time parameters such as link bandwidth, link delay, and link load to allocate the resources flexibly for transmission and to reduce the influence of between traffic classes. Furthermore, our proposed communication model between application services and the controller, which can guarantee the reliable transmission of the designated traffic. By conducting extensive simulations, we demonstrate that our proposed PDMR algorithm significantly outperforms other existing non-priority-based schemes in improving network performance.

Dynamic Multipath Routing With Traffic Grooming in OFDM-Based Elastic Optical Path Networks

Elastic optical networks employ flexible routing and spectrum allocation algorithms to support diverse services and heterogeneous traffic. By splitting a traffic request into multiple small-size subconnections and individually transmitting them through several optical paths, multipath routing algorithms can more flexibly utilize spectrum resources than single-path routing algorithms in dynamic scenario. However, due to the imperfect shape of optical filters deployed in the network, guard bands are typically inserted between two adjacent connections in spectrum domain and, thus, cannot be used to transmit data. When the traffic load is heavy, multipath algorithms severely suffer this spectrum waste from deploying many subconnections and result in lower spectrum efficiency than single-path routing. Moreover, multipath routing algorithms require more bandwidth-variable transponders (BVT), which may lead to a higher cost. In this paper, we propose a dynamic multipath routing algorithm with traffic grooming (MPTG) to tackle this problem of multipath routing under heavy traffic load. By aggregating small-size connections originated from the same source node and sharing common fiber links, traffic grooming enhances the network throughput, and also effectively reduce the BVT consumption. The simulation results show that our proposed MPTG algorithm dramatically reduced bandwidth blocking ratio and BVT usage compared with previous multipath routing algorithm.

A Dynamic Multi-Path Routing Algorithm for ATM Networks

In this paper we describe briefly a dynamic multi-path routing scheme that has been considered for connection oriented homogeneous high-speed wide area Asynchronous Transfer Mode (ATM) networks. The fundamental objective of the scheme is to bridge the gap between routing and congestion control as the network becomes congested. Because propagation delay far out shadows queueing and transmission delay in high-speed networks, the proposed routing scheme works as a shortest path (minimum hop) first algorithm under light traffic conditions. However as the shortest path becomes congested, the source node uses multiple paths when and if available in order to distribute the load and reduce packet loss. The scheme is a cross between Alternate Path Routing and Trunk Reservation.We compare the performance of the proposed scheme with the Shortest Path Only Algorithm, the Alternate Path Routing Algorithm, the Random Routing Algorithm, and the Trunk Reservation Scheme. The throughput and packet loss performance are compared via simulations. These have been carried out concentrating on a five-node network, each with varying traffic patterns, the intention being to gain insight into the strengths and weaknesses of the various schemes.