Routing Table Entries Research Articles

MaP: Increasing node capacity of programmable cloud gateways

Virtual routing table lookup is a crucial operation in multi-tenant cloud gateways, the essential devices to enable the elastic management of Virtual Private Clouds (VPCs). However, software-based cloud gateways face performance bottlenecks when handling ever-increasing traffic. To address this challenge, a recent trend involves accelerating virtual routing table lookups using programmable switches, with Sailfish being the state-of-the-art solution. Nonetheless, Sailfish’s table scale on a single programmable switch is limited by the ASIC memory sizes. We introduce a novel scheme, named MaP (Merge and Partition), to significantly increase the memory efficiency on a single Tofino 1.0 programmable switch. MaP exploits the similarities in routing table entries across various VPCs for table compression and leverages the hardware architecture of programmable chips to minimize the memory occupancy. Performance evaluations using real-world virtual routing tables demonstrate that our approach reduces the memory cost from 25% to 47.7% compared to Sailfish, without negatively impacting the throughput and latency. With MaP, a single programmable switch can manage a massive table containing over 2 million entries for nearly 1 million VPCs, while only occupying 59.0% of memory and 63.0% of stages.

Improvement of DBR routing protocol in underwater wireless sensor networks using fuzzy logic and bloom filter.

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.

Handover Scheme of LEO Satellite Network Based on Geographical Division Scenario

On the basis of completing the division of geographical regions, for the problem of satellite mobile handover, this paper proposes a satellite selection algorithm for selecting the satellite with the longest coverage time to reduce the handover rate. Also based on the idea of "centralized location management", this paper proposes the satellite handover scheme based on the geographical division scenario to update the satellite routing table entries and ensure the correct routing of data packets. Regarding the user handover problem, based on the idea of "decoupling data transmission and address update", a user handover scheme based on geographical division scenario is proposed, which reduces handover delay and signaling overhead compared to traditional satellite network handover schemes.

A Bio-inspired Routing Optimization in UAV-enabled Internet of Everything

Internet of Everything (IoE) indicates a fantastic vision of the future, where everything is connected to the internet, providing intelligent services and facilitating decision making. IoE is the collection of static and moving objects able to coordinate and communicate with each other. The moving objects may consist of ground segments and flying segments. The speed of flying segment e.g., Unmanned Ariel Vehicles (UAVs) may high as compared to ground segment objects. The topology changes occur very frequently due to high speed nature of objects in UAV-enabled IoE (Ue-IoE). The routing maintenance overhead may increase when scaling the Ue-IoE (number of objects increases). A single change in topology can force all the objects of the Ue-IoE to update their routing tables. Similarly, the frequent updating in routing table entries will result more energy dissipation and the lifetime of the Ue-IoE may decrease. The objects consume more energy on routing computations. To prevent the frequent updation of routing tables associated with each object, the computation of routes from source to destination may be limited to optimum number of objects in the Ue-IoE. In this article, we propose a routing scheme in which the responsibility of route computation (from neighbor objects to destination) is assigned to some IoE-objects in the Ue-IoE. The route computation objects (RCO) are selected on the basis of certain parameters like remaining energy and mobility. The RCO send the routing information of destination objects to their neighbors once they want to communicate with other objects. The proposed protocol is simulated and the results show that it outperform state-of-the-art protocols in terms of average energy consumption, messages overhead, throughput, delay etc.

Design and analysis of a hybrid mobility management scheme for wireless mesh network to handle highly mobile mesh clients

