Please use this identifier to cite or link to this item:
Title: A Content Caching Strategy for Named Data Networking
Keywords: Named Data Networking,Performance evaluation,Cache Policy,Network of Caches,Simulation,Modeling
Issue Date: 29-Dec-2014
Citation: SEYED MOSTAFA SEYED REZAZAD DALALY (2014-12-29). A Content Caching Strategy for Named Data Networking. ScholarBank@NUS Repository.
Abstract: The type of applications that Internet is being used for is completely different from what it was invented for. Whilst resource sharing was the first goal of networking, accessing huge data, such as multimedia files, is the main usage of the Internet now. The nature of multimedia content requires multicasting which is hard to provide in current point-to-point paradigm of TCP/IP protocol. In addition, concepts like mobility, security, efficiency, billing etc were not the first concern of designers of the Internet. That explains the recent movements toward designing a more efficient Internet which matches the current requirements. Named Data Networking is one of the successful proposals that has received a lot of attention. By giving name to content, NDN enables in-network caching. However, efficiency of in-network caching has been questioned by experts. Therefore, in this thesis we propose a cache policy, CCndnS, which can increase the efficiency of in-network caching. The idea can be generalized to the domain of Content Networking but we analyzed our approach with NDN. We realize that the source of inefficiency in a network of caches is the dependency between caches. To break the dependency, each cache regardless of its location in the network should receive independent set of requests. Without such characteristic, only misses of the downstream caches make their way to the upper caches. That filtering effect establishes a hidden dependency between neighboring caches. CCndnS breaks files into smaller segments and spreads them in the path between requesters and publishers. Requests for a segment skip searching intermediate caches to search only the cache with corresponding segment. We present mathematical equations for cache and network hit rate when CCndnS is applied. We show that how CCndnS can simplify this task. The model can be used for further studies on cache performance or in a real application such as Service Level Agreement application. Using CCndnS we suggest some techniques to improve the forwarding architecture of an NDN router for a better match with line speed throughput. Performance of a cache can even be improved more with partitioning scheme. A dynamic partitioning scheme is presented in this thesis. The scheme can be used to enhance other features like fairness as well. All ideas and proposed techniques are tested with an event-driven simulator that we implemented.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
SeyedRezazadSMD-signed.pdf1.47 MBAdobe PDF



Page view(s)

checked on Oct 5, 2018


checked on Oct 5, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.