Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal and Efficient Merging Schedules for Video-on-Demand Servers
 

Summary: Optimal and Efficient Merging Schedules for
Video-on-Demand Servers
Derek Eager Mary Vernon John Zahorjan
Dept. of Computer Science Computer Sciences Dept. Dept. of Computer Sci. & Eng.
University of Saskatchewan University of Wisconsin University of Washington
eager@cs.usask.ca vernon@cs.wisc.edu zahorjan@cs.washington.edu
1 INTRODUCTION
The simplest video-on-demand (VOD) delivery policy is to
allocate a new media delivery stream to each client request when
it arrives. This policy has the desirable properties of "immediate
service" (there is minimal latency between the client request and
the start of playback, assuming that sufficient server bandwidth is
available to start the new stream), of placing minimal demands on
client capabilities (the client receive bandwidth required is the
media playback rate, and no client local storage is required1
), and
of being simple to implement. However, the policy is untenable
because it requires server bandwidth that scales linearly with the
number of clients that must be supported simultaneously, which is
too expensive for many applications.

  

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle
Vernon, Mary K. - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences; Engineering