A scheduling method to reduce waiting time for P2P streaming systems

  • Authors:

  • Yusuke Gotoh;Kentaro Suzuki;Tomoki Yoshihisa;Masanori Kanazawa

  • Affiliations:

  • Kyoto University, Kyoto;Kyoto University, Kyoto;Cybermedia Center, Osaka University, Osaka;Academic Center for Computing and Media Studies, Kyoto University, Kyoto

  • Venue:
  • Journal of Mobile Multimedia
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, live streaming systems with peer-to-peer (P2P) technology have attracted much attention and are changing how we watch movies. In P2P streaming systems, a peer that plays the movie receives data from other peers. By sequentially playing the received data, users can watch the entire movie from beginning to the end. We previously proposed a method to reduce waiting time in P2P streaming. In conventional methods, by receiving the first chunk of data sequentially from a peer with large bandwidth and making a delivery schedule that considers the finishing time to delivery each content, waiting time is reduced effectively. However, these methods do not consider the case where heterogeneous peers deliver data to multiple peers. Also, since selected peers deliver the data to a peer using all the bandwidth, the number of available peers that deliver data decreases. In this paper, we propose a scheduling method to reduce the waiting time for selecting peers in P2P streaming by selecting peers and considering the available bandwidth. By designing and implementing P2P streaming systems, we consider situations in which our proposed system is effective. Our evaluation shows that our proposed method reduces the average waiting time 62.5% more than conventional methods at maximum.