Study on Supernode Election Algorithm in P2P Network Based upon District Partitioning

With the development of P2P, there are some new applications such as P2PSIP and intercommunication of heterogeneous DHTs (Distributed Hash Table). In the scenario of P2PSIP, there needs some nodes acting as all kinds of proxies of SIP; and as to intercommunication of heterogeneous DHT, there need some nodes to be the gateway roles to complete the intercommunication function, here these nodes were called Supernode (SN). The problem of which nodes could be the SNs was answered by SN election. In a overlay that had n nodes, the message complexity of traditional election algorithm is O(n²), itpsilas the horrible overhead in a huge overlay. In this paper, a new SN election based upon district partition which divided the whole overlay into k small districts and using distributed and parallel computing among these small units was brought forward. This algorithm would decrease the message complexity to O(n²/k) and raise the electing speed. At the same time, the new algorithm would uniformly distribute the SNs among the overlay.