An Efficient Implementation of Interactive Video-on-Demand Steven Carter and Darrell Long University of California, Santa Cruz Jehan-François Pâris University.

Slides:



Advertisements
Similar presentations
Presentation of M.Sc. Thesis Work Presented by: S. M. Farhad [ P] Department of Computer Science and Engineering, BUET Supervised by: Dr. Md. Mostofa.
Advertisements

Scalable On-demand Media Streaming Anirban Mahanti Department of Computer Science University of Calgary Canada T2N 1N4.
Ying Wai Wong, Jack Y. B. Lee, Victor O. K. Li, and Gary S. H. Chan CSVT 2007 FEB Supporting Interactive Video-on-Demand With Adaptive Multicast Streaming.
Optimization of Data Caching and Streaming Media Kristin Martin November 24, 2008.
A Lightweight Currency-based P2P VoD Incentive Mechanism Presented by Svetlana Geldfeld by Chi Wang, Hongbo Wang, Yu Lin, and Shanzhi Chen.
Slice–and–Patch An Algorithm to Support VBR Video Streaming in a Multicast– based Video–on–Demand System.
Scalable On-demand Media Streaming with Packet Loss Recovery Anirban Mahanti Department of Computer Science University of Calgary Calgary, AB T2N 1N4 Canada.
Distributed Multimedia Systems
CHAINING COSC Content Motivation Introduction Multicasting Chaining Performance Study Conclusions.
Lecture 36: Chapter 6 Today’s topic –RAID 1. RAID Redundant Array of Inexpensive (Independent) Disks –Use multiple smaller disks (c.f. one large disk)
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
Analysis of Using Broadcast and Proxy for Streaming Layered Encoded Videos Wilson, Wing-Fai Poon and Kwok-Tung Lo.
Periodic Broadcasting with VBR- Encoded Video Despina Saparilla, Keith W. Ross and Martin Reisslein (1999) Prepared by Nera Liu Wing Chun.
VCR-oriented Video Broadcasting for Near Video-On- Demand Services Jin B. Kwon and Heon Y. Yeon Appears in IEEE Transactions on Consumer Electronics, vol.
Distributed Servers Architecture for Networked Video Services S.-H. Gary Chan and Fouad Tobagi Presented by Todd Flanagan.
An Active Buffer Management Technique for Providing Interactive Functions in Broadcast Video-on-Demand Systems Zongming Fei, Member, IEEE, Mostafa H. Ammar,
Prefix Caching assisted Periodic Broadcast for Streaming Popular Videos Yang Guo, Subhabrata Sen, and Don Towsley.
HHMSM: A Hierarchical Hybrid Multicast Stream Merging Scheme For Large-Scale Video-On-Demand Systems Hai Jin and Dafu Deng Huazhong University of Science.
End-to-End Analysis of Distributed Video-on-Demand Systems P. Mundur, R. Simon, and A. K. Sood IEEE Transactions on Multimedia, Vol. 6, No. 1, Feb 2004.
Distributed Servers Architecture for Networked Video Services S. H. Gary Chan, Member IEEE, and Fouad Tobagi, Fellow IEEE.
Periodic Broadcast and Patching Services - Implementation, Measurement, and Analysis in an Internet Streaming Video Testbed Michael K. Bradshaw, Bing Wang,
Optimal Proxy Cache Allocation for Efficient Streaming Media Distribution Bing Wang, Subhabrata Sen, Micah Adler, and Don Towsley INFOCOM 2002.
Proxy-based Distribution of Streaming Video over Unicast/Multicast Connections B. Wang, S. Sen, M. Adler and D. Towsley University of Massachusetts Presented.
Dimensioning the Capacity of True Video-on-Demand Servers Nelson L. S. da Fonseca, Senior Member, IEEE, and Hana Karina S. Rubinsztejn IEEE TRANSACTIONS.
1 On a Unified Architecture for Video-on-Demand Services Jack Y. B. Lee IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 4, NO. 1, MARCH 2002.
Multicast with Cache (Mcache): An Adaptive Zero-Delay Video-on-Demand Service Sridhar Ramesh, Injong Rhee, and Katherine Guo INFOCOM 2001.
Efficient Support for Interactive Browsing Operations in Clustered CBR Video Servers IEEE Transactions on Multimedia, Vol. 4, No.1, March 2002 Min-You.
Recursive Patching by Wong Ying Wai. Agenda Introduction Review on patching  Patching  Transition patching Recursive patching Stream assignment Performance.
Scalable Live Video Streaming to Cooperative Clients Using Time Shifting and Video Patching Meng Guo and Mostafa H. Ammar INFOCOM 2004.
On G-network and resource allocation in multimedia systems 報告者 : 王敬育.
Limiting the client bandwidth of broadcasting protocols for video on demand Jehan-Francois Paris and Darrell D.E. Long Proceedings of the Euromedia 2000.
Loopback: Exploiting Collaborative Caches for Large-Scale Streaming Ewa Kusmierek, Yingfei Dong, Member, IEEE, and David H. C. Du, Fellow, IEEE.
A scalable technique for VCR-like interactions in video-on-demand applications Tantaoui, M.A.; Hua, K.A.; Sheu, S.; IEEE Proceeding of the 22nd International.
A Scalable Video-On-Demand System Using Multi-Batch Buffering Techniques Cyrus C. Y. Choi and Mounir Hamdi, Member, IEEE IEEE ‘03 Transactions on Broadcasting.
The Split and Merge Protocol for Interactive Video-on-Demand Wanjiun Liao and Victor O.K. Li IEEE Multimedia.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
SET TOP BOX What is set-top box ? An interactive device which integrates the video and audio decoding capabilities of television with a multimedia application.
Can Internet Video-on-Demand Be Profitable? SIGCOMM 2007 Cheng Huang (Microsoft Research), Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University)
1 Proxy-Assisted Techniques for Delivering Continuous Multimedia Streams Lixin Gao, Zhi-Li Zhang, and Don Towsley.
T Multimedia Programming Maciej Korczyński, Krzysztof Zurek.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Exploring VoD in P2P Swarming Systems By Siddhartha Annapureddy, Saikat Guha, Christos Gkantsidis, Dinan Gunawardena, Pablo Rodriguez Presented by Svetlana.
COCONET: Co-Operative Cache driven Overlay NETwork for p2p VoD streaming Abhishek Bhattacharya, Zhenyu Yang & Deng Pan.
An Analysis of Chaining Protocols for Video-on-Demand J.-F. Pâris University of Houston Thomas Schwarz, S. J. Universidad Católica del Uruguay.
INFOCOM, 2007 Chen Bin Kuo ( ) Young J. Won ( ) DPNM Lab.
NETWORK TOPOLOGIES There are three basic configurations used to connect computers they are the  Bus  Ring  Star.
Local Area Networks (LAN) are small networks, with a short distance for the cables to run, typically a room, a floor, or a building. - LANs are limited.
DELAYED CHAINING: A PRACTICAL P2P SOLUTION FOR VIDEO-ON-DEMAND Speaker : 童耀民 MA1G Authors: Paris, J.-F.Paris, J.-F. ; Amer, A. Computer.
Multimedia Operating Systems ●File System Paradigms ●File Replacement ●Caching ●Disk.
Chapter 5: Summary r principles behind data link layer services: m error detection, correction m multiple access protocols m link layer addressing, ARP.
Segment-Based Proxy Caching of Multimedia Streams Authors: Kun-Lung Wu, Philip S. Yu, and Joel L. Wolf IBM T.J. Watson Research Center Proceedings of The.
March 16 & 21, Csci 2111: Data and File Structures Week 9, Lectures 1 & 2 Indexed Sequential File Access and Prefix B+ Trees.
Computing Infrastructure for Large Ecommerce Systems -- based on material written by Jacob Lindeman.
Multicast instant channel change in IPTV systems 1.
Memory Management Problem: Records (of various lengths) need to be stored. Model: A big array of space to store them, managed by a memory manager. Like.
1 Push-to-Peer Video-on-Demand System. 2 Abstract Content is proactively push to peers, and persistently stored before the actual peer-to-peer transfers.
HADOOP DISTRIBUTED FILE SYSTEM HDFS Reliability Based on “The Hadoop Distributed File System” K. Shvachko et al., MSST 2010 Michael Tsitrin 26/05/13.
March 2001 CBCB The Holy Grail: Media on Demand over Multicast Doron Rajwan CTO Bandwiz.
Simulation case studies J.-F. Pâris University of Houston.
California State University, LA Presented by Amanda Steven StevenAamirObaid.
Scalable video distribution techniques Laurentiu Barza PLANETE project presentation: Sophia Antipolis 12 October 2000.
Dariusz Broncel, Łukasz Dewera Systemy Multimedialne 2006 Development Directions of IPTV Platform.
Cost-Effective Video Streaming Techniques Kien A. Hua School of EE & Computer Science University of Central Florida Orlando, FL U.S.A.
INTERNET PROTOCOL TELEVISION (IP-TV)
CS 414 – Multimedia Systems Design Lecture 31 – Media Server (Part 5)
Video on Demand (VoD) March, 2003
CSI 400/500 Operating Systems Spring 2009
Video On Demand.
INTERNET PROTOCOL TELEVISION (IP-TV)
Presentation transcript:

An Efficient Implementation of Interactive Video-on-Demand Steven Carter and Darrell Long University of California, Santa Cruz Jehan-François Pâris University of Houston

Why Video-on-Demand? Increased customer convenience Few people enjoy returning video tapes Even fewer people enjoy paying late fees Improved selection of videos Current pay-per-view provides only a small selection of popular videos Savings in time and resources It takes time and fuel to drive to the video rental store

Why Now? Technology becoming available Processors are inexpensive Storage is nearly free ($200 for 40GB) Fast networking is seeing wide deployment Consider the success of Tivo Records live television using MPEG to disk Provides interactive access to recorded programs

Why Interactive? It’s hard! It’s more expensive! … but it’s what people expect They won’t give up functionality they have come to expect They’d like to pause to make microwave popcorn They’d like to rewind to see the play again They’d like to be able to fast forward past the boring parts

Related Research Conventional video-on-demand (VoD) Requires one stream per client Patching An independently developed version of stream tapping Batching Group the requests of several clients together Various near video-on-demand (NVoD) schemes

Key Observation For videos of non-trivial length, several clients will be viewing portions of that video One client watching a 120 minute video and a second client begins watching the same video 10 minutes later The server needs only send data for the non-overlapping portion The potential for savings is enormous

Assumptions A set-top-box with: A fast network connection A few gigabytes of local storage A modest processor Keep in mind that set top boxes with these features already exist

Our Solution Stream Tapping uses multicast to tap in existing video streams Server load is the primary difficult in making VOD a reality Stream Tapping reduces server load by allowing clients to tap into video streams created for other clients Cost per client is dramatically reduced Client waiting time is also reduced

Stream Types A B C 0  22 33 44 Stream Time (since start of complete stream A) bb cc cc  bb Full tap Complete stream Partial tap

Complete Streams Start at a particular position in a video and transmit the remainder of the video For non-interactive Stream Tapping, the starting position is the beginning of the video Used primarily by the first client in a group to view the video

Stream Types A B C 0  22 33 44 Stream Time (since start of complete stream A) bb cc cc  bb Full tap Complete stream Partial tap

Full Tap Streams Can be used if the delay (  ) is less than the buffer size (  ) The full tap stream transmits the video from time 0 to  The complete stream is tapped and written to the buffer while the full tap stream is played

Stream Types A B C 0  22 33 44 Stream Time (since start of complete stream A) bb cc cc  bb Full tap Complete stream Partial tap

Partial Tap Streams Can be used when a complete stream is available but    Note that given current technology,  will be very large The client will tap the complete stream for  units while simultaneously viewing the first  from a partial tap stream Subsequently, partial tap streams of length    are used for the client to catch up to the complete stream

Stream Types A B C 0  22 33 44 Stream Time (since start of complete stream A) bb cc cc  bb Full tap Complete stream Partial tap

Tapping Options Extra Tapping Allows the client to tap data from any active video stream active, not just the complete stream of the video group Decreases server load by decreasing the length of full tap streams Stream Stacking If the server has streams available, the client can combine them to receive data at rate higher than the nominal rate Allows the server to service stream more quickly, which allows new streams to be scheduled

Interactive Stream Tapping When an interaction begins, Stream Tapping deallocates resources associated with a client If the client was the only one using a stream, then the stream is terminated Stream Tapping determines the resources needed for an interaction, and allocates an interaction stream Note: for rewind, the client’s buffer can be used When the interaction is complete, the client is merged into a video group (tapping existing streams if available)

Contingency Streams These are streams that are held in reserve for interaction The pool of these streams can be managed using high and low watermarks for hysteresis Having such a reserve of streams is essential to avoid blocking

Simulation Model Stream Tapping is too complex to model analytically, so we used discrete event simulation The length of the videos was derived from empirical data and a gaussian with mean 102 minutes provided the best fit The popularity of videos was modeled using a Zipf-like distribution, which is the distribution used in most VoD studies

Comparison with Conventional Systems

Contingency Streams versus Start-up Latency

Contingency Streams versus Resume Latency

Contingency Streams versus Blocking Probability

Effect of Client Buffer Size

Effect of Tapping Options

Conclusions Stream Tapping has been shown to work well in the interactive environment We have shown that VCR-like controls are possible Previous work has ignored them or only provided course-grained control The use of storage in the STB is an enabling technology

Video Length Distribution