Showing papers on "Routing table published in 2012"

A survey on routing protocols in Wireless Sensor Networks

Abstract: This paper presents a survey of state-of-the-art routing techniques in Wireless Sensor Networks (WSNs). Compared with traditional wireless networks, WSNs are characterized with denser levels of node deployment, higher unreliability of sensor nodes and severe power, computation and memory constraints. Various design challenges such as energy efficiency, data delivery models, quality of service, overheads etc., for routing protocols in WSNs are highlighted. We addressed most of the proposed routing methods along with scheme designs, benefits and result analysis wherever possible. The routing protocols discussed are classified into seven categories such as Data centric routing, Hierarchical routing, Location based routing, Negotiation based routing, Multipath based routing, Quality of Service (QoS) routing and Mobility based routing. This paper also compares the routing protocols against parameters such as power consumption, scalability, mobility, optimal routing and data aggregation. The paper concludes with possible open research issues in WSNs.

A survey of naming and routing in information-centric networks

Abstract: The concept of information-centric networking (ICN) defines a new communication model that focuses on what is being exchanged rather than which network entities are exchanging information. From the ICN perspective, contents are first class network citizens instead of hosts. ICN's primary objective is to shift the current host-oriented communication model toward a content-centric model for effective distribution of content over the network. In recent years this paradigm shift has generated much interest in the research community and sprung several research projects around the globe to investigate and advance this stream of thought. Content naming and content-based routing are core research challenges in this research community. In this survey, we analyze, compare, and contrast the naming and routing mechanisms proposed by some of the most prominent ICN research projects.

Distributed logical l3 routing

Abstract: A novel method for logically routing a packet between a source machine that is in a first logical domain and a destination machine that is in a second logical domain is described. The method configures a managed switching element as a second-level managed switching element. The method configures a router in a host that includes the second-level managed switching element. The method communicatively couples the second-level managed switching element with the router. The method causes the router to route a packet when the router receives a packet from the first logical domain that is addressed to the second logical domain.

OFLOPS: an open framework for openflow switch evaluation

Abstract: Recent efforts in software-defined networks, such as OpenFlow, give unprecedented access into the forwarding plane of networking equipment. When building a network based on OpenFlow however, one must take into account the performance characteristics of particular OpenFlow switch implementations. In this paper, we present OFLOPS, an open and generic software framework that permits the development of tests for OpenFlow-enabled switches, that measure the capabilities and bottlenecks between the forwarding engine of the switch and the remote control application. OFLOPS combines hardware instrumentation with an extensible software framework. We use OFLOPS to evaluate current OpenFlow switch implementations and make the following observations: (i) The switching performance of flows depends on applied actions and firmware. (ii) Current OpenFlow implementations differ substantially in flow updating rates as well as traffic monitoring capabilities. (iii) Accurate OpenFlow command completion can be observed only through the data plane. These observations are crucial for understanding the applicability of Open- Flow in the context of specific use-cases, which have requirements in terms of forwarding table consistency, flow setup latency, flow space granularity, packet modification types, and/or traffic monitoring abilities.

Caesar: a content router for high speed forwarding

Abstract: Today, high-end routers forward hundreds of millions of packets per second by means of longest prefix match on forwarding tables with less than a million IP prefixes. Information-Centric Networking, a novel form of networking where content is requested by its name, poses a new challenge in the design of high-end routers: process at least the same amount of packets, assuming a forwarding table that contains hundreds of millions of content prefixes. In this work we design and preliminarily evaluate Caesar, the first content router that supports name-based forwarding at high speed. Caesar efficiently uses available processing and memory units in a high-end router to support forwarding tables containing a billion content prefixes with unlimited characters.

A Trace-Driven Analysis of Caching in Content-Centric Networks

Abstract: A content-centric network is one which supports host-to-content routing, rather than the host-to-host routing of the existing Internet. This paper investigates the potential of caching data at the router-level in content-centric networks. To achieve this, two measurement sets are combined to gain an understanding of the potential caching benefits of deploying content-centric protocols over the current Internet topology. The first set of measurements is a study of the BitTorrent network, which provides detailed traces of content request patterns. This is then combined with CAIDA's ITDK Internet traces to replay the content requests over a real-world topology. Using this data, simulations are performed to measure how effective content-centric networking would have been if it were available to these consumers/providers. We find that larger cache sizes (10,000 packets) can create significant reductions in packet path lengths. On average, 2.02 hops are saved through caching (a 20% reduction), whilst also allowing 11% of data requests to be maintained within the requester's AS. Importantly, we also show that these benefits extend significantly beyond that of edge caching by allowing transit ASes to also reduce traffic.

Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks

Abstract: Routing in delay tolerant networks is a challenging problem due to the intermittent connectivity between nodes resulting in the frequent absence of end-to-end path for any source-destination pair at any given time. Recently, this problem has attracted a great deal of interest and several approaches have been proposed. Since Mobile Social Networks (MSNs) are increasingly popular type of Delay Tolerant Networks (DTNs), making accurate analysis of social network properties of these networks is essential for designing efficient routing protocols. In this paper, we introduce a new metric that detects the quality of friendships between nodes accurately. Utilizing this metric, we define the community of each node as the set of nodes having close friendship relations with this node either directly or indirectly. We also present Friendship-Based Routing in which periodically differentiated friendship relations are used in forwarding of messages. Extensive simulations on both real and synthetic traces show that the introduced algorithm is more efficient than the existing algorithms.

Revisiting routing control platforms with the eyes and muscles of software-defined networking

Abstract: Prior work on centralized Routing Control Platform (RCP) has shown many benefits in flexible routing, enhanced security, and ISP connectivity management tasks. In this paper, we discuss RCPs in the context of OpenFlow/SDN, describing potential use cases and identifying deployment challenges and advantages. We propose a controller-centric hybrid networking model and present the design of the RouteFlow Control Platform (RFCP) along the prototype implementation of an AS-wide abstract BGP routing service.

Collaborative forwarding and caching in content centric networks

Abstract: Content caching plays an important role in content-centric networks. The current design of content-centric networks adopts a limited, en-route hierarchical caching mechanism, and caching and forwarding are largely uncoordinated. In this paper, we propose a novel collaborative caching and forwarding design. In this design, collaboration is guided by content popularity ranking, based on which we introduce a collaborative forwarding table to allow coordination between caching and forwarding. We also propose a self-adaptive dual-segment cache division algorithm to deal with dynamic inconsistent content popularity. We evaluate our design via extensive simulations and demonstrate that our design improves content access cost and cache miss rate by at least 30% in a diverse network settings.

Enhancing Real-Time Delivery of Gradient Routing for Industrial Wireless Sensor Networks

Abstract: This paper proposes gradient routing with two-hop information for industrial wireless sensor networks to enhance real-time performance with energy efficiency. Two-hop information routing is adopted from the two-hop velocity-based routing, and the proposed routing algorithm is based on the number of hops to the sink instead of distance. Additionally, an acknowledgment control scheme reduces energy consumption and computational complexity. The simulation results show a reduction in end-to-end delay and enhanced energy efficiency.

Social feature-based multi-path routing in delay tolerant networks

Abstract: Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing process. This approach is motivated from several social contact networks, such as the Infocom 2006 trace, where people contact each other more frequently if they have more social features in common. Our approach includes two unique processes: social feature extraction and multi-path routing. In social feature extraction, we use entropy to extract the m most informative social features to create a feature space (F-space): (F 1 , F 2 , …, F m ), where F i corresponds to a feature. The routing method then becomes a hypercube-based feature matching process where the routing process is a step-by-step feature difference resolving process. We offer two special multi-path routing schemes: node-disjoint-based routing and delegation-based routing. Extensive simulations on both real and synthetic traces are conducted in comparison with several existing approaches, including spray-and-wait routing and spray-and-focus routing.

