Skip to main content
Variable Neighbor Selection in Live Peer-to-Peer Multimedia Streaming Networks
CSE Conference and Workshop Papers
  • Jagannath Ghoshal, Sprint Nextel, Overland Park, KS
  • Miao Wang, University of Nebraska - Lincoln
  • Lisong Xu, University of Nebraska - Lincoln
  • Byrav Ramamurthy, University of Nebraska - Lincoln
Date of this Version
Published in BROADNETS 2008. 5th International Conference on Broadband Communications, Networks and Systems, 2008. Copyright 2008 IEEE. Used by permission.
Data-driven (or swarming based) streaming is one of the popular ways to distribute live multimedia streaming traffic over Peer-to-Peer (P2P) networks. The efficiency and user satisfaction highly depend on the constructed overlays. The common neighbor selection algorithms in existing overlay construction schemes usually randomly select a fixed number of neighbors which satisfy the selection requirements, such as end-to-end delay or a peer's sojourn time. However, this fixed random neighbor-selection algorithm (FRNS) neglects the peers' upload bandwidth heterogeneity and therefore, the upload bandwidth cannot be efficiently used. In this paper, we propose a variable random neighbor-selection (VRNS) scheme to alleviate the problems due to bandwidth heterogeneity, and in which the number of neighbors with different upload bandwidths is dynamically determined by the statistical bandwidth information of the system. Our proposed scheme is shown to outperform FRNS based upon a large volume of carefully designed simulations.
Citation Information
Jagannath Ghoshal, Miao Wang, Lisong Xu and Byrav Ramamurthy. "Variable Neighbor Selection in Live Peer-to-Peer Multimedia Streaming Networks" (2008)
Available at: