scispace - formally typeset
Search or ask a question

Showing papers on "Routing table published in 2022"


Journal ArticleDOI
TL;DR: In this article , the authors proposed a learning-based topology-aware routing (QTAR) protocol for FANETs to provide reliable combinations between the source and destination.
Abstract: Flying ad hoc networks (FANETs) have emanated over the last few years for numerous civil and military applications. Owing to underlying attributes, such as a dynamic topology, node mobility in 3-D space, and the limited energy of unmanned aerial vehicles (UAVs), a routing protocol for FANETs is challenging to design. Exiting topology-based routing is unsuitable for highly dynamic FANETs. Location-based routing protocols can be preferred for FANETs owing to their scalability, but are based on one-hop neighbor information and do not contemplate the reachability of further appropriate nodes for forwarding. Owing to the rapid mobility of UAVs, the topology frequently changes; thus, some route entries in the routing table can become invalid and the next-hop nodes may be unavailable before a timeout. That is, the routing decision based on one-hop neighbors cannot assure a successful delivery. In this study, we propose a novel $Q$ -learning-based topology-aware routing (QTAR) protocol for FANETs to provide reliable combinations between the source and destination. The proposed QTAR improves the routing decision by considering two-hop neighbor nodes, extending the local view of the network topology. With the ${Q}$ -learning technique, QTAR adaptively adjusts the routing decision according to the network condition. Our simulation results reveal that QTAR outstrips the existing routing protocols in respect of various performance metrics under distinct scenarios.

33 citations



Journal ArticleDOI
TL;DR: Proposed enhanced self-organization of data packet (EAOD) mechanism is planned to aggregate the data packet sequencially from network structure to reduce the packet loss rate and increase network lifetime.
Abstract: The mobile nodes are infrequent movement in nature; therefore, its packet transmission is also infrequent. Packet overload occurred for routing process, and data are lossed by receiver node, since hackers hide the normal routing node. Basically, the hidden node problem is created based on the malicious nodes that are planned to hide the vital relay node in the specific routing path. The packet transmission loss occurred for routing; so, it minimizes the packet delivery ratio and network lifetime. Then, proposed enhanced self-organization of data packet (EAOD) mechanism is planned to aggregate the data packet sequencially from network structure. The hacker node present in routing path is easy to separate from network with trusty nodes. In order to secure the regular characteristics of organizer node from being confirmed as misbehaving node, the hidden node detection technique is designed for abnormal routing node identification. This algorithm checks the neighboring nodes that are hacker node, which hide the trust node in the routing path. And that trust nodes are initially found based on strength value of every node and assign path immediately. It increases network lifetime and minimizes the packet loss rate.

24 citations


Journal ArticleDOI
TL;DR: In this paper , the authors proposed a position-based reliable emergency message routing (REMR) scheme based on mobility metrics, which exploits the vehicle moving behaviors to enhance emergency message delivery.
Abstract: Reliable emergency message (EM) transmission in vehicular adhoc networks (VANETs) necessitates an effective routing scheme. Position-based routing is considered more suitable for VANETs for not having to maintain any routing table or sharing connection states with neighbors. However, position-based routing is challenging in VANETs because vehicles change their positions instantly, and the next-hop can often go out of the communication range in greedy forwarding mode. This unstable behavior of the next-hop triggers route redundancy and leads to a high end-to-end delay (ED) and lower packet delivery ratio (PDR). Moreover, routing decisions based on a next-hop (relay) vehicle may be less optimal if we do not consider the stability and predict the position of a next-hop vehicle in such dynamic environments. To that end, we propose a position-based reliable emergency message routing (REMR) scheme based on our mobility metrics, which exploits the vehicle moving behaviors to enhance EM delivery. We describe how the choice of next-hop in greedy forwarding can be enhanced by leveraging neighbor’s future location information. By taking into account the Euclidean distance and position information, REMR predicts the relative positions of neighbor vehicles to exclude unstable neighbors from the list of candidate next-hops. In addition, REMR employs the vehicles’ movement information (e.g., position, speed variation, and moving angle) to minimize a possible link disruption and to choose an optimal next-hop for robust routing of EMs. REMR also offers a beaconing control strategy to enhance message reliability and to deal with the problem of beacons congestion. To minimize beacons congestion, REMR adjusts the beacon interval based on the neighborhood density. By consolidating mobility metrics and beacon control strategy, REMR can respond adequately to variation in the network traffic and frequent topology changes as validated by our simulation results.

