Interest Reduction and PIT Minimization in Content Centric Networks
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 9
Abstract
Content Centric Networking aspires to a more efficient use of the Internet through in-path caching, multi-homing, and provisions for state maintenance and intelligent forwarding at the CCN routers. However, these benefits of CCN’s communication model come at the cost of large Pending Interest Table (PIT) sizes and Interest traffic overhead. Reducing PIT size is essential since larger memory sizes have an associated cost of slower access speeds, which would become a bottleneck in high speed networks. Similarly, Interest traffic may lead to upload capacity getting filled up which would be inefficient as well as problematic in case of traffics having bidirectional data transfers such as video conferencing. Our contribution in this paper is threefold. Firstly, we reduce PIT size by eliminating the need for maintaining PIT entries at all routers. We include the return path in the packets and maintain PIT entries at the egress routers only. Further, we use Persistent Interests (PIs), where one Interest suffices for retrieving multiple data segments, in order to reduce PIT entries at the egress routers as well as to reduce Interest overhead. This is especially useful for live and interactive traffic types where packet sizes are small leading to a large number of pipelined Interests at any given time. Lastly, since using PIs affects CCN’s original transport model, we address the affected aspects, namely congestion and flow control and multi path content retrieval. For our congestion scheme, we show that it achieves max-min fairness.
Authors and Affiliations
Aadil Zia Khan
Keywords
Related Articles
- EP ID EP393835
- DOI 10.14569/IJACSA.2018.090922
- Views 80
- Downloads 0
Automatic Facial Expression Recognition Based on Hybrid Approach
The topic of automatic recognition of facial expressions deduce a lot of researchers in the late last century and has increased a great interest in the past few years. Several techniques have emerged in order to improve...
A Multi-Threaded Symmetric Block Encryption Scheme Implementing PRNG for DES and AES Systems
Due to the ever-increasing efficiency of computer systems, symmetric cryptosystem are becoming more vulnerable to linear cryptanalysis brute force attacks. For example, DES with its short key (56 bits) is becoming easier...
: Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes
Low Density Parity Check (LDPC) code approaches Shannon–limit performance for binary field and long code lengths. However, performance of binary LDPC code is degraded when the code word length is small. An op...
Bio-inspired Think-and-Share Optimization for Big Data Provenance in Wireless Sensor Networks
Big data systems are being increasingly adopted by the enterprises exploiting big data applications to manage data-driven process, practices, and systems in an enterprise wide context. Specifically, big data systems and...
POSIX.1 conformance For Android Applications
Android operating system is designed for use in mobile computing by The Open Handset Alliance. Android market has hundreds of thousands of Android applications and these applications are restricted only to the mobiles. T...