Scalable Routing Research Articles

Exploiting Queue Information for Scalable Delay-Constrained Routing in Deterministic Networks

Exploiting Queue Information for Scalable Delay-Constrained Routing in Deterministic Networks

Routing algorithm for sparse unstructured P2P networks using honey bee behavior

SummaryUnstructured peer‐to‐peer (P2P) networks pose unique challenges for efficient and scalable routing. In this study, we introduce a novel routing algorithm inspired by the foraging behavior of honey bees named Honey Bee Optimization in P2P Networks (HBO_P2P) to address the inherent limitations of routing in unstructured P2P networks, focusing on improving packet delivery, minimizing hop count, reducing message overhead, and optimizing overall throughput. To evaluate the performance of our proposed algorithm, we conducted comprehensive experiments comparing it with existing algorithms commonly used in P2P networks, namely, particle swarm optimization (PSO), genetic algorithm (GA), and ant colony optimization (ACO). After the simulation, we got the results as follows: Our algorithm outperforms ACO, GA, and PSO by exhibiting the highest number of data hops indicating potential efficiency in route optimization. Routing overhead is also minimal as compared to ACO, GA, and PSO. The average data packet delay is also low in our algorithm as compared to ACO, GA, and PSO. HBO_P2P achieves the highest throughput, nearly reaching 100 Mbps. While ACO and GA exhibit similar throughput of around 80 Mbps, and PSO has the lowest throughput, approximately 60 Mbps.

Leveraging P2P Architecture and Semantic Web for Enhanced Resource Discovery

Web 4.0, also known as the next generation, intelligent internet, possesses the potential to become a widely and universally used communication medium for various types of information. However, its decentralized architecture lacks strong semantic support, resulting in an internet that is disorganized. The current system lacks the capacity to facilitate users' effective information discovery, extraction, and integration from multiple sources. Additionally, it fails to give consumers efficient tools for manipulating and turning acquired data into knowledge that is useful. Peer-to-peer (P2P) overlay technologies have recently come to light as a way to improve resource discovery on the internet. In dynamic and large-scale situations, these technologies provide a scalable framework for allocating, sharing, and gaining access to resources. The purpose of this research is to discuss on semantically enabled web architecture that makes use of P2P overlay technology. This architecture aims to facilitate structured and precise access to internet resources and promote knowledge sharing among community members who share similar interests. The paper examines the core elements of the semantic web architecture, which encompass the services and protocols responsible for resource advertising, discovery, and management, methods and material. It then delve into the hybrid peer-to-peer (P2P) overlay structure, specifically focusing on indexing and resource location, and explores the mechanisms necessary to facilitate scalable routing within a distributed environment.

A review of SDN‐enabled routing protocols for Named Data Networking

AbstractNamed Data Networking is a novel network architecture for the future internet in which data is named rather than addressed. This enables routers to forward data more efficiently based on its name, outperforming IP‐based routing. Another networking architecture that divides the control plane and the data plane is software‐defined networking (SDN). In an SDN network, the control plane decides on routing while the data plane forwards data packets. This separation increases routing flexibility and scalability. Numerous techniques to improve routing can be achieved with NDN and SDN integration. This paper provides an in‐depth examination of routing approaches in NDN based on SDN, emphasizing design principles, algorithms, and performance measures. We begin by summarizing the NDN architecture and delving into its essential components. We next go into the core routing ideas in NDN and categorize and study several routing solutions based on Software Defined Networks. Finally, we highlight the need for scalable, effective, and secure routing systems that may satisfy the expanding requirements of the contemporary internet. We also suggest open research topics in NDN routing based on SDN. This review provides an extensive overview of current centralized routing approaches in NDN, including their limitations and future possibilities.

Assessing Routing Algorithms for Payment Channel Networks