19 citations


Journal ArticleDOI
TL;DR: This paper proposes a new technique in implementing the chip in order to maintain the data privacy of NoC routers by embedding advanced TACIT security algorithm in Virtex-5 FPGA.
Abstract: In the technical world, NoC (network-on-chip) is a noticeable communication subsystem based on integrated circuits. It is mainly used in improving the performance of system-on-chip (SoC) by bridging the intellectual properties in the SoCs. But there is a need of protected architecture which is dealing with routing and processing data in the multicore system-on-chip (SoC). The recent issue with the above is there is still a drawback in enabling a better network routing system for accessing physical networks. The methodology of NoC mainly depends on the routing scheme, switching techniques, and structuring topologies. In this paper, we propose a new technique in implementing the chip in order to maintain the data privacy of NoC routers. There are many works with different algorithms that were evolved in enabling the secureness of NoCs, but due to the key size and block size, it is still not able to reach the expected effectiveness. Our proposed work is intended in designing a NoC architecture by means of embedding advanced TACIT security algorithm in Virtex-5 FPGA. Here, we used a hash function which is under a 4 hash function (4-H) scheme. The main advantage of this key generation scheme is it is applicable for block size and key size up to ‘ n ’ bit. Thus, this TACIT security algorithm enables ‘ n ’ bit using the software VHDL programming language in Xilinx ISE 14.2 and Modelsim 10.1 b which are applicable for 1024 bit and ‘ N ’ bits of block size on Virtex-5 FPGA systems. This design system can be enhanced by improving the factors like timing parameters, supporting memory, higher frequencies, and utilized summaries.

14 citations


Journal ArticleDOI
07 Feb 2022-PLOS ONE
TL;DR: In a new scenario called FB-DBR, clustering is performed, and fuzzy logic and bloom filter are used in each cluster’s new routing protocol in underwater wireless sensor networks, and better results are obtained and bloom filters areused in routing tables to compensate for the deceleration.
Abstract: Routing protocols for underwater wireless sensor networks (UWSN) and underwater Internet of Things (IoT_UWSN) networks have expanded significantly. DBR routing protocol is one of the most critical routing protocols in UWSNs. In this routing protocol, the energy consumption of the nodes, the rate of loss of sent packets, and the rate of drop of routing packets due to node shutdown have created significant challenges. For this purpose, in a new scenario called FB-DBR, clustering is performed, and fuzzy logic and bloom filter are used in each cluster’s new routing protocol in underwater wireless sensor networks. Due to the fuzzy nature of the parameters used in DBR, better results are obtained and bloom filters are used in routing tables to compensate for the deceleration. as the average number of accesses to routing table entries, dead nodes, Number of Packets Sent to Base Station (BS), Number of Packets Received at BS, Packet Dropped, and Remaining Energy has improved significantly.

6 citations



Journal ArticleDOI
TL;DR: In this article , the authors present a library that allows to integrate LoRa end nodes into a LoRa mesh network, in which a routing protocol is used to send and receive data packets to and from other nodes in the LoRA mesh network.
Abstract: LoRa is a popular communication technology in the Internet of Things (IoT) domain, providing low-power and long-range communications. Most LoRa IoT applications use the LoRaWAN architecture, which builds a star topology between LoRa end nodes and the gateway they connect to. However, LoRa can also be used for the communication between end nodes themselves, forming a mesh network topology. In this paper, we present a library that allows to integrate LoRa end nodes into a LoRa mesh network, in which a routing protocol is used. Thus, an IoT application running on these nodes can use the library to send and receive data packets to and from other nodes in the LoRa mesh network. The designed routing protocol is proactive, and maintains the routing table at each node updated by sending routing messages between neighboring nodes. The implemented library has been tested on embedded boards featuring an ESP32 microcontroller and a LoRa single-channel radio. By using our LoRa mesh library, nodes do not need to connect to a LoRaWAN gateway, but among themselves. This opens the possibility for new, distributed applications solely built upon tiny IoT nodes.

4 citations


Journal ArticleDOI
TL;DR: A comprehensive survey of FPGA-based TCAMs implemented using block random access memory (BRAM), lookup table RAM (LUTRAM), and flip-flops (FFs) is presented in this paper.

4 citations


Journal ArticleDOI
TL;DR: The proposed Grafnet model is able to work as a direct address translator without the need for tables in the forwarding plane of a router, and is evaluated as an SDN scheme on a 75-node US-core network and 2000-node, 5 million IP address-based random WAN topology.
Abstract: Grafnet, a Graph Neural-Network (GNN)-based scheme learns IP-address-to-port mapping, leading to forwarding table-less routers. GNNs allow mapping network-wide features like adjacencies and addresses to generate new representations. Grafnet converts network-wide IP addresses to a feature space using GNNs. GNNs extrapolate node adjacencies onto a feature matrix, whose output tells which address/subnet is connected to a node and port. To do so, we use a GNN in conjunction with an Artificial Neural Network (ANN), whose output transforms graph adjacencies to address-based adjacencies. We exploit the fact that IP addresses are present in contiguous groups (subnets) or ‘ranges’. Large range sizes imply a better likelihood of Grafnets’ approximation, though with enough learning Grafnet learns just about all network-wide IP addresses, irrespective of range sizes. Grafnet is evaluated as an SDN scheme on (1) 75-node US-core network and (2) 2000-node, 5 million IP address-based random WAN topology. Analytically, we show equivalence between Grafnet and a Feed-forward neural network implying exhaustiveness and correctness. The proposed Grafnet model is able to work as a direct address translator without the need for tables in the forwarding plane of a router. Engineering considerations to implement Grafnet are also discussed.

3 citations


Journal ArticleDOI
TL;DR: In this article , the authors proposed a scheme for FIB construction from the information communicated through content advertisement, which is governed by Bloom Filter (BF) enabled content advertisement and the Interest forwarding is guided by information gradient.

Proceedings ArticleDOI
13 Jun 2022
TL;DR: KIRA is presented, a two-tier routing architecture that provides self-organized, zero-touch, and extremely robust control plane connectivity that converges loop-free and fast, even in very large networks with drastic failure scenarios.
Abstract: Emerging network infrastructures are increasingly softwarized, virtualized and, thus, flexible. They may even be viewed as a large, dynamic, and distributed elastic resource pool of network devices that can be flexibly configured and employed according to the needs of network services. Full control of such a resource pool requires resilient control plane connectivity. In this paper, we present KIRA, a two-tier routing architecture that provides self-organized, zero-touch, and extremely robust control plane connectivity. KIRA consists of the distributed, highly scalable, ID-based routing protocol R2//Kad that can run on top of any link layer. It is complemented by a forwarding tier with PathID-based fast forwarding for (control) data packets. KIRA shows excellent performance even in very large networks (evaluated with up to 200 000 nodes). R2/ Kad allows for flexible memory/stretch tradeoff per node and finds shortest paths to certain destinations in most cases. R2//Kad converges loop-free and fast, even in very large networks with drastic failure scenarios.


