• DocumentCode
    2961736
  • Title

    A fairness analysis of content centric networks

  • Author

    Tortelli, M. ; Cianci, I. ; Grieco, L.A. ; Boggia, G. ; Camarda, P.

  • Author_Institution
    DEE, Politec. di Bari, Bari, Italy
  • fYear
    2011
  • fDate
    28-30 Nov. 2011
  • Firstpage
    117
  • Lastpage
    121
  • Abstract
    In recent years the new vision of data-centric networks has emerged as a natural way to satisfy user needs in the Future Internet. It is based on novel architectures oriented towards data sharing and delivering as opposite to classic host-to-host communications. Among several proposals, Content Centric Networking has been conceived as a very promising solution by the Palo Alto Research Center team. It can be gradually deployed over current IP networks and solves different problems, as NAT Traversal, depletion of IP addresses, security, mobility, and multicast communications. In this work an analytical framework for investigating properties of Content Centric Network is proposed, with a particular focus on fairness in cache usage. It captures the distribution of content replicas among nodes of the network by taking into account contents availability, data popularity, topology information, and cache size. Preliminary results, validated using numerical simulations, shed some light on the underlying fairness of a Content Centric Network, thus helping future developments and upgrades on the current architecture.
  • Keywords
    IP networks; Internet; computer network security; multicast communication; numerical analysis; telecommunication network topology; IP networks; Internet; content centric network fairness analysis; data-centric networks; host-to-host communications; multicast communications; numerical simulations; IP networks; Jacobian matrices; Security; CCN; Data centric networks; theoretical model;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network of the Future (NOF), 2011 International Conference on the
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-4577-1605-8
  • Type

    conf

  • DOI
    10.1109/NOF.2011.6126670
  • Filename
    6126670