A caching strategy based on dynamic popularity for named data networking
by Meiju Yu; Ru Li
International Journal of Information Technology and Management (IJITM), Vol. 19, No. 4, 2020

Abstract: Named data networking (NDN) is a prominent architecture for the future internet. In NDN, routers have the capacity of in-network cache, which can completely improve network performance. However, the cache capacity in routers is limited and how to utilise the cache resources effectively is still a great challenge. To solve the problem, this study presents a dynamic popularity caching strategy based on additive increase multiplicative decrease for NDN (DPCA). DPCA takes content popularity and caching capacity into account and it utilises AIMD algorithm to adjust the popularity threshold dynamically. At the same time, it also proposes a evict algorithm which takes the historical information of content popularity, the trend of content request and the interval from the last request time into account. The simulation results show that the DPCA strategy can effectively improve cache hit ratio, decrease network throughput and reduce the average hit distance compared with other schemes.

Online publication date: Mon, 12-Oct-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology and Management (IJITM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com