Nowadays, the importance of continuous connectivity of wireless network has increased because of increase in the number of applications in handheld devices. For offering continuous connectivity, seamless mobility management is very much necessary. Many mobility management schemes have been proposed. The techniques can broadly classified as, tunnel based scheme and routing based scheme. The tunnel based techniques has the advantage of limited route management packet transmission. But disadvantage is that besides source and destination addresses each of the data packets carry an extra header for routing. In case of routing based scheme, advantage is that the data packets do not carry any extra header for routing. But the disadvantage is that during handoff lots of route management packets are transmitted. As the mesh client speed increases, these problems further increase. Hybrid mobility management technique has been proposed in this paper for minimizing the problems of both tunnel based scheme and routing based scheme. It has been designed to handle highly mobile mesh clients. The proposed scheme routes internet packets using routing table entries. On the other hand, it uses tunneling to route the intranet packets to the destination. The hybrid scheme and some of the existing schemes have been analyzed and compared. Performance comparison shows that the hybrid scheme outperforms these techniques.

Mitigating Routing Attacks in Mobile Ad Hoc Networks

Mobile Ad hoc Networks have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. In existing solutions typically attempt to isolate malicious nodes based on binary or naive fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure. In this paper proposes a risk-aware response mechanism to systematically cope with the identified routing attacks. To avoid the routing attacks Dijkstra’s and Destination sequenced Distance Vector algorithm are used. Dijkstra's algorithm solves the single-source shortest-path problem when all edges have non-negative weights. The primary improvement for ad hoc networks made in DSDV over conventional distance vector is the addition of a sequence number in each routing table entry. Index Terms - Intrusion response, risk aware, dempster- shafer theory, Dijkstra’s algorithm, Destination sequenced Distance Vector.

A novel routing algorithm for IoT cloud based on hash offset tree

IoT-Cloud has been played significant role and helped doctors or physicians to add wisdom for healthcare, A data center network (DCN) and a software defined network (SDN) in IoT-Cloud are characterized by a considerable increase in routing table entries, substantial rise in network traffic and higher demands on route forwarding speed. To address these issues, an efficient prefix-matching algorithm that combines the strengths of the hash and Trie methods is proposed to look up and forward the packets more efficiently in the SDN for Healthcare IoT-Cloud. To achieve this objective, the presented study designs a hash offset Trie match on longest prefix (HOTMLP) algorithm. The routing table matching on longest prefix is divided into common prefix match and feature prefix match in this routing algorithm. Common parts of all route prefixes are stored using the hash table to reduce storage space and matching step size. The exact prefix-matching entry is identified using the Trie method. Theoretical analysis demonstrates that the proposed algorithm looks up faster, updates more easily, and stores the data with less space. Achieving the longest prefix match via HOTMLP has a complexity of “O(2+n∕k)”. In the worst case, the largest number of “n” is 8 for the ipv4 address and 32 for the ipv6 address. Experimental results prove that the proposed algorithm is able to meet the requirements of the core route on routing lookup efficiency and forward tens of millions of packets per second.

CCN: A novel energy efficient greedy routing protocol for green computing

SummaryWe proposed a novel Energy Efficient Greedy Routing Protocol (EEGRP) in CCN for MANETs to achieve the gaps in the existing infrastructure of Green Cloud Computing. Initially, the consumer node broadcasts the interest packet; each relay node verifies if it is already satisfied, and then it drops the packet. Otherwise, the provider node selects shortest path to unicast data packet within minimum delay. Each relay node receives a data packet, stores its content in content store, and forwards it to next node according to path mention in the hop‐count field. If the data packet custodian node does not find path mention in the hop‐count field, then it searches the routing table entries to choose the second best path to unicast the data packet. EEGRP is implemented in three scenarios using ns2 and compare its performance with AIRDrop routing protocol on bases of three performance parameters like packet delivery ratio, delay, and energy consumption. EEGRP achieves high PDR with minimum delay and less energy consumption as compared to AIRDrop. Therefore, EEGRP is feasible to use on green computing and cloud technology. This can save energy issue to secure energy for Green Computing and Cloud before moving to full‐scale virtualization and Cloud services.

Gateway load balancing using multiple QoS parameters in a hybrid MANET

