Domain-orientated Coordinated Hybrid Content Caching and Request Search in Information-centric Networking

RUI Lanlan; KONG Jiahui; HUANG Haoqiu; PENG Hao

doi:10.11999/JEIT170212

Volume 39 Issue 11

Nov. 2017

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2017 > 39(11): 2741-2747

RUI Lanlan, KONG Jiahui, HUANG Haoqiu, PENG Hao. Domain-orientated Coordinated Hybrid Content Caching and Request Search in Information-centric Networking[J]. Journal of Electronics & Information Technology, 2017, 39(11): 2741-2747. doi: 10.11999/JEIT170212

Citation:

RUI Lanlan, KONG Jiahui, HUANG Haoqiu, PENG Hao. Domain-orientated Coordinated Hybrid Content Caching and Request Search in Information-centric Networking[J]. Journal of Electronics & Information Technology, 2017, 39(11): 2741-2747. doi: 10.11999/JEIT170212

Citation:

PDF( 976 KB)

Domain-orientated Coordinated Hybrid Content Caching and Request Search in Information-centric Networking

doi: 10.11999/JEIT170212

Funds:

The National Natural Science Foundation of China (61302078, 61372108), The National 863 Program of China (2011AA01A102), The National ST Major Project (2011ZX 03005-004-02)

Received Date: 2017-03-17
Rev Recd Date: 2017-07-20
Publish Date: 2017-11-19

Abstract

Abstract

In-network caching is always a hot topic in the research of Information-Centric Networking (ICN). Most of traditional caching coordination research use uniform caching policies within the same cache network, but the aim of different network part is quite various, thus the existed schemes are hard to achieve a comprehensive performance optimization or hard to scale. Additionally, most work fail to adapt to the on-path coupling effect content caching and request routing. This paper proposes and evaluates novel domain-orientated coordinated hybrid content caching and request search in ICN, which fully exploit content- space partitioning and divide the cache network into a core area and several edge areas. The off-path HASH-based coordination scheme is applied to core area and on-path reversion scheme is deployed in edge areas. The binary tuple is created to record the information of content placement and guides the request routing. Through simulation and comparison, it is found that the proposed policies yield better tradeoff between network-centric and user-centric performance than traditional schemes, and are scalable to be used in large ISPs.
- Information-Centric Network (ICN),
- Caching network,
- Hybrid,
- Routing request

FullText(HTML)

References(18)

References

WANG L, TYSON G, KANGASHARJU J, et al. FairCache: introducing fairness to ICN caching technical report[C]. 2016 IEEE 24th International Conference on Network Protocols (ICNP), Singapore, 2016: 1-10. doi: 10.1109/ICNP. 2016.7784440.

芮兰兰, 彭昊, 黄豪球, 等. 基于内容流行度和节点中心度匹配的信息中心网络缓存策略[J]. 电子与信息学报, 2016, 38(2): 325-331. doi: 10.11999/JEIT150626.

RUI Lanlan, PENG Hao, HUANG Haoqiu, et al. Popularity and centrality based selective caching scheme for information-centric networks[J]. Journal of Electronics Information Technology, 2016, 38(2): 325-331. doi: 10.11999 /JEIT150626.

RATH HK, PANIGRAHI B J, and SIMHA A. On cooperative on-path and off-path caching policy for information centric networks[C]. IEEE, International Conference on Advanced Information Networking and Applications, Crans-Montana, Switzerland, 2016: 842-849.

CHAI W, HE D, PSARAS I, et al. Cache Less for More in information-centric networks (Extended Version)[J]. Computer Communications, 2013, 36(7): 758-770.

MING Zhongxing, XU Mingwei, and WANG Dan. Age-based cooperative caching in Information-Centric Networks[C]. IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Florida, USA, 2012: 268-273.

PSARAS I, CHAI W, and PAVLOU G. Probabilistic in-network caching for information-centric networks[C]. Edition of the Icn Workshop on Information-Centric NETWORKING. ACM, Helsinki, Finland, 2012: 55-60.

CHO K, LEE M, Park K, et al. WAVE: Popularity-based and collaborative in-network caching for content-oriented networks[J]. Proceedings-IEEE INFOCOM, 2012, 11(12): 316-321. doi: 10.1109/INFCOMW.2012.6193512.

LI Z and SIMON G. Time-shifted TV in content centric networks: The case for cooperative in-network caching[C]. Proceedings of IEEE International Conference on Communications (ICC), Kyoto, Japan, 2011, 41(4): 1-6.

SAINO L, PSARAS I, and PAVLOU G. Hash-routing schemes for information centric networking[C]. ACM SIGCOMM Workshop on Information-Centric NETWORKING, Hong Kong, China, 2013: 27-32.

吴海博, 李俊, 智江, 等. 基于概率的启发式ICN缓存内容放置方法[J]. 通信学报, 2016, 37(5): 62-72. doi: 10.11959/j.issn. 1000-436x.2016093.

WU Haibo, LI Jun, and ZHI Jiang. Probability-based heuristic content placement method for ICN caching[J]. Journal on Communications, 2016, 37(5): 62-72. doi: 10. 11959/j.issn.1000-436x.2016093.

LAKHANI H, MCCATHY T, KIM M, et al. Evaluation of a delay-tolerant ICN architecture[C]. International Conference on Ubiquitous and Future Networks (ICUFN), Sapporo, Japan, 2015: 950-955.

SPRING N, MAHAJAN R, WETHERALL D, et al. Measuring ISP topologies with rocketfuel[J]. Acm Sigcomm Computer Communication Review, 2002, 32(4): 133-145. doi: 10.1109/TNET.2003.822655.

ALVAREZ-HAMELIN I, DALL'ASTAL L, BARRAT A, et al. k-core decomposition: A tool for the visualization of large scale networks[J]. Computer Science, 2005, 56(2): 18-20.

SHI Xiaoqiu, HAN Jinsong, LIU Yunhao, et al. Popularity adaptive search in hybrid P2P systems[J]. Journal of Parallel and Distributed Computing, 2009, 69(2): 125-134.

ROSENSWEIG E and KUROSE J. Breadcrumbs: Efficient, best-effort content location in cache networks[C]. The IEEE Conference on Computer Communications, Brazil, 2009: 2631-2635.

ZHANG Guoqiang, WANG Xiaohui, GAO Qian, et al. A hybrid ICN cache coordination scheme based on role Division between cache nodes[C]. IEEE Global Communications Conference, London, UK, 2015: 1-6.

Relative Articles

Supplements(0)

Cited By

Proportional views