Proactive caching placement for arbitrary topology with multi-hop forwarding in ICN

Shan, Siyang, Feng, Chunyan, Zhang, Tiankui and Loo, Jonathan ORCID: (2019) Proactive caching placement for arbitrary topology with multi-hop forwarding in ICN. IEEE Access, 7. pp. 149117-149131.

[thumbnail of Loo_etal_IEEE_Access_2019_Proactive_caching_placement_for_arbitrary_topology_with_multi-hop_forwarding_in_ICN.pdf]
Loo_etal_IEEE_Access_2019_Proactive_caching_placement_for_arbitrary_topology_with_multi-hop_forwarding_in_ICN.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (606kB) | Preview


With the rapid growth of network traffic and the enhancement of the quality of experiences of users, Information-Centric Networking (ICN), which is a content-centric network architecture with named data caching and routing, is proposed to improve the multimedia content distribution efficiency. In arbitrary topology, cache nodes and users are randomly distributed and connected, hence it is challenging to achieve an optimal caching placement under this situation. In this paper, we propose a caching placement algorithm for arbitrary topology in ICN. We formulate an optimization problem of proactive caching placement for arbitrary topology combined with multi-hop forwarding, with an objective to optimize the user delay and the load balancing level of the nodes simultaneously. Since the original problem is NP-hard, we solve the formulated caching placement problem in two sub-problems, content replica allocation subproblem and content replica placement sub-problem. First, in the content replica allocation sub-problem, the replica number of each content is obtained by utilizing the auction theory. Second, the replica number of each content is used as a constraint for the content replica placement sub-problem, which is solved by matching theory. The caching placement algorithm combined with multi-hop NRR forwarding maximizes the utilization of cache resources in order to achieve better caching performance. The numerical results show that significant hop count savings and load balancing level improvement are attainable via the proposed algorithm.

Item Type: Article
Identifier: 10.1109/access.2019.2947064
Additional Information: This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see
Keywords: ICN, IoT, Caching Placement, Multi-hop For-warding, Arbitrary Topology
Subjects: Computing > Systems > Computer networking
Computing > Systems > Distributed computing
Depositing User: Jonathan Loo
Date Deposited: 02 Oct 2019 12:20
Last Modified: 06 Feb 2024 16:01


Downloads per month over past year

Actions (login required)

View Item View Item