Video distribution system using dynamic segmenting of video data files

• US 7,143,433 B1
• Filed: 12/27/2000
• Issued: 11/28/2006
• Est. Priority Date: 12/27/2000
• Status: Active Grant

• Current Assignee: InfoValue Computing, Inc.
• Original Assignee: InfoValue Computing, Inc.
• Inventors: Duan, Dah-Weih, Pappu, Aparna, Chen, Monsong, Mukherjee, Bodhi
• Primary Examiner(s): Miller, John
• Assistant Examiner(s): SALTARELLI, DOMINIC D
• Application Number:
  US09/748,304
• Time in Patent Office: 2,162 Days
• Field of Search: 725/91, 725/92, 725/93, 725/114, 725/116, 725/95, 725/115, 709/203, 709/246, 711/114, 711/173, 711/157
• US Class Current: 725/115
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04N 21/23103 using load balancing strategies, e.g. by placing or distributing content on different disks, different memories or different servers storage management G06F3/0604; allocation of resources considering the load in multiprogramming arrangements G06F9/505; techniques for rebalancing the load in a distributed system G06F9/5083; access to distributed or replicated servers, e.g. load balancing, in data networks H04L67/1001
• CPC Class Codes: H04N 21/2312 Data placement on disk arrays data placement in general G06F3/0604
• CPC Class Codes: H04N 21/2343 involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements video transcoding H04N19/40; media packet handling at the source H04L65/762
• CPC Class Codes: H04N 21/632 using a connection between clients on a wide area network, e.g. setting up a peer-to-peer communication via Internet for retrieving video segments from the hard-disk of other client devices broadcast-related systems characterised by transmission among terminal devices H04H60/80; distributed application using peer-to-peer [P2P] networks H04L67/104
• CPC Class Codes: H04N 21/8456 by decomposing the content in the time domain, e.g. in time segments

Abstract

A method and apparatus to dynamically segment video data files or portions of video data files within a video distribution system to facilitate the transfer of the video data files from a file server computing system to client computing system within a video distribution system. The video data files or portions of the video data files are dynamically fragmented as a function of demand for the video data files, size of each video data file of the plurality of video data files, amount of retention space available on each of the plurality of data storage devices, and available bandwidth for communication with the client computing systems.

Claims

1. A method for dynamically segmenting a digital data file resident within at least one digital data storage device of multiple digital data storage devices associated with a first computing system to facilitate transfer of the segmented digital data file from said first computing system to at least one of a plurality of second computing systems, whereby said method comprises the steps of

a) requesting an identifier for said digital data file;

b) requesting a range of locations within the multiple data storage devices where said digital data file is resident;

c) calculating a new segment size list for said digital data file describing a fragmentation of said digital data file as a function of demand for all digital data files resident on said digital data storage devices, size of each digital data file of all digital data files, amount of retention space available on each of the plurality of digital data storage devices, and available bandwidth for communication with the plurality of second computing systems;

d) if said digital data file has been previously segmented, comparing the new segment size list to an existing segment size list;

e) if the existing segment size list provides a more facilitated transfer of said digital data file, transferring said digital data file to the second computing system according to said existing segment size list;

f) if the new segment size list provides a more facilitated transfer of said digital file,

creating a new file identifier for each new segment ascertained by the creating of the new segment size list,

creating a new range of locations for each new segment of the digital data file to identify the location for each new segment, and

storing the digital data file at said locations for each new segment;

g) transferring each new segment of said digital data file to at least one of the second computing systems; and

repeating steps a) through g) at each request for each digital data file.

2. The method of claim 1 wherein calculating the new segment size list comprises the steps of:

determining a number of storage devices attached to said first computing system available to retain a plurality of segments of said digital data file;

determining a maximum digital data transfer load for the storage devices attached to said first computing system;

assigning a minimum segment size which is the smallest amount of digital data to be contained within one segment of the digital data file;

calculating a first segment size as a first function of a number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size;

assigning a last segment size as the minimum segment size;

