面向分域信息中心網(wǎng)絡(luò)的協(xié)作混合緩存和路由策略
doi: 10.11999/JEIT170212
基金項目:
國家自然科學(xué)基金(61302078, 61372108)，國家863計劃項目(2011AA01A102)，國家科技重大專項(2011ZX03005-004-02)
Domain-orientated Coordinated Hybrid Content Caching and Request Search in Information-centric Networking
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)
-
摘要: 網(wǎng)內(nèi)緩存技術(shù)一直是信息中心網(wǎng)絡(luò)(Information-Centric Networking, ICN)研究中的核心問題。傳統(tǒng)緩存方案通常為網(wǎng)絡(luò)內(nèi)的單一全局協(xié)作策略，然而不同網(wǎng)絡(luò)區(qū)域的緩存目標(biāo)不同，導(dǎo)致傳統(tǒng)方案的性能優(yōu)化程度有限，可擴展性不強。同時協(xié)同緩存放置和請求路由，相較于純緩存方案有效性更高。該文提出并評估了一種新型面向分域的協(xié)作混合緩存放置和路由請求機制，該機制將緩存網(wǎng)絡(luò)區(qū)分核心網(wǎng)絡(luò)和邊緣網(wǎng)絡(luò)，在核心網(wǎng)絡(luò)中采用非沿路的HASH協(xié)作機制，邊緣網(wǎng)絡(luò)采用沿路的回退協(xié)作機制，創(chuàng)建二元組標(biāo)簽保存緩存放置的信息并作用于后續(xù)的請求轉(zhuǎn)發(fā)。通過仿真對比表明，該文提出的協(xié)作混合緩存機制相較于傳統(tǒng)策略可以更好地平衡網(wǎng)絡(luò)資源利用和用戶體驗，并在大型ISPs中拓展性更好。
-
關(guān)鍵詞:
- 信息中心網(wǎng)絡(luò) /
- 緩存網(wǎng)絡(luò) /
- 混合 /
- 請求路由
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.-
Key words:
- Information-Centric Network (ICN) /
- Caching network /
- Hybrid /
- Routing request
-
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. 芮蘭蘭, 彭昊, 黃豪球, 等. 基于內(nèi)容流行度和節(jié)點中心度匹配的信息中心網(wǎng)絡(luò)緩存策略[J]. 電子與信息學(xué)報, 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. 吳海博, 李俊, 智江, 等. 基于概率的啟發(fā)式ICN緩存內(nèi)容放置方法[J]. 通信學(xué)報, 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. -
計量
- 文章訪問數(shù): 4268
- HTML全文瀏覽量: 176
- PDF下載量: 219
- 被引次數(shù): 0
下載:
