Performance evaluation of an adaptive forwarding strategy in Named Data Networking

Named Data Networking (NDN) is an envisioned Internet architecture that uses named data to locate the data of interest as opposed to the IP address of the stored data. The forwarding strategy is critical in this network to ensure the data is well received in a timely manner. Stochastic Adaptive Forwarding (SAF) is said to have an increased throughput and provide quick recovery as it efficiently chooses the potential forwarding link whenever there is a failure on the existing link. SAF is designed to consider both the context and content of the networks to optimize its forwarding behavior. This paper compares the performance of SAF and Best Route algorithms, in terms of Interest satisfaction ratio, cache hit ratio, delay, Interest retransmission rate and hop count value. The results show SAF outperforms Best Route except for the hop count value

An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN

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

The Road Ahead for Networking: A Survey on ICN-IP Coexistence Solutions

In recent years, the current Internet has experienced an unexpected paradigm shift in the usage model, which has pushed researchers towards the design of the Information-Centric Networking (ICN) paradigm as a possible replacement of the existing architecture. Even though both Academia and Industry have investigated the feasibility and effectiveness of ICN, achieving the complete replacement of the Internet Protocol (IP) is a challenging task. Some research groups have already addressed the coexistence by designing their own architectures, but none of those is the final solution to move towards the future Internet considering the unaltered state of the networking. To design such architecture, the research community needs now a comprehensive overview of the existing solutions that have so far addressed the coexistence. The purpose of this paper is to reach this goal by providing the first comprehensive survey and classification of the coexistence architectures according to their features (i.e., deployment approach, deployment scenarios, addressed coexistence requirements and architecture or technology used) and evaluation parameters (i.e., challenges emerging during the deployment and the runtime behaviour of an architecture). We believe that this paper will finally fill the gap required for moving towards the design of the final coexistence architecture.Comment: 23 pages, 16 figures, 3 table

HoPP: Robust and Resilient Publish-Subscribe for an Information-Centric Internet of Things

This paper revisits NDN deployment in the IoT with a special focus on the interaction of sensors and actuators. Such scenarios require high responsiveness and limited control state at the constrained nodes. We argue that the NDN request-response pattern which prevents data push is vital for IoT networks. We contribute HoP-and-Pull (HoPP), a robust publish-subscribe scheme for typical IoT scenarios that targets IoT networks consisting of hundreds of resource constrained devices at intermittent connectivity. Our approach limits the FIB tables to a minimum and naturally supports mobility, temporary network partitioning, data aggregation and near real-time reactivity. We experimentally evaluate the protocol in a real-world deployment using the IoT-Lab testbed with varying numbers of constrained devices, each wirelessly interconnected via IEEE 802.15.4 LowPANs. Implementations are built on CCN-lite with RIOT and support experiments using various single- and multi-hop scenarios

Adaptive Routing Forwarding Strategy Based on Neural Network Algorithm

With the profound changes in global digital media, the focus of Internet users has gradually shifted to how to quickly obtain information without paying attention to where the information is stored. However, the current TCP/IP network protocol architecture cannot adapt to the rapid development of today#39s content applications. In order to adapt to the changes in the Internet, information-centric networking (ICN)has received extensive attention. Besides, the optimization of the user service request scheduling problem is the core issue affecting the performance of the ICN , and it is one of the hot research topics in the ICN network. To solve this problem, this paper proposes an adaptive routing forwarding strategy based on neural network algorithm. Through the modeling of the classic architecture named data networking (NDN) network delay model of ICN network, a neural network algorithm is used to delay prediction, and a forwarding strategy mechanism based on predict delay is designed to innovate in the NDN. The interface information Stat is added to the forwarding information base (FIB) of the network component to implement the dynamic selection of the forwarding routing. In addition, routing dynamic self-adaptation adjustment mechanism and fault rerouting function are designed in consideration of the situation of route congestion and interruption. Simulation results show that this strategy effectively reduces network delay and improves network performance

A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST), Pakistan, and the Higher Education Commission, Pakistan