中国邮电高校学报(英文) ›› 2010, Vol. 17 ›› Issue (2): 76-84.doi: 10.1016/S1005-8885(09)60451-9

• Networks • 上一篇    下一篇

Scheduling Piece Requests Blindly and Randomly for Peer-to-Peer Live Streaming

陈一帅1,陈常嘉1,李纯喜2,赵永祥2   

  1. 1. 北京交通大学
    2.
  • 收稿日期:2009-07-06 修回日期:2010-01-21 出版日期:2010-04-30 发布日期:2010-06-01
  • 通讯作者: 陈一帅 E-mail:chenyishuai@gmail.com
  • 基金资助:

    国家级.国家自然科学基金

Scheduling Piece Requests Blindly and Randomly for Peer-to-Peer Live Streaming

  • Received:2009-07-06 Revised:2010-01-21 Online:2010-04-30 Published:2010-06-01

摘要:

The design of piece scheduling algorithm is fundamental in mesh-based Peer-to-Peer (P2P) live streaming systems. This paper regards the piece propagation process in P2P live streaming system as a conflict process, where peers compete to get the piece as soon as possible to meet the tight timing requirement of the live system. In this vision, we reduce the piece scheduling problem as a conflict resolution problem, and propose a blind random scheduling method to resolve it. The algorithm is: 1) pieces are scheduled independently; 2) conflicts are resolved by the random back off algorithm. The theoretical analysis and simulation results prove that the algorithm scales well with the network size, and can obtain near-optimal in-time delivery of pieces. The algorithm is also easy to implement in the real-world system.

关键词:

Peer-to-peer, Live streaming, Conflict Resolution, Exponential Back Off, Piece Scheduling

Abstract:

The design of piece scheduling algorithm is fundamental in mesh-based Peer-to-Peer (P2P) live streaming systems. This paper regards the piece propagation process in P2P live streaming system as a conflict process, where peers compete to get the piece as soon as possible to meet the tight timing requirement of the live system. In this vision, we reduce the piece scheduling problem as a conflict resolution problem, and propose a blind random scheduling method to resolve it. The algorithm is: 1) pieces are scheduled independently; 2) conflicts are resolved by the random back off algorithm. The theoretical analysis and simulation results prove that the algorithm scales well with the network size, and can obtain near-optimal in-time delivery of pieces. The algorithm is also easy to implement in the real-world system.

Key words:

Peer-to-peer, Live streaming, Conflict Resolution, Exponential Back Off, Piece Scheduling