Payment Channel Networks (PCNs) are a promising approach to overcome scalability issues of blockchains. To achieve efficient payments in PCNs, it is necessary to route transactions between a payer and a payee. Especially in large-scale PCNs, multi-hop routing becomes necessary, since transactions need to be relayed by nodes. For this, a scalable routing algorithm is needed, which fits the individual objectives of PCN users. In this article, we study whether routing protocols from the field of Wireless Sensor Networks can be applied in PCNs. To this end, we first derive requirements for routing in PCNs, select suitable approaches, and analyze to which degrees they perform well and meet the requirements. We adapt selected protocols and evaluate them with regard to the lengths of payment paths, fees, and success ratio.

Scalable QoS-Aware Multipath Routing in Hybrid Knowledge-Defined Networking with Multi-Agent Deep Reinforcement Learning

Scalable QoS-Aware Multipath Routing in Hybrid Knowledge-Defined Networking with Multi-Agent Deep Reinforcement Learning

Software Defined Multicast Using Segment Routing in LEO Satellite Networks

The emerging low earth orbit (LEO) broadband satellite networks are creating new opportunities to enable superior video distribution. With numerous satellites deployed, broadband constellations are capable of distributing videos across the globe by efficient multicasting techniques. However, existing work only studied IP multicast for broadband constellations, which suffer from limited scalability and tree performance. With recent breakthroughs in software defined networking, novel software defined multicasting (SDM) techniques manage to achieve efficient data transfer through intelligent and granular management, outperforming traditional IP Multicast. This paper leverages software defined multicasting in the promising broadband constellations to empower satellite-based Internet video distribution. Based on rectilinear Steiner trees, this paper proposes a novel software defined multicasting framework for broadband satellite networks. In addition, this paper designs simple, agile, and scalable multicast segment routing protocols implementing source routing and equal cost multipath routing. The proposed protocols also adapt to frequent member updates and network failures with efficient tree recovery and local rerouting mechanisms. Comprehensive experiments demonstrate the effectiveness and efficiency of our approach when compared with traditional algorithms.

Named Multipath Depth-First Search: An SDN-based Routing Strategy for Efficient Failure Handling and Content Delivery in NDN

Information-centric networking (ICN) architectures, such as named data networking (NDN), have emerged as potential solutions for efficiently retrieving and delivering content. However, challenges remain regarding routing scalability, resilience, and caching efficiency. Software-defined networking (SDN) offers opportunities to optimize NDN implementations through centralized control and programmability. In this paper, we propose Named Multipath DFS, an SDN-based routing and caching scheme for NDN networks. NMDFS leverages a centralized controller to pre-compute multipath routes and implement coordinated caching. We evaluate NMDFS on an emulated topology testbed against default NDN and Named-data link state routing. The results demonstrate significant improvements with NMDFS, reducing overhead signalling costs by 94% and 78%, respectively, compared with other schemes. Round-trip latencies for content retrieval were reduced by up to 98%. The SDN controller’s global network view and control are leveraged to optimize content caching through packet loss-driven adaptation and eliminate redundant messaging, leading to substantial performance gains.

Reliable and Scalable Routing Under Hybrid SDVN Architecture: A Graph Learning Based Method

Reliable and Scalable Routing Under Hybrid SDVN Architecture: A Graph Learning Based Method

Reuse-based online joint routing and scheduling optimization mechanism in deterministic networks

Deterministic networks plan the entire network traffic and calculate the scheduling time to meet the critical traffic requirements of specific domains, enabling real-time and deterministic interaction of massive data. However, in dynamic industrial automation scenarios where devices undergo changes, existing mechanisms face challenges in quickly responding to dynamic transmission demand changes caused by rapid traffic migration. To address this issue, this paper proposes a reuse-based online scheduling mechanism that utilizes dynamic path planning of flows and coordinated scheduling of time slots to achieve deterministic transmission of dynamic flows. In the offline phase, the mechanism proposes a backbone link selection and a scalable intelligent routing strategy, constructs a set of routing and scheduling co-design constraints, and generates an offline scheduling table using an iterative scheduling algorithm. In the online scheduling phase, a reuse-based online scheduling algorithm is proposed to achieve rapid scheduling and deterministic transmission of dynamic real-time flows. It utilizes the offline scheduling results and the period offset of migrated flows. The reuse of offline scheduling results reduces computation time and expands the solution space. Experimental results demonstrate that the proposed mechanism achieves a maximum increase in scheduling success rate of 37.3% and reduces time costs by up to 66.6% compared to existing online scheduling algorithms.

