一种基于博弈论的对等网络带宽分配方案

为解决对等网络中多个异构下载节点从多个源节点下载的带宽分配问题,提出一种基于注水算法及能够容纳自私节点的对等网络带宽分配方案.以节点的满意度为效益函数、以整个网络总效益达到最大为目标,设计一种带宽分配方案,使得未达到其接收能力的下载节点的带宽水面高度保持相平,并且使下载节点在源节点带宽耗尽时进行带宽水面高度的转换.证明了这一方案是约束优化问题的最优解.利用博弈论中的Vickrey-Clarke-Groves(VCG)算法,通过支付函数,设计一种容纳自私节点的机制.利用这种机制,节点只有诚实报告其接收能力,才能使其自身效益最大.

Proposal for peer-to-peer bandwidth allocation based on game theory

To solve the bandwidth allocation problem for several downloading nodes with different capacities downloading from several source nodes,a proposal for peer-to-peer bandwidth allocation is proposed,which is based on the water filling algorithm and can accommodate selfish node.The utility function being the satisfaction degree of the node and the objective being maximizing the aggregate utilities of the whole network,a bandwidth proposal is designed,which keeps the height of bandwidth water equal for the downloading nodes not reaching their receiving abilities and transfers the height of bandwidth water for the downloading nodes with exhausting bandwidth of source nodes.It is proved that the proposal is the optimal solution for the constrained optimization problem.Using the VCG mechanism in game theory,a mechanism accommodating selfish nodes is designed by the payment function.Using this mechanism the node can maximize its utility only by reporting its receiving ability honestly.