Journal on Communications ›› 2013, Vol. 34 ›› Issue (4): 99-105.doi: 10.3969/j.issn.1000-436x.2013.04.011

• Academic paper • Previous Articles     Next Articles

Auction based bandwidth allocation mechanism for P2P content distribution networks

Yun-he ZHANG1,2,Yan-qin ZHU1,2,Qi-jin JI1,2   

  1. 1 School of Computer Science and Technology,Soochow University,Suzhou 215006,China
    2 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:

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

No Suggested Reading articles found!