Universal Caching Model and Markov-based cache analysis for Information Centric Networks

Universal Caching Model and Markov-based cache analysis for Information Centric Networks Information Centric Networks (ICN) is proposed as an alternative design for content-based communication rather than host-to-host-based communication. In ICN architecture, the data are cached or stored at intermediate routers to satisfy future demands locally without repeatedly getting it from the original source. For ICN architecture to work efficiently, caching policies must be defined such that most of the requests are satisfied locally. In this paper, we propose Universal Caching, a novel caching algorithm which takes into account multiple parameters like distance from the content source, frequency of fetching the content, number of outgoing links at the intermediate router. We further propose a discrete time Markov model and entropy-based analysis to determine the cache size for a given cache hit requirement at a router in ICN networks. We have also established that Universal Caching policy is in fact an optimal caching policy and have calculated the bounds for the same as well. To validate the proposed caching policy and the analytical model, we have conducted extensive MATLAB-based simulations. Our simulation results show that the Universal Caching outperforms other caching policies like Least Recently Used, First In, First Out in terms of cache hits, access delay, etc. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Universal Caching Model and Markov-based cache analysis for Information Centric Networks

Loading next page...
 
/lp/springer_journal/universal-caching-model-and-markov-based-cache-analysis-for-Y90H04u4iZ
Publisher
Springer US
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
D.O.I.
10.1007/s11107-015-0570-7
Publisher site
See Article on Publisher Site

Abstract

Information Centric Networks (ICN) is proposed as an alternative design for content-based communication rather than host-to-host-based communication. In ICN architecture, the data are cached or stored at intermediate routers to satisfy future demands locally without repeatedly getting it from the original source. For ICN architecture to work efficiently, caching policies must be defined such that most of the requests are satisfied locally. In this paper, we propose Universal Caching, a novel caching algorithm which takes into account multiple parameters like distance from the content source, frequency of fetching the content, number of outgoing links at the intermediate router. We further propose a discrete time Markov model and entropy-based analysis to determine the cache size for a given cache hit requirement at a router in ICN networks. We have also established that Universal Caching policy is in fact an optimal caching policy and have calculated the bounds for the same as well. To validate the proposed caching policy and the analytical model, we have conducted extensive MATLAB-based simulations. Our simulation results show that the Universal Caching outperforms other caching policies like Least Recently Used, First In, First Out in terms of cache hits, access delay, etc.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Sep 30, 2015

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from
Google Scholar,
PubMed
Create lists to
organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off