Routing using cached source routes from message headers

Abstract: In one embodiment, an intermediate node of a computer network can receive a message intended for a destination. The message can include a header indicating a source route. The intermediate node can determine a routing entry for a routing entry for the destination associated with a next hop based on the source route and cache the routing entry. The intermediate node can further receive a second message intended for the destination that does not indicate the next hop, and transmit the second message according to the cached routing entry.

Method of processing a request in an information-centred communication network

Abstract: The invention relates to a method of processing a request for content by a routing device in a communication network implementing a name-based routing, the device comprising a plurality of interfaces able to receive at least one request for content and at least one data packet associated with a content, and a routing table adapted to determine, as a function of a content name, at least one interface to which to route the request, said method comprising: - a step of receiving the request through a first interface, - if the device is not able to provide said data packet associated with the content, a step of searching for the name of the content in a table of pending requests which is associated with the first interface, - in case the content name does not appear in the table of pending requests associated with the first interface, a step of storing the name of the content in said table, and - a step of transmitting the request through at least one second interface, said second interface being determined as a function of the name of the content on the basis of the routing table.

Random Host Mutation for Moving Target Defense

Abstract: Exploiting static configuration of networks and hosts has always been a great advantage for design and launching of decisive attacks. Network reconnaissance of IP addresses and ports is prerequisite to many host and network attacks. At the same time, knowing IP addresses is required for service reachability in IP networks, which makes complete concealment of IP address for servers infeasible. In addition, changing IP addresses too frequently may cause serious ramifications including service interruptions, routing inflation, delays and security violations. In this paper, we present a novel approach that turns end-hosts into untraceable moving targets by transparently mutating their IP addresses in an intelligent and unpredictable fashion and without sacrificing network integrity, manageability or performance. The presented technique is called Random Host Mutation (RHM). In RHM, moving target hosts are assigned virtual IP addresses that change randomly and synchronously in a distributed fashion over time. In order to prevent disruption of active connections, the IP address mutation is managed by network appliances and totally transparent to end-host. RHM employs multi-level optimized mutation techniques that maximize uncertainty in adversary scanning by effectively using the whole available address range, while at the same time minimizing the size of routing tables, and reconfiguration updates. RHM can be transparently deployed on existing networks on end-hosts or network elements. Our analysis, implementation and evaluation show that RHM can effectively defend against stealthy scanning, many types of worm propagation and attacks that require reconnaissance for successful launching. We also show the performance bounds for moving target defense in a practical network setup.

Automatic routing using multiple prefix labels

Abstract: We present Multi-label Automatic Routing (MAR), the first compact routing protocol that attains a low path stretch (ratio of selected path length to the optimal path length) while maintaining a low routing state for mobile networks. MAR is resilient to node movements in the network. In MAR, nodes assign themselves labels based on their location in the network through a distributed algorithm. Distributed Hash Tables (DHTs) for the node to label mappings are established in some anchor nodes. Once the labels are established, the routing is automatic based on the positional labels of the nodes and DHT lookups. This eliminates flooding completely. Unlike traditional routing protocols MAR does not need destinations-based routing tables. Hence, MAR has a small routing state. With the use of multiple labels per node, the average path length is close to the shortest path and there are multiple paths between source and destination nodes. In Qualnet simulations MAR shows a path stretch close to or better than traditional table-driven and on-demand protocols like OLSR and AODV. Simulation results also show shorter end-to-end delays due to the automatic routing. The delivery ratio of MAR is comparable to these traditional protocols but with a significantly lower network overhead.

Comparing alternative approaches for networking of named objects in the future Internet

