Sökning: id:"swepub:oai:DiVA.org:ltu-13932" >
CPHR :
-
Wang, SenSchool of Software Engineering, Chongqing University, and Key Laboratory of Dependable Service Computing in Cyber Physical Society, Ministry of Education, Chongqing
(författare)
CPHR : In-Network Caching for Information-Centric Networking With Partitioning and Hash-Routing
- Artikel/kapitelEngelska2016
Förlag, utgivningsår, omfång ...
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:ltu-13932
-
https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-13932URI
-
https://doi.org/10.1109/TNET.2015.2480093DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:art swepub-publicationtype
Anmärkningar
-
Validerad; 2016; Nivå 2; 2016-11-08 (rokbeg)
-
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.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Bi, JunInstitute for Network Sciences and Cyberspace, Tsinghua University
(författare)
-
Wu, JianpingInstitute for Network Sciences and Cyberspace, Tsinghua University
(författare)
-
Vasilakos, AthanasiosLuleå tekniska universitet,Datavetenskap(Swepub:ltu)thanos
(författare)
-
School of Software Engineering, Chongqing University, and Key Laboratory of Dependable Service Computing in Cyber Physical Society, Ministry of Education, ChongqingInstitute for Network Sciences and Cyberspace, Tsinghua University
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:IEEE/ACM Transactions on Networking24:5, s. 2742-27551063-66921558-2566
Internetlänk
Hitta via bibliotek
Till lärosätets databas