最小化出口流量花费的接入级P2P缓存容量设计方法

doi:10.3969/j.issn.0372-2112.2015.05.007

电子学报 ›› 2015, Vol. 43 ›› Issue (5): 879-887.DOI: 10.3969/j.issn.0372-2112.2015.05.007

最小化出口流量花费的接入级P2P缓存容量设计方法

翟海滨, 张鸿, 刘欣然, 王勇, 沈时军, 李正民

国家计算机网络应急技术处理协调中心, 北京 100029

收稿日期:2013-10-23 修回日期:2015-01-29 出版日期:2015-05-25
- 通讯作者:
- 翟海滨
- 作者简介:
- 张鸿男,1976年出生,陕西西安人,工学博士,高级工程师,主要研究方向为云计算技术、计算机网络、信息安全.E-mail:zhangh@isc.org.cn
- 基金资助:
- 国家973重点基础研究发展规划 (No.2011CB302605)

A P2P Cache Capacity Design Method to Minimize the Total Traffic Cost of Access ISPs

ZHAI Hai-bin, ZHANG Hong, LIU Xin-ran, WANG Yong, SHEN Shi-jun, LI Zheng-min

National Computer Network Emergency Response Technical Team/Coordination Center of China, Beijing 100029, China

Received:2013-10-23 Revised:2015-01-29 Online:2015-05-25 Published:2015-05-25
- Supported by:
- National Program on Key Basic Research Project of China (973 Program) (No.2011CB302605)

摘要/Abstract

摘要：

接入级P2P(Peer-to-Peer)缓存容量设计回答在接入级ISP (Internet Service Provider)出口部署多大容量缓存的问题,目前还没有最优P2P缓存容量设计方法被提出.本文提出一种权衡存储成本和带宽成本的P2P缓存容量设计方法,以最小化ISP出口流量总花费为目标,将最优缓存容量设计问题描述为整数规划问题,其目标函数形式为单调阶梯函数,通过理论推导得出最优缓存容量计算公式指导接入级ISP进行缓存容量设计.将本文所提方法与Median和“20-80 Rule”等几种ISP常用的容量设计方法进行性能比较,结果表明,本文所提方法明显优于已有方法,与目前ISP最认可的“20-80 Rule”相比,应用本文所提方法的ISP出口流量总花费最多可降低7.5%.

关键词: P2P缓存技术, ISP网络, 缓存部署, 容量设计

Abstract:

By deploying Peer-to-Peer (P2P) caches at the edge of access ISPs,cross-ISP P2P traffic can be reduced.The problem is how to design an optimal cache capacity? Up to now,no optimal P2P cache capacity design method has been proposed yet.In this paper,an optimal P2P cache capacity design method is proposed based on the storage versus bandwidth cost tradeoff.In order to minimize the total traffic cost of access ISPs,the cache capacity design problem is formulated into an integer programming problem whose objective function is piecewise continuous.The formula of optimal cache capacity can be derived through theoretical derivation.Experimental results suggest that compared with several simple design rules including No Cache,Median and “20-80 Rule”,ISPs can achieve significant cost saving using our method.For example,compared with "20-80 Rule" that is most commonly used by ISPs nowadays,the cost saving can be as much as 7.5%.

Key words: P2P(Peer-to-Peer)caching technology, ISP (Internet service provider)network, cache deployment, capacity design

中图分类号:

TP393

翟海滨, 张鸿, 刘欣然, 等. 最小化出口流量花费的接入级P2P缓存容量设计方法[J]. 电子学报, 2015, 43(5): 879-887.

ZHAI Hai-bin, ZHANG Hong, LIU Xin-ran, et al. A P2P Cache Capacity Design Method to Minimize the Total Traffic Cost of Access ISPs[J]. Acta Electronica Sinica, 2015, 43(5): 879-887.

参考文献

