Research on district partitioning in P2P network

With the rapid development of P2P, there are some new applications such as P2PSIP and intercommunication of heterogeneous DHTs (Distributed Hash Table). In those scenarios, there need some nodes acting as proxies and gateways. Such nodes as proxies or gateways in P2P overlays were called Supernodes. The problem of which nodes would be the supernode s was answered by SN election. To choose an eligible supernode in P2P overlay is time-consumed and it´s a NP-hard problem. To decrease the message complexity and to accelerate the election speed, the district or area partitioning model was brought forth. In this paper, the authors mainly analyzed four kinds of district partitioning models, they were models based upon geographical information, IP structure, DHT characteristics and pre-placed supernode.