A Robust Algorithm for the Membership Management of Super-Peer Overlay

  • Authors:
  • Meirong Liu;Jiehan Zhou;Timo Koskela;Mika Ylianttila

  • Affiliations:
  • Media Team Oulu research group, Information Processing Laboratory, Department of Electrical and Information Engineering, University of Oulu, Finland FIN-90014;Media Team Oulu research group, Information Processing Laboratory, Department of Electrical and Information Engineering, University of Oulu, Finland FIN-90014;Media Team Oulu research group, Information Processing Laboratory, Department of Electrical and Information Engineering, University of Oulu, Finland FIN-90014;Media Team Oulu research group, Information Processing Laboratory, Department of Electrical and Information Engineering, University of Oulu, Finland FIN-90014

  • Venue:
  • MMNS 2009 Proceedings of the 12th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Wired-Wireless Multimedia Networks and Services Management
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Peer-to-Peer technologies have been widely applied for multimedia applications. The super-peer based approach provides an efficient way to run applications by exploring nodes' heterogeneity. In P2P live video streaming, even though the number of stable nodes is small, they have significant impact on the performance of the network. Thus, we present a super-peer-based overlay design, where stable nodes are assigned as super-peers that organize client nodes. A gossip-based super-peer selection algorithm (GSPS) is proposed to identify the stable nodes to be chosen as super-peers and to manage the client nodes (namely the membership management). The basic idea of the GSPS is: first, a set of super-peer candidates for a node is built based on the gossip, then the role of this node is identified and the corresponding operations are executed. Simulation results show that the GSPS is efficient in managing the super-peer overlay and robust to the failure of super-peers.