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

Quality-of-Service-Linked Privileged Content-Caching Mechanism for Named Data Networks

Author

Listed:
  • Shrisha H. S.

    (Department of Information Science and Engineering, Malnad College of Engineering, Visvesvaraya Technological University, Hassan 573202, India)

  • Uma Boregowda

    (Department of Computer Science and Engineering, Malnad College of Engineering, Visvesvaraya Technological University, Hassan 573202, India)

Abstract

The domain of information-centric networking (ICN) is expanding as more devices are becoming a part of connected technologies. New methods for serving content from a producer to a consumer are being explored, and Named Data Networking (NDN) is one of them. The NDN protocol routes the content from a producer to a consumer in a network using content names, instead of IP addresses. This facility, combined with content caching, efficiently serves content for very large networks consisting of a hybrid and ad hoc topology with both wired and wireless media. This paper addresses the issue of the quality-of-service (QoS) dimension for content delivery in NDN-based networks. The Internet Engineering Task Force (IETF) classifies QoS traffic as (prompt, reliable), prompt, reliable, and regular, and assigns corresponding priorities for managing the content. QoS-linked privileged content caching (QLPCC) proposes strategies for Pending Interest Table (PIT) and content store (CS) management in dedicated QoS nodes for handling priority content. QoS nodes are intermediately resourceful NDN nodes between content producers and consumers which specifically manage QoS traffic. The results of this study are compared with EQPR, PRR probability cache, and Least Frequently Used (LFU) and Least Fresh First (LFF) schemes, and QLPCC outperformed the latter-mentioned schemes in terms of QoS-node CS size vs. hit rate (6% to 47%), response time vs, QoS-node CS size (65% to 90%), and hop count vs. QoS-node CS size (60% to 84%) from the perspectives of priority traffic and overall traffic. QLPCC performed predictably when the NDN node count was increased from 500 to 1000, showing that the strategy is scalable.

Suggested Citation

  • Shrisha H. S. & Uma Boregowda, 2022. "Quality-of-Service-Linked Privileged Content-Caching Mechanism for Named Data Networks," Future Internet, MDPI, vol. 14(5), pages 1-24, May.
  • Handle: RePEc:gam:jftint:v:14:y:2022:i:5:p:157-:d:820272
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/14/5/157/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/14/5/157/
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Nemat Hazrati & Sajjad Pirahesh & Bahman Arasteh & Seyed Salar Sefati & Octavian Fratu & Simona Halunga, 2025. "Cache Aging with Learning (CAL): A Freshness-Based Data Caching Method for Information-Centric Networking on the Internet of Things (IoT)," Future Internet, MDPI, vol. 17(1), pages 1-24, January.

    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:5:p:157-:d:820272. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.