Showing papers on "Virtual routing and forwarding published in 2016"

E-CARP: An Energy Efficient Routing Protocol for UWSNs in the Internet of Underwater Things

Abstract: With the advance of the Internet of Underwater Things, smart things are deployed under the water and form the underwater wireless sensor networks (UWSNs), to facilitate the discovery of vast unexplored ocean volume. A routing protocol, which is not expensive in packets forwarding and energy consumption, is fundamental for sensory data gathering and transmitting in UWSNs. To address this challenge, this paper proposes Enhanced CARP (E-CARP), which is an enhanced version of the channel-aware routing protocol (CARP) developed by S. Basagni et al. , to achieve the location-free and greedy hop-by-hop packet forwarding strategy. In general, CARP does not consider the reusability of previously collected sensory data to support certain domain applications afterward, which induces data packets forwarding which may not be beneficial to applications. Besides, the PING - PONG strategy in CARP can be simplified for selecting the most appropriate relay node at each time point, when the network topology is relatively steady. These two research problems have been addressed by our E-CARP. Simulation results validate that our technique can decrease the communication cost significantly and increase the network capability to a certain extent.

Wdfad-dbr

Abstract: The design of routing protocols for Underwater Acoustic Sensor Networks (UASNs) poses many challenges due to long propagation, high mobility, limited bandwidth, multi-path and Doppler effect. Because of the void-hole caused by the uneven distribution of nodes and sparse deployment, the selection of next hop forwarding nodes only based on the state of current node may result in the failure of forwarding in the local sparse region. In order to reduce the probability of encountering void holes in the sparse networks, in this paper we present weighting depth and forwarding area division DBR routing protocol, called WDFAD-DBR. The novelties of WDFAD-DBR lie in: firstly, next forwarding nodes are selected according to the weighting sum of depth difference of two hops, which considers not only the current depth but also the depth of expected next hop. In this way, the probability of meeting void holes is effectively reduced. Secondly, the mechanisms for forwarding area division and neighbor node prediction are designed to reduce the energy consumption caused by duplicated packets and neighbors' requests, respectively. Thirdly, we make theoretical analyses on routing performance in case of considering channel contending with respect to delivery ratio, energy consumption and average end-to-end delay. Finally we conduct extensive simulations using NS-3 simulator to verify the effectiveness and validity of WDFAD-DBR.

Adaptive and Channel-Aware Detection of Selective Forwarding Attacks in Wireless Sensor Networks

Abstract: Wireless sensor networks (WSNs) are vulnerable to selective forwarding attacks that can maliciously drop a subset of forwarding packets to degrade network performance and jeopardize the information integrity. Meanwhile, due to the unstable wireless channel in WSNs, the packet loss rate during the communication of sensor nodes may be high and vary from time to time. It poses a great challenge to distinguish the malicious drop and normal packet loss. In this paper, we propose a channel-aware reputation system with adaptive detection threshold (CRS-A) to detect selective forwarding attacks in WSNs. The CRS-A evaluates the data forwarding behaviors of sensor nodes, according to the deviation of the monitored packet loss and the estimated normal loss. To optimize the detection accuracy of CRS-A, we theoretically derive the optimal threshold for forwarding evaluation, which is adaptive to the time-varied channel condition and the estimated attack probabilities of compromised nodes. Furthermore, an attack-tolerant data forwarding scheme is developed to collaborate with CRS-A for stimulating the forwarding cooperation of compromised nodes and improving the data delivery ratio of the network. Extensive simulation results demonstrate that CRS-A can accurately detect selective forwarding attacks and identify the compromised sensor nodes, while the attack-tolerant data forwarding scheme can significantly improve the data delivery ratio of the network.

Defence against Black Hole and Selective Forwarding Attacks for Medical WSNs in the IoT.

Abstract: Wireless sensor networks (WSNs) are being used to facilitate monitoring of patients in hospital and home environments. These systems consist of a variety of different components/sensors and many processes like clustering, routing, security, and self-organization. Routing is necessary for medical-based WSNs because it allows remote data delivery and it facilitates network scalability in large hospitals. However, routing entails several problems, mainly due to the open nature of wireless networks, and these need to be addressed. This paper looks at two of the problems that arise due to wireless routing between the nodes and access points of a medical WSN (for IoT use): black hole and selective forwarding (SF) attacks. A solution to the former can readily be provided through the use of cryptographic hashes, while the latter makes use of a neighbourhood watch and threshold-based analysis to detect and correct SF attacks. The scheme proposed here is capable of detecting a selective forwarding attack with over 96% accuracy and successfully identifying the malicious node with 83% accuracy.

