基于拍卖的P2P内容分发网络带宽分配机制

doi:10.3969/j.issn.1000-436x.2013.04.011

通信学报 ›› 2013, Vol. 34 ›› Issue (4): 99-105.doi: 10.3969/j.issn.1000-436x.2013.04.011

基于拍卖的P2P内容分发网络带宽分配机制

张云鹤^1,²,朱艳琴^1,²,纪其进^1,²

¹ 苏州大学计算机科学与技术学院，江苏苏州 215006
² 江苏省计算机信息处理技术重点实验室，江苏苏州 215006

出版日期:2013-04-25 发布日期:2017-07-17
基金资助:
国家自然科学基金资助项目;苏州市应用基础研究计划基金资助项目;东南大学计算机网络和信息集成教育部重点实验室开放研究基金资助项目

Auction based bandwidth allocation mechanism for P2P content distribution networks

Yun-he ZHANG^1,²,Yan-qin ZHU^1,²,Qi-jin JI^1,²

¹ School of Computer Science and Technology,Soochow University,Suzhou 215006,China
² Jiangsu Provincial Key Laboratory of Computer Information Processing,Suzhou 215006,China

Online:2013-04-25 Published:2017-07-17
Supported by:
The National Natural Science Foundation of China;Suzhou Application Foundation Research Project;Open Research Fund from Key Laboratory of Computer Network and Information Integration in Southeast University,Ministry of Education

摘要/Abstract

摘要：

为了解决P2P内容分发网络中带宽资源稀缺且分配不合理这一突出问题，抑制节点的自私性行为，设计了一种基于拍卖的带宽分配机制。该机制通过上载带宽支付方式，迫使自私请求节点选择合适的带宽需求，使得整个P2P网络中的节点良性竞争带宽资源，避免了“公共地悲剧”的发生；且带宽分配算法在资源节点和请求节点并行执行，能很好适应 P2P 网络的分布式特性。仿真结果表明，该机制能够有效遏制搭便车行为，从而缩短P2P内容分发的平均完成时间，降低内容源服务器的上传数据比例。

关键词: P2P内容分发网络, 带宽分配, 拍卖, 分布式优化

Abstract:

Unreasonable allocation of originally scarce bandwidth was a severe problem in the P2P content distribution networks.To solve the problem and suppress the node's selfishness,an auction-based bandwidth allocation mechanism for P2P networks was proposed.Through the effective bandwidth payment scheme,the selfish nodes had no incentives to lie and provided the real bandwidth requirements.Also the “tragedy of the commons” could be avoided by the nodes' healthy bandwidth competition.To adapt to the distributed nature of the P2P networks,the algorithm was implemented in parallel at resource providing nodes and request nodes.Simulation results show that the scheme not only suppresses riding nodes efficiently in the system,but also shortens the average completion time for content distribution and decreases the ratio of data uploaded by the source server.

Key words: P2P content distribution networks, bandwidth allocation, auction, distributed optimization

张云鹤,朱艳琴,纪其进. 基于拍卖的P2P内容分发网络带宽分配机制[J]. 通信学报, 2013, 34(4): 99-105.

Yun-he ZHANG,Yan-qin ZHU,Qi-jin JI. Auction based bandwidth allocation mechanism for P2P content distribution networks[J]. Journal on Communications, 2013, 34(4): 99-105.

图/表 7

表1

图1

图2

图3

图4

图5

图6

参考文献 15

