ID management and allocation algorithm for P2P load balancing

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.