An incentive charging scheme for video-on-demand

Y. W. Leung*, E. W.M. Wong

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

8 Citations (Scopus)

Abstract

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 hatch service, a user has to wait af^er making a request and cannot perform interactive operations, hut the system can use one video stream to serve a hatch of users. Therefore, individual service has a hetter quality while hatch service requires less resources to serve each user. In this paper, we consider a VOD system providing hoth services and propose an incentive charging scheme to optimize the coexistence of hoth services. This scheme imposes a lower service charge on hatch service in order to attract users to choose this service. Consequently, the service provider can get more revenue hy serving more concurrent users via hatch service and users can choose their preferred services. We analyze the incentive charging scheme and maximize the mean revenue suhject to a given availahility 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.

Original languageEnglish
Pages (from-to)55-63
Number of pages9
JournalJournal of the Operational Research Society
Volume52
Issue number1
DOIs
Publication statusPublished - Jan 2001

Scopus Subject Areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

User-Defined Keywords

  • Information systems
  • Stochastic optimization
  • Telecommunications

Fingerprint

Dive into the research topics of 'An incentive charging scheme for video-on-demand'. Together they form a unique fingerprint.

Cite this