MCPC: Improving In-Network Caching with Network Partitions

• Published in: 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) pp. 730 - 738
• Main Authors: He, Dongbiao, Jiang, Jinlei, Yang, Guangwen, Westphal, Cedric
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-12-2018
• Subjects: 5G mobile communication; Access Latency; Content Placement; Greedy algorithms; In-Network Caching; Indexes; Network Partition; Network topology; Requests Aggregation; Resource management; Routing; Servers
• DOI: 10.1109/PADSW.2018.8644920

In-network caching is considered to be an important solution to efficiently using network resources to achieve a high overall content delivery performance in both information-centric networks (ICNs) and 5G wireless networks. Content placement plays a key role in achieving this goal. Unfortunately, most content placement strategies today rely on opportunistic caching due to the problem complexity. We analyze the content placement problem in detail and present MCPC, a new content placement strategy for architectures that support in-network caching. Unlike existing content placement approaches that try to increase cache hit ratio, MCPC leverages the information recorded in each network node to reduce content access latency. MCPC proposes two new mechanisms: 1) a content load allocation estimation method based on local requests aggregation information; and 2) a content placement algorithm that avoids long-distance signaling messages by partitioning the network into smaller domains. We evaluate MCPC on a variety of network topologies, cache sizes and content popularity distributions. The experimental results show that MPCP can reduce by up to 56% the content access latency while providing comparable cache hit ratios as traditional benchmarks.