Towards disruption tolerant ICN

Delay-tolerant network (DTN) architectures have recently been proposed as a means to enable efficient routing of messages in vehicular area networks (VANETs), which are characterized by alternating periods of connectivity and disconnection. Under such architectures, when multihop connectivity is available, messages propagate at the speed of radio over connected vehicles. On the other hand, when vehicles are disconnected, messages are carried by vehicles and propagate at vehicle speed. Our goal in this paper is to analytically determine what gains are achieved by DTN architectures and under which conditions, using the average message propagation speed as the primary metric of interest. We develop an analytical model for a bidirectional linear network of vehicles, as found on highways. We derive both upper and lower bounds on the average message propagation speed by exploiting a connection with the classical pattern-matching problem in probability theory. The bounds reveal an interesting phase transition behavior. Specifically, we find out that, below a certain critical threshold, which is a function of the traffic density in each direction, the average message speed is the same as the average vehicle speed, i.e., DTN architectures provide no gain. On the other hand, we determine another threshold above which the average message speed quickly increases as a function of traffic density and approaches radio speed. Based on the bounds, we also develop an approximation model for the average message propagation speed that we validate through numerical simulations.

In recent years, several investigations have been made on "challenged network" [also known as, delay tolerant network (DTN)] architectures highlighting their advantages and disadvantages. In spite of its inherent shortcomings of unreliability and delay, smart-phone based opportunistic network is gaining immense popularity in the research community due to its applicability in different adverse and extreme communication scenarios where traditional communication infrastructure is either unavailable or incapacitated for a long time. Considerable research has been conducted till date to design efficient network architecture for emergency data dissemination in intermittently connected/challenged networks. Different architectures (ranging from flat to multi-tier) are proposed for implementing opportunistic DTN keeping in view of specific application requirements. However, very few of these proposed architectures have been examined from the perspective of a post disaster communication. Moreover, most DTN architectures are designed by aiming towards increasing delivery probability and reducing latency and as a whole, maximizing network throughput; with very little emphasis on its energy efficiency. The impact of different mobility patterns on existing DTN routing algorithms with respect to data dissemination and energy consumption has also not been studied so far. Our objective, in this paper, is to investigate the impact of different mobility patterns on existing DTN routing protocols and existing DTN architectures and subsequently, come up with a suitable energy efficient DTN framework combining suitable architecture and routing protocol that may be used to offer different disaster management services during post-disaster relief operation. We have done an extensive simulation on ONE simulator with different categories of well-known existing DTN architectures, mobility models, DTN routing protocols to study the network performance in terms of delivery probability, energy efficiency and overhead ratio. Based on the simulation results, we have tried to figure out a suitable combination of energy efficient architecture, mobility model and routing protocol that fits well in the post disaster communication scenario.

The High-Rate Delay Tolerant Networking (HDTN) project has taken a distributed service-based approach to the development of a highly efficient delay tolerant networking (DTN) implementation. Through the analysis of many DTN implementations, system and mission requirements as well as the DTN protocol specifications, HDTN has worked to infuse modern computing technologies into the NASA approach to interplanetary networking.The initial use case of the HDTN software runs on a hypervisor representative of the International Space Station (ISS) DTN Gateway. In this scenario, multiple emulated payloads will send science data through HDTN to a mission operations center. HDTN will provide store and forward capability as well as network flow management.This paper discusses the infusion path of cognitive networking technologies in the NASA Space Communications and Navigation (SCaN) networks using the DTN architecture and protocols as the basis for cognitive routing and network management capabilities. HDTN has been developing the Bundle Protocol encoding and decoding mechanisms and messaging framework that can be used as the basis for integrating DTN with various learning and decision-making processes. The concepts of distributed computing, network virtualization, software defined networking and delay tolerant networking are basic building blocks which will further the development of cognitive networking. In addition to discussion of the HDTN software development and testing, this paper examines the role that each of these technologies play in the evolution of the current state of space networking into an intelligent network of networks.

A survey of routing and data dissemination in Delay Tolerant Networks

7 - Assessing the Bundle Protocol (BP) and alternative approaches to data bundling in delay-tolerant networks (DTNs)

