280 likes | 386 Views
On a Unified Architecture for Video-on-Demand Services. Jack Y. B. Lee IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 4, NO. 1, MARCH 2002. Outline. Introduction UVoD Architecture Performance Modeling Numerical Results Simulation Results Interactive Controls Conclusions. Introduction.
E N D
On a Unified Architecture forVideo-on-Demand Services Jack Y. B. Lee IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 4, NO. 1, MARCH 2002
Outline • Introduction • UVoD Architecture • Performance Modeling • Numerical Results • Simulation Results • Interactive Controls • Conclusions
Introduction • true-VoD (TVoD) • Service quality is maximized • near-VoD (NVoD) • System cost is minimized • unified VoD (UVoD) • Cost-performance tradeoff
Arrives at time t tm-1< t < (tm –δ) After (t – tm-1) Admit-via-Unicast
Recourse reduction over TVoD • Admit-via-Multicast • As multicast channels is fixed, Admit-via-Multicast users will not result in additional load • Increasing the admission threshold δ thenmore user will be admitted to the multicast channels • Admit-via-Unicast • Since 0 < (t – tm-1) < (T –δ) ≪ L, unicast channels are occupied for a much shorter duration compared to TVoD
Performance Modeling • Latency (average waiting time) • Admit-via-Multicast • Admit-via-Unicast • Admission Threshold • Channel Partitioning
Waiting Times (1) • Admit-via-Multicast • wM (δ)=δ / 2 • Admit-via-Unicast • Arrival process • λu = ( 1 –δ / TR)λ • Service time • Uniform distribution between 0 < s < TR –δ • Approximation by Allen and Cunneen for G/G/m queue
Coefficient of variation Traffic intensity Average service time Server utilization Erlang-C function Waiting Times (2)
Channel Partitioning • Find the optimum number of multicast channel such that the resultant latency is minimized • Theorem 1: The optimal proportion of available channels to multicast that minimizes the load at the unicast channels is given by
Numerical Results • Corresponding Latency Formula • NVoD • The latency is constant at 360(900)s for 10(20) movies • TVoD
System Capacity and Scalability (1) λ arrival rate in customers/s ulatency constraint in seconds WUVoDlatency fo UVoD WTVoDlatency fo TVoD
0.2 0.1 System Capacity and Scalability (2)
Simulation Results • Environments • Simulation program is developed in C++ using CNCL version 1.10 • Run 31 days • Model Validation • Admission Rescheduling
Admission Rescheduling (1) • When Admission Rescheduling? • For heavy system loads, a user by Admit-via-Unicast may waiting exceed the time to the next multicast of the requestd movie
Interactive Controls (1) • Using Unicast Channels • Break current multicast video stream then restart at some point • Treat interactive controls as new-video requests starting at the middle of a movie • Could increase waiting for both and interactive requests
Interactive Controls (2) • Channel Hopping • Client has a buffer large enough to cache TR s • User pause at a movie time Tp • Case1: • If resume before buffer overflow, nothing need to be done • Case2: • Once buffer is full, stop buffering • Later resume immediately and determine the nearest multicast channel at movie time Tm ≤Tp
Conclusions • This paper propose and analyzes an architecture that unifies the existing TVoD and NVoD • Through admission-threshold and channel partitioning can achieve cost-performance tradeoff • Results show large performance gain