COMPARING THE PERFORMANCE OF OSPF AND OSPF-MPLS ROUTING PROTOCOL IN FORWARDING TCP AND UDP PACKET

Routing is an important process in computer networks, which involves selecting a path for packet data. The routing mechanism is governed by protocols at layer three of the OSI model or layer two of the TCP/IP model. Routing can be static or dynamic, with dynamic routing algorithms automatically determining the best path in the network. One commonly used dynamic routing protocol is Open Shortest Path First (OSPF), which automatically selects the optimal route for data packets based on received network topology information. The need for more advanced and scalable routing solutions led to the development of Multi-Protocol Label Switching (MPLS), introducing the concept of label switching for faster and more efficient data forwarding. This research aims to analyze the performance of OSPF and OSPF MPLS routing scenarios regarding TCP and UDP services. Through evaluation of Quality of Service (QoS) parameters, including throughput, packet loss, delay, and jitter. This study simulates the network using GNS3 software, with TCP and UDP services transmitted for durations of 15, 30, and 60 seconds. The results showed performance for both scenarios with an average index value of 3.75, indicating "good" network performance according to TIPHON standards across all measurement sessions. Although MPLS OSPF showed slightly lower throughput compared to non-MPLS OSPF, both scenarios showed very low packet loss, low delay, and stable jitter. The evaluation also highlights that the use of OSPF MPLS for UDP services reduces the time delay. Both non-MPLS OSPF and MPLS OSPF effectively support TCP and UDP services, with MPLS OSPF showing advantages in certain QoS parameters, especially for UDP services.

Routing approaches in named data network: a survey and emerging research challenges

Named Data Networking (NDN) has emerged as a promising information-centric networking paradigm that addresses the limitations of the traditional IP-based Internet architecture. The core principle of NDN relies on content naming instead of host addressing, to provide efficient, secure, and scalable content delivery. Routing is a critical component of NDN and is responsible for discovering and maintaining optimal paths to named content. This paper presents a comprehensive review of routing techniques in NDN, focusing on the design principles, algorithms, and performance metrics, especially in wired network architecture. We first summarize the NDN architecture and discuss its key components. We then delve into the fundamental routing concepts in NDN and categorize and examine various routing techniques, including link state, distance vector, and centralized approaches based on Software Defined Network. We also summarize the relevant research efforts proposed to address NDN routing challenges by focusing more on wired network architecture. Finally, we identify open research issues and future directions in NDN routing, emphasizing the need for scalable, efficient, and secure routing techniques that can fulfill the growing demands of the modern Internet. In conclusion, this review serves as a valuable reference for researchers and practitioners in NDN, offering a comprehensive understanding of the current state-of-the-art routing techniques, limitations, and potential future advancements.

Secure and Energy-Based STEERA Routing Protocol for Wireless Sensor Networks

In wireless sensor networks (WSN), the multifunctional low-power sensor nodes are linked to base stations and are highly responsible for sensing various information. However, maintaining the network’s lifespan is a major issue because of limited battery capacity and node failures. Thus, the proposed study introduced a new Scalable Trust-based Energy Efficient Routing Algorithm (STEERA) with Adaptive Grasshopper Algorithm (AGA) to enhance the network lifespan. At first, the trust values (Tv) are generated for each node to eliminate the malicious node with the help of penalty factor and volatilization. To make efficient routing process, the nodes are formed into cluster groups. A suitable cluster head is selected for each cluster to mitigate the energy consumption problem through the AGA approach by optimizing the parameters like Tv, distance and residual energy. Finally, the data packets are effectively transmitted through a multi-hop routing process by selecting an appropriate path and satisfying certain parameters through Fire Hawks Optimization (FHO). To simulate the proposed techniques, NS2 software is employed, and the performance is measured over various metrics like energy consumption, residual energy, the lifespan of a network, packet loss ratio and average end-to-end delay. The performance analysis shows that the proposed protocol design has obtained higher results than conventional routing protocols.

