Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication7
  4. Interest flooding reduction in Content Centric Networks
 
  • Details
Options

Interest flooding reduction in Content Centric Networks

Date Issued
09-12-2013
Author(s)
Ekambaram, Vijay
Krishna Moorthy Sivalingam 
Indian Institute of Technology, Madras
DOI
10.1109/HPSR.2013.6602313
Abstract
The Content Centric Networking (CCN) architectural framework is designed with the central abstraction of content distribution rather than host-to-host connectivity. CCN has several advantages such as inherent router caching, lower content retrieval time and network load reduction. However, it also faces various challenges such as scalability, deployment and storage issues. In particular, the routing state information that needs to be maintained in the CCN routers leads to very high memory requirements that might not be met using current technologies. If the routing state information stored in the routers is reduced, it leads to flooding of interest packets increasing congestion in the network. The objective of this paper is to propose techniques that avoid congestion due to interest flooding in CCN while having low router memory requirements. We have proposed three different algorithms to address this problem and present their performance using discrete-event simulation models. © 2013 IEEE.
Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback