A Novel Supernodes Election Scheme in Structured P2P Network
Most Peer-To-Peer (P2P) applications need to elect some SuperNodes (SNs) from ordinary nodes to improve their performance. So, SuperNodes election has become an important issue in such systems. However, choosing the best SNs is not a trivial problem from a huge and dynamically changing P2P environment. The random election strategy does not work in such scenario. In this paper, the authors bring forward a novel SNs election scheme based on network coordinate and district partition in structured P2P systems to solve this problem.