210 likes | 406 Views
Supporting Interactive Video-on-Demand With Adaptive Multicast Streaming. Ying Wai Wong, Jack Y. B. Lee, Victor O. K. Li, and Gary S. H. Chan CSVT 2007 FEB. Introduction. Multicast Streaming Interactive Playback Support Interactive Multicast Streaming Static Full Stream Scheduling (SFSS)
E N D
Supporting Interactive Video-on-Demand With Adaptive Multicast Streaming Ying Wai Wong, Jack Y. B. Lee, Victor O. K. Li, and Gary S. H. Chan CSVT 2007 FEB
Introduction • Multicast Streaming • Interactive Playback Support • Interactive Multicast Streaming • Static Full Stream Scheduling (SFSS) • Adaptive Full Stream Scheduling • Performance Evaluation
Multicast Streaming • Concept 10:00 10:00 Stream 1 Stream 2 Stream 3 10:03 10:05 Tcsu (http://vc.cs.nthu.edu.tw/home/paper/codfiles/tcsu/200104221412/odmr_jswang.ppt) time 10:00 10:03 10:05
Multicast Streaming • Caching and Patching • Caching and Sharing the streams in clients • The missed initial portion is transmitted by patching Full Stream Caching in cc Caching in cb Caching in cb Partial Stream Patching Caching in cc time time
Multicast Streaming • Controlled greedy recursive patching (CGRA) [9] • A new client caches data from the latest reachable stream • Cost-aware recursive patching (CARP) [9] • A new client is inserted in the merge tree • Dyadic [13] • Dyadic interval: t + L/(2ri) • Earliest Reachable Merge Target (ERMT) [10] time time time time Time to wait before playback beginning
Interactive Playback Support • Unicast • Dedicated stream • Multicast • Discontinuous interactive playback • Staggered multicast video streaming [30] • Split-and-Merge (Dedicated interactive stream) [28] • Best-Effort Patching (cache from more than one stream) [33] Jump point current … … stream 6 7 8 Stream 1 Stream 2 Stream 3 Stream 4 Dedicated stream pk-tm time Current point tm pk
Interactive Multicast Streaming • Issues • Interactivity Model • Request Scheduling • Client Buffer Management
Interactive Multicast Streaming • Interactivity Model • Interactive operations (VCR operations) • Pause/resume, slow motion, frame stepping, fast forward/backward visual search, and forward/backward seeking • Multi-campus interactive educational resource system [37] • Exponential distribution • Not suitable for entertainment contents • Two state model – NORMAL and INTERACTION [36] • Exponentially distributed staying in one state • Multi-state model [31]
Interactive Multicast Streaming Full stream (admission requests) • Request Scheduling • Admission requests • Generated by new clients • Merging requests • Generated by clients performing VCR • Importance • Merging requests > Admission requests • Full-stream restart threshold W Partial stream (Merging requests) time time time W W
Interactive Multicast Streaming • Client Buffer Management • Playback rate: R bps • Receiving rate: 2R bps • Buffer accumulation rate: R bps • Minimum required buffer size: WR bits • Assume maximum buffer size is limited to BcR bits • W Bc • (pk – tm) Bc • Tp + Tpc Bc Caching time W Nearest playback point after VCR operations VCR duration Maximum buffer time Patching and caching duration PAUSE duration
Interactive Multicast Streaming # of server channels: 10 Probability of FSEEK:0.1 • Performance Impact Time to wait before playback beginning Time to wait from VCR to playback resuming
Interactive Multicast Streaming # of server channels: 24 Probability of FSEEK:0.03 Probability of BSEEK:0.03 Probability of PAUSE:0.03 • Performance Impact (2)
FSEEK,BSEEK,PAUSE Static Full Stream Scheduling (SFSS) • Assumption: • Full streams are generated every W seconds • Merging request rate: uVCR requests/second • # of full streams in the system: L/W • Average playback point after VCR operations before next full stream: W/2 • Average merging cost: WR/2 • Average system cost: uVCR (WR/2) • Resource consumption rate of full stream: RL/W • Total resource consumption rate: uVCR (WR/2) + RL/W • When W = (2L/uVCR)1/2, we have the minimum consumption rate … time W W Partial stream W is a decreasing function of uVCR
Adaptive Full Stream Scheduling • An optimal W must be found with knowing all the system parameters. • Five system parameters • Client arrival rate, Probability of FSEEKPf, Probability of BSEEKPb, Probability of PAUSEPp, Average seek distancesd • Initial full-stream restart threshold (W) is needed such that system parameters can be measured. • Embedded simulator is applied to find the optimal threshold by the measured parameters. • The changes of the system parameters are detected and go to step 2. 95% confidence interval
Performance Evaluation # of server channels: 24 Probability of FSEEK:0.1 Probability of BSEEK:0.1 Probability of PAUSE:0.1 • Optimization of the Full Stream Restart Threshold
Performance Evaluation • Latencies Comparisons Improvement: 98%
Performance Evaluation # of server channels: 24 Probability of FSEEK:0.05 Probability of BSEEK:0.05 Probability of PAUSE:0.05 • Latencies Comparisons Improvement: 90%
Performance Evaluation • Effect of Client Buffer Constraint L
Performance Evaluation • Just-in-Time Simulation (Adaptive W)
Performance Evaluation • Just-in-Time Simulation (Adaptive W)
Performance Evaluation • Adaptive FSS vs. Static FSS