calculating all remaining segment sizes as a second function of the number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size; and

partitioning said digital data file into segments whereby the first segment of the digital data file is of the first segment size, the last segment of the digital data file is of the last segment size, and all the remaining segments of the digital data file is of the remaining segment sized.

3. The method of claim 2 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

4. The method of claim 2 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

5. The method of claim 2 further comprising the step of:

determining a file interactivity factor describing a number of jumps by the second computing system within the digital data file.

6. The method of claim 5 wherein the first function is further dependent upon the file interactivity factor.

7. The method of claim 6 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file interactivity factor.

8. The method of claim 5 wherein the second function is further dependent upon the file interactivity factor.

9. The method of claim 8 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file Inter activity factor.

10. The method of claim 2 further comprising the step of:

determining a file usage factor describing a number of requests for said digital data file for a period of time.

11. The method of claim 10 wherein the first function is further dependent upon the file usage factor.

12. The method of claim 11 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

13. The method of claim 9 wherein the second function is further dependent upon the file usage factor.

14. The method of claim 13 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

15. The method of claim 2 further comprising the steps of:

determining a file usage factor describing a number of requests for said digital data file for a period of time; and

determining a file interactivity factor describing a number of jumps by the second computing system within the digital data file.

16. The method of claim 15 wherein the first function is further dependent upon the file usage factor and the file interactivity factor.

17. The method of claim 16 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

18. The method of claim 15 wherein the second function is further dependent upon the file usage factor and the file interactivity factor.

19. The method of claim 18 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

20. The method of claim 1 wherein the locations at which the segments of said data file are located are within the multiple storage devices of the first computing system.

21. The method of claim 1 wherein the locations at which the segments of said data file are located are within multiple storage devices of the plurality of the second computing systems.

22. The method of claim 1 wherein the digital data file is a video file to be transferred isochronously to at least one of the second computing systems.

23. A digital data service system in communication with a plurality of computing systems to provide at least one digital data file of a plurality of digital data files to at least one of the plurality of computing systems, comprising:

a plurality of digital data file storage devices in communication with each other and with any of the plurality of computing systems for storing a plurality of dynamically generated segments of said provided data file, said segments stored within said plurality of digital data file storage devices to facilitate transfer of said provided data file to at least one of the plurality of computing systems; and

a segmentation apparatus in communication with the plurality of digital data file storage devices, which, at a request of any of the digital data files, dynamically fragments any requested digital data file into a plurality of segments to facilitate transfer to and processing by at least one of the computing systems of said segments, wherein the segmentation apparatus performs the steps of;

a) requesting an identifier for said digital data file;

b) requesting a range of locations within the multiple data storage devices where said digital data file is resident;

c) calculating the new segment size list for said digital data file describing a fragmentation of said digital data file as a function of demand for all digital data files resident on said digital data storage devices, size of each digital data file of all digital data files, amount of retention space available on each of the plurality of digital data storage devices, and available bandwidth for communication with the plurality of computing systems;

d) if said digital data file has been previously segmented, comparing the new segment size list to an existing segment size list;

e) if the existing segment size list provides a more facilitated transfer of said digital data file, transferring said digital data file to the computing system according to said existing segment size list;

f) if the new segment size list provides a more facilitated transfer of said digital file,

creating a new file identifier for each new segment ascertained by the creating of the new segment size list,

creating a new range of locations for each new segment of the digital data file to identify the location for each new segment, and

storing the digital data file at said locations for each new segment;

g) transferring each new segment of said digital data file to at least one of the computing systems; and

h) repeating steps a) through g) at each request for each digital data file.

24. The system of claim 23 wherein calculating the new segment size list comprises the steps of:

determining a number of storage devices attached to said first computing system available to retain a plurality of segments of said digital data file;

determining a maximum digital data transfer load for the storage devices attached to said first computing system;

assigning a minimum segment size which is the smallest amount of digital data to be contained within one segment of the digital data file;

calculating a first segment size as a first function of a number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size;

assigning a last segment size as the minimum segment size;

calculating all remaining segment sizes as a second function of the number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size; and

partitioning said digital data file into segments whereby the first segment of the digital data file is of the first segment size, the last segment of the digital data file is of the last segment size, and all the remaining segments of the digital data file is of the remaining segment sized.

25. The system of claim 24 wherein the segmentation apparatus the further performs the steps of:

assigning one of the number of storage devices to retain each segment of the digital data file; and

assigning an address within the storage devices to identify the location of an assigned segment.

26. The system of claim 24 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

27. The system of claim 24 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

28. The system of claim 24 further comprising the step of:

determining a file interactivity factor describing a number of jumps by the computing system within the digital data file.

29. The system of claim 28 wherein the first function is further dependent upon the file interactivity factor.

30. The system of claim 29 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file interactivity factor.

31. The system of claim 28 wherein the second function is further dependent upon the file interactivity factor.

32. The system of claim 31 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file Inter activity factor.

33. The system of claim 24 further comprising the step of:

determining a file usage factor describing a number of requests for said digital data file for a period of time.

34. The system of claim 33 wherein the first function is further dependent upon the file usage factor.

35. The system of claim 34 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

36. The system of claim 33 wherein the second function is further dependent upon the file usage factor.

37. The system of claim 36 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

38. The system of claim 24 further comprising the steps of:

determining a file usage factor describing a number of requests for said digital data file for a period of time; and

determining a file interactivity factor describing a number of jumps by the computing system within the digital data file.

39. The system of claim 38 wherein the first function is further dependent upon the file usage factor and the file interactivity factor.

40. The system of claim 39 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

41. The system of claim 38 wherein the second function is further dependent upon the file usage factor and the file interactivity factor.

42. The system of claim 41 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

43. The system of claim 24 wherein the locations at which the segments of said data file are located are within the multiple storage devices of the first computing system.

44. The system of claim 24 wherein the locations at which the segments of said data file are located are within multiple storage devices of the plurality of the computing systems.

45. The system of claim 23 wherein the digital data file is a video file to be transferred isochronously to the computing system.

46. An apparatus for dynamically segmenting a digital data file resident within at least one digital data storage device of multiple digital data storage devices associated with a first computing system to facilitate transfer of the segmented digital data file from said first computing system to at least one of a plurality of second computing systems, whereby said apparatus comprises the steps of

a) means for requesting an identifier for said digital data file;

b) means for requesting a range of locations within the multiple data storage devices where said digital data file is resident;

c) means for calculating a new segment size list for said digital data file describing a fragmentation of said digital data file as a function of demand for all digital data files resident on said digital data storage devices, size of each digital data file of all digital data files, amount of retention space available on each of the plurality of digital data storage devices, and available bandwidth for communication with the plurality of second computing systems;

e) means comparing the new segment size list to an existing segment size list, if said digital data file has been previously segmented;

f) means for transferring said digital data file to the second computing system according to said existing segment size list, if the existing segment size list provides a more facilitated transfer of said digital data file;

g) means for;

creating a new file identifier for each new segment ascertained by the creating of the new segment size list,

creating a new range of locations for each new segment of the digital data file to identify the location for each new segment, and

storing the digital data file at said locations for each new segment,

if the new segment size list provides a more facilitated transfer of said digital file;

h) means for transferring each new segment of said digital data file to at least one of the second computing systems; and

means for executing the means of steps of a) through h) at each request for each digital data file.

47. The apparatus of claim 46 wherein the means for calculating the new segment size list comprises:

means for determining a number of storage devices attached to said first computing system available to retain a plurality of segments of said digital data file;

means for determining a maximum digital data transfer load for the storage devices attached to said first computing system;

means for assigning a minimum segment size which is the smallest amount of digital data to be contained within one segment of the digital data file;

means for calculating a first segment size as a first function of a number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size;

means for assigning a last segment size as the minimum segment size;

means for calculating all remaining segment sizes as a second function of the number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size; and

means for partitioning said digital data file into segments whereby the first segment of the digital data file is of the first segment size, the last segment of the digital data file is of the last segment size, and all the remaining segments of the digital data file is of the remaining segment sized.

48. The apparatus of claim 47 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

49. The apparatus of claim 47 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

50. The apparatus of claim 47 further comprising:

means for determining a file interactivity factor describing a number of jumps by the second computing system within the digital data file.

51. The apparatus of claim 50 wherein the first function is further dependent upon the file interactivity factor.

52. The apparatus of claim 51 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file interactivity factor.

53. The apparatus of claim 50 wherein the second function is further dependent upon the file interactivity factor.

54. The apparatus of claim 53 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file Inter activity factor.

55. The apparatus of claim 47 further comprises:

means for determining a file usage factor describing a number of requests for said digital data file for a period of time.

56. The apparatus of claim 55 wherein the first function is further dependent upon the file usage factor.

57. The apparatus of claim 56 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

58. The apparatus of claim 55 wherein the second function is further dependent upon the file usage factor.

59. The apparatus of claim 58 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

60. The apparatus of claim 47 further comprises:

means for determining a file usage factor describing a number of requests for said digital data file for a period of time; and

means for determining a file interactivity factor describing a number of jumps by the second computing system within the digital data file.

61. The apparatus of claim 60 wherein the first function is further dependent upon the file usage factor and the file interactivity factor.

62. The apparatus of claim 61 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

63. The apparatus of claim 60 wherein the second function is further dependent upon the file usage factor and the file interactivity factor.

64. The apparatus of claim 63 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

65. The apparatus of claim 46 wherein the locations at which the segments of said data file are located are within the multiple storage devices of the first computing system.

66. The apparatus of claim 46 wherein the locations at which the segments of said data file are located are within multiple storage devices of the plurality of the second computing systems.

67. The apparatus of claim 46 wherein the digital data file is a video file to be transferred isochronously to at least one of the second computing systems.

68. A computer readable medium encoded with a computer program to dynamically segment a digital data file resident within at least one digital data storage device of multiple data storage devices associated with a first computing system to facilitate transfer of the segmented digital data file from said first computing system to at least one of a plurality of second computing systems, whereby said computer program performs a method comprising the steps of:

a) requesting an identifier for said digital data file;

b) requesting a range of locations within the multiple data storage devices where said digital data file is resident;

c) calculating a new segment size list for said digital data file describing a fragmentation of said digital data file as a function of demand for all digital data files resident on said digital data storage devices, size of each digital data file of all digital data files, amount of retention space available on each of the plurality of digital data storage devices, and available bandwidth for communication with the plurality of second computing systems;

d) if said digital data file has been previously segmented, comparing the new segment size list to an existing segment size list;

e) if the existing segment size list provides a more facilitated transfer of said digital data file, transferring said digital data file to the second computing system according to said existing segment size list;

f) if the new segment size list provides a more facilitated transfer of said digital file,

creating a new file identifier for each new segment ascertained by the creating of the new segment size list,

creating a new range of locations for each new segment of the digital data file to identify the location for each new segment, and

storing the digital data file at said locations for each new segment;

g) transferring each new segment of said digital data file to at least one of the second computing systems; and

repeating steps a) through g) at each request for each digital data file.

69. The medium of claim 68 wherein calculating the new segment size list comprises the steps of:

determining a number of storage devices attached to said first computing system available to retain a plurality of segments of said digital data file;

determining a maximum digital data transfer load for the storage devices attached to said first computing system;

assigning a minimum segment size which is the smallest amount of digital data to be contained within one segment of the digital data file;

calculating a first segment size as a first function of a number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size;

assigning a last segment size as the minimum segment size;

calculating all remaining segment sizes as a second function of the number of the storage devices, the current digital data transfer load, the maximum digital data transfer load, and the minimum segment size; and

partitioning said digital data file into segments whereby the first segment of the digital data file is of the first segment size, the last segment of the digital data file is of the last segment size, and all the remaining segments of the digital data file is of the remaining segment sized.

