Search: id:"swepub:oai:DiVA.org:ltu-13932" >
CPHR :
CPHR : In-Network Caching for Information-Centric Networking With Partitioning and Hash-Routing
-
- Wang, Sen (author)
- School of Software Engineering, Chongqing University, and Key Laboratory of Dependable Service Computing in Cyber Physical Society, Ministry of Education, Chongqing
-
- Bi, Jun (author)
- Institute for Network Sciences and Cyberspace, Tsinghua University
-
- Wu, Jianping (author)
- Institute for Network Sciences and Cyberspace, Tsinghua University
-
show more...
-
- Vasilakos, Athanasios (author)
- Luleå tekniska universitet,Datavetenskap
-
show less...
-
(creator_code:org_t)
- 2016
- 2016
- English.
-
In: IEEE/ACM Transactions on Networking. - 1063-6692 .- 1558-2566. ; 24:5, s. 2742-2755
- Related links:
-
https://urn.kb.se/re...
-
show more...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- Recently, research on Information-Centric Networking (ICN) has flourished, which attempts to shift from the current host-oriented Internet architecture to an information-oriented one. The built-in caching capability is a typical feature of ICN. In this paper, in order to fully exploit the built-in caching capability of ICN, we propose a collaborative in-network caching scheme with Content-space Partitioning and Hash-Routing, which is named as CPHR. By intelligently partitioning the content space and assigning partitions to caches, CPHR is able to constrain the path stretch incurred by hash-routing. We formulate the problem of assigning partitions to caches into an optimization problem of maximizing the overall hit ratio and propose a heuristic algorithm to solve it. We also formulate the partitioning proportion problem into a min-max linear optimization problem to balance cache workloads. By simulations with both the characteristics of real Internet traffic and traces of peer-to-peer (P2P) traffic, we show the necessity of collaborative caching since the en-route caching mode cannot yield a considerable overall hit ratio with practical cache size. It is shown as well that CPHR can significantly increase the overall hit ratio by up to about 100% with the practical cache policy Least Recently Used (LRU) while the overhead incurred is acceptable in terms of propagation latency and load on links.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Medieteknik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Media and Communication Technology (hsv//eng)
Keyword
- Mobile and Pervasive Computing
- Distribuerade datorsystem
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database