Upward scalable vehicle routing problem of automobile inbound logistics with pickup flexibility

Motivated by the inbound logistics of a famous automobile manufacturing company, we introduce the upward scalable vehicle routing problem (for order pickup) with time windows (USVRPTW), where the pickup from each supplier can be adjusted upward by a certain degree (pickup flexibility) based on the order volume, thus increasing the vehicle utilization and reducing logistics cost. We solve the USVRPTW exactly by a branch-and-price algorithm, where the flexibility affects the pricing problem, leading to the elementary shortest path problem having to consider resource allocation except the resource constraints. The consideration of resource allocation adds many new properties to the shortest path problem, based on which we design a tree search algorithm. We develop a heuristic algorithm based on the bipartite graph to generate initial columns for the column generation (CG) process. The algorithm can also be adopted as an efficient method for solving large-scale problems due to its ability to find near-optimal solutions quickly. We also propose the penalty stabilization method and the drill-down strategy to accelerate CG. Numerical experiments show that our designed branch-and-price algorithm outperforms the commercial solver Gurobi. The efficiency of the tree search algorithm, the heuristic algorithm, and the CG acceleration methods is also verified. Real-data experiments illustrate that the low increase in driving cost can significantly improve vehicle utilization, proving the significance of flexibility. We then provide management insights to reveal that adopting the proposed flexibility mechanism can reduce logistics cost.

The measurement and monitoring of Quality of service based on security analysis in wireless sensor network using deep learning architecture

Wireless sensor networks comprise of unattended little sensor hubs having low energy and low scope of correspondence. Machine learning has demonstrated its effectiveness in creating proficient cycles to deal with complex issues in different organization perspectives. This exploration propose novel procedure in wireless sensor network routing and security improvement by network observing utilizing profound learning model. The organization routing is done utilizing cluster based scalable hierarchical energy routing protocol (CSHERP) and the organization checking is completed utilizing fuzzy Boltzmann adversarial learning (FBAL). This routing protocol adopts an information driven strategy, with moderate hubs collecting information and sending it to a sink hub. The arrangement gave is valuable to additional investigation of expanded WSN networks. The trial examination is completed as far as energy efficiency, throughput, end-end delay, latency, QoS. The proposed technique attained energy efficiency of 96%, throughput of 91%, end-end delay of 86%, latency of 85%, QoS of 96%.

Scalable Deep Reinforcement Learning-Based Online Routing for Multi-Type Service Requirements

Emerging applications raise critical QoS requirements for the Internet. The improvements in flow classification technologies, software-defined networks (SDN), and programmable network devices make it possible to fast identify users' requirements and control the routing for fine-grained traffic flows. Meanwhile, the problem of optimizing the forwarding paths for traffic flows with multiple QoS requirements in an online fashion is not addressed sufficiently. To address the problem, we propose DRL-OR-S, a highly scalable online routing algorithm using multi-agent deep reinforcement learning. DRL-OR-S adopts a comprehensive reward function, an efficient learning algorithm, and a novel deep neural network structure to learn appropriate routing strategies for different types of flow requirements. In order to enhance the generalization and scalability, we propose a novel graph-based actor-critic network architecture and a carefully designed input state for DRL-OR-S. To accelerate the training process and guarantee reliability, we further introduce an NN-simulator for efficient offline training and a safe learning mechanism to avoid unsafe routes during the online routing process. We implement DRL-OR-S under SDN architecture and conduct Mininet-based experiments using real network topologies and traffic traces. The results validate that DRL-OR-S can well satisfy the requirements of latency-sensitive, throughput-sensitive, latency-throughput-sensitive, and latency-loss-sensitive flows at the same time, while exhibiting great adaptiveness and reliability under the scenarios of link failure, traffic change, unseen large topology and partial deployment.

A social relationship-based energy efficient routing scheme for Opportunistic Internet of Things

