Title :
ID management and allocation algorithm for P2P load balancing
Author :
Wang, Bin ; Shen, Qing-guo
Author_Institution :
Inst. of Commun. Eng., PLA Univ. of Sci. & Technol., Nanjing, China
Abstract :
In DHT (Distributed Hashing Table) based P2P system, load of some nodes is as much as O(logn) times the average. In this paper, an algorithm for ID allocation with complete knowledge is proposed. Based on hierarchical structured topology, even node distribution is achieved in key space according to top-down ID allocation. The algorithm can deal with issues caused by node departure. It is proved that the ratio of longest arc to shortest arc is no more than 4, when network scale increases non-strictly. The performance is analyzed in simulation experiment. Simulating results show that updating messages only occupy a little of network bandwidth.
Keywords :
cryptography; file organisation; peer-to-peer computing; resource allocation; telecommunication network topology; ID allocation; ID management; P2P load balancing; allocation algorithm; distributed hashing table; hierarchical structured topology; network scale; node distribution; updating messages; Internet; Lead; Maintenance engineering;
Conference_Titel :
Communication Technology (ICCT), 2010 12th IEEE International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-6868-3
DOI :
10.1109/ICCT.2010.5689106
