A Distributed Peer Selection Method for Supporting Scalable Peer-to-Peer Services

作者: Jaesung Park

DOI: 10.3745/KTCCS.2013.2.11.471

关键词:

摘要: In this paper, we propose a distributed parent peer selection method to construct an efficient peer-to-peer(P2P) network topology by considering the capacity of and hop distance from data source peer. To achieve goal, combine two performance metrics calculate probability that becomes Using probability, select stochastically making use state information neighboring peers each maintains. Through simulation studies, show proposed drives high support more children makes diameter P2P shorter than other methods.

参考文章(5)
Nianwang Liu, Zheng Wen, Kwan L. Yeung, Zhibin Lei, Request-peer selection for load-balancing in P2P live streaming systems wireless communications and networking conference. pp. 3227- 3232 ,(2012) , 10.1109/WCNC.2012.6214363
Meno Guo, M.H. Ammar, Scalable live video streaming to cooperative clients using time shifting and video patching international conference on computer communications. ,vol. 3, pp. 1501- 1511 ,(2004) , 10.1109/INFCOM.2004.1354564
Amos Brocco, Fulvio Frapolli, Beat Hirsbrunner, Bounded diameter overlay construction: A self organized approach ieee swarm intelligence symposium. pp. 114- 121 ,(2009) , 10.1109/SIS.2009.4937853
Kin-Wah Kwong, D.H.K. Tsang, Building heterogeneous peer-to-peer networks: protocol and analysis IEEE ACM Transactions on Networking. ,vol. 16, pp. 281- 292 ,(2008) , 10.1109/TNET.2007.899026
M. Dorigo, L.M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation. ,vol. 1, pp. 53- 66 ,(1997) , 10.1109/4235.585892