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

Weighted-CAPIC Caching Algorithm for Priority Traffic in Named Data Network

Author

Listed:
  • Leanna Vidya Yovita

    (School of Electrical Engineering, Telkom University, Bandung 40257, Indonesia)

  • Nana Rachmana Syambas

    (School of Electrical Engineering and Informatics, Bandung Institute of Technology, Bandung 40116, Indonesia)

  • Ian Joseph Matheus Edward

    (School of Electrical Engineering and Informatics, Bandung Institute of Technology, Bandung 40116, Indonesia)

Abstract

Today, the internet requires many additional mechanisms or protocols to support various ever-growing applications. As a future internet architecture candidate, the Named Data Network (NDN) offers a solution that naturally fulfills this need. One of the critical components in NDN is cache. Caching in NDN solves bandwidth usage, server load, and service time. Some research about caching has been conducted, but improvements can be made. In this research, we derived the utility function of multiclass content to obtain the relationship between the class’s weight and cache hit ratio. Then, we formulated it into the Weighted-CAPIC caching algorithm. Our research shows that Weighted-CAPIC provides a higher cache hit ratio for the priority class and the whole system. This performance is supported while the algorithm still provides the same path-stretch value as Dynamic-CAPIC. The Weighted-CAPIC is suitable to used in mobile nodes due to its ability to work individually without having to coordinate with other nodes.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jftint:v:14:y:2022:i:3:p:84-:d:769822
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/14/3/84/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/14/3/84/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    Full references (including those not matched with items on IDEAS)

    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.

      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:14:y:2022:i:3:p:84-:d:769822. 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.