GBC-based caching function group selection algorithm for SINET

Abstract

The emerging future network designs such as Smart Identifier Network (SINET) and Information-Centric Networking (ICN) can provide efficient content delivery via its in-path caching. However, it is not an optimal way to cache contents at all intermediate routers for that current technology is not yet ready to support an Internet scale deployment. Most of the existing works select cache location based on the important of single node rather than that of entire cache group, which may result in inefficient problem caused by reduplicative impertinences. In this work, we study the intelligent cache location selection algorithm with an objective to maximize cache delivery performance while minimize the number of caching nodes. We first investigate the recent work in term of content location selection schemes, and formulate this problem as finding the prominent group with the highest Group Betweenness Centrality (GBC). We then propose a GBC-based in-path caching function group selection algorithm to select the caching nodes in SINET. We evaluate the performance of proposed algorithm through simulations and compare it with others. The final results show that GBC-based algorithm can provide better performance in term of average hop of content delivery. Using our finding, the network operators could deploy cache easily.