70. The medium of claim 69 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

71. The medium of claim 69 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load, and

C_I is the current digital data transfer load.

72. The medium of claim 69 further comprising the step of:

determining a file interactivity factor describing a number of jumps by the second computing system within the digital data file.

73. The medium of claim 72 wherein the first function is further dependent upon the file interactivity factor.

74. The medium of claim 73 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file interactivity factor.

75. The medium of claim 72 wherein the second function is further dependent upon the file interactivity factor.

76. The medium of claim 75 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

I is the file Inter activity factor.

77. The medium of claim 69 further comprising the step of:

determining a file usage factor describing a number of requests for said digital data file for a period of time.

78. The medium of claim 77 wherein the first function is further dependent upon the file usage factor.

79. The medium of claim 78 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

80. The medium of claim 78 wherein the second function is further dependent upon the file usage factor.

81. The medium of claim 80 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load, and

H is the file usage factor.

82. The medium of claim 69 further comprising the steps of:

determining a file usage factor describing a number of requests for said digital data file for a period of time; and

determining a file interactivity factor describing a number of jumps by the second computing system within the digital data file.

83. The medium of claim 82 wherein the first function is further dependent upon the file usage factor and the file interactivity factor.

84. The medium of claim 83 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

85. The medium of claim 82 wherein the second function is further dependent upon the file usage factor and the file interactivity factor.

86. The medium of claim 85 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

87. The medium of claim 68 wherein the locations at which the segments of said data file are located are within the multiple storage devices of the first computing system.

88. The medium of claim 68 wherein the locations at which the segments of said data file are located are within multiple storage devices of the plurality of the second computing systems.

89. The medium of claim 68 wherein the digital data file is a video file to be transferred isochronously to at least one of the second computing systems.

90. A digital video data service system in communication with a plurality of computing systems to provide at least one digital video data file of a plurality of digital video data files to at least one of the plurality of computing systems, comprising:

a plurality of digital video data file storage devices in communication with each other and with any of the plurality of computing systems for storing a plurality of dynamically generated segments of said provided digital video data file, said segments stored within said plurality of digital video data file storage devices to facilitate transfer of said provided digital video data file to at least one of the plurality of computing systems; and

a segmentation apparatus in communication with the plurality of digital video data file storage devices, which, at a request of any of the digital video data files, dynamically fragments any requested digital video data file into a plurality of segments to facilitate transfer to and processing by at least one of the second computing systems of said segments, wherein the segmentation apparatus performs the steps of;

a) requesting an identifier for said digital video data file;

b) requesting a range of locations within the multiple data storage devices where said digital video data file is resident;

c) calculating the new segment size list for said digital video data file describing a fragmentation of said digital video data file as a function of demand for all digital video data files resident on said digital video data storage devices, size of each digital video data file of all digital video data files, amount of retention space available on each of the plurality of digital video data storage devices, and available bandwidth for communication with the plurality of computing systems;

d) if said digital data file has been previously segmented, comparing the new segment size list to an existing segment size list;

e) if the existing segment size list provides a more facilitated transfer of said digital data file, transferring said digital data file to the computing system according to said existing segment size list;

f) if the new segment size list provides a more facilitated transfer of said digital file,

creating a new file identifier for each new segment ascertained by the creating of the new segment size list,

creating a new range of locations for each new segment of the digital data file to identify the location for each new segment, and

storing the digital data file at said locations for each new segment;

g) transferring each new segment of said digital data file to at least one of the computing systems; and

h) repeating steps a) through g) at each request for each digital data file.

91. The system of claim 90 wherein calculating the new segment size list comprises the steps of:

determining a number of storage devices attached to said first computing system available to retain a plurality of segments of said digital video data file;

determining a maximum digital video data transfer load for the storage devices attached to said first computing system;

assigning a minimum segment size which is the smallest amount of digital video data to be contained within one segment of the digital video data file;