A Mobile ad hoc network (MANET) is a self configurable wireless network in which mobile nodes communicate with each other in a multihop fashion without any pre-installed infrastructure. A MANET can be considered to be a standalone network. To enhance the connectivity of a MANET it can be connected to the fixed network, thus forming a heterogeneous network. The integration of MANET and the Internet is called a hybrid MANET which is facilitated by special nodes called Internet gateway nodes. Load balancing among gateways is a challenging task when a MANET is connected to Internet. Gateway nodes with higher loads will lead to disconnected networks and depletes the node’s resources which include their batteries, memory and bandwidth quickly. Gateway selection based on the shortest path may increase traffic concentration on one particular gateway which leads to congestion and increases delay in the network. In this paper a QoS based load balancing mechanism has been proposed among multiple gateway nodes that provide communication between mobile nodes and fixed nodes in the Internet to select lightly loaded gateways so that more packets will be delivered to the fixed host in the Internet. The proposed QoS based scheme selects four QoS parameters that are (1) connecting degree, (2) interface queue length, (3) routing table entries and (4) hop count. A weight based method is used to select the gateway which combines all four QoS metrics. Simulation results demonstrate that when compared with individual parameter, the average ETE delay, queue size and traffic load of gateway generated by proposed algorithm is decreased by 17, 25 and 15 % respectively and when compared with existing schemes, the average ETE delay, queue size and traffic load of gateway is decreased by 25, 25 and 16 % respectively.

On Hierarchical Routing in Doubling Metrics

We study the problem of routing in doubling metrics and show how to perform hierarchical routing in such metrics with small stretch and compact routing tables (i.e., with a small amount of routing information stored at each vertex). We say that a metric ( X , d ) has doubling dimension dim(<i<X</i<) at most α if every ball can be covered by 2 α balls of half its radius. (A doubling metric is one whose doubling dimension dim(<i<X</i<) is a constant.) We consider the metric space induced by the shortest-path distance in an underlying undirected graph G . We show how to perform (1 + τ)-stretch routing on such a metric for any 0 < τ ≤ 1 with routing tables of size at most (α/τ) O (α) log Δlog δ bits with only (α/τ) O (α) log Δ entries , where Δ is the diameter of the graph, and δ is the maximum degree of the graph G ; hence, the number of routing table entries is just τ − O (1) log Δ for doubling metrics. These results extend and improve on those of Talwar (2004). We also give better constructions of sparse spanners for doubling metrics than those obtained from the routing tables earlier; for τ > 0, we give algorithms to construct (1 + τ)-stretch spanners for a metric ( X , d ) with maximum degree at most (2 + 1/τ) O(dim(X)) , matching the results of Das et al. for Euclidean metrics.

Fully Distributed Multicast Routing Protocol for IEEE 802.15.8 Peer-Aware Communication

The IEEE 802.15.8 provides peer-aware communication (PAC) protocol for peer-to-peer infrastructureless service with fully distributed coordination. One of the most promising services in IEEE 802.15.8 is group multicast communication with simultaneous membership in multiple groups, typically up to 10 groups, in a dense network topology. Most of the existing multicast techniques in mobile ad hoc networks (MANET) have significant overhead for managing the multicast group and thus cannot be used for fully distributed PAC networks. In this paper, we propose a light-weight multicast routing protocol referred to as a fully distributed multicast routing protocol (FDMRP). The FDMRP minimizes routing table entries and thus reduces control message overhead for its multicast group management. To balance the control message, all nodes in the network have a similar number of routing entries to manage nodes in the same multicast group. To measure the effectiveness of the proposed FDMRP against the existing schemes, we evaluated performance by OPNET simulator. Performance evaluation shows that the FDMRP can reduce the number of routing entries and control message overhead by up to 85% and 95%, respectively, when the number of nodes is more than 500.

Large-scale SRAM-based IP lookup architectures using compact trie search structures

