Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Scalable Supernode Selection in Peer-to-Peer Overlay Networks
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
A reputation-based trust management system for P2P networks
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
| Hi-index | 0.00 |
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[1,2,3]. The problem of which nodes ould 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.