Scalable Supernode Selection in Peer-to-Peer Overlay Networks

  • Authors:
  • Virginia Lo;Dayi Zhou;Yuhong Liu;Chris GauthierDickey;Jun Li

  • Affiliations:
  • Network Research Group - University of Oregon;Network Research Group - University of Oregon;Network Research Group - University of Oregon;Network Research Group - University of Oregon;Network Research Group - University of Oregon

  • Venue:
  • HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define a problem called the supernode selection problem which has emerged across a variety of peer-topeer applications. Supernode selection involves selection of a subset of the peers to serve a special role. The supernodes must be well-dispersed throughout the peerto- peer overlay network, and must ful?ll 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 supernode selection protocols we have developed for peer-topeer environments: a label-based scheme for structured overlay networks, a distributed protocol for coordinatebased overlay networks, and a negotiation protocol for unstructured overlays. We believe an integrated approach to the supernode selection problem can bene?t the peer-to-peer community through cross-fertilization of ideas and sharing of protocols.