Opportunistic Internet of Things (OppIoT) combines Opportunistic Networks and the Internet of Things to provide opportunistic communication between IoT devices and human-created communities in order to improve network connectivity, reliability, and longevity. This is significant because it introduces a new approach to connect and communicate smart devices in situations where there is no end-to-end connectivity. Due to the non-stable existence of connectivity between nodes, building a scalable, flexible, interoperable, and energy efficient routing protocol is a difficult issue. This study presents a new routing protocol for the Opportunistic Internet of Things called Social relationship based Energy Efficient Routing (SEER), which bases routing decisions on the forwarding feasibility degree, residual energy, and buffer capacity of nodes. SEER surpasses EBR and EDR in terms of delivery probability, hop count, and overhead ratio, according to simulation results utilizing the Opportunistic Network Environment (The ONE) simulator.

Joint congestion and contention avoidance in a scalable QoS-aware opportunistic routing in wireless ad-hoc networks.

Opportunistic routing (OR) can greatly increase transmission reliability and network throughput in wireless ad-hoc networks by taking advantage of the broadcast nature of the wireless medium. However, network congestion is a barrier in the way of OR's performance improvement, and network congestion control is a challenge in OR algorithms, because only the pure physical channel conditions of the links are considered in forwarding decisions. This paper proposes a new method to control network congestion in OR, considering three types of parameters, namely, the backlogged traffic, the traffic flows' Quality of Service (QoS) level, and the channel occupancy rate. Simulation results show that the proposed algorithm outperforms the state-of-the-art algorithms in the context of OR congestion control in terms of average throughput, end-to-end delay, and Packet Delivery Ratio (PDR). Due to the higher PDR at different traffic loads and different node densities, it can be concluded that the proposed algorithm also improves network scalability, which is very desirable given the recent changes in wireless networks.

Neural Network-based Dynamic Clustering Model for Energy Efficient Data Uploading and Downloading in Green Vehicular Ad-hoc Networks

Green VANET is an emerging field of research that spurs interest in energy consumption management for the development of smart cities. It also presents a unique variety of research problems for developing trustworthy and scalable routing protocols as vehicles are susceptible to the restrictions of road geometry and the barriers which limit networking capabilities in urban environments. Clustering is a process of assembling vehicle nodes to create a powerful and effective network infrastructure. According to recent studies, clustering-based routing algorithms in green VANET may significantly improve networking effectiveness and lower infrastructure costs. However, sometimes the vehicle nodes are unaware of their OBU energy consumption, which causes network execution issues and topological alterations. In such instances, the energy consumption of onboard sensors becomes a major problem in the clustering-based routing protocol. Hence, this paper proposes a self-organizing map neural network (SOMNN) based dynamic clustering model to identify energy-efficient nodes from each cluster for vehicular data uploading and downloading applications. The simulation results demonstrate that the proposed model solves network lifetime issues and provides superior network effectiveness with enhanced communication stability. The suggested dynamic clustering model reduces network energy consumption by 26% and 18% in comparison to k – means (KM) and fuzzy c – means (FCM) based clustering model.

Cross-Layer Design for Energy-Efficient Reliable Multi-Path Transmission in Event-Driven Wireless Sensor Networks.

In event-driven wireless sensor networks (WSNs), a reliable, efficient, and scalable routing solution is required for the reliable delivery of sensory data to the base station (BS). However, existing routing algorithms rarely address the issue of energy efficiency under multi-path conflicts for multi-event-driven scenarios. In order to maximize energy efficiency while maintaining a manageable conflict probability, this paper investigates a cross-layer design of routing and power control for multi-event-driven WSNs. We first develop a mathematical characterization of the conflict probability in multi-path routing, and we then formulate the energy efficiency maximization problem as a non-convex combinatorial fractional optimization problem subject to a maximum conflict probability constraint. By utilizing non-linear fractional programming and dual decomposition, an iterative search algorithm was used to obtain near-optimal power allocation and routing solutions. Extensive results demonstrate that our proposed algorithm achieved a gain of 9.09% to 35.05% in energy efficiency compared to other routing algorithms, thus indicating that our proposed algorithm can avoid unnecessary control overhead from multi-path conflicts with a lower conflict probability and can ensure maximum energy efficiency through routing and power control design.