Video file server cache management using movie ratings for reservation of memory and bandwidth resources

• US 20030005457A1
• Filed: 06/28/2001
• Published: 01/02/2003
• Est. Priority Date: 06/28/2001
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Faibish, Sorin, Bixby, Peter, Sezer, Ugur, Forecast, John, Duso, Wayne W.
• Granted Patent: US 7,444,662 B2
• Time in Patent Office: Days
• US Class Current: 725/94
• CPC Class Codes: H04N 21/2225 Local VOD servers
• CPC Class Codes: H04N 21/23106 involving caching operations prefetching while addressing of a memory level in which the access to the desired data or data block requires associative addressing means within memory systems or architectures G06F12/0862; caching at an intermediate stage in a data network H04L67/568
• CPC Class Codes: H04N 21/2393 involving handling client requests scheduling or organising the servicing of application requests H04L67/60
• CPC Class Codes: H04N 21/2407 Monitoring of transmitted content, e.g. distribution time, number of downloads arrangements for monitoring programmes for broadcast or for distribution combined with broadcast H04H20/14
• CPC Class Codes: H04N 21/26241 involving the time of distribution, e.g. the best time of the day for inserting an advertisement or airing a children program
• CPC Class Codes: H04N 7/17336 Handling of requests in head-ends

Abstract

Access to movies ranging from very popular movies to unpopular movies is managed by configuring sets of data movers for associated movie rankings, reserving data mover local cache resources for the most popular movies, reserving a certain number of streams for popular movies, negotiating with a client for selection of available movie titles during peak demand when resources are not available to start any freely-selected movie in disk storage, and managing disk bandwidth and primary and local cache memory and bandwidth resources for popular and unpopular movies. The assignment of resources to movie rankings may remain the same while the rankings of the movies are adjusted, for example, during off-peak hours. A movie locked in primary cache and providing a source for servicing a number of video streams may be demoted from primary cache to disk in favor of servicing one or more streams of a higher-ranking movie.

Claims

1. A video file server for providing clients with video-on-demand access to movies, the video file server comprising:

a cached disk storage system including a primary cache and disk storage for storing the movies; and

a multiplicity of data mover computers coupled to the cached disk storage system for streaming video data from the cached disk storage system to clients in a data network, each of the data mover computers having a local cache;

wherein the movies are ranked with respect to popularity, and a respective set of the data movers are pre-assigned for servicing video streams for each movie ranking.

2. The video file server as claimed in claim 1, wherein the data movers in the respective sets of data movers are configured differently for providing more network interface resources for very popular movies and for providing more local cache memory resources for less popular movies.

3. The video file server as claimed in claim 2, wherein for very popular movies, the very popular movies are retained in their entirety in local cache of the data movers assigned to service the very popular movies.

4. The video file server as claimed in claim 1, wherein the sets of data movers include a set consisting of more than one data mover for servicing one very popular movie, a set consisting of one data mover for servicing only one movie, and a set consisting of one data mover for servicing a plurality of the movies.

5. The video file server as claimed in claim 1, wherein a series of at least some of the data movers include direct links for transfer of movie data from a data mover set servicing one movie ranking to a data mover set servicing a next higher movie ranking and for transfer of movie data from the data mover set servicing the one movie ranking to a data mover set servicing a next lower movie ranking.

6. The video file server as claimed in claim 1, wherein data mover resources for a certain number of video streams from the data movers to the clients are reserved for each of a multiplicity of the movies.

7. The video file server as claimed in claim 1, wherein the video file server is programmed for locking in the primary cache a plurality of entire movies, and when there is a need for servicing a more popular movie from the primary cache and there is insufficient free cache memory for servicing the more popular movie from the primary cache, transferring the servicing of a less popular movie from the primary cache to disk storage in order to free cache memory for servicing the more popular movie from the primary cache.

8. The video file server as claimed in claim 7, wherein the video file server is programmed for freeing primary cache memory by transferring the servicing of a least popular movie in the primary cache from the primary cache to the disk storage so long as no more than a certain number of video streams are being serviced concurrently from the least popular movie in the primary cache.

9. The video file server as claimed in claim 1, wherein the video file server is programmed for negotiating with a client for selection of an available movie during peak demand when resources are not available to select freely any movie in the disk storage for which a video stream can be started.

10. A video file server for providing clients with video-on-demand access to movies, the video file server comprising:

a cached disk storage system including a cache and disk storage for storing the movies; and

a multiplicity of data mover computers coupled to the cached disk storage system for streaming video data from the cached disk storage system to clients in a data network;

