CPHR: In-Network Caching for Information-Centric Networking with Partitioning and Hash-Routing

Wang, S; Bi, J; Wu, J; Vasilakos, AV

CPHR: In-Network Caching for Information-Centric Networking with Partitioning and Hash-Routing

Wang, S Bi, J Wu, J Vasilakos, AV

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE/ACM Transactions on Networking, 2016, 24, (5), pp. 2742-2755
Issue Date:: 2016-10-01

Closed Access

	Filename	Description	Size
	CPHR_In-Network_Caching_for_Information-Centric_Networking_With_Partitioning_and_Hash-Routing.pdf	Published version	2.26 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Wang, S
dc.contributor.author	Bi, J
dc.contributor.author	Wu, J
dc.contributor.author	Vasilakos, AV
dc.date.accessioned	2022-08-08T20:24:34Z
dc.date.available	2022-08-08T20:24:34Z
dc.date.issued	2016-10-01
dc.identifier.citation	IEEE/ACM Transactions on Networking, 2016, 24, (5), pp. 2742-2755
dc.identifier.issn	1063-6692
dc.identifier.issn	1558-2566
dc.identifier.uri	http://hdl.handle.net/10453/159774
dc.description.abstract	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.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartof	IEEE/ACM Transactions on Networking
dc.relation.isbasedon	10.1109/TNET.2015.2480093
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.subject.classification	Networking & Telecommunications
dc.title	CPHR: In-Network Caching for Information-Centric Networking with Partitioning and Hash-Routing
dc.type	Journal Article
utslib.citation.volume	24
utslib.for	0805 Distributed Computing
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2022-08-08T20:24:33Z
pubs.issue	5
pubs.publication-status	Published
pubs.volume	24
utslib.citation.issue	5

Abstract:

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/159774