Joint Incentive Mechanism for Paid Content Caching and Price Based Cache Replacement Policy in Named Data Networking
Open Access
- 18 June 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6 (99), 33702-33717
- https://doi.org/10.1109/access.2018.2848231
Abstract
Internet traffic volume is continuing to increase rapidly. Named Data Networking (NDN) has been introduced to support this Internet traffic growth through caching contents close to consumers. While caching in NDN is beneficial to both Internet Service Providers (ISPs) and Content Providers (CPs), ISPs serve cached contents independently without any coordination with CPs. By authorizing the ISPs to cache and distribute the contents accessible on payments, it becomes impractical for CPs to control content access and payments. In this work, we address these challenges by proposing a joint incentive mechanism and price based cache replacement policy for paid content in NDN that improves the ISP’s and CPs’ profits. We use an auction theory, where the ISP earns profits from caching by alleviating traffic load on transit links and participating in contents selling. Therefore, before the ISP starts selling cached contents, it needs to cache them first. Furthermore, the ISP cache capacity is limited, so we propose Price Based Cache Replacement (PBCR), where PBCR triggers the content that needs to be replaced when the cache storage is full based on both content price and link cost. The simulation results show that our proposal increases the profits of all the network players involved in paid content caching and improves cache hit ratio.Keywords
This publication has 26 references indexed in Scilit:
- Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures)IEEE Transactions on Parallel and Distributed Systems, 2015
- Analyzing Impact of Introducing CCN on Profit of ISPsIEEE Transactions on Network and Service Management, 2015
- SRSC: SDN-based routing scheme for CCNPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2015
- Revisiting caching in content delivery networksACM SIGMETRICS Performance Evaluation Review, 2014
- Distributed caching in unstructured peer-to-peer file sharing networksComputers and Electrical Engineering, 2014
- A comparative study of Content-Centric and Content-Distribution Networks: Performance and boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Caching in information centric networking: A surveyComputer Networks, 2013
- Measuring ISP topologies with rocketfuelACM SIGCOMM Computer Communication Review, 2002
- LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policiesInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2001
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functionsDiscrete Applied Mathematics, 1999