wherein the video file server is programmed for locking in the cache a plurality of entire movies, and when there is a need for servicing a more popular movie from the cache and there is insufficient free cache memory for servicing the more popular movie from the cache, transferring the servicing of a less popular movie from the cache to disk storage in order to free cache memory for servicing the more popular movie from the cache.

11. The video file server as claimed in claim 10, wherein the video file server is programmed for freeing locked cache memory by transferring the servicing of the least popular movie in the cache from the cache to the disk storage so long as no more than a certain number of video streams are being concurrently serviced from the least popular movie in the cache.

12. The video file server as claimed in claim 10, wherein each of the data mover computers has a local cache, the movies are ranked with respect to popularity, and a respective set of the data movers are pre-assigned for servicing video streams for each movie ranking, and the data movers in the respective sets of data movers are configured differently for providing more network interface resources for very popular movies and for providing more local cache memory resources for less popular movies.

13. The video file server as claimed in claim 10, wherein a series of at least some of the data movers include direct dedicated links for transfer of movie data from a data mover set servicing one movie ranking to a data mover set servicing a next higher movie ranking and for transfer of movie data from the data mover set servicing the one movie ranking to the data mover set servicing a next lower movie ranking.

14. The video file server as claimed in claim 10, wherein data mover resources for a certain number of video streams from the data movers to the clients are reserved for each of a multiplicity of the movies.

16. The method as claimed in claim 15, which includes configuring differently the data movers in the respective sets of data movers in order to provide more network interface resources for very popular movies and for providing more local cache memory resources for less popular movies.

17. The method as claimed in claim 15, which includes, for very popular movies, retaining the very popular movies in their entirety in the local cache of the data movers assigned to service the very popular movies.

18. The method as claimed in claim 15, which includes servicing a most popular movie with an assigned data mover set consisting of more than one data mover, servicing only one movie with an assigned data mover set consisting of one data mover, and servicing a plurality of movies with an assigned data mover set consisting of one data mover.

19. The method as claimed in claim 15, wherein a series of at least some of the data movers are linked by direct dedicated data links and the method includes transferring movie data from a data mover set servicing one movie ranking to a data mover set servicing a next higher movie ranking and transferring movie data from a data mover set servicing the one movie ranking to a data mover set servicing a next lower movie ranking.

20. The method as claimed in claim 15, which includes reserving data mover resources for a respective number of video streams from the data movers to the clients for each of a multiplicity of the movies.

21. The method as claimed in claim 15, which includes locking in the primary cache a plurality of entire movies, and when there is a need for servicing a more popular movie from the primary cache and there is insufficient free cache memory for servicing the more popular movie from the primary cache, transferring the servicing of a less popular movie from the primary cache to the disk storage in order to free primary cache memory for servicing the more popular movie from the primary cache.

22. The method as claimed in claim 15, which includes freeing primary cache memory by transferring the servicing of a least popular movie in the primary cache from the primary cache to the disk storage so long as no more than a certain number of video streams are being concurrently serviced from the least popular movie in the primary cache.

23. The method as claimed in claim 15, which includes the video file server negotiating with a client for selection of an available movie during peak demand when resources are not available to select freely any movie in the disk storage for which a video stream can be started.

25. The method as claimed in claim 24, which includes the video file server freeing locked cache memory by transferring the servicing of a least popular movie in the cache from the cache to the disk storage so long as no more than a certain number of video streams are being concurrently serviced from the least popular movie in the cache.

26. The method as claimed in claim 24, wherein each of the data mover computers has a local cache, the method includes ranking the movies with respect to popularity, assigning a respective set of the data movers for servicing video streams for each movie ranking, and configuring the data movers in the respective sets of data movers differently for providing more network interface resources for very popular movies and for providing more local cache memory resources for less popular movies.

15. A method of operating a video file server for providing clients with video-on-demand access to movies, the video file server having a cached disk storage system including a primary cache and disk storage containing the movies, and a multiplicity of data mover computers coupled to the cached disk storage system for streaming video data from the cached disk storage system to clients in a data network, each of the data mover computers having a local cache, wherein the method includes:

ranking the movies with respect to popularity, and assigning a respective set of the data movers to each movie ranking, and

servicing video streams for each movie ranking with the respective set of data movers assigned for servicing said video streams for said each movie ranking.

24. A method of operating a video file server for providing clients with video-on-demand access to movies, the video file server having a cached disk storage system including a cache and disk storage containing the movies, and a multiplicity of data mover computers coupled to the cached disk storage system for streaming video data from the cached disk storage system to clients in a client data network, the method comprising:

locking in the cache a plurality of entire movies, and when there is a need for servicing a more popular movie from the cache and there is insufficient free cache memory for servicing the more popular movie from the cache, transferring the servicing of a less popular movie from the cache to the disk storage in order to free cache memory for servicing the more popular movie from the cache.