Supernode Election Algorithm in P2P Network Based upon District Partition

With the rapid development of P2P, there are some new applications such as P2PSIP and intercommunication of heterogeneous DHTs (Distributed Hash Tables). In those scenarios, there need some nodes acting as proxies and gateways. Such nodes as proxies or gateways in P2P overlays were called Supernodes (SNs). The problem of which nodes could be the SNs was called SN election. In an overlay that had n nodes, the message complexity of traditional election algorithms was ) ( 2 n O , it was the horrible overhead in a huge overlay. In this paper, a new SN election algorithm based upon district partition which divided the whole overlay into k small districts and using distributed and parallel computing in these small units was brought forward. This algorithm would decrease the message complexity to ) ( 2 k n O and increase the electing speed. At the same time, the elected SN would be evenly distributed in the whole overlay.