CAJ | 학술논문

为了解决 P2P 内容分发网络中带宽资源稀缺且分配不合理这一突出问题,抑制节点的自私性行为,设计了一种基于拍卖的带宽分配机制.该机制通过上载带宽支付方式,迫使自私请求节点选择合适的带宽需求,使得整个 P2P 网络中的节点良性竞争带宽资源,避免了“公共地悲剧”的发生;且带宽分配算法在资源节点和请求节点并行执行,能很好适应 P2P 网络的分布式特性.仿真结果表明,该机制能够有效遏制搭便车行为,从而缩短P2P 内容分发的平均完成时间,降低内容源服务器的上传数据比例.
위료해결 P2P 내용분발망락중대관자원희결차분배불합리저일돌출문제,억제절점적자사성행위,설계료일충기우박매적대관분배궤제.해궤제통과상재대관지부방식,박사자사청구절점선택합괄적대관수구,사득정개 P2P 망락중적절점량성경쟁대관자원,피면료“공공지비극”적발생;차대관분배산법재자원절점화청구절점병행집행,능흔호괄응 P2P 망락적분포식특성.방진결과표명,해궤제능구유효알제탑편차행위,종이축단P2P 내용분발적평균완성시간,강저내용원복무기적상전수거비례.
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 free riding nodes efficiently in the system, but also shortens the average completion time for content distribution and decreas-es the ratio of data uploaded by the source server.