By Topic

Scalable supernode selection in peer-to-peer overlay networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Lo, V. ; Network Res. Group, Oregon Univ., Eugene, OR, USA ; Dayi Zhou ; Yuhong Liu ; GauthierDickey, C.
more authors

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.

Published in:

Hot Topics in Peer-to-Peer Systems, 2005. HOT-P2P 2005. Second International Workshop on

Date of Conference:

21 July 2005