It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
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.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer