IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v12y2020i12p227-d459268.html
   My bibliography  Save this article

Performance Analysis of Cache Based on Popularity and Class in Named Data Network

Author

Listed:
  • Leanna Vidya Yovita

    (School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Kota Bandung 40132, Indonesia)

  • Nana Rachmana Syambas

    (School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Kota Bandung 40132, Indonesia)

  • Ian Joseph Matheus Edward

    (School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Kota Bandung 40132, Indonesia)

  • Noriaki Kamiyama

    (Department of Electronics Engineering and Computer Science, Fukuoka University, Fukuoka 814-0180, Japan)

Abstract

The communication network is growing with some unique characteristics, such as consumers repeatedly request the same content to the server, similarity in local demand trend, and dynamic changes to requests within a specific period. Therefore, a different network paradigm is needed to replace the IP network, namely Named Data Network (NDN). The content store, which acts as a crucial component in the NDN nodes is a limited resource. In addition, a cache mechanism is needed to optimize the router’s content store by exploiting the different content services characters in the network. This paper proposes a new caching algorithm called Cache Based on Popularity and Class (CAPIC) with dynamic mechanism, and the detail explanation about the static method also presented. The goal of Static-CAPIC was to enhance the total cache hit ratio on the network by pre-determining the cache proportion for each content class. However, this technique is not appropriate to control the cache hit ratio for priority class. Therefore, the Dynamic-CAPIC is used to provide flexibility to change the cache proportion based on the frequency of requests in real-time. The formula involves considering the consumers’ request all the time. It gives a higher cache hit ratio for the priority content class. This method outperforms Static-CAPIC, and the LCD+sharing scheme in the total network cache hit ratio parameter and channels it to the priority class.

Suggested Citation

  • Leanna Vidya Yovita & Nana Rachmana Syambas & Ian Joseph Matheus Edward & Noriaki Kamiyama, 2020. "Performance Analysis of Cache Based on Popularity and Class in Named Data Network," Future Internet, MDPI, vol. 12(12), pages 1-22, December.
  • Handle: RePEc:gam:jftint:v:12:y:2020:i:12:p:227-:d:459268
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/12/12/227/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/12/12/227/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Xin Zheng & Gaocai Wang & Qifei Zhao, 2019. "A Cache Placement Strategy with Energy Consumption Optimization in Information-Centric Networking," Future Internet, MDPI, vol. 11(3), pages 1-16, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Leanna Vidya Yovita & Nana Rachmana Syambas & Ian Joseph Matheus Edward, 2022. "Weighted-CAPIC Caching Algorithm for Priority Traffic in Named Data Network," Future Internet, MDPI, vol. 14(3), pages 1-15, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nikos Fotiou, 2020. "Information-Centric Networking (ICN)," Future Internet, MDPI, vol. 12(2), pages 1-2, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:12:y:2020:i:12:p:227-:d:459268. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.