calculating a first segment size as a first function of a number of the storage devices, the current digital video data transfer load, the maximum digital video data transfer load, and the minimum segment size;

assigning a last segment size as the minimum segment size;

calculating all remaining segment sizes as a second function of the number of the storage devices, the current digital video data transfer load, the maximum digital video data transfer load, and the minimum segment size; and

partitioning said digital video data file into segments whereby the first segment of the digital video data file is of the first segment size, the last segment of the digital video data file is of the last segment size, and all the remaining segments of the digital video data file is of the remaining segment sized.

92. The system of claim 91 wherein the segmentation apparatus the further performs the steps of:

assigning one of the number of storage devices to retain each segment of the digital video data file; and

assigning an address within the storage devices to identify the location of an assigned segment.

93. The system of claim 91 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital video data file,

M_I is the maximum digital video data transfer load, and

C_I is the current digital video data transfer load.

94. The system of claim 91 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)

where

N_d is the number of storage devices available to retain the segments of the digital video data file,

M_I is the maximum digital video data transfer load, and

C_I is the current digital video data transfer load.

95. The system of claim 91 further comprising the step of:

determining a file interactivity factor describing a number of jumps by the computing system within the digital video data file.

96. The system of claim 95 wherein the first function is further dependent upon the file interactivity factor.

97. The system of claim 96 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital video data file,

M_I is the maximum digital video data transfer load,

C_I is the current digital video data transfer load, and

I is the file interactivity factor.

98. The system of claim 95 wherein the second function is further dependent upon the file interactivity factor.

99. The system of claim 98 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+I

where

N_d is the number of storage devices available to retain the segments of the digital video data file,

M_I is the maximum digital video data transfer load,

C_I is the current digital video data transfer load, and

I is the file Inter activity factor.

100. The system of claim 91 further comprising the step of:

determining a file usage factor describing a number of requests for said digital video data file for a period of time.

101. The system of claim 100 wherein the first function is further dependent upon the file usage factor.

102. The system of claim 101 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital video data file,

M_I is the maximum digital video data transfer load,

C_I is the current digital video data transfer load, and

H is the file usage factor.

103. The system of claim 100 wherein the second function is further dependent upon the file usage factor.

104. The system of claim 103 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H

where

N_d is the number of storage devices available to retain the segments of the digital video data file,

M_I is the maximum digital video data transfer load,

C_I is the current digital video data transfer load, and

H is the file usage factor.

105. The system of claim 91 further comprising the steps of:

determining a file usage factor describing a number of requests for said digital video data file for a period of time; and

determining a file interactivity factor describing a number of jumps by the computing system within the digital video data file.

106. The system of claim 105 wherein the first function is further dependent upon the file usage factor and the file interactivity factor.

107. The system of claim 106 wherein the first function to determine the first segment size is:

Seg1=min(SegSize_min,V/f)

where

Seg1 is the first segment size,

min is the minimum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital video data file,

M_I is the maximum digital video data transfer load,

C_I is the current digital video data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

108. The system of claim 105 wherein the second function is further dependent upon the file usage factor and the file interactivity factor.

109. The system of claim 108 wherein the second function to determine the remaining segment sizes is:

Segn=max(SegSize_min,V/f)

where

Segn is the a segment size for one segment of the remaining segments,

max is the maximum function of two variables,

V is a total size of the digital video data file, and

f is determined by the formula;

f=N_d+(M_I/M_I−

C_I)+H+I

where

N_d is the number of storage devices available to retain the segments of the digital data file,

M_I is the maximum digital data transfer load,

C_I is the current digital data transfer load,

H is the file usage factor, and

I is the file Inter activity factor.

110. The system of claim 91 wherein the locations at which the segments of said data file are located are within the multiple storage devices of the first computing system.

111. The system of claim 91 wherein the locations at which the segments of said data file are located are within multiple storage devices of the plurality of the computing systems.

112. The system of claim 90 wherein the digital video data file is transferred isochronously to the computing system.