SRAM-based pipelined architectures for high-speed IP lookup using Field Programmable Gate Arrays (FPGAs) has recently attracted a great deal of attention from researchers. Due to the limited amount of on-chip memory and the number of I/O pins of FPGAs, compact data structures providing high memory efficiency are in great demand.In IP lookup, a binary trie that is an ordered tree data structure is used to store the routing table entries. In this paper, we propose two compact trie structures denoted Compact Trie Forest (CTF) and Compact Trie∊ (CT∊) for Internet Protocol (IP) lookup. The large variant in node sizes leading to the memory inefficiency in hardware implementation is resolved by using multiple disjoint pipelines in CTF. CT∊ solves the problem within a single pipeline by splitting large nodes into sequentially connected multiple small and fixed size nodes. To support each data structure, two pipelined SRAM-based architectures optimized by allowing multiple memory banks in each stage are also proposed.

P2P Overlay Maintenance Algorithm

Peer to peer networking has emerged as viable business model and systems architecture for internet scale application since it attracts millions of simultaneous participants. In P2P overlay network (collection of peer connections in a P2P network) peers join and leave the overlay arbitrarily and do not stay in the overlay for a predictable time. To ensure dependability of the overlay, peers with neighbor links to the joining or leaving peers requires updates. Therefore overlay maintenance protocols have to be devised to include efficient features that able to handle peer churn. In this paper we are focusing on the P2P overlay maintenance protocol through which the peers in the overlay maintains routing properties, referred as overlay maintenance. We have proposed an efficient method to find stale routing table entries in a way that retains the desired routing behavior since the look up query traffic and overlay maintenance traffic both compete for the underlying network bandwidth and resources, maintenance traffic should be constrained to that needed for target table accuracy.

Effect of Quality Parameters in Efficient Routing Protocol � Grid FSR with Best QoS Constraints

Rapid advanced in information technology has made it possible to transmit the data in wireless links without the aid of any fixed infrastructure or centralized administrator. Wireless mobile ad hoc networks are self-creating, selfadministering and self-organizing entities. Thus a set of selfmotivated mobile wireless users is able to dynamically exchange data among themselves, even in the absence of a predetermined infrastructure and controller. In our research work, we present investigations on the behavior of the Proactive Routing Protocol FSR in the GRID by analysis of various parameters. The Performance metrics that are used to evaluate performance of the routing protocols are Packet Delivery Ratio (PDR), Network Control Overhead, Normalized Overhead, Throughput and Average End to End Delay. Experimental results reveal that FSR is more efficient in Grid FSR in all QOS constraints.FSR can be used in all Resource critical environments. Scalability in respect to QOS is effective in FSRlarge area routing protocol. Grid Fisheye state routing (GFSR) consumes less bandwidth by restricting the propagation of routing control messages in paths formed by alternating gateways and neighbor heads, and allowing the gateways to selectively include routing table entries in their control messages.PDR and Throughput are 100% efficient in Simulation Evaluation with NS2.

A Survey on Selective Routing Topology Inference Through Active Probing

Although there are surveys summarizing the efforts toward discovering the Internet routing topology, no work has addressed how to infer the routing topology among a particular group of hosts scattered across the Internet. These two issues differ in scale, objective and solutions currently available. How to infer the routing topology among a group of hosts is non-trivial due to the complexity, size and decentralized nature of the Internet. Nevertheless, a cost-effective means of inferring topology would be of considerable benefit to many mechanisms, such as network monitoring, overlay topology construction and failure diagnosis. Since external information, such as routing table entries, is not publicly available to hosts, most of the methodologies employ an active probing mechanism to address this issue. For this reason our focus is on active probing based solutions, too. A comparison between generic Internet topology discovery and that between a specific group of hosts is elaborated in order to distinguish these two problems. Furthermore, we discuss the motivation that underlines the significance of various techniques addressing routing topology discovery among a group of hosts. We then classify the strategies into two types: Router-Assisted (RA) and Non-Router-Assisted (NRA), and analyze in detail their state-of-the-art position, merits and challenges, respectively. Conclusions and future directions are also presented.

EXPERIMENTAL EVALUATIONS OF ALGORITHMS FOR IP TABLE MINIMIZATION

Reducing the size of IP routing tables is one of the most compelling scaling problems affecting the Internet because of massive growth of routing table entries, increased traffic, and the migration to 128 bit IPv6 addresses. Various algorithms for IP table minimization have been proposed in the literature both for a single and for multiple tables, also with the possibility of performing address reassignments. In this paper we first introduce two new compression heuristics, the BFM and its evolution called BFM-Cluster, that exploit address reassignments for the minimization of multiple routing tables, and then we experimentally evaluate their performances together with the already existing techniques. Since a main problem posed by the growth of the routing tables sizes is the consequent general increase of the table lookup time during the routing of the IP packets, the aim is twofold: to measure and compare the compression ratios of the different algorithms, and to estimate the effects of the compression on the lookup times by measuring the induced improvement on the time of the main algorithms and data structures for the fast IP address lookup from the original tables to the compressed ones. Our point is that the existing techniques are efficient in different situations, with BFM-Cluster heuristic outperforming all other ones.

Constructing disjoint paths for failure recovery and multipath routing

Applications such as Voice over IP and video streaming require continuous network service, requiring fast failure recovery mechanisms. Proactive failure recovery schemes have been recently proposed to improve network performance during the failure transients. These proactive failure recovery schemes need extra infrastructural support in the form of routing table entries, extra addresses etc. In this paper, we study if the extra infrastructure support can be exploited to build disjoint paths in those frameworks, while keeping the lengths of the recovery paths close to those of the primary paths. Our evaluations show that it is possible to extend the proactive failure recovery schemes to provide support for nearly-disjoint paths which can be employed in multipath routing for load balancing and QoS.

Packet Loss Reduction During Rerouting

When a network failure is detected by an IP router, its routing table is updated for all affected routing entries. The packet loss resulting from this event depends on the network traffic associated with the updated routing table entries. In this paper, we model this process, define packet loss minimization heuristics relying on network traffic prediction models, and show by simulation that the resulting packet loss can be reduced compared to the default routing table update process.

Packet loss reduction during rerouting using network traffic analysis

Upon certain network events, such as node or link failures, IP routers need to update their affected routing table entries. During the period between the failure occurrence and the installation of the updated entries (on the line cards), the network traffic is lost when forwarded by routers that are still using old entries. Indeed, current IP routers do not involve network traffic information during this unordered update process. The consequence is more packet losses compared to a process that would order these entries based on local traffic information. In this paper, we model and predict network traffic passing through an IP router and define two dynamic heuristics in order to reduce the packet loss resulting from routing table updates. AutoRegressive Integrated Moving Average (ARIMA)--Generalized AutoRegressive Conditional Heteroskedasticity (GARCH) traffic models are used in combination with heuristics that dynamically sort the routing entries and improve the low-level routing table update process. In a realistic simulation environment, we show that this setup can result into a clear decrease of packet loss, depending on i) the network traffic model, ii) the applied heuristic, and iii) the network traffic aggregation level.

Dynamic measurement-aware routing in practice

Traffic monitoring is a critical network operation for the purpose of traffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Existing techniques for traffic monitoring, however, tend to be suboptimal due to poor choice of monitor location or constantly evolving monitoring objectives and traffic characteristics. One way to counteract these limitations is to use routing as a degree of freedom to enhance monitoring efficacy, which we refer to as measurement-aware routing. Traffic sub-populations can be routed (rerouted) on the fly to optimally leverage existing monitoring infrastructures. Implementing dynamic measurement-aware routing (DMR) in practice is riddled with challenges. Three major challenges are how to dynamically assess the importance of traffic flows; how to aggregate flows (and hence take a common action for them) in order to conserve routing table entries; and how to achieve traffic routing/rerouting in a manner that is least disruptive to normal network performance while maximizing the measurement utility. This article takes a closer look at these challenges and discusses how they manifest for different types of networks. Through an OpenFlow prototype, we show how DMR can be applied in enterprise networks. Using global iceberg detection and capture as a driving application, we demonstrate how our solutions successfully route suspected iceberg flows to a DPI box for further processing, while preserving balanced load distribution in the overall network.