[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Dynamic batching policies for an on-demand video server

  • Published:
Multimedia Systems Aims and scope Submit manuscript

Abstract

In a video-on-demand environment, continuous delivery of video streams to the clients is guaranteed by sufficient reserved network and server resources. This leads to a hard limit on the number of streams that a video server can deliver. Multiple client requests for the same video can be served with a single disk I/O stream by sending (multicasting) the same data blocks to multiple clients (with the multicast facility, if present in the system). This is achieved by batching (grouping) requests for the same video that arrive within a short time. We explore the role of customerwaiting time and reneging behavior in selecting the video to be multicast. We show that a first come, first served (FCFS) policy that schedules the video with the longest outstanding request can perform better than the maximum queue length (MQL) policy that chooses the video with the maximum number of outstanding requests. Additionally, multicasting is better exploited by scheduling playback of the n most popular videos at predetermined, regular intervals (hence, termed FCFS-n). If user reneging can be reduced by guaranteeing that a maximum waiting time will not be exceeded, then performance of FCFS-n is further improved by selecting the regular playback intervals as this maximum waiting time. For an empirical workload, we demonstrate a substantial reduction (of the order of 60%) in the required server capacity by batching.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anderson DP (1993) Metascheduling for continuous media. ACM Trans Comput Syst 11:226–252

    Article  Google Scholar 

  2. Craig DW, Woodside CM (1990) The rejection rate for tasks with random arrivals, deadlines, and preemptive scheduling. IEEE Trans Software Eng 16:1198–1208

    Article  Google Scholar 

  3. Dan A, Sitaram D (1993) Buffer management policy for an on-demand video server. IBM Research Report RC 19347, Yorktown Heights, NY

  4. Dan A, Sitaram D (1995) A generalized interval caching policy for mixed interactive and long video environment. IBM Research Report RC 20206. To appear in MMCN 96

  5. Dan A, Sitaram D, Shahabuddin P (1994) Scheduling policies for an on-demand video server with batching. IBM Research Report RC 19381

  6. Dan A, Shahabuddin P, Sitaram D, Tetzlaff W (1994) Anticipatory scheduling with batching for video servesr. IBM Research Report RC 1 9640, Yorktown Heights, NY

  7. Dan A, Dias D, Mukherjee R, Sitaram D, Tewari R(1995a) Buffering and caching in large-scale video servers. Proceedings of IEEE Comp-Con, San Francisco, CA, pp 217–224

    Google Scholar 

  8. Dan A, Kienzle M, Sitaram D (1995b) Dynamic segment replication policy for load-balancing in video-on-demand servers. ACM Multimedia Syst 3:93–103

    Article  Google Scholar 

  9. Dan A, Shahabuddin P, Sitaram D, Towsley D (1995c) Channel allocation under batching and VCR control in movie-on-demand servers. Journal of Parallel and Distributed Computing vol 30, 168–179

    Article  Google Scholar 

  10. Dykeman HD, Ammar MH, Wong JW (1986) Scheduling algorithms for videotex systems under broadcast delivery. Proceedings of IEEE ICC’86, Toronto, Canada, pp 1847–1851

  11. Fox EA (1989) The coming revolution in interactive digital video. Commun ACM 7:794–801

    Article  Google Scholar 

  12. Gelman AD, Halfin S (1990) Analysis of resource sharing in information providing services. Proceedings IEEE Global Telecommunications Conference and Exhibition, San Diego, CA, 1:312–316

    Article  Google Scholar 

  13. Gross D, Harris CM (1985) Fundamentals of queueing theory. John Wiley, New York Chichester Brisbane Toronto Singapore, p 124

    MATH  Google Scholar 

  14. Kleinrock L (1975) Queueing systems, vol 1: theory. John Wiley, New York Chichester Brisbane Toronto, p 105

    Google Scholar 

  15. Le Boudec J-Y (1992) The asynchronous transfer mode: a tutorial. Comput Networks ISDN Syst 24:279–309

    Article  MATH  Google Scholar 

  16. Lindfield GR, Penny JET (1989) Microcomputers in numerical analysis. John Wiley, New York Chichester Brisbane Toronto, p 31

    MATH  Google Scholar 

  17. Marchok DJ, Rohrs C, Schafer MR (1991) Multicasting in a growable packet (ATM) switch. IEEE INFOCOM, Bal Harbor, FL, pp 850–858

    Google Scholar 

  18. Peha JM, Tobagi FA (1990) Evaluating scheduling algorithms for traffic with heterogeneous performance objectives. IEEE GLOBECOM, pp 21–27

  19. Rangan PV, Vin HM, Ramanathan S (1992) Designing an on-demand multimedia service. IEEE Commun Magazine 30:56–65

    Article  Google Scholar 

  20. Sincoskie WD (19891) System architecture for a large-scale video-ondemand service. Comput Networks ISDN Syst 22:155–162

    Article  Google Scholar 

  21. Stankovic J, Ramamritham K, Chang S (1985) Evaluation of a flexible task-scheduling algorithm for distributed hard real-time systems. IEEE Trans Comput C-34:1130–1143

    Google Scholar 

  22. Wolff RW (1989) Poisson arrivals see time averages. Operations Res 30: 223–231

    Article  MathSciNet  Google Scholar 

  23. Wong JW, Ammar MH (1985) Analysis of broadcast delivery in a videotex system. IEEE Trans Commun 34:863–866

    Article  Google Scholar 

  24. Zhao ZX, Panwar SS, Towsley D (1991) Queueing performance with impatient customers. IEEE INFOCOM, Bal Harbor, FL, pp 400–409

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, T. J. Watson Research Center, 10598, Yorktown Heights, NY, USA

    Asit Dan & Dinkar Sitaram

  2. Dept. of Industrial Engg. & Operations Research, Columbia University, 10027, NY, USA

    Perwez Shahabuddin

Authors
  1. Asit Dan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dinkar Sitaram
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Perwez Shahabuddin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Asit Dan.

Additional information

This work was done at IBM Research

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dan, A., Sitaram, D. & Shahabuddin, P. Dynamic batching policies for an on-demand video server. Multimedia Systems 4, 112–121 (1996). https://doi.org/10.1007/s005300050016

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s005300050016

Key words

Search

Navigation