An efficient selection algorithm for building a super-peer overlay

15Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

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. © 2013 Liu et al.

Author supplied keywords

Cite

CITATION STYLE

APA

Liu, M., Harjula, E., & Ylianttila, M. (2013). An efficient selection algorithm for building a super-peer overlay. Journal of Internet Services and Applications, 4(1), 1–12. https://doi.org/10.1186/1869-0238-4-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free