Class-based access control for distributed video-on-demand systems

The focus of this paper is the analysis of threshold-based admission control policies for distributed video-on-demand (VoD) systems. Traditionally, admission control methods control access to a resource based on the resource capacity. We have extended that concept to include the significance of an arriving request to the VoD system by enforcing additional threshold restrictions in the admission control process on request classes deemed less significant. We present an analytical model for computing blocking performance of the VoD system under threshold-based admission control. Extending the same methodology to a distributed VoD architecture we show through simulation that the threshold performance conforms to the analytical model. We also show that threshold-based analysis can work in conjunction with other request handling policies and are useful for manipulating the VoD performance since we are able to distinguish between different request classes based on their merit. Enforcing threshold restrictions with the option of downgrading blocked requests in a multirate service environment results in improved performance at the same time providing different levels of quality of service (QoS). In fact, we show that the downgrade option combined with threshold restrictions is a powerful tool for manipulating an incoming request mix over which we have no control into a workload that the VoD system can handle.

[1]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[2]  Keith W. Ross,et al.  The stochastic knapsack problem , 1989, IEEE Trans. Commun..

[3]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[4]  J. Aein A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model , 1978, IEEE Trans. Commun..

[5]  Spiridon Bakiras,et al.  Maximizing the number of users in an interactive video-on-demand system , 2002, IEEE Trans. Broadcast..

[6]  Ing-Ray Chen,et al.  Threshold-Based Admission Control Policies for Multimedia Servers , 1996, Comput. J..

[7]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[8]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[9]  Arun K. Sood,et al.  An integrated approach to end-to-end analysis of distributed video-on-demand systems , 2000 .

[10]  Keith W. Ross,et al.  Algorithms to determine exact blocking probabilities for multirate tree networks , 1990, IEEE Trans. Commun..

[11]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 2001 .

[12]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[13]  Fouad A. Tobagi,et al.  Threshold-based admission policies for video services , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[14]  Arun K. Sood,et al.  End-to-end analysis of distributed video-on-demand systems , 2004, IEEE Transactions on Multimedia.

[15]  A. L. Narasimha Reddy,et al.  Disk scheduling in a multimedia I/O system , 1993, MULTIMEDIA '93.

[16]  Harrick M. Vin,et al.  A statistical admission control algorithm for multimedia servers , 1994, MULTIMEDIA '94.

[17]  Edward Y. Chang,et al.  Admissions control and data placement for VBR video servers , 1994, Proceedings of 1st International Conference on Image Processing.

[18]  Roger Zimmermann,et al.  Comprehensive statistical admission control for streaming media servers , 2003, MULTIMEDIA '03.