[1] Slyck News.CacheLogic study-P2P is changing[EB/OL].http://www.slyck.com/story914_CacheLogic_Study_P2P_is_Changing,2005-09-16.
[2] Ipoque.Ipoque Company Internet study 2008/2009[EB/OL].http://www.ipoque.com/sites/default/files/mediafiles/documents/internet-study-2008-2009.pdf,2009-04-29.
[3] 韦乐平.电信业和电信技术发展的趋势和挑战[EB/OL].http://wenku.baidu.com/view/be139cc78bd63186bcebbcdc.html,2010-10-15.
[4] Wierzbicki A,Leibowitz N,Ripeanu M,et al.Cache replacement policies revisited:the case of P2P traffic[A].Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid[C].Chicago,Illinois,USA:IEEE Press,2004.182-189.
[5] 丁珂.中国互联网骨干网市场问题分析与政策建议[J].广东通信技术,2007,27(6):10-14.
[6] Gummadi K,Dunn R,et al.Measurement,modeling,and analysis of a Peer-to-Peer file-sharing workload[A].Proceedings of the 19th ACM Symposium on Operating Systems Principles[C].New York,USA:ACM Press,2003.314-329.
[7] Hefeeda M,Saleh O.Traffic modeling and proportional partial caching for Peer-to-Peer systems[J].IEEE Transactions on Networking,2008,16(6):1447-1460.
[8] Hefeeda M,Noorizadeh B.On the benefits of cooperative proxy caching for Peer-to-Peer traffic[J].IEEE Transactions on Parallel and Distributed Systems,2010,21(7):998-1010.
[9] Ye Mingjiang,Wu Jianping,Xu Ke.Caching the P2P traffic in ISP network[A].Proceedings of the 2008 IEEE International Conference on Communications[C].Beijing,China:IEEE Press,2008.5876-5880.
[10] Kamiyama N,Mori T,Kawahara R,et al.ISP-Operated CDN[A].Proceedings of the 28th Conference on Computer Communications[C].Rio de Janeiro,Brazil:IEEE Press,2009.1-6.
[11] Kamiyama N,Mori T,Kawahara R,et al.Analyzing influence of network topology on designing ISP-operated CDN[J].Telecommunication Systems,2013,52(2):969-977.
[12] Dai J,Li B,Liu F,Li B,Jin H.On the efficiency of collaborative caching in ISP-aware P2P networks[A].Proceedings of the 30th IEEE International Conference on Computer Communications[C].Shanghai,China:IEEE Press,2011.1224-1232.
[13] Kelly T,Reeves D.Optimal Web cache sizing:Scalable methods for exact solutions[J].Computer Communications,2001,24(2):163-173.
[14] Carlinet Y,Debar H,et al.Caching P2P Traffic:What are the Benefits for an ISP[A].Proceedings of Ninth International Conference on Networks[C].Menuires,France:IEEE Press,2010.5876-5880.
[15] Karagiannis T,Rodriguez P,Papagiannaki K.Should internet service provid-ers fear peer-assisted content distribution[A].Proceedings of the ACM 2005 Conference on Internet Measurement[C].New Orleans,USA:ACM Press,2005.63-76.
[16] Easyt1.Easyt1 Products[EB/OL].http://www.easyt1.net/2013-08-10.
[17] PeerApp.PeerApp UltraBand Products[EB/OL].http://www.gzhowe.com/product_detail.asp?name=P2P Cache,2013-01-08.
[18] Dell.Dell Products[EB/OL].http://www1.la.dell.com/content/products/productdetails.aspx/pvaul_cx300?c=la&l=en&s=corp&～ck=p,2013-08-09.
[19] Seagate.Seagate Products[EB/OL].http://www.seagate.com/,2013-07-05.
[20] Pinheiro E,Weber W,et al.Failure trends in a large disk drive population[A].Proceedings of USENIX Conference on File and Storage Technologies[C].San Jose,USA:ACM Press,2007.17-29.
[21] Rasmussen A,Kiciman E,et al.Improving the responsiveness of internet services with automatic cache placement[A].Proceedings of the 4th ACM European conference on Computer systems[C].Nuremberg,Germany:ACM Press,2009.27-32.

最小化出口流量花费的接入级P2P缓存容量设计方法

A P2P Cache Capacity Design Method to Minimize the Total Traffic Cost of Access ISPs

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	皮德常, 吴致远, 曹建军. 基于知识图谱表示学习的谣言早期检测方法[J]. 电子学报, 2023, 51(2): 385-395.
[2]	金翊, 张红红, 陈迅雷, 王舒欣, 欧阳山, 沈云付, 江家宝. SD16的三值逻辑光学运算器理论和结构[J]. 电子学报, 2023, (): 1-9.
[3]	张宏科, 于成晓, 权伟, 张宇明. 融算网络体系基础研究[J]. 电子学报, 2022, 50(12): 2928-2934.
[4]	金明, 丁蓉. 一种联合时域和空域残差的网络异常检测与节点定位方法[J]. 电子学报, 2022, (): 1-8.
[5]	胡钢, 牛琼, 许丽鹏, 卢志宇, 过秀成. 基于网络超链接信息熵的节点重要性序结构演化建模分析[J]. 电子学报, 2022, 50(11): 2638-2644.
[6]	杨宏宇, 王泽霖, 张良, 成翔. 面向物联网的多协议僵尸网络检测方法[J]. 电子学报, 2022, (): 1-9.
[7]	孟超, 周倩, 郭林, 王攀, 孙知信. 基于相关性传输模型的无线链路质量估计方法及路由优化算法[J]. 电子学报, 2022, 50(10): 2409-2424.
[8]	蒋伟进, 张婉清, 陈萍萍, 陈君鹏, 孙永霞, 刘权. 基于IWOA群智感知中数量敏感的任务分配方法[J]. 电子学报, 2022, 50(10): 2489-2502.
[9]	杨明亮, 吴春明, 沈丛麒, 邱于兵. 基于IEEE 802.1的TSN交换机队列调度技术研究[J]. 电子学报, 2022, 50(9): 2090-2095.
[10]	熊小峰, 黄淳岚, 乐光学, 戴亚盛, 杨晓慧, 杨忠明. 边缘计算中基于综合信任评价的任务卸载策略[J]. 电子学报, 2022, 50(9): 2134-2145.
[11]	魏振春, 傅宇, 马仲军, 吕增威, 石雷, 张本宏. 带时间窗的无线可充电传感器网络多目标路径规划算法[J]. 电子学报, 2022, 50(8): 1819-1829.
[12]	赵耿, 马英杰, 陈磊, 董有恒, 侯艳丽. 基于扰动时空混沌系统的动态S盒设计[J]. 电子学报, 2022, 50(8): 2037-2042.
[13]	欧阳与点, 谢鲲, 谢高岗, 文吉刚. 面向大规模网络测量的数据恢复算法：基于关联学习的张量填充[J]. 电子学报, 2022, 50(7): 1653-1663.
[14]	陈嘉兴, 程杰, 董云玲, 刘志华. 基于弯曲声线和测距修正的水下节点定位算法[J]. 电子学报, 2022, 50(7): 1567-1572.
[15]	易令, 李泽平. 基于深度强化学习的码率自适应算法研究[J]. 电子学报, 2022, 50(5): 1192-1200.