Journal ArticleDOI
TL;DR: In this article , a policy-based routing algorithm is proposed to take advantage of free IP addresses from the free IP pool, which enables efficient use of available flow table space in SDN architecture due to the small flow table size.
Abstract: Software-defined networking makes forwarding devices easier to manage and provides centralized control. Because of the centralization, a network administrator can programme the devices cheaply. Network administrators make attempts to convert their entire network into SDN-compatible switches. A good balance of SDN and legacy switching functions can lead to a successful network scenario in network architecture. In this study, a hybrid network scenario is provided in which the external boundary forwarding devices of the service provider network are replaced with SDN devices. Still, the other internal forwarding devices continue to operate traditionally. The benefits of both SDN and legacy network design are combined, allowing the network administrator to reap the benefits of both. The network architecture employs a policy-based routing algorithm that takes advantage of free IP addresses from the free IP pool. The technique enables efficient use of available flow table space, which is critical in SDN architecture due to the small flow table size. The algorithm’s efficiency is assessed using performance metrics such as network path stretch, throughput, latency delay, and so on, compared to traditional SDN controllers such as OpenDayLight, NOX, and POX. According to the experimental results, the suggested approach outperforms specific similar state-of-the-art techniques in the hybrid SDN domain.

Journal ArticleDOI
04 Jan 2022-Sensors
TL;DR: In this article , the authors proposed a probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date.
Abstract: With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.

Proceedings ArticleDOI
06 Sep 2022
TL;DR: A work-in-progress evaluation on the relationship between routing, forwarding strategy, and sync for scenarios with ad hoc mobile conditions with intermittent connectivity is reported.
Abstract: Routing, forwarding strategy, and dataset synchronization (sync) are three well-known components of Named Data Networking (NDN). This poster reports a work-in-progress evaluation on the relationship between routing, forwarding strategy, and sync, especially for scenarios with ad hoc mobile conditions with intermittent connectivity.

Journal ArticleDOI
TL;DR: In this paper , a Q-learning and fuzzy logic-based hierarchical routing protocol (QFHR) is proposed for VANETs, which consists of three main phases: identifying traffic conditions, routing algorithm at the intersection level, and routing at the road level.
Abstract: A vehicular ad hoc network (VANET) is the major element of the intelligent transportation system (ITS). The purpose of ITS is to increase road safety and manage the movement of vehicles. ITS is known as one of the main components of smart cities. As a result, there are critical challenges such as routing in these networks. Recently, many scholars have worked on this challenge in VANET. They have used machine learning techniques to learn the routing proceeding in the networks adaptively and independently. In this paper, a Q-learning and fuzzy logic-based hierarchical routing protocol (QFHR) is proposed for VANETs. This hierarchical routing technique consists of three main phases: identifying traffic conditions, routing algorithm at the intersection level, and routing algorithm at the road level. In the first phase, each roadside unit (RSU) stores a traffic table, which includes information about the traffic conditions related to four road sections connected to the corresponding intersection. Then, RSUs use a Q-learning-based routing method to discover the best path between different intersections. Finally, vehicles in each road section use a fuzzy logic-based routing technique to choose the foremost relay node. The simulation of QFHR has been executed on the network simulator version 2 (NS2), and its results have been presented in comparison with IRQ, IV2XQ, QGrid, and GPSR in two scenarios. The first scenario analyzes the result based on the packet sending rate (PSR). In this scenario, QFHR gets better the packet delivery rate by 2.74%, 6.67%, 22.35%, and 29.98% and decreases delay by 16.19%, 22.82%, 34.15%, and 59.51%, and lowers the number of hops by 6.74%, 20.09%, 2.68%, and 12.22% compared to IRQ, IV2XQ, QGrid, and GPSR, respectively. However, it increases the overhead by approximately 9.36% and 11.34% compared to IRQ and IV2XQ, respectively. Moreover, the second scenario evaluates the results with regard to the signal transmission radius (STR). In this scenario, QFHR increases PDR by 3.45%, 8%, 23.29%, and 26.17% and decreases delay by 19.86%, 34.26%, 44.09%, and 68.39% and reduces the number of hops by 14.13%, 32.58%, 7.71%, and 21.39% compared to IRQ, IV2XQ, QGrid, and GPSR, respectively. However, it has higher overhead than IRQ (11.26%) and IV2XQ (25%).

Journal ArticleDOI
TL;DR: This paper proposes an algorithm to determine the egress node that is the exit of the segment routing section for all destination nodes with only three shortest- path tree calculations.
Abstract: SUMMARY Recently, segment routing, which is a modern forwarding mechanism, and Topology Independent Loop-free Alternate, which is an IP fast-reroute method using segment routing, have been proposed and have begun to be applied to real networks. When a failure occurs in a network, TI-LFA quickly restores packet forwarding without waiting for other nodes to update their routing tables. It does so by using segment routing to forward sections that may cause loops in the rerouting path. However, determining the segment routing sections has a high computational cost because it requires computation for each destination. This paper therefore proposes an algorithm to determine the egress node that is the exit of the segment routing section for all destination nodes with only three shortest- path tree calculations. The evaluation results of the proposed algorithm showed that the average tunnel lengths are at most 2.0 to 2.2 hops regardless of the size of the network. I also showed that the computational complexity of the proposed algorithm is O ( N log N ) .

Journal ArticleDOI
TL;DR: In this article , an adaptive routing algorithm based on inline-formula was proposed, which can avoid the unnecessary detour of data in the fault area and select the path with less congestion.
Abstract: Link failure and network congestion have a serious impact on the performance degradation of network on chip (NoC). Adaptive routing algorithms, which have the capability of fault tolerance and congestion awareness, can make NoCs adapt to complex and changeable applications. The proposed algorithm in this letter is an adaptive routing algorithm based on $Q$ -learning. By introducing $H - Q$ table to learn the congestion and fault information of the paths between the source node and the destination node, it can avoid the unnecessary detour of data in the fault area and select the path with less congestion. Aiming at the problem caused by the untimely updating of some values in $Q$ -learning, the $Q$ -value decay and dynamic learning rate mechanism are proposed. Experimental results demonstrate that the proposed routing algorithms still can obtain a good performance under a high failure rate (Fault rate >25%) with modest extra hardware overhead.

Book ChapterDOI
01 Jan 2022
TL;DR: In this paper , the authors proposed the ant colony-based shortest path routing algorithm (AC*) to illustrate typical topologies, which decouples the control plane from the data forwarding plane, and topology description language (TPDL) files are utilized as prerequisite information to establish initial topology in SDN controllers.
Abstract: The exponential growth of cloud computing has resulted in the rapid creation of data center networks (DCNs). As data center networks have grown in popularity, efficient routing has become a critical problem for maximizing network performance, scalability, and reliability. Traditional link-state algorithms are widely used in data center networks, but they take a longer convergence time. In DCN, topology-aware routing algorithms were recently discovered to be efficient. This paper proposes the ant colony-based shortest path routing algorithm (AC*) to illustrate typical topologies. To guarantee unified control of the whole network, this approach decouples the control plane from the data forwarding plane, and topology description language (TPDL) files are utilized as prerequisite information to establish initial topology in the software-defined network (SDN) controllers. Unlike other topology-aware routing algorithms, the ant colony-based shortest path routing algorithm (AC*) is designed to work on a variety of standard topologies. The AC* algorithm outperforms traditional link-state routing methods according to the results of the experiments.

Journal ArticleDOI
TL;DR: This paper proposes an algorithm to calculate the generalized next hops with strict partial order (GSPO next hops) of a network prefix and use them for the aggregation of the Nexthop-Selectable Forwarding Information Base (NSFIB).
Abstract: The size of the global routing table has been growing at an alarming rate. With the exhaustion of IPv4 addresses and the gradual deployment of IPv6 networks, the growth rate will continue to accelerate in the future. Although modern high performance routers provide enough line-card memory, Internet Service Providers (ISPs) cannot afford to upgrade their routers as fast as the growth of global routing tables. In this paper, we propose an algorithm to calculate the generalized next hops with strict partial order (GSPO next hops) of a network prefix and use them for the aggregation of the Nexthop-Selectable Forwarding Information Base (NSFIB). Since the existing NSFIB aggregation algorithm may introduce path stretch, we also propose a weighted NSFIB aggregation algorithm to effectively control path stretch under a given upper limit of the FIB size. Experiment results show that our algorithm can shrink the FIB size by at most 97% under IPv4 networks, and at most 95% under IPv6 networks. Under a given upper limit of the FIB size, our algorithm can reduce the path stretch by at least 22%.