An experimental investigation of hyperbolic routing with a smart forwarding plane in NDN

Abstract: Routing in NDN networks must scale in terms of forwarding table size and routing protocol overhead. Hyperbolic routing (HR) presents a potential solution to address the routing scalability problem, because it does not use traditional forwarding tables or exchange routing updates upon changes in network topologies. Although HR has the drawbacks of producing sub-optimal routes or local minima for some destinations, these issues can be mitigated by NDN's intelligent data forwarding plane. However, HR's viability still depends on both the quality of the routes HR provides and the overhead incurred at the forwarding plane due to HR's sub-optimal behavior. We designed a new forwarding strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's sub-optimal path selection. This paper describes our experimental investigation into the packet delivery delay and overhead under HR as compared with Named-Data Link State Routing (NLSR), which calculates shortest paths. We run emulation experiments using various topologies with different failure scenarios, probing intervals, and maximum number of next hops for a name prefix. Our results show that HR's delay stretch has a median close to 1 and a 95th-percentile around or below 2, which does not grow with the network size. HR's message overhead in dynamic topologies is nearly independent of the network size, while NLSR's overhead grows polynomially at least. These results suggest that HR offers a more scalable routing solution with little impact on the optimality of routing paths.

Scalable Multi-Failure Fast Failover via Forwarding Table Compression

Abstract: In datacenter networks, link and switch failures are a common occurrence. Although most of these failures do not disconnect the underlying topology, they do cause routing failures, disrupting communications between some hosts. Unfortunately, current 1:1 redundancy groups are only partly effective at reducing the impact of these routing failures. In principle, local fast failover schemes, such as OpenFlow fast failover groups, could reduce the impact by preinstalling backup routes that protect against multiple simultaneous failures. However, providing a sufficient number of backup routes within the available space provided by the forwarding tables of datacenter switches is challenging. To solve this problem, we contribute a new forwarding table compression algorithm. Further, we introduce the concept of compression-aware routing to improve the achieved compression ratio. Lastly, we have created Plinko, a new forwarding model that is designed to have more easily compressible forwarding tables. All optimizations combined, we often saw compression ratios ranging from 2.10x to 19.29x.

Optimizing restoration with segment routing

Abstract: Segment routing is a new proposed routing mechanism for simplified and flexible path control in IP/MPLS networks. It builds on existing network routing and connection management protocols and one of its important features is the automatic rerouting of connections upon failure. Re-routing can be done with available restoration mechanisms including IGP-based rerouting and fast reroute with loop-free alternates. This is particularly attractive for use in Software Defined Networks (SDN) because the central controller need only be involved at connection set-up time and failures are handled automatically in a distributed manner. A significant challenge in restoration optimization in segment routed networks is the centralized determination of connections primary paths so as to enable the best sharing of restoration bandwidth over non-simultaneous network failures. We formulate this problem as a linear programming problem and develop an efficient primal-dual algorithm for the solution. We also develop a simple randomized rounding scheme for cases when there are additional constraints on segment routing. We demonstrate the significant capacity benefits achievable from this optimized restoration with segment routing.

Compressing IP forwarding tables: towards entropy bounds and beyond

Abstract: Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the efficiency of standard operations, like random access, search, or update. The main goal of this paper is to demonstrate how data compression can benefit the networking community by showing how to squeeze the IP Forwarding Information Base (FIB), the giant table consulted by IP routers to make forwarding decisions, into information-theoretical entropy bounds, with essentially zero cost on longest prefix match and FIB update. First, we adopt the state of the art in compressed data structures, yielding a static entropy-compressed FIB representation with asymptotically optimal lookup. Then, we redesign the venerable prefix tree, used commonly for IP lookup for at least 20 years in IP routers, to also admit entropy bounds and support lookup in optimal time and update in nearly optimal time. Evaluations on a Linux kernel prototype indicate that our compressors encode an FIB comprising more than 440 K prefixes to just about 100-400 kB of memory, with a threefold increase in lookup throughput and no penalty on FIB updates.

Hybrid IP/SDN Networking: Open Implementation and Experiment Management Tools