Abstract: This paper describes and compares alternative architectures for achieving the functional goals of name oriented networking. The CCN (content-centric network) scheme proposed by Van Jacobson is contrasted with hybrid name and address based routing proposed in conjunction with the MobilityFirst (MF) future Internet architecture. In a CCN network, routers forward data directly on content names (such as URNs), achieving elegant and efficient retrieval of content files; the framework can also be extended to other communications services such as VoIP. The MF scheme supports name-based communication services by introducing the concept of a flat ‘globally unique identifier (GUID)’, which is used as the authoritative header for routing. Further, the GUID is dynamically mapped to one or more topological network addresses using a global name resolution service (GNRS). This leads to a hybrid GUID and network address based routing (HGN) scheme in which routers operate with both flat names (GUIDs) and network addresses, reducing routing table size and overhead at the cost of a fast distributed service for dynamic mapping of names to addresses. Protocol operations for both CCN and HGN are outlined in context of specific services including content retrieval, unicast and mobility. Preliminary evaluations of scalability and performance for both schemes are given using simple analytical models and selected results from Internet-scale simulations for GNRS and BGP.

Fast failover for control traffic in Software-defined Networks

Abstract: The Software-defined Network (SDN) design decouples forwarding and control planes, and runs the controlling functions on servers that might be in different physical locations from the forwarding elements. Such separation introduces new challenges to the network resiliency, because disconnection between switches and the controller could disable the forwarding plane. In this work, we analyze resiliency of the connection between control and forwarding planes in SDN. We propose algorithms to improve this resiliency by maximizing the possibility of fast failover—which we achieve through resilience-aware controller placement and control-traffic routing in the network.

Method to Carry FCoE Frames Over A TRILL Based Network

Abstract: An apparatus for forwarding an Fiber Channel over Ethernet (FCoE) data frame into an Ethernet network comprising a processor configured to receive a data frame on a input port, obtain a first destination address and a virtual local area network identifier (VID), determine whether the first destination address and the VID matches an entry within a forwarding table, construct a key when the first destination address and VID matches the entry and the data frame is a FCoE frame, and forward the data frame as an outgoing data frame via an output port when the key matches a rule that permits forwarding the data frame.

CATT: potential based routing with content caching for ICN

Abstract: Information Centric Networking (ICN) has shown possibilities to solve several problems of the Internet. At the same time, some problems need to be tackled in order to advance this promising architecture. In this paper we address two of the problems, namely routing and content caching. For the routing, we introduce the Potential Based Routing (PBR) to achieve several design goals such as availability, adaptability, diversity, and robustness. In addition, we examine the performance of a random caching policy which can be a promising candidate for ICN. The integrated system of both PBR and a caching policy is named the Cache Aware Target idenTification (CATT). Simulation results demonstrate that PBR with replications located on less than 1% of total nodes can achieve a near optimal routing performance (close to the shortest path routing) even though a request message is randomly forwarded.

Method and apparatus for providing interfacing between content delivery networks

Abstract: A method and apparatus are described for forwarding content delivery network interconnection (CDNI) signaling. A CDNI router content delivery network (CDN) may establish CDNIs with upstream and downstream CDNs. The CDNI router CDN may receive a CDNI route advertisement message from at least one of the upstream and downstream CDNs. The CDNI router CDN may update at least one end-user-based CDNI routing table based on Internet protocol (IP) address blocks in the CDNI route advertisement message. The CDNI router CDN may transmit an updated CDNI route advertisement message to at least one of the upstream and downstream CDNs. At least one of the upstream and downstream CDNs may update at least one end-user-based CDNI routing table based on the end user IP address blocks in the updated CDNI route advertisement message.

Distributed Routing Domains in Multi-Tenant Datacenter Virtual Networks

Abstract: A distributed routing domain is disclosed wherein each user or tenant can deploy a multi-subnet routing topology in a network-virtualized datacenter. A virtualization module implements the distributed routing domain and enforces a multi-subnet routing topology in a distributed fashion without requiring a standalone physical router or VM router. The topology and the routing rules are distributed in a network virtualization module on each hypervisor host, and collectively realize the multi-subnet topology for a virtual network over any physical network topology.

Exploit the known or explore the unknown?: hamlet-like doubts in ICN

Abstract: Most Information Centric Networking designs propose the usage of widely distributed in-network storage. However, the huge amount of content exchanged in the Internet, and the volatility of content replicas cached across the network pose significant challenges to the definition of a scalable routing protocol able to address all available copies. In addition, the number of available copies of a given content item and their distribution among caches is clearly impacted by the request forwarding policy.In this paper we gather initial design considerations for an ICN request forwarding strategy by spanning over two extremes: a deterministic exploitation of forwarding information towards a "known" copy and a random network exploration towards an "unknown" copy, via request flooding. By means of packet-level simulations, we investigate the performance trade-offs of exploitation/exploration approaches, and introduce an hybrid solution. Our forwarding scheme shows a good potential, whether carefully tuned, in terms of delivery performance, implicit cache coordination and possible reduction of forwarding table size.

Routing around decoys

Abstract: Decoy Routing is a new approach to Internet censorship circumvention that was recently and independently proposed at FOCI'11, USENIX Security'11 and CCS'11. Decoy routing aims to hamper nation-state level Internet censorship by having routers, rather than end hosts, relay traffic to blocked destinations. We analyze the security of these schemes against a routing capable adversary, a censoring authority that is willing to make routing decisions in response to decoy routing systems.We explore China, Syria, Iran, and Egypt as routing capable adversaries, and evaluate several attacks that defeat the security goals of existing decoy routing proposals. In particular, we show that a routing capable adversary can enumerate the participating routers implementing these protocols; can successfully avoid sending traffic along routes containing these routers with little or no adverse effects; can identify users of these schemes through active and passive attacks; and in some cases can probabilistically identify connections to targeted destinations.

Method and system for static trill routing

Abstract: A method and system for static routing in a TRILL network is disclosed. Routing bridges in the TRILL network use LLDP discovery to identify their next hop routing bridges. A data packet, with an inner header specifying a MAC address of a destination host, is sent by a source host and received by an ingress routing bridge. The ingress routing bridge encapsulates the data packet with a TRILL header and an outer header and sends the data packet to a next hop routing bridge on path to the destination host. The next hop routing bridge determines it is not the egress routing bridge for the data packet and sends the data packet onward to the egress routing bridge. The egress routing bridge decapsulates the data packet and forwards the data packet to the destination host specified in the inner header.

Design of primary and composite routing metrics for RPL-compliant Wireless Sensor Networks

Abstract: The diversity of applications that current and emerging Wireless Sensor Networks (WSNs) are called to support imposes different requirements on the underlying network with respect to delay and loss, while at the same time the WSN imposes its own intricacies. The satisfaction of these requirements highly depends on the metric upon which the forwarding routes are decided. In this view, the IETF ROLL group has proposed the RPL routing protocol, which can flexibly work on various routing metrics, as long as they hold specific properties. The system implementer/user is free to decide whether to use one or multiple routing metrics, as well as the way these metrics can be combined. In this paper, we provide ways to quantify the routing metrics so that they can be combined in an additive or lexical manner. We use extensive simulation results to evaluate the impact of several routing metrics on the achieved performance.

Surveying Position Based Routing Protocols for Wireless Sensor and Ad-hoc Networks

Abstract: A focus of the scientific community is to design network oriented position-based routing protocols and this has resulted in a very high number of algorithms, different in approach and performance and each suited only to particular applications However, though numerous, very few position-based algorithms have actually been adopted for commercial purposes This article is a survey of almost 50 position-based routing protocols and it comes as an aid in the implementation of this type of routing in various applications which may need to consider the advantages and pitfalls of position-based routing An emphasis is made on geographic routing, whose notion is clarified as a more restrictive and more efficient type of position-based routing The protocols are therefore divided into geographic and non-geographic routing protocols and each is characterized according to a number of network design issues and presented in a comparative manner from multiple points of view The main requirements of current general applications are also studied and, depending on these, the survey proposes a number of protocols for use in particular application areas This aims to help both researchers and potential users assess and choose the protocol best suited to their interest