Enhancing multi-source content delivery in content-centric networks with fountain coding

Fountain coding has been considered as especially suitable for lossy environments, such as wireless networks, as it provides redundancy while reducing coordination overheads between sender(s) and receiver(s). As such it presents beneficial properties for multi-source and/or multicast communication. In this paper we investigate enhancing/increasing multi-source content delivery efficiency in the context of Content-Centric Networking (CCN) with the usage of fountain codes. In particular, we examine whether the combination of fountain coding with the in-network caching capabilities of CCN can further improve performance. We also present an enhancement of CCN's Interest forwarding mechanism that aims at minimizing duplicate transmissions that may occur in a multi-source transmission scenario, where all available content providers and caches with matching (cached) content transmit data packets simultaneously. Our simulations indicate that the use of fountain coding in CCN is a valid approach that further increases network performance compared to traditional schemes

Design and Implementation of a Fully Distributed Caching Algorithm on an NDN System

ICN (Information Centric Networking) is a new method of storing and accessing data on the internet which focuses on the content itself rather than the IP (Internet Protocol) address where the content is stored. ICN enables both in-network caching and name-based data retrieval. This allows for better usage of edge cloud resources, giving the user a faster response time as some data requests and services may be handled locally. NDN (Named Data Networking) is a specific type of ICN which locates and delivers content based on the associated data name rather than using the source or destination host addresses. For NDN to be most beneficial, we need to implement efficient caching algorithms that consider the needs of many users in a network. To address this need, we have developed a caching algorithm for an NDN network in a tree topology. It is fully distributed and makes storage and eviction decisions at each router based on the number of hops needed to retrieve the data and the popularity of the data at that router. The total number of hops taken by all data during the testing period determined the algorithm’s true cost. We tested our algorithm using an NDN testbed and compared its true cost with another commonly used algorithm, LRU (Least Recently Used), under the same conditions. Our cost-based policy incurred a lower true cost in all test cases, with average savings ranging from 9% to 19% depending on cache size and popularity distribution. The cost policy performed particularly well in comparison to LRU when the cache size was small

Caching on Named Data Network: a Survey and Future Research

The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance

Poseidon: Mitigating Interest Flooding DDoS Attacks in Named Data Networking

Content-Centric Networking (CCN) is an emerging networking paradigm being considered as a possible replacement for the current IP-based host-centric Internet infrastructure. In CCN, named content becomes a first-class entity. CCN focuses on content distribution, which dominates current Internet traffic and is arguably not well served by IP. Named-Data Networking (NDN) is an example of CCN. NDN is also an active research project under the NSF Future Internet Architectures (FIA) program. FIA emphasizes security and privacy from the outset and by design. To be a viable Internet architecture, NDN must be resilient against current and emerging threats. This paper focuses on distributed denial-of-service (DDoS) attacks; in particular we address interest flooding, an attack that exploits key architectural features of NDN. We show that an adversary with limited resources can implement such attack, having a significant impact on network performance. We then introduce Poseidon: a framework for detecting and mitigating interest flooding attacks. Finally, we report on results of extensive simulations assessing proposed countermeasure.Comment: The IEEE Conference on Local Computer Networks (LCN 2013