1 / 20

Double P-Tree: A Distributed Architecture for Large-Scale Video-on-Demand

Double P-Tree: A Distributed Architecture for Large-Scale Video-on-Demand. Fernando Cores, Ana Ripoll, and Emilio Luque. Presented by Chi-Yuk Chan. Outline. Background P-Tree Double P-Tree Performance Evaluation Summary. Background. One-level proxy system. Caching

miette
Download Presentation

Double P-Tree: A Distributed Architecture for Large-Scale Video-on-Demand

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. Double P-Tree: A Distributed Architecture for Large-Scale Video-on-Demand Fernando Cores, Ana Ripoll, and Emilio Luque Presented by Chi-Yuk Chan

  2. Outline • Background • P-Tree • Double P-Tree • Performance Evaluation • Summary

  3. Background

  4. One-level proxy system • Caching • Cache the most popular videos • For video requests • Served by proxy if cached • Stream from main server directly otherwise •  Scalability problem

  5. Hierarchical proxy system (P-Tree)

  6. P-Tree • Mirroring • In addition to Caching • Making distributed mirror across the system • Limitations • Proxy-hit probability vs.Mirror-service distance • Solution • Raise connectivity

  7. Double P-Tree

  8. Double P-Tree

  9. Double P-Tree • Modification • Use the proxy of the nets at the same level • Advantages • Reduce service-distance • Larger distributed mirror • Better fault tolerant

  10. Default Settings • Binary topology with 7 levels in Double P-Tree • Every 127 local net has 1Mbps of bandwidth • Total system bandwidth of 127Mbps • A proxy capacity of 20% of system videos

  11. Scalability

  12. Proxy-Storage Requirements

  13. Efficiency

  14. Summary • P-Tree • Hierarchical-tree topology of independent networks with proxies • Caching and mirroring • Double P-Tree • Adding the concept of brother networks • Unlimited and low-cost growth • High fault tolerant

  15. Completed and Future Works • Completed Works • Distributed Mirror heuristics • Traffic Balancing • Incorporate with Multicasting • Interactive VoD service • Future works • Proxy size reduction

  16. Reference • Bahjat Qazzaz, Remo Suppi, Fernando Cores, Ana Ripoll, Porfidio Hernández, and Emilio Luque, “Providing Interactive Video on Demand Services in Distributed Architecture,”EUROMICRO 2003, pp.215-222 • Fernando Cores, Ana Ripoll, Bahjat Qazzaz, Remo Suppi, Xiaoyuan Yang, Portfidio Hernández, and Emilio Luque, “Exploiting Traffic Balancing and Multicast Efficiency in Distributed Video-on-Demand Architectures,”Euro-Par 2003, pp.859-869 • Fernando Cores, Ana Ripoll, and Emilio Luque, “Double P-Tree: A Distributed Architecture for Large-Scale Video-on-Demand,”Euro-Par 2002, pp.816-825 • Fernando Cores, Ana Ripoll, and Emilio Luque, “A Fully Scalable and Distributed Architecture for Video-on-Demand.,”PROMS 2001, pp.59-73

  17. Questions & Answers Thank you

  18. Notations

  19. Analytical Model

  20. Analytical Model

More Related