Journal ArticleDOI
TL;DR: CBFeng et al. as mentioned in this paper presented a memory-optimized binary search (MOBS) algorithm in the counting Bloom filter (CBF), which decreases memory consumption by reducing the storage of prefix marker entries while maintaining the fast lookup efficiency.

Journal ArticleDOI
TL;DR: The Publish-Subscribe network as mentioned in this paper uses destination driven multicast routing algorithm (DDMC) to select the shortest path in the network and active match published information, where the receiver and sender don't expect to be active at the same time, don't know each other's addresses, and don't use any blocking mechanisms or client send requests and server replay responses.
Abstract: The internet’s architecture today has a problem in routing information depending on what the receiver is interested in without knowing the sender and receiver addresses. As a result, the Publish-Subscribe paradigm was developed. In this network, we build and use in the design, implementation, and evaluation of Publish-Subscribe network via destination driven multicast routing algorithm for selecting the shortest path in the network. Basically, the networks have Router to perform routing mechanism, the publisher is the producer of information, and the subscriber is the consumer of information with their own deferent type of module for facilitating their function. Every connection in the network is bidirectional way of communication (an undirected graph) with random seed available in the network. Each Router has topology management module for creating a picture of the networks and computing the available path. It informs to the forwarder in order to send the information of network for intended receiver. Record table module used for recording of the network information comes from the subscriber or the publisher via link state advertisement then it informs to the topology manager. In this network, the receiver and sender don’t expect to be active at the same time, don’t know each other’s addresses, and don’t use any blocking mechanisms or client send requests and server replay responses. The Publish-Subscribe network is first developed and designed enough, after which it is implemented and evaluated using the destination driven multicast routing algorithm (DDMC) to pick the shortest path in the network and active match published information. The proposed work evaluated via total bit (produced 1,000,000 bit per second), and throughput was 83.33%.


Journal ArticleDOI
TL;DR: The models described, based on the average greedy packet forwarding distance measures, showed distinct distribution patterns of the dissimilarity indices when applied to the example multi-greedy routing environment consisting of the ELLIPSOID and the GREEDY forwarding metrics.
Abstract: Characterizing the topology of MANETs provides the means for packet routing protocols to perform adaptively and efficiently in the particular environments. We show that the geographic routing’s greedy packet forwarding distance dissimilarity distributions in relation to node size characterizes MANET topologies and supports efficient multi-greedy forwarding. The models we described, based on the average greedy packet forwarding distance measures, showed distinct distribution patterns of the dissimilarity indices when applied to the example multi-greedy routing environment consisting of the ELLIPSOID and the GREEDY forwarding metrics. The scheme demonstrates the potential for adaptive forwarding performance to improve successful packets delivery in environments of high node-size variations such as VANETs.

Proceedings ArticleDOI
01 Dec 2022
TL;DR: NBMon as mentioned in this paper is an NB-IoT-based routing monitoring system for UAV networks, which can upload the routing table information from the host device to a control station through the NBIOT network, at the same time the control station can also send commands to the monitored devices to change routes.
Abstract: The routing state of UAV networks is difficult to monitor, making many new routing protocols hard to evaluate on UAVs. In this paper, we propose NBMon, an NB-IoT-based routing monitoring system for UAV networks, which can upload the routing table information from the host device to a control station through the NB-IoT network. At the same time, the control station can also send commands to the monitored devices to change routes. However, one challenge is that both NB-IoT modules and the control station are behind NAT without global IP addresses. We propose a NAT traversal method on top of NB- IoT. It allows communication between the NB-IoT modules and the control station in different networks. Finally, we implement NBMon and evaluate the performance of NB-IoT devices through real-world experiments.