The increase of data-rates that are provided by free-space optical (FSO) communications is essential in our data-driven society. When used in satellite and interplanetary networks, these optical links can ensure fast connections, yet they are susceptible to atmospheric disruptions and long orbital delays. The Delay and Disruption Tolerant Networking (DTN) architecture ensures a reliable connection between two end nodes, without the need for a direct connection. This can be an asset when used with FSO links, providing protocols that can handle the intermittent nature of the connection. This paper provides a review on the theoretical and state-of-the-art studies on FSO and DTN. The aim of this review is to provide motivation for the research of an optical wireless satellite network, with focus on the use of the Licklider Transmission Protocol. The assessment presented establishes the viability of these networks, providing many examples to rely on, and summarizing the most recent stage of the development of the technologies addressed.

Modeling chunk-based content placement in information centric networking

An instance of information-centric networking (ICN) is Content-Centric Networking (CCN) which represents the upcoming generation of the Internet paradigm. CCN concentrates on content distribution by allowing it to become routable and addressable directly. Its fundamental objectives are to enhance the conventional network operations by allowing the network equipments to perform routing decisions depending on the content’s name instead of host address. Unlike IPv4/6, the CCN names are hierarchically structured and have long, changeable, and unlimited lengths, which makes the quick name lookup an issue that needs to be addressed. Despite the considerable preferences of CCN architecture, hardware challenges, including Forwarding Information Base (FIB) are remain existing in the implementation of CCN. Fast memory lookup and adequate storage requirements represent the most important issues within these challenges. This paper presents an up-to-date survey of FIB design techniques in content-centric networks. Its main purpose is to classify comprehensive FIB designing and implementation techniques in an abridged style. Then presenting their pros and cons and identifying the requisite necessities for preferable FIB enhancement in terms of scalability.KeywordsContent-centric networkingForwarding information baseInterest packetData packet

In this paper, for secure routing optimization we are introducing dynamic trust management protocol in information centric network and delay tolerant network (DTN) environments. In the existing system, dynamic trust management for DTN is used to deal with the detection of the selfish, malicious misbehaving nodes and genuine loss nodes. To disrupt DTN operations, malicious nodes performing trust-related assaults. Human conveying message devices in a DTN are communally egotistic to outsiders but altruistic to friends. The proposed system is designed to identify the malicious node and selfish node based on checking the node energy level and buffer level using multi-hop forwarding algorithm. But it is time consuming process. In the Proposed System, we implement ICN for validating the node history based on payoff calculation of node. It provides security and less time consumption. Before data transmission, ICN identifies the malicious node and selfish node based on Repetitive Trust Management and Adversary Detection scheme.

Despite the notable progress that has been achieved on long-haul radio and optical communications, which are expected to improve the data transfer rates of future space exploration missions, both scheduled and random link outages remain possible. To improve reliability, NASA’s delay-tolerant networking (DTN) architecture offers the Bundle Protocol (BP) and the Licklider Transmission Protocol (LTP) that implement bundle custodial transfer and automatic repeat query retransmissions. We analyze the performance of these protocols considering the default flow control method of LTP, which limits the number of concurrent sessions. We derive the combined BP and LTP throughput and provide approximations for model parameters that are difficult to find exactly. Event-driven simulations suggest that our analysis is reasonably accurate under different channel conditions and protocol settings. The proposed model provides insight into the role of the channel conditions, the workload, and the choice of BPLTP protocol parameters on the performance of a reliable space link.

Information-Centric Networking (ICN) emerges as a promising architecture for the future Internet to keep up with the tremendous growth of Internet users and the explosive increase of mobile data traffic. ICN can be coupled with Disruption Tolerant Networking (DTN) to overcome the limitations of the current Internet architecture in some challenging environments where we cannot establish a network connection, and also lighten the load on the Internet backhaul. Unfortunately, resources constraints, such as energy and buffer space, are among the most serious issues in Mobile Information-Centric Disruption Tolerant Networking (MICDTN). In this paper, we introduce an opportunistic DTN-based forwarding mechanism of Interest and Data for ICN, named Fast-MICDTN. The propagation of the content have been modeled using Markov-Decision Process (MDP). Hence, we characterize the living period in transit of the content to reach the maximum possible number of mobiles. Through extensive simulations based on synthetic mobility model and real-world traces, we prove the efficiency of the new approach in sharing content within a large number of users under a low cost.

