An incentive charging scheme for video-on-demand

Video-on-demand (VOD) systems can provide either an individual service or batch service. For individual service, a user can receive video immediately after making a request and he/she can perform interactive operations (such as pause, jump, fast forward and rewind), and the system uses one video stream to serve one user. For batch service, a user has to wait after making a request and cannot perform interactive operations, but the system can use one video stream to serve a batch of users. Therefore, individual service has a better quality while batch service requires less resources to serve each user. In this paper, we consider a VOD system providing both services and propose an incentive charging scheme to optimize the coexistence of both services. This scheme imposes a lower service charge on batch service in order to attract users to choose this service. Consequently, the service provider can get more revenue by serving more concurrent users via batch service and users can choose their preferred services. We analyze the incentive charging scheme and maximize the mean revenue subject to a given availability specification. The numerical results show that the incentive charging scheme is particularly effective in peak hours when the demand for the VOD service is large.

[1]  Sape J. Mullender Distributed multimedia systems , 1992, Future Gener. Comput. Syst..

[2]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[3]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[4]  David P. Anderson,et al.  Metascheduling for continuous media , 1993, TOCS.

[5]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..

[6]  Donald F. Towsley,et al.  Channel Allocation under Batching and VCR Control in Video-on-Demand Systems , 1995, J. Parallel Distributed Comput..

[7]  Wanjiun Liao,et al.  The split and merge (SAM) protocol for interactive video-on-demand systems , 1997, Proceedings of INFOCOM '97.

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

[9]  S. Rao,et al.  Optimal Pricing of Priority Services , 1998, Oper. Res..

[10]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[11]  Asit Dan,et al.  Scheduling policies for an on-demand video server with batching , 1994, MULTIMEDIA '94.

[12]  W. Verbiest,et al.  Interactive video on demand , 1994, IEEE Communications Magazine.

[13]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[14]  W. Press,et al.  Numerical Recipes in Fortran: The Art of Scientific Computing.@@@Numerical Recipes in C: The Art of Scientific Computing. , 1994 .

[15]  A. Jagers,et al.  On the continued Erlang loss function , 1986 .

[16]  Eric Wing Ming Wong,et al.  Performance Model of Interactive Video-on-Demand Systems , 1996, IEEE J. Sel. Areas Commun..

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