Research Article
Scalable supernode selection in peer-to-peer overlay networks
@INPROCEEDINGS{10.1109/HOT-P2P.2005.17, author={Virginia Lo and Dayi Zhou and Chris GauthierDickey and Jun Li}, title={Scalable supernode selection in peer-to-peer overlay networks}, proceedings={2nd International ICST Workshop on Hot Topics in Peer-to-Peer Systems}, publisher={IEEE}, proceedings_a={HOT-P2P}, year={2005}, month={10}, keywords={}, doi={10.1109/HOT-P2P.2005.17} }- Virginia Lo
Dayi Zhou
Chris GauthierDickey
Jun Li
Year: 2005
Scalable supernode selection in peer-to-peer overlay networks
HOT-P2P
IEEE
DOI: 10.1109/HOT-P2P.2005.17
Abstract
We define a problem called the supernode selection problem which has emerged across a variety of peer-to-peer applications. Supernode selection involves selection of a subset of the peers to serve a special role. The supernodes must be well-dispersed throughout the peer-to-peer overlay network, and must fulfil additional requirements such as load balance, resource needs, adaptability to churn, and heterogeneity. While similar to dominating set and p-centers problems, the supernode selection problem must meet the additional challenge of operating within a huge, unknown and dynamically changing network. We describe three generic super-node selection protocols we have developed for peer-to-peer environments: a label-based scheme for structured overlay networks, a distributed protocol for coordinate-based overlay networks, and a negotiation protocol for unstructured overlays. We believe an integrated approach to the supernode selection problem can benefit the peer-to-peer community through cross-fertilization of ideas and sharing of protocols.