[1]	ADAR E , HUBERMAN B A . Free Riding on Gnutella[R]. Xerox PARC, 2000.
[2]	HARDIN G . The tragedy of the commons. Science, 1968,162(3859): 1243-1248.
[3]	刘志新, 申妍燕, 关新平 . 一种基于 VCG 拍卖的分布式网络资源分配机制[J]．电子学报, 2010,38(8):1929-1933. LIU Z X , SHEN Y Y , GUAN X P . A VCG-auction based distributed mechanism for network resource allocation[J]. Acta Electronica Sinica, 2010,38(8):1929-1933.
[4]	RICHARD T B M , SAM C M L , JOHN C S L . Incentive and service differentiation in P2P networks:a game theroretic approcach[J]. IEEE/ACM Transactions on Networking, 2006,14(5): 978-991.
[5]	COHEN B . Incentives build robustness in BitTorrent[A]. Workshop on Economics of Peer-to-Peer Systems[C]. Berkeley,CA,USA, 2003.
[6]	KLEMPERER P . Auction theory:a guide to the literature[J]. Journal of Economic Surveys, 1999,13(3): 227-286.
[7]	KRISHNA V . Auction Theory(2nd ed)[M]. Academic Press, USA, 2010.
[8]	COURCOUBETIS C , WEBER R . Pricing Communication Network:Economics,Technology and Modeling[M]. Wiley Online Library, 2003.
[9]	YANG S , HAJEK B . VCG-Kelly mechanisms for allocation of divisible goods:adapting VCG mechanisms to one-dimensional signals[J]. IEEE Journal on Selected Areas in Communications, 2007,25(6): 1237-1243.
[10]	KELLY F P , MAULLOO A K , TAN D . Rate control in communication networks:shadow prices,proportional fairness and stability[J]. Journal of the Operational Research Society, 1998,49(3): 237-252.
[11]	BERTSEKAS D P , NEDIC A , OZDAGLAR A . Convex Analysis and Optimization[M]. Nashua: Nashua:Athena Scientific, 2003.
[12]	KABUS P , TERPSTRA W W , CILIA M . Addressing cheating in distributed MMOGS[A]. Proc NetGames[C]. New York,NY,USA, 2005. 1-6.
[13]	BERTSEKAS D P , TSITSIKLIS J N >. Parallel and Distributed Computation[M]. New York: Prentice Hall Inc, 1989.
[14]	BOYD S , VANDENBERGHE L . Convex Optimization[M]. Cambridge: Cambridge University Press, 2004.
[15]	OMNeT++community site[EB/OL]. , 2012.

比例/%	接入带宽（kbit/s）
20	256
10	512
55	1 024
5	2 048
5	4 096
5	10 240

基于拍卖的P2P内容分发网络带宽分配机制

Auction based bandwidth allocation mechanism for P2P content distribution networks

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 7

参考文献 15

相关文章 15

Metrics

推荐阅读 0

[1]	田有亮, 吴柿红, 李沓, 王林冬, 周骅. 基于激励机制的联邦学习优化算法[J]. 通信学报, 2023, 44(5): 169-180.
[2]	郎磊, 王荆宁, 王一, 赵子涛. 无人机辅助通信中基于用户轨迹的无线资源和航迹优化[J]. 通信学报, 2022, 43(3): 225-232.
[3]	孙俨, 熊翱, 蒋承伶, 王威, 于东晓, 郭少勇. 基于区块链的计算与无线通信资源联合管理双向拍卖模型[J]. 通信学报, 2022, 43(11): 14-25.
[4]	王佳琪,鲁宁,程庆丰,巫朝霞,史闻博. 面向隐私保护的多属性逆向频谱拍卖方案[J]. 通信学报, 2020, 41(9): 77-91.
[5]	林艳, 闫帅, 张一晋, 李春国, 束锋. 基于交通流量预测的车联网双边拍卖边缘计算迁移方案[J]. 通信学报, 2020, 41(12): 205-214.
[6]	丛鑫,訾玲玲,沈学利. 基于最佳匹配拍卖的企业级网络资源分配策略[J]. 通信学报, 2019, 40(8): 212-222.
[7]	刘媛妮,李垚焬,李慧聪,李万林,张建辉,赵国锋. 基于拍卖模型的移动群智感知网络激励机制[J]. 通信学报, 2019, 40(7): 208-222.
[8]	刘业君,刘玉莹,汉鹏超,王继东,郭磊. OFDM无源光网络中多业务分层带宽分配算法[J]. 通信学报, 2018, 39(9): 84-93.
[9]	于存谦,唐明珠,何荣希. TWDM-PON中时延约束节能动态波长带宽分配算法[J]. 通信学报, 2018, 39(9): 110-121.
[10]	刘浩,陈志刚,张连明. 移动社交网络中基于拍卖模型的数据转发激励机制[J]. 通信学报, 2017, 38(11): 111-120.
[11]	丛鑫,訾玲玲,孙劲光. 基于可信拍卖机制的视频移植定价策略[J]. 通信学报, 2016, 37(4): 1-65.
[12]	崔勇,林予松,李润知,王宗敏. 基于合作博弈的多虚拟机实时迁移带宽分配机制[J]. 通信学报, 2016, 37(4): 149-158.
[13]	魏淑芝,朱琦. 基于网络选择的视频通信带宽博弈算法[J]. 通信学报, 2015, 36(2): 212-220.
[14]	陈赓，夏玮玮，沈连丰. 基于多门限预留机制的自适应带宽分配算法[J]. 通信学报, 2014, 35(12): 10-88.
[15]	陈赓,夏玮玮,沈连丰. 基于多门限预留机制的自适应带宽分配算法[J]. 通信学报, 2014, 35(12): 78-88.