Virtual routing and forwarding

About: Virtual routing and forwarding is a research topic. Over the lifetime, 2191 publications have been published within this topic receiving 52690 citations.

BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks

Abstract: The increasing penetration of smart devices with networking capability form novel networks Such networks, also referred as pocket switched networks (PSNs), are intermittently connected and represent a paradigm shift of forwarding data in an ad hoc manner The social structure and interaction of users of such devices dictate the performance of routing protocols in PSNs To that end, social information is an essential metric for designing forwarding algorithms for such types of networks Previous methods relied on building and updating routing tables to cope with dynamic network conditions On the downside, it has been shown that such approaches end up being cost ineffective due to the partial capture of the transient network behavior A more promising approach would be to capture the intrinsic characteristics of such networks and utilize them in the design of routing algorithms In this paper, we exploit two social and structural metrics, namely centrality and community, using real human mobility traces The contributions of this paper are two-fold First, we design and evaluate BUBBLE, a novel social-based forwarding algorithm, that utilizes the aforementioned metrics to enhance delivery performance Second, we empirically show that BUBBLE can substantially improve forwarding performance compared to a number of previously proposed algorithms including the benchmarking history-based PROPHET algorithm, and social-based forwarding SimBet algorithm

A survey of wormhole routing techniques in direct networks

Abstract: Several research contributions and commercial ventures related to wormhole routing, a switching technique used in direct networks, are discussed. The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail. By its nature, wormhole routing is particularly susceptible to deadlock situations, in which two or more packets may block one another indefinitely. Several approaches to deadlock-free. routing, along with a technique that allows multiple virtual channels to share the same physical channel, are described. In addition, several open issues related to wormhole routing are discussed. >

Analysis of an Equal-Cost Multi-Path Algorithm

Abstract: Equal-cost multi-path (ECMP) is a routing technique for routing packets along multiple paths of equal cost. The forwarding engine identifies paths by next-hop. When forwarding a packet the router must decide which next-hop (path) to use. This document gives an analysis of one method for making that decision. The analysis includes the performance of the algorithm and the disruption caused by changes to the set of next-hops.

The IP Network Address Translator (NAT)

Abstract: The two most compelling problems facing the IP Internet are IP address depletion and scaling in routing. Long-term and short-term solutions to these problems are being developed. The short-term solution is CIDR (Classless InterDomain Routing). The long-term solutions consist of various proposals for new internet protocols with larger addresses.

Hash-based IP traceback

Abstract: The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet. Even in the absence of any deliberate attempt to disguise a packet's origin, wide-spread packet forwarding techniques such as NAT and encapsulation may obscure the packet's true source. Techniques have been developed to determine the source of large packet flows, but, to date, no system has been presented to track individual packets in an efficient, scalable fashion.We present a hash-based technique for IP traceback that generates audit trails for traffic within the network, and can trace the origin of a single IP packet delivered by the network in the recent past. We demonstrate that the system is effective, space-efficient (requiring approximately 0.5% of the link capacity per unit time in storage), and implementable in current or next-generation routing hardware. We present both analytic and simulation results showing the system's effectiveness.