Abstract: The introduction of SDN in large-scale IP provider networks is still an open issue and different solutions have been suggested so far. In this paper, we propose a hybrid approach that allows the coexistence of traditional IP routing with SDN based forwarding within the same provider domain. The solution is called OSHI—Open Source Hybrid IP/SDN networking, as we have fully implemented it combining and extending open source software. We discuss the OSHI system architecture and the design and implementation of advanced services like pseudo wires and virtual switches. In addition, we describe a set of open source management tools for the emulation of the proposed solution using either the Mininet emulator or distributed physical testbeds. We refer to this suite of tools as Mantoo (management tools). Mantoo includes an extensible Web-based graphical topology designer, which provides different layered network “views” (e.g., from physical links to service relationships among nodes). The suite can validate an input topology, automatically deploy it over a Mininet emulator or a distributed SDN testbed and allows access to emulated nodes by opening consoles in the web GUI. Mantoo provides also tools to evaluate the performance of the deployed nodes.

Translating Traffic Engineering outcome into Segment Routing paths: The Encoding problem

Abstract: Traffic Engineering (TE) algorithms aims at determining the packet routing paths in order to satisfy specific QoS requirements. These paths are normally established through control procedures e.g., exchange of RSVP messages in MPLS networks or links weights modification in pure IP networks. An increase of control traffic or long convergence time intervals, respectively, are the drawbacks of these solutions. Segment Routing (SR) is a new network paradigm able to implement TE routing strategies over legacy IP/MPLS networks with no need of dedicated signaling procedures. This result is obtained by inserting in each packet header an ordered list of instructions, called Segments List, that indicates the path to be crossed. This paper provides the formulation of the Segment List Encoding problem i.e., the detection of the proper Segment Lists to obtain TE network paths minimizing the Segment Lists sizes. The SL encoding procedure is composed of two steps: i) the creation of an auxiliary graph representing the forwarding paths between the couple of source and destination nodes; ii) the solution of a Multi-commodity Flow (MCF) problem over the auxiliary graph. The performance evaluation shows that properly performing SL encoding allows to implement TE outcome with a reduced reconfiguration cost with respect to E2E tunneling and Hop-by-Hop solutions; moreover a significant advantage in terms of packets overhead is obtained.

System and method for context aware network

Abstract: A system and method for handling context aware network includes a managing server including a control unit, a memory coupled to the control unit, one or more virtual routing and forwarding (VRF) tables stored in the memory, and one or more ports coupled to the control unit and configured to couple the managing server to a network. The managing server is configured to store VRF information in the one or more VRF tables, receive a request packet including a context from a first edge switch, determine the context included in the request packet, examine the one or more VRF tables to identify a VRF-ID associated with the context, and forward a VRF configuration flow control message to the first edge switch. The managing server is further configured to forward one or more additional VRF configuration flow control messages to one or more second edge switches.

System and method for routing network frames between virtual machines

Abstract: VM-to-VM switching is an enhancement to Ethernet card technology that enables virtual machines on the same hardware server platform to switch Ethernet Frames (or IP Packets) directly without exiting the server or using a slower and bandwidth limited software process in the hypervisor. The method does not require new network switch hardware. The invention creates a unique switching ability that allows users to modify parameters applied to Ethernet Frames passing between Virtual Machines, such as quality of service or firewall rules without adding considerable latency to the switching process. The hardware switching method enriches the functionality of the Ethernet Card and permits more advanced switching architectures in servers and thus increases density of VMs and reduces complexity of planning the location of virtual machines in a virtualized infrastructure.

Structural Vulnerability Assessment of Community-Based Routing in Opportunistic Networks

Abstract: Opportunistic networks enable mobile devices to communicate with each other through routes that are built dynamically, while messages are en route between the sender and the destination(s). The social structure and interaction of users of such devices dictate the performance of routing protocols in those networks. Community structures, commonly exhibited by social networks, is also observed in the encounter patterns in opportunistic networks and has an astounding impact in designing forwarding algorithms for such types of networks. In this paper, we explore the structural vulnerability of social-based forwarding and routing methods in opportunistic networks. In particular, we introduce Community Vulnerability Assessment (CVA), a new problem on assessing the performance reliability of opportunistic routing strategies in Delay Tolerant Networks (DTN) from a community structure point of view. Given a positive number $k$ , CVA aims to find out the $k$ most vulnerable devices in the network whose non-participation (due to out-of-service or permanent out-of-range) transforms the current network community structure to a totally different one. As the first study in this direction, we analyze and provide key insights into the separation of network communities, evaluated via the Normalized Mutual Information (NMI). Based on these findings, we suggest an approximation algorithm for the special case when, and a heuristic, genEdge, for the general case. To certify the effectiveness of our proposed approaches, we first test them on synthesized data with known community structures, and then we show the impact of node removal on community structures in real social networks. Finally we evaluate the performance via different forwarding and routing strategies in multiple real-world DTN traces. Our results indicate that, in many forwarding and routing methods, the nonparticipation of only some important devices is significant enough to degrade the entire network's performance.

