.png){kind=icon}
返回
GBC-based caching function group selection algorithm for SINET
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2016.12.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
SINET
CCN
Cache
Group Betweenness Centrality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.7K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容