SpringerOpen Newsletter

Receive periodic news and updates relating to SpringerOpen.

Open Access Open Badges Research

An efficient selection algorithm for building a super-peer overlay

Meirong Liu*, Erkki Harjula and Mika Ylianttila

Author Affiliations

Media Team Oulu research group, Department of Computer Science and Engineering, University of Oulu, Oulu, Finland

For all author emails, please log on.

Journal of Internet Services and Applications 2013, 4:4  doi:10.1186/1869-0238-4-4

Published: 27 February 2013


Super-peer overlay provides an efficient way to run applications by exploring the heterogeneity of nodes in a Peer-to-Peer overlay network. Identifying nodes with high capacity as super-peers plays an important role in improving the performance of P2P applications, such as live streaming. In this paper, we present a super-peer selection algorithm (SPS) to select super-peers for quickly building a super-peer overlay. In the SPS, each peer periodically builds its set of super-peer candidates through gossip communication with its neighbors, in order to select super-peers and client peers. Simulation results demonstrate that the SPS is efficient in selecting super-peers, and in quickly building a super-peer overlay. The proposed SPS also possesses good scalability and robustness to failure of super-peers.

Peer-to-Peer; Super-peer; Overlay; Gossip