Journal ArticleDOI
TL;DR: In this paper , the authors proposed a novel destination-based traffic engineering solution called FlexEntry, which leverages emerging reinforcement learning (RL) to reduce the time complexity and routing update overhead while achieving good network performance simultaneously.
Abstract: Traffic Engineering (TE) is a widely-adopted network operation to optimize network performance and resource utilization. Destination-based routing is supported by legacy routers and more readily deployed than flow-based routing, where the forwarding entries could be frequently updated by TE to accommodate traffic dynamics. However, as the network size grows, destination-based TE could render high time complexity when generating and updating many forwarding entries, which may limit the responsiveness of TE and degrade network performance. In this paper, we propose a novel destination-based TE solution called FlexEntry, which leverages emerging Reinforcement Learning (RL) to reduce the time complexity and routing update overhead while achieving good network performance simultaneously. For each traffic matrix, FlexEntry only updates a few forwarding entries called critical entries for redistributing a small portion of the total traffic to improve network performance. These critical entries are intelligently selected by RL with traffic split ratios optimized by Linear Programming (LP). We find out that the combination of RL and LP is very effective. Our simulation results on six real-world network topologies show that FlexEntry reduces up to 99.3% entry updates on average and generalizes well to unseen traffic matrices with near-optimal load balancing performance.

Journal ArticleDOI
TL;DR: M-PolKA as mentioned in this paper is a topology-agnostic multipath source routing scheme and orchestration architecture for reliable communications, which explores special properties from the Residue Number System (RNS) polynomial arithmetic.
Abstract: Innovative traffic engineering functions and services require disrupting routing and forwarding mechanisms to be performed with low overhead over complex network topologies. Source routing (SR) is a prominent alternative to table-based routing for providing the needed expressiveness and agility by reducing the number of network states. This work proposes the M-PolKA, a topology-agnostic multipath source routing scheme and orchestration architecture for reliable communications, which explores special properties from the Residue Number System (RNS) polynomial arithmetic. A P4-based proof-of-concept is experimentally demonstrated using emulated and hardware prototypes. Also, use cases for revealing M-PolKA’s functionalities are tested in different scenarios in order to address problems, such as communication reliability improvement, agile path migration and fast failure reaction. Finally, low overhead for extra functionalities is observed when RNS-based SR is compared to traditional routing approaches.

Journal ArticleDOI
TL;DR: The open router designed in this paper integrates Simple Network Management Protocol (SNMP) agent and SDN agent mechanism organically to achieve the goal of SDN network management and provides the visualization function of routing state and routing state data flow.
Abstract: Given the coexistence of heterogeneous hybrid networks such as IP network, 4G network and Software Defined Network (SDN) in the application of digital news media system, this paper designs a routing control algorithm based on SDN network architecture, which can realize the compatibility of internal gateway protocol and OpenFlow communication strategies. Through the analysis of OpenFlow communication protocol in SDN network architecture, the relationship between Interior Gateway Protocol (IGP) and OpenFlow routing rules is found out. Based on the existing hardware structure of the OpenFlow router, the configuration parameters of a port table, port address table and routing table are improved, and the adjacent routing relation table and information transmission port are used to realize the connection between routers are designed. The attention of users is considered It can reduce the burden of system operation and is compatible with the forwarding control of route forwarding and routing filtering. The adjacent routing relation table is designed to control the process of data collection, storage and forwarding, and the input and output ports between adjacent routers are defined. The open router designed in this paper integrates Simple Network Management Protocol (SNMP) agent and SDN agent mechanism organically to achieve the goal of SDN network management; the routing control module focuses on the management of key data flow, realizes the control of routing state and data flow at the same time, and provides the visualization function of routing state and routing state data flow. By constructing the experimental platform of routing transmission and control functions based on routing control and interior gateway protocol, the effect of routing state control of the two methods is compared and analysed from three aspects of packet transmission state, packet processing state and packet receiving delay in routing control process. The experimental results verify the correctness of the design results.