Performance evaluation of AS-friendly peer selection algorithms for P2P live streaming

  • Authors:
  • Yukinobu Fukushima;Kazuya Inada;Yin Tao;Yasuyuki Fujiwara;Tokumi Yokohira

  • Affiliations:
  • Graduate School of Natural Science and Technology, Okayama University, Okayama-city, Okayama, Japan;Graduate School of Natural Science and Technology, Okayama University, Okayama-city, Okayama, Japan;Graduate School of Natural Science and Technology, Okayama University, Okayama-city, Okayama, Japan;Graduate School of Natural Science and Technology, Okayama University, Okayama-city, Okayama, Japan;Graduate School of Natural Science and Technology, Okayama University, Okayama-city, Okayama, Japan

  • Venue:
  • APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we evaluate the performance of peer selection algorithms: MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) to increase the number of joining peers and to decrease inter-AS traffic volume in P2P live streaming, where we assume that every peer's logical hop count (the number of providing peers between an origin streaming server and the peer) is limited by a predetermined value in order to keep real-time property of live streaming. In MLH, a newly joining peer selects such providing peers that the logical hop count is minimum to increase the number of joining peers. And then if there are several such providing peers, the newly joining peer selects such providing peers that the number (physical hop count) of ASs between the newly joining peer and each of the providing peers is minimum to decrease the inter-AS traffic volume. In MPH, a newly joining peer selects providing peers in the reverse order of MLH. Simulation results show that MLH achieves about from 20% to 60% more maximum joining peers than MPH, and MPH shows smaller inter-AS traffic volume than MLH when the number of joining peers is small while MLH shows smaller inter-AS traffic volume when the number of joining peers is large.