A Movie-Scheduling Policy for Video-on-Demand Systems

  • Sameer Dubey
  • Grammati E. Pantziou
  • Nilay Sheth


In this paper we present a policy for scheduling movies in a video-on-demand system which is equipped with the multicast facility. A 2-layer architecture is used where both a master server and a number of local servers are used to serve the users. The policy enables users to select both local and non-local movies, reduces the average waiting time before a user is served, and prevents the replication of movies at each site. Real-time threads have been used for the implementation, of the mechanism, and a simulation study has been conducted.


Local Server Remote Server Server Capacity IEEE Communication Magazine Average Waiting Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H.-J. Chen and T.D.C. Little, “Physical Storage Organizations for Time-Dependent Multimedia Data”, in Proc. ACM FODO, (1993). Google Scholar
  2. [2]
    S. Christodoulakis and C. Faloutsos, “Design and Performance Considerations for an Optical Disk-Based,Multimedia. Object Server” Computer 19. (1986), pp. 45–56. CrossRefGoogle Scholar
  3. [3]
    A. Dan, P. Shahabuddin, D. Sitaram and D. Towsley, “Channel Allocation under Batching and VCR Control in Movie-On-Demand Servers”. IBM Research Report, RC 19588,York town Heights, NY, 1994. Google Scholar
  4. [4]
    A. Dan, D. Sitaram and P. Shahabuddin, “Scheduling Policies for an On-Demand Video Server with Batching”, in Proc. ACM Multimedia, (1994), pp. 15–23. Google Scholar
  5. [5]
    A. Dan D. Sitaram and P. Shahabuddin, “Scheduling Policies with Grouping for providing VCR Control Functions in a Multimedia Server” U.S. Docket No YO993-030, 1994. Google Scholar
  6. [6]
    A. Dan and D. Sitaram, “Buffer Management Policy for an On-Demand Video Server”, IBM Research Report, RC 19347, Yorktown Heights. NY. 1993.Google Scholar
  7. [7]
    H.D. Dykeman, M.H. Ammar and J.W. Wong, “Scheduling Algorithms for Videotex Systems under Broadcast Delivery”, in Proc. ICC (1986), pp. 1847–1851. Google Scholar
  8. [8]
    A.D. Gelman, H. Kobrinski, L.S. Smoot and S.B. Weinstein, “A Store-and-Forward Architecture for Video-On-Demand Service”, in Proc. ICC (1991). Google Scholar
  9. [9]
    T.D.C. Little and D. Venkatesh, “Probabilistic Assignment of Movies to Star age Devices in a Video-On-Demand System”, Proc. Network and Operating System Support for Digital Audio and Video (NOSSDAV), (1993), pp. 204–215.Google Scholar
  10. [10]
    S. Loeb, “Delivering Interactive Multimedia Documents over Networks”, IEEE Communications Magazine 30, (1992), pp. 52–59.MathSciNetCrossRefGoogle Scholar
  11. [11]
    P.V. Rangan, H.M. Vin, S. Ramanathan, “Designing an On-Demand Multimedia Service”, IEEE Communications Magazine 30, (1992). pp. 56–64.CrossRefGoogle Scholar
  12. [12]
    R. Ramarao, V. Ramamoorthy, “Architectural Design of On-Demand Video Delivery Systems: The spatio-Temporal Storage Allocation Problem”, in Proc. ICC (1991). Google Scholar
  13. [13]
    W.D. Sincoskie, “System Architecture for a. Large Scale Video-On-Demand Service”, Computer Networks and ISDN Systems 22, (1991), pp. 155–162.CrossRefGoogle Scholar
  14. [14]
    J. Sutherland, L. Litter al, “Residential Video Services”, IEEE Communications Magazine 30, (1992), pp. 36–41.CrossRefGoogle Scholar
  15. [15]
    H. Tokuda, T. Kitayama, “Dynamic QOS Control based on Real-Time Threads”, Proc. Network and Operating System Support for Digital Audio and Video (NOSSDAV), (1993), pp. 114–123. Google Scholar

Copyright information

© Plenum Press, New York 1996

Authors and Affiliations

  • Sameer Dubey
    • 1
  • Grammati E. Pantziou
    • 2
  • Nilay Sheth
    • 1
  1. 1.Computer Science DepartmentUniversity of Central FloridaOrlandoUSA
  2. 2.Computer Technology InstitutePatrasGreece

Personalised recommendations