최근에 기존 IP기반과는 다른, 정보 중심 네트워킹이 부각되고 있으며 그 중의 하나인 Content-Centric Networking(CCN)은 Van Jacobson에 의해 처음 제안되어 대표적인 정보 중심 네트워킹 패러다임으로 활발히 연구되고 있다. CCN은 콘텐츠 자체에 대한 접근과 전달에 목표를 두고 라우터에서 콘텐츠의 배분이 가능토록 하여 IP 방식보다 좀 더 빠르게 콘텐츠가 전달되도록 하는 장점을 가지고 있다. 하지만, CCN은 정보요청자 기준의 통신(pull-based)으로 사전 요청패킷의 전송없이 정보를 분배하는 것이 제한된다. 또한, PIT(Pending Interest Table)의 사용으로 DDoS 공격 등을 받을 시 PIT 메모리 오버로드의 문제점이 있다. 이에 본 논문은 CCN에서 요청패킷 없이 정보를 전달하는 push-based 기법과 PIT 오버로드 상황에서 데이터 전달이 가능하도록 Interest Group Pushing Table(IGPT)을 활용한 정보전송 방법을 제안한다. 제안하는 기법은 데이터 전송의 신속성 및 보안성 향상 측면에서 기존의 기법보다 동일 시간동안 많은 양의 콘텐츠 전송이 가능하다. Recently, Information-Centric Networking(ICN), different from traditional IP-based networking, has been highlighted. Content-Centric Networking(CCN), proposed by Van Jacobson, is a representative scheme of the ICN architectures. It can deliver messages slightly faster than the IP-based networking by focusing on the access and delivery to the content itself. However, CCN is restricted to distribute the information without transmitting the request packet in advance because it is pull-based architecture by content requester. In addition, it has a problem that the Pending Interest Table(PIT) could be overloaded easily when DDoS attack happens. In this paper, we suggest an algorithm using a push-based scheme without request packets and overcoming PIT overload situation by Interest Group Push Table(IGPT). The proposed scheme enables to transmit a large amount of content than an existing scheme during the same amount of time in terms of timely-delivery and security.

In the last few years, the research community has witnessed the rapid development of the Information-Centric Networking (ICN) approach aiming at evolving the Internet from today's host based packet delivery towards directly retrieving information in a secure, reliable, scalable, and efficient way. The Internet of Things (IoT) concept envisions scenarios in which “smart objects” can be interconnected to enable a whole new class of applications and services, positively increasing the impact of Information and Communication Technologies (ICT). Although ICN tested scenarios have been mainly limited to multimedia and data, quoted advantages of ICN make from this architectural design a valuable approach in addressing the challenges that arise from the increasing deployment of IoT. In general, IoT applications impose stringent requirements in terms of information freshness, which can be highly impacted by the intrinsic caching mechanisms existing in ICN approaches. In the present work, the available freshness mechanism conceived as part of the Content-Centric Networking (CCN) protocol is assessed and a novel consumer driven information freshness approach is proposed to satisfy the consumers' needs while mitigating the negative effect of the freshness requirements in the overall network performance. The new mechanism was evaluated through simulation, with obtained results showing that the proposed approach leads to better performance, as compared with the available CCN freshness mechanism.

This paper proposes a Software-Defined Delay Tolerant Networking (SDDTN) architecture as a solution to managing large Delay Tolerant Networking (DTN) networks in a scalable manner. This work is motivated by the planned deployments of large DTN networks on the Moon and beyond in deep space. Current space communication involves relatively few nodes and is heavily deterministic and scheduled, which will not be true in the future. It is unclear how these large space DTN networks, consisting of inherently intermittent links, will be able to adapt to dynamically changing network conditions. In addition to the proposed SDDTN architecture, this paper explores data plane programming and the Programming Protocol-Independent Packet Processors (P4) language as a possible method of implementing this SDDTN architecture, enumerates the challenges of this approach, and presents intermediate results.

Research interest about Information Centric Networking (ICN) has grown at a very fast pace over the last few years, especially after the 2009 seminal paper of Van Jacobson et al. describing a Content Centric Network (CCN) architecture. While significant research effort has been produced in terms of architectures, algorithms, and models, the scientific community currently lacks common tools and scenarios to allow a fair cross-comparison among the different proposals. The situation is particularly complex as the commonly used general-purpose simulators cannot cope with the expected system scale: thus, many proposals are currently evaluated over small and unrealistic scale, especially in terms of dominant factors like catalog and cache sizes. As such, there is need of a scalable tool under which different algorithms can be tested and compared. Over the last years, we have developed and optimized ccnSim, an highly scalable chunk-level simulator especially suitable for the analysis of caching performance of CCN network. In this paper, we briefly describe the tool, and present an extensive benchmark of its performance. To give an idea of ccnSim scalability, a common off-the-shelf PC equipped with 8GB of RAM memory is able to simulate 2-hours of a 50-nodes CCN network, where each nodes is equipped with 10GB caches, serving a 1PB catalog in about 20 min CPU time.