3D Real-Time Routing Protocol With Tunable Parameters for Wireless Sensor Networks

Abstract: A novel 3D real-time geographical routing protocol (3DRTGP) for wireless sensor networks is presented in this paper. 3DRTGP controls the number of forwarding nodes in the network by limiting forwarding to a unique packet forwarding region (PFR). PFR selection is based on the network density around each of the forwarding nodes, which reduces the number of redundant packet transmissions, collisions, and congestion. This enables 3DRTGP to meet the real-time requirements of a time sensitive application. In order to meet the packet delivery delay deadline, a forwarding node uses its own delay parameters, such as queuing and processing delays, and the expected number of hops to the destination to make a forwarding decision. 3DRTGP does not require an explicit exchange of neighboring information, such as location information. 3DRTGP is evaluated through extensive simulations under various network densities and traffic load conditions, which provides network tuning parameters to meet the real-time requirements of applications. 3DRTGP heuristically solves the void node problem (VNP) in 3-D deployments. It is demonstrated that 3DRTGP resolves VNP given that there is no network partitioning. 3DRTGP significantly outperforms similar 3-D geographical routing protocols in terms of end-to-end delay and miss ratio.

A length-aware cuckoo filter for faster IP lookup

Abstract: A cuckoo filter is a highly efficient data structure that provides approximate set-membership testing and addresses some drawbacks of a Bloom filter such as deletion and space overhead. Motivated by the application of Bloom filters to IP lookup, and in general, fast packet processing at routers, we propose a new filter called a length-aware cuckoo filter (LACF), for faster IP lookup with limited extra storage requirement. LACF uses different numbers of hash functions to store and search for entries based on the prefix length popularity of routing entries. Our preliminary results show that LACF reduces the false positive rates for IP lookup by a factor of up to two, with less than 1% storage increase. As future work, we will implement LACF in real network routers, and validate its effectiveness as an IP packet forwarding mechanism.

Intelligent Forwarding Strategy Based on Online Machine Learning in Named Data Networking

Abstract: The content-oriented model of Named Data Networking (NDN) allows consumers to pay more attention to the targeting data itself instead of the location of where the data is stored. Different from IP, NDN has a unique feature that forwarding plane enables each router to select the next forwarding hop independently without relying on routing. Therefore, forwarding strategies play a significant role for adaptive and efficient data transmission in NDN. Existing forwarding strategies are not smart enough to cope with the complexity of network and diversity of application demands. This paper presents an intelligent forwarding strategy, which integrates online machine learning method into the optimization of interface probabilities during forwarding process. Originally, a probabilistic binary tree structure is proposed to abstract the forwarding process as a path selection process traversing from the root node to the leaf node, which provides theoretical support for machine learning and reduces the complexity of forwarding process. In addition, we improved our strategy to prevent the convergence into limited local optimal solution by adopting the idea of simulated an nealing. Experimental results show that the proposed strategy can reduce time complexity, as well as achieve higher throughput, better load balance and lower packet drop rates in comparison with other existing forwarding strategies. The drop rates are reduced by 60% and 34% respectively in different scenarios compared with BestRoute, a strategy widely used in NDN.

Source routing with protocol-oblivious forwarding (POF) to enable efficient e-Health data transfers

Abstract: It has already been confirmed that software-defined networking (SDN) can make the networks more programmable, adaptive and application aware. However, due to the large-scale and geographically-distributed nature of wide-area networks (WAN), the scalability could become a critical issue if we incorporate SDN for WANs (i.e., realizing SD-WANs). In this paper, we design and implement a novel network system that can leverage source routing with the protocol-oblivious forwarding (POF) to facilitate efficient e-Health data transfers with low setup latency. We develop the POF-based source routing protocol to realize a pipeline based packet processing procedure, which can replace the table-lookup based approach in traditional SDN networks and make the forwarding plane more efficient. The proposed scheme is demonstrated experimentally, and the results verify that with it, the flow-tables installed in each core switches in a POF-controlled SD-WAN can be minimized and the path setup latency of traffic flows can be reduced significantly as well.

