1 / 21

Delay Bounds of ChuNk -Based Peer-to-Peer Video Streaming - Yong Liu

6 th Dec 2010 Swetha Vallala. Delay Bounds of ChuNk -Based Peer-to-Peer Video Streaming - Yong Liu. P2P video streaming solutions. Pros utilize the uploading bandwidth of end-users low server infrastructure cost Cons long video startup delays

gunnar
Download Presentation

Delay Bounds of ChuNk -Based Peer-to-Peer Video Streaming - Yong Liu

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 6th Dec 2010 Swetha Vallala Delay Bounds of ChuNk-Based Peer-to-Peer Video Streaming- Yong Liu

  2. P2P video streaming solutions Pros • utilize the uploading bandwidth of end-users • low server infrastructure cost Cons • long video startup delays • highly variable playback lags Design • chunk-based • tradeoff among chunk size, playback delay and signaling overhead • efficient for bandwidth-sensitive applications • performance constraint for delay-sensitive applications

  3. Background • Single-Tree Streaming • degrades the peer bandwidth utilization efficiency • Balanced Multi-Tree Streaming • Mesh-Based Streaming • robust against peer dynamics

  4. Related Work • Very few studies • Chunk transmission delay not considered Research • Tradeoff between server bandwidth cost, maximum number of peers supported and minimum number of streaming hops • Assuming Video ~ Fluid, minimum tree depth of multi-tree streaming • A heuristic algorithm to build low-delay overlay mesh for P2P live streaming • Modeling the diffusion process using difference equations

  5. Single-Chunk Dissemination • If the server generates a chunk of content at time, how does one disseminate that chunk to all peers in the shortest time possible? • Depends on • size of the chunk • available bandwidth • propagation delays • Chunk size = 1 and bandwidth unit = video streaming rate • Ignore propagation delay • dominated by chunk transmission delay

  6. Single-Chunk Dissemination - Homogeneous • Upload bandwidth = 1 • Upload rate = download rate • P2P streaming system is self-scalable Assumptions • Download bandwidth never a bottleneck. • Server participation • upload only one copy of the chunk to one peer

  7. Single-Chunk Dissemination - Homogeneous • Single-Tree Chunk Dissemination • Multi-Tree Chunk Dissemination • Snowball Chunk Dissemination • recursive

  8. Single-Chunk Dissemination - Heterogeneous Heterogeneous • different types of network access • different upload bandwidth • U(t) = System-wide usable uploading bandwidth • Impact of order at which peers receive the chunk Categories • Super Peers and Free-Riders • 2 level hierarchy • Multilevel Bandwidth Hierarchy • General Heterogeneous Case

  9. Snowball Streaming - Homogeneous

  10. Snowball Streaming - Heterogeneous • Delay bound for single-chunk dissemination cannot always be achieved in continuous streaming • There exists snowball streaming to achieve the minimum chunk dissemination delay for all chunks in Super Peers and Free-Riders, Multilevel Bandwidth Hierarchy

  11. Impact of Network Impairments • Propagation Delays • as chunk size decreases, propagation delay plays important role • Bandwidth Variations • transmission time of a chunk is not constant

  12. Propagation Delays

  13. Bandwidth Variations Workload of a peer is naturally adaptive to its bandwidth Number of peers in each sub-tree is no longer N/2 Uploading in both subgroups will finish around the same time For a reasonable large N (1000), snowball approach achieves better delay performance than the deterministic case

  14. Dynamic Snowball Streaming Algorithm Push older chunks as quickly as possible Give enough peer upload bandwidth access to newer chunks Challenge - chunk transmission complete time is not predictable DSB - A simple heuristic algorithm that mimics the static snowball streaming algorithm and dynamically resolves the conflicts between active chunks in continuous streaming Works in rounds Demand factor for chunk, dk = Nk/Rk Bi = the set of chunks in peer's buffer The total expected workload for peer =

  15. Performance Study of DSB • Static homogeneous environment • dynamic snowball streaming is delay-optimal • Dynamic Heterogeneous environment • Random Propagation Delay • Random Upload Bandwidth • Both

  16. Random Propagation Delay

  17. Random Upload Bandwidth

  18. Propagation Delay and Bandwidth variations

  19. Conclusion Various delay bounds for P2P streaming systems Static snowball streaming algorithms in static homogeneous and heterogeneous P2P video systems DSB algorithm to approach the minimum delay bounds with a small peer upload bandwidth overhead Snowball type of streaming algorithms are robust to network impairments

  20. Future Work • Mesh-based P2P video systems • Other factors • peer churns • geographic locality of peers

  21. Questions

More Related