Load balancing in video-on-demand servers by allocating buffer to streams with successively larger buffer requirements until the buffer requirements of a stream can not be satisfied

Claim 1

A method of managing memory buffer in a video server, wherein a plurality of clients are served from video streams provided from disks, comprising the steps of: determining buffer requirements of a plurality of the video streams, the buffer requirements being a number of frames separating each video stream from an immediately previous video stream carrying the same video; creating a list of streams being served from each of the disks, ordered by the buffer requirement of each of the streams; determining when to balance the load across the disks; allocating the buffer to the streams on a most heavily loaded one of the disks so as to serve the streams from the buffer, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied; and retaining blocks of the immediately preceding stream in the buffer allocated to its following stream and discarding the blocks from the buffer as they are read by a client viewing the following stream; updating the list when any of starting, stopping, pausing and resuming of a video occurs; and responsive to the updating, identifying the most heavily loaded one of the disks after the updating and reallocating the buffer to the streams being served from the most heavily loaded disk, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied.

Claim 2

A method of managing memory buffer in a video server, wherein a plurality of clients are served from video streams provided from disks, comprising the steps of: determining buffer requirements of a plurality of the video streams, the buffer requirements being a number of frames separating each video stream from an immediately previous video stream carrying the same video; creating a list of streams being served from each of the disks, ordered by the buffer requirement of each of the streams; determining when to balance the load across the disks; allocating the buffer to the streams on a most heavily loaded one of the disks so as to serve the streams from the buffer, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied; and retaining blocks of the immediately preceding stream in the buffer allocated to its following stream and discarding the blocks from the buffer as they are read by a client viewing the following stream; updating the list when any of starting, stopping, pausing and resuming of a video occurs; and responsive to the updating, identifying the most heavily loaded one of the disks after the updating and reallocating the buffer to the streams being served from the most heavily loaded disk, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied.

Claim 3

A method of managing memory buffer in a video server, wherein a plurality of clients are served from video streams provided from storage elements, comprising the steps of: determining buffer requirements of a plurality of the video streams, the buffer requirements being a number of frames separating each video stream from an immediately previous video stream carrying the same video; creating a list of streams being served from each of the storage elements, ordered by the buffer requirement of each of the streams; allocating the buffer to the streams on a most heavily loaded one of the storage elements so as to serve the streams from the buffer, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied; retaining blocks of the immediately preceding stream in the buffer allocated to its following stream and discarding the blocks from the buffer as they are read by a client viewing the following stream; updating the list when any of starting, stopping, pausing and resuming of a video occurs; responsive to the updating, identifying the most heavily loaded one of the storage elements after the updating and reallocating the buffer to the streams being served from the most heavily loaded storage element, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied.

Claim 4

A method of managing memory buffer in a video server, wherein a plurality of clients are served from video streams provided from storage elements, comprising the steps of: determining buffer requirements of a plurality of the video streams, the buffer requirements being a number of frames separating each video stream from an immediately previous video stream carrying the same video; creating a list of streams being served from each of the storage elements, ordered by the buffer requirement of each of the streams; allocating the buffer to the streams on a most heavily loaded one of the storage elements so as to serve the streams from the buffer, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied; retaining blocks of the immediately preceding stream in the buffer allocated to its following stream and discarding the blocks from the buffer as they are read by a client viewing the following stream; updating the list when any of starting, stopping, pausing and resuming of a video occurs; responsive to the updating, identifying the most heavily loaded one of the storage elements after the updating and reallocating the buffer to the streams being served from the most heavily loaded storage element, starting from a stream with a smallest buffer requirement and proceeding to streams with larger buffer requirements until the buffer requirement of a stream can not be satisfied.