Design and implementation of SDN/IP hybrid space information network prototype

Abstract: Software Defined Networking (SDN) promises to ease design, operation and management of communication networks. For years, however, most networks have been designed, deployed and managed as IP-based systems. It is necessary to introduce SDN in IP backbones to construct SDN/IP hybrid space information network. In this paper, we design and implement a new architecture of the SDN/IP hybrid space information network. It helps to achieve a collaborative management between the IP network and the SDN network through the model. So, in space information network, we can use traditional IP-based system in ground internet and use centralized SDN in satellite network. By combining Quagga and SDN controller, the entire flexible centralized SDN network is abstracted as a traditional distributed control IP router. Thus, the SDN controller can get routing tables from Quagga and forward routing protocol packets over the network. At the same time, other IP subnet can be aware of the existing SDN subnet, and its location. We designed our SDN/IP hybrid network prototype combining the POX as the controller and the Mininet for topology construction, all with OpenFlow 1.0 support. And results show that we achieve the interconnection between SDN and IP subnets efficiently.

Forwarding Strategies for Applications in Named Data Networking

Abstract: Named Data Networking (NDN), an information-centric Internet architecture, introduces a new forwarding model, in which the forwarding plane can choose between multiple interfaces when forwarding a packet. While the forwarding module brings new opportunities it also introduces challenges when the application's performance or correctness is affected by a conflict between the application design and the assigned forwarding strategy. In this paper we demonstrate the impact of the forwarding strategy decision on the performance and correctness of NDN applications.

A light-weight forwarding plane for content-centric networks

Abstract: We present CCN-DART, a more efficient forwarding approach for content-centric networking (CCN) than named data networking (NDN) that substitutes Pending Interest Tables (PIT) with Data Answer Routing Tables (DART) and uses a novel approach to eliminate forwarding loops. The forwarding state required at each router using CCN-DART consists of segments of the routes between consumers and content providers that traverse a content router, rather than the Interests that the router forwards towards content providers. Accordingly, the size of a DART is proportional to the number of routes used by Interests traversing a router, rather than the number of Interests traversing a router. We show that CCN-DART avoids forwarding loops by comparing distances to name prefixes reported by neighbors, even when routing loops exist. Results of simulation experiments comparing CCN-DART with NDN using the ndnSIM simulation tool show that CCN-DART incurs 10 to 20 times less storage overhead.

Fault-tolerance improvement for core and edge of IP network

Abstract: The fault-tolerance improvement for the core and edge of the IP network is proposed in the given paper. In solving the technological problem of the fault-tolerant IP routing during minimization of the object function it is necessary to solve either quadratic programming problem or mixed integer nonlinear programming problem with limitations defined. The proposed model also provides the support of load balancing functions on the virtual router interfaces and fault-tolerant routing in the core of the IP network with protection schemes of link, node and path, which has a positive impact on the availability and productivity of communications system as a whole.

Fault-tolerant IP routing flow-based model

Abstract: In this paper the fault-tolerant IP routing flow-based model presented. In solving the technological problem of fault-tolerant IP routing it is necessary during minimization of object function to solve either linear programming problem or Boolean programming problem with limitations defined. Proposed model also provides the support of traffic balancing functions on the virtual router interfaces, which also has a positive impact on the availability and productivity of telecommunication system as a whole.

Name-based geographical routing/forwarding support for location-based IoT services

Abstract: Internet of Things (IoT) devices deployed everywhere are expected as potential data sources for various location-based services. This paper designs an anonymous geographical routing/forwarding mechanism to support location-based IoT services, where users collect data pieces from IoT devices by specifying their locations rather than their names/addresses. A key idea of the routing/forwarding mechanism is enabling users to collect location-dependent data without locations of users' interest being leaked.

Assessing co-locality of IP blocks

Abstract: Many IP Geolocation services and applications assume that all IP addresses within the same /24 IPv4 prefix (a /24 block) reside in close physical proximity. For blocks that contain addresses in very different locations (such as blocks identifying network backbones), this assumption can result in a large geolocation error. In this paper we evaluate the co-location assumption. We first develop and validate a hierarchical clustering method to find clusters of IP addresses with similar observed delay measurements within /24 blocks. We validate our methodology against two ground-truth datasets, confirming that 93% of the identified multi-cluster blocks are true positives with multiple physical locations and an upper bound for false positives of only about 5.4%. We then apply our methodology to a large dataset of 1.41M /24 blocks extracted from a delay-measurement study of the entire responsive IPv4 address space. We find that about 247K (17%) out of 1.41M blocks are not co-located, thus quantifying the error in the /24 block co-location assumption.

High Throughput Forwarding for ICN with Descriptors and Locators

Abstract: Application-defined and location-independent addressing is a founding principle of information centric networking (ICN) that is inherently difficult to realize if one also wants scalable routing and forwarding. We propose an ICN architecture, called TagNet, intended to combine expressive application-defined addressing with scalable routing and forwarding. TagNet features two independent delivery services: one with application-defined and possibly location-independent content descriptors, and one with network-defined host locators. In this paper we develop and evaluate specialized forwarding algorithms for TagNet. We then implement and combine these algorithms in a forwarding engine built on a general-purpose commodity CPU, and show experimentally that, thanks to the dual addressing, by descriptor or by locator, this engine can achieve a throughput of over 20Gbps with large forwarding tables corresponding to hundreds of millions of users.

Systems and methods for performing targeted scanning of a target range of ip addresses to verify security certificates

Abstract: The present disclosure is directed towards systems and methods for scanning of a target range of IP addresses to verify security certificates associated with the target range of IP addresses. Network traffic may be monitored between a plurality of clients and a plurality of serves over an IP address space. Traffic monitors positioned intermediary to the plurality of client and the plurality of servers can identify a target range of IP addresses in the address space for targeted scanning. The target range of IP address may be grouped into a priority queue and a scan can be performed of the target range of IP addresses to verify a security certificate associated with each IP address in the target range of IP addresses. In some embodiments, a rogue security certificate is detected that is associated with at least one IP address in the target range of IP addresses.

SDAR: Software Defined Intra-Domain Routing in Named Data Networks

Abstract: Named Data Networking (NDN) is a newly proposed content-centric network architecture that naturally supports efficient content distribution by routing data names instead of conventional IP prefixes. Taking advantage of the unique feature-adaptive forwarding in NDN and the centralized management and control in Software Defined Networking (SDN), we design and develop SDAR, a Software Defined Intra-Domain Routing Control Platform in NDN, that can manage network-wide routers and various dynamics effectively. To the best of our knowledge, it is the first time that we combine SDN and NDN ideas to implement adaptive forwarding via intra-domain multi-path routing algorithms. More specifically, we made the following contributions: (1) Designed an efficient communication model between routers and the controller within a single administrative domain; (2) Prototyped a centralized platform for handling different types of network dynamics, such as link failures and cost changes; (3) Ported multiple existing single-path and multi-path routing algorithms to the platform for robust and adaptive intra-domain routing; (4) Evaluated the effectiveness of SDAR through NS3/ndnSIM simulation with realistic settings.

QoS-FS: A new forwarding strategy with QoS for routing in Named Data Networking

Abstract: Information-Centric Networking (ICN) is a novel paradigm for future Internet architectures. The aim of ICN is to accommodate content distribution within the Internet infrastructure. Named Data Networking (NDN) is one of the most popular ICN proposal. This paper presents a design of QoS-FS, a new NDN's adaptive forwarding strategy with quality of service (QoS). At each node of the network, QoS-FS monitors, in real-time, ingoing and outgoing networks' link to estimate the QoS parameters and integrate them into the different decisions taken to determine when and which interface to use to forward an Interest. Therefore, making forwarding decision adaptive to network conditions and user's preferences. We provide simulation experiments to demonstrate the efficiency of the proposed solution.

$\alpha$Route: Routing on Names

Abstract: One of the crucial building blocks for Information Centric Networking (ICN) is a name based routing scheme that can route directly on content names instead of IP addresses. However, moving the address space from IP addresses to content names brings the scalability issues to a whole new level, due to two reasons. First, name aggregation is not as trivial a task as the IP address aggregation in BGP routing. Second, the number of addressable contents in the Internet is several orders of magnitude higher than the number of IP addresses. With the current size of the Internet, name based, anycast routing is very challenging specially when routing efficiency is of prime importance. We propose a name-based routing scheme $\alpha$ Route for ICN that offers efficient bandwidth usage, guaranteed content lookup and scalable routing table size. $\alpha$ Route consists of two components: an alphanumeric Distributed Hash Table (DHT) and an overlay to underlay (Internet topology) mapping algorithm. Simulation results show that $\alpha$ Route performs significantly better than Content Centric Network (CCN) in terms of network bandwidth usage, lookup latency and load balancing.