US 6,449,688 B1Grant

Computer system and process for transferring streams of data between multiple storage units and multiple applications in a scalable and reliable manner

Issue Date:2002-09-10

•22 Claims

•23 Drawing Sheets

Abstract

Multiple applications request data from multiple storage units over a computer network. The data is divided into segments and each segment is distributed randomly on one of several storage units, independent of the storage units on which other segments of the media data are stored. Redundancy information corresponding to each segment also is distributed randomly over the storage units. The redundancy information for a segment may be a copy of the segment, such that each segment is stored on at least two storage units. The redundancy information also may be based on two or more segments. This random distribution of segments of data and corresponding redundancy information improves both scalability and reliability. When a storage unit fails, its load is distributed evenly over to remaining storage units and its lost data may be recovered because of the redundancy information. When an application requests a selected segment of data, the request may be processed by the storage unit with the shortest queue of requests. Random fluctuations in the load applied by multiple applications on multiple storage units are balanced nearly equally over all of the storage units. Small data files also may be stored on storage units that combine small files into larger segments of data using a log structured file system. This combination of techniques results in a system which can transfer both multiple, independent high-bandwidth streams of data and small data files in a scalable manner in both directions between multiple applications and multiple storage units.

Metadata

Assignee

Avid Technology, Inc.

Inventors

Eric C. Peters
Stanley Rabinowitz
Herbert R. Jacobs

Application Information

Application Number:US 09/724,327

Filing Date:2000-11-28

Priority Date:1997-12-24

Art Unit:7

Classifications

IPC:

G06F 1200G06F 13372

Field of Search:

711170711100711 4711112711114709106709104709105709225709226709230709231709232709233725 92725 93725 97

Patent Drawings (23 sheets)

Description

[0002] This application claims the benefit under 35 U.S.C. §120, and is a continuing application of U.S. patent application Ser. No. 09/549,841, filed Apr. 14, 2000, now abandoned, and of U.S. patent application Ser. No. 09/054,761, filed on Apr. 3, 1998, now U.S. Pat. No. 6,374,336, and U.S. patent application Ser. No. 09/006,070, filed Jan. 12, 1998, pending, which claims the benefit under 35 U.S.C. §120, and is a continuing application of U.S. patent application Ser. No. 08/997,769, filed Dec. 24, 1997, abandoned.

Background

[0003] There are several computer system architectures which support distributed use of data over computer networks. These computer system architectures are used in applications such as corporate intranets, Internet sites, distributed database applications and video-on-demand services.

[0004] Video-on-demand services, for example, typically are designed with an assumption that a user requests an entire movie, and that the selected movie has a substantial length. The video-on-demand server therefore is designed to support read-only access by several subscribers to the same movie, possibly at different times. Such servers generally divide data into several segments and distribute the segments sequentially over several computers or computer disks. This technique commonly is called striping, and is described, for example, in U.S. Pat. Nos. 5,473,362, 5,583,868 and 5,610,841. One problem with striping data for movies over several disks is that failure of one disk or server can result in the loss of all movies, because every movie has at least one segment written on every disk.

[0005] A common technique for providing reliability in data storage is called mirroring. A hybrid system using mirroring and sequential striping is shown in U.S. Pat. No. 5,559,764 (Chen et al.). Mirroring involves maintaining two copies of each storage unit, i.e., having a primary storage and secondary backup storage for all data. Both copies also may be used for load distribution. Using this technique however, a failure of the primary storage causes its entire load to be placed on the secondary backup storage.

[0006] Another problem with sequentially striping data over several disks is the increased likelihood of what is called a “convoy effect.” A convoy effect occurs because requests for data segments from a file tend to group together at a disk and then cycle from one disk to the next (a “convoy”). As a result, one disk may be particularly burdened with requests at the one time while other disks have a light load. Any new requests to a disk also must wait for the convoy to be processed, thus resulting in increased latency for new requests. To overcome the convoy effect, data may be striped in a random fashion, i.e., segments of a data file is stored in a random order among the disks rather than sequentially. Such a system is described in “Design and Performance Tradeoffs in Clustered Video Servers,” by R. Tewari, et. al., in Proceedings of Multimedia '96, pp. 144-150. See also, “High Availability in Clustered Multimedia Servers,” by R. Tewari, et al., Proceedings of the IEEE Intern. Conf. On Data Engineering,February 1996. Such a system still may experience random, extreme loads on one disk. however, due to the generally random nature of data accesses.

[0007] None of these systems is individually capable of transferring multiple, independent, high bandwidth streams of data, particularly isochronous media data such as video and associated audio data, between multiple storage units and multiple applications in a scalable and reliable manner. Such data transfer requirements are particularly difficult in systems supporting capture, authoring and playback of multimedia data. In an authoring system in particular, data typically is accessed in small fragments, called clips, of larger data files. These clips tend to be accessed in an arbitrary or random order with respect to how the data is stored. making efficient data transfer difficult to achieve.

[0008] It also is common to use one server for high bandwidth data, such as video, and another different server for low bandwidth data, such as text. The problems associated with video or other high bandwidth data typically involve solutions that are considered too complex for other data such as text.

Summary

[0009] Data is randomly distributed on multiple storage units connected with multiple applications using a computer network. The data is divided into segments. Each segment is stored on one of the storage units. Redundancy information based on one or more segments also is stored on a different storage unit than the segments on which it is based. The redundancy information may be a copy of each segment or may be computed by an exclusive-or operation performed on two or more segments. The selection of each storage unit on which a segment or redundancy information is stored is random or pseudorandom and may be independent of the storage units on which other segments of the data are stored. Where redundancy information is based on two or more segments, each of the segments is stored on a different storage unit.

[0010] This random distribution of segments of data improves both scalability and reliability. For example, because the data is processed by accessing segments, data fragments or clips also are processed as efficiently as all of the data. The applications may request data transfer from a storage unit only when that transfer would be efficient and may request storage units to preprocess read requests. Bandwidth utilization on a computer network may be optimized by scheduling data transfers among the clients and storage units. If one of the storage units fails, its load also is distributed randomly and nearly uniformly over the remaining storage units. Procedures for recovering from failure of a storage unit also may be provided.

[0011] The storage units and applications also may operate independently and without central control. For example, each client may use only local information to schedule communication with a storage unit. Storage units and applications therefore may be added to or removed from the system. As a result, the system is expandable during operation.

[0012] When the redundancy information is a copy of one segment, system performance may be improved, although at the expense of increased storage. For example, when an application requests a selected segment of data, the request may be processed by the storage unit with the shortest queue of requests so that random fluctuations in the load applied by multiple applications on multiple storage units are balanced statistically and more equally over all of the storage units. Also, an application may send two requests to randomly selected servers. When one request is accepted by one of the selected servers, the other request to the other selected server is canceled. Both of these ways for requesting data enable transactions among multiple clients and multiple servers without using a centralized queue.

[0013] This combination of techniques results in a system which can transfer multiple, independent high-bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner.

[0014] These techniques also may be used to support all kinds of streams of data, for example, the system maybe used as a file system for supporting database servers and for supporting intranet and Internet applications with small files, such as single images and/or text. In particular, smaller files may be supported by using a log-structured file system that combines small files into larger segments of data for storage on a server. Each server maintains and accesses a log for read/write recovery and archiving operations of small files.

[0015] Accordingly, in one aspect, a distributed data storage system includes a plurality of storage units for storing data, wherein segments of data stored on the storage units are randomly distributed among the plurality of storage units. Redundancy information corresponding to each segment also is randomly distributed among the storage units.

[0016] When the redundancy information is a copy of one segment, each copy of each segment may be stored on a different one of the storage units. Each copy of each segment may be assigned to one of the plurality of storage units according to a probability distribution defined as a function of relative specifications of the storage units. The distributed data storage system may include a computer-readable medium having computer-readable logic stored thereon and defining a segment table accessible by a computer using an indication of a segment of data to retrieve indications of the storage units from the plurality of storage units on which the copies of the segment are stored. The plurality of storage units may include first, second and third storage units connected to a computer network.

[0017] In another aspect, a file system for a computer enables the computer to access remote independent storage units over a computer network in response to a request, from an application executed on the computer, to read data stored on the storage units. Segments of the data and redundancy information are randomly distributed among the plurality of storage units. Where the redundancy information is a copy of a segment, the file system is responsive to the request to read data, to select, for each segment of the selected data, one of the storage units on which the segment is stored. The file system may reconstruct a lost segment from other segments and the redundancy information. Each segment of the requested data is read from the selected storage unit for the segment. The data is provided to the application when the data is received from the selected storage units. In this file system, the storage unit may be selected such that a load of requests on the plurality of storage units is substantially balanced. The storage unit for the segment may be selected according to an estimate of which storage unit for the segment has a shortest estimated time for servicing the request.

[0018] More particularly, the file system may request data from one of the storage units, indicating an estimated time. If the first storage unit rejects the request, the file system may request data from another of the storage units, indicating another estimated time. The file system requests the data from the first storage unit when the second storage unit rejects the request. Each storage unit rejects a request for data when the request cannot be serviced by the storage unit within the estimated time. The storage unit accepts a request for data when the request can be serviced by the storage unit within the estimated time.

[0019] The file system may read each segment by scheduling the transfer of the data from the selected storage unit such that the storage unit efficiently transfers data. More particularly, the file system may request transfer of the data from the selected storage unit, indicating a waiting time. The data may be requested from another storage unit when the selected storage unit rejects the request to transfer the data, or the file system may request the data from the same storage unit at a later time. Each storage unit rejects a request to transfer data when the data is not available to be transferred from the storage unit within the indicated waiting time. The storage unit transfers the data when the selected storage unit is able to transfer the data within the indicated waiting time.

[0020] In another aspect, a file system for a computer enables the computer to access remote independent storage units over a computer network in response to a request, from an application executed on the computer, to store data on the storage units. The file system is responsive to the request to store the data to divide the data into a plurality of segments. Each segment is randomly distributed among the plurality of storage units along with redundancy information based on one or more segments. The file system confirms to the application whether the data is stored.

[0021] In this file system, when the redundancy information is a copy of the segment, the random distribution of data may be accomplished by selecting, for each segment, at least two of the storage units at random and independent of the storage units selected for other segments. The selected storage units may be requested to store the data for each segment. The file system may select a subset of the storage units, and may selecting the storage units for storing the segment from among the storage units in the selected subset.

[0022] The functionality of the file system also may be provided by another application or through a code library accessible through an application programming interface. Accordingly, another aspect is the client or the process implemented thereby to perform read or write functions, including selection of a storage unit and scheduling of network transfer. Another aspect is the storage units or the process implemented thereby to perform read or write functions, including selection of a storage unit and scheduling of network transfer. Another aspect is a distributed computer system implementing such functionality. These operations may be performed by a client or a storage unit using only local information to enable a system to be readily expandable.

[0023] In another aspect, data is recovered in a distributed data storage system having a plurality of storage units for storing the data, wherein segments of the data and redundancy information stored on the storage units are randomly distributed among the plurality of storage units, when failure of one of the storage units is detected. To recover the data, segments of which copies were stored on the failed storage unit are identified. The storage units on which the redundancy information corresponding to the identified segments was stored are identified. The redundancy information is used to reconstruct a copy of the identified segments, which are then randomly distributed among the plurality of storage units. Such data recovery may be used in combination with the read and write functionality of a file system or distributed storage system described herein.

[0024] In another aspect, streams of video data are combined to produce composited video data which is stored in a distributed system comprising a plurality of storage units for storing video data, wherein copies of segments of the video data stored on the storage units are randomly distributed among the plurality of storage units. The streams of video data are read from the plurality of storage units. These streams of video data are combined to produce the composited video data. The composited video data is divided into segments. Copies of the segments of the composited video data are randomly distributed among the plurality of storage units. The reading and storage of data may be performed using the techniques described herein.

Brief Description of the Drawings

[0025] In the drawings,

[0026] FIG. 1A is a block diagram of an example computer system;

[0027] FIG. 1B is a block diagram of another embodiment of the system of FIG. 1A;

[0028] FIG. 2A illustrates a data structure mapping segments of data to storage units 42 in FIG. 1A;

[0029] FIG. 2B illustrates a data structure mapping segments of data storage units 42 in FIG. 1B;

[0030] FIG. 3 is a flowchart describing how data may be captured and distributed among several storage units in one embodiment;

[0031] FIG. 4 is a flowchart describing how storage units may process requests for storing data in one embodiment;

[0032] FIG. 5 is a flowchart describing how fault recovery may be performed when a storage unit becomes unavailable;

[0033] FIG. 6 is a flowchart describing how an additional copy of data may be made;

[0034] FIG. 7 is a flowchart describing how a copy of data may be deleted;

[0035] FIG. 8 is a flowchart describing how a storage unit may be removed from the system;

[0036] FIG. 9 is a flowchart describing how data may be archived or copied as a backup;

[0037] FIG. 10 is state diagram of a process on a storage unit for notifying a catalog manager of availability of the storage unit;

[0038] FIG. 11 illustrates a list of storage units which may be maintained by a catalog manager;

[0039] FIG. 12 is a state diagram illustrating how the catalog manager may monitor a storage unit;

[0040] FIG. 13 illustrates a table for tracking equivalency of media data files;

[0041] FIG. 14 illustrates a list structure for representing a motion video sequence of several clips;

[0042] FIG. 15 illustrates a structure of buffer memories for supporting playback of two streams of motion video data and four streams of associated audio data at a client;

[0043] FIG. 16 is a flowchart describing how a client may process a multimedia composition into requests for data from a selected storage unit;

[0044] FIG. 17 is a flowchart describing how a client requests a storage unit to transfer data from primary storage into a buffer in one embodiment:

[0045] FIG. 18 is a flowchart describing how a storage unit replies to requests from a client in FIG. 17;

[0046] FIG. 19 illustrates example disk queues, for prioritizing requests for disk access to data, and network queues, for prioritizing requests for network transfers of data;

[0047] FIG. 20 is a flowchart describing how a client requests a storage unit to transfer data over the network in one embodiment;

[0048] FIG. 21 is a flowchart describing how a storage unit processes requests to transfer data from multiple clients in one embodiment;

[0049] FIG. 22 is a flow chart describing an embodiment of a network scheduling process performed by a client for transferring data from the client to a storage unit;

[0050] FIG. 23 is a flow chart describing an embodiment of a network scheduling process performed by a storage unit for transferring data from a client to the storage unit;

[0051] FIG. 24 is a flow chart describing how data may be captured and distributed among several storage units in another embodiment; and

[0052] FIG. 25 is a flow chart describing how fault recovery may be performed when a storage unit becomes unavailable in another embodiment.

Detailed Description

[0053] In the following detailed description, which should be read in conjunction with the attached drawings, example embodiments of the invention are set forth. All references cited herein are hereby expressly incorporated by reference.

[0054] Several problems arise in the design of a scalable and reliable distributed system which supports transfer of data, particularly multiple, independent streams of high-bandwidth, time-sensitive data such as motion video and associated audio and other temporally continuous media, between multiple applications and multiple storage units. Some of these problems also arise for file systems supporting database servers and intranet or other computer network, including Internet, applications that typically use many small files. In such a system, an application, for example which is used to author a motion video program, may access randomly several small portions of several different files which may be distributed over several storage units. Several applications may require immediate and simultaneous access to the same data, and any application should be able to access any piece of media at any time. In a system which is used for broadcasting or other time sensitive playback, fault tolerance also is desirable. Finally, the system should be both expandable and scalable in a manner which simplifies the addition of new storage units and new applications even while the system is in operation. Other desirable characteristics of such a system include a long mean time to failure, no single point of failure, the capability of being repaired rapidly and while operating, tolerance to storage unit failure without disrupting operation, and the capability of recovering lost data.

[0055] In one embodiment, the system includes multiple applications connected by a computer network to multiple separate and independent storage units for storing data. The data is divided into segments. Redundancy information for each segment is determined and the segment and its redundancy information are stored on a different one of the storage units. The selection of a storage unit for a segment is random or pseudorandom and may be independent of the storage units selected for other segments, such as the immediately preceding segment. The redundancy information and random distribution of data both increases the ability of the system to efficiently transfer data in both directions between applications and storage and improves fault tolerance.

[0056] The redundancy information may be a copy of a segment. This replication of segments allows the system to further control which storage unit is accessed by a particular application, such as by selecting the storage unit with the shortest queue of requests. As a result, random fluctuations in load are distributed approximately evenly over all of the storage units.

[0057] Applications also may request data transfer with a storage unit only when the transfer would be efficient. By scheduling communication over the network appropriately, network congestion also may be reduced and network bandwidth may be used more efficiently. Central control points may be eliminated by having each client use local information to schedule communication with a storage unit.

[0058] FIG. 1A illustrates an example computer system 40. The computer system includes a plurality of storage units 42. A storage unit is a device with a nonvolatile computer-readable medium, such as a disk, on which data may be stored. The storage unit also has faster, typically volatile, memory into which data is read from the medium. Each storage unit also has its own independent controller which responds to requests for access, including but not limited to read and write access, to data stored on the medium. For example, the storage unit 42 may be a server computer which stores data in a data file in the file system of the server. There may be an arbitrary number of storage units in the computer system 40.

[0059] Applications 44 are systems that request access to the storage units 42 via requests to the storage units over a computer network 46. The storage units 42 may deliver data to or receive data from the applications 44 over the computer network 46. Applications 44 may include systems which capture data received from a digital or analog source for storing the data on the storage units 42. Applications 44 also may include systems which read data from the storage units, such as systems for authoring, processing or playback of multimedia programs. Other applications 44 may perform a variety of fault recovery tasks. Applications 44 also may be called “clients.” One or more catalog managers 49 also may be used. A catalog manager is a database, accessible by the applications 44, that maintains information about the data available on the storage units 42. This embodiment may be used to implement a broadcast news system such as shown in PCT Publication WO97/39411, dated Oct. 23, 1997.

[0060] Data to be stored on the storage units 42 is divided into segments. Redundancy information is created based on one or more segments. For example, each segment may be copied. As a result, each segment is stored on at least two of the storage units 42. Alternatively, the redundancy information may be created by the exclusive-or of two or more segments. Each segment is stored on a different one of the storage units 42 from its redundancy information. The selection of the storage units on which a segment and its redundancy information are stored is random or pseudorandom and may be independent of the storage units on which other segments of the data are stored. Pseudorandom sequences that are poor, i.e., that fail most tests of randomness, may be used. Quasi-random or other deterministic sequences also maybe used. Any sequence that provides a non-sequential distribution may be used where the pattern of distribution is different from one file to the next and from the file to its redundancy information.

[0061] In one embodiment, two consecutive segments are not stored on the same storage unit. The probability distribution for selecting a storage unit for storing a segment and its redundancy information may be uniform over all of the storage units where the specifications, such as capacity, bandwidth and latency, of the storage units are similar. This probability distribution also may be a function of the specifications of each storage unit. The number of copies stored may vary from file to file, and from segment to segment within a file. For example, the number of copies of a segment may vary according to the kind of information in the segment or according to information about locality of access of data in file. For example, header information of a file may be copied more than other parts of the file. The random distribution of segments of data and corresponding redundancy information improves both scalability and reliability.

[0062] An example of the random distribution of copies of segments of data is shown in FIG. 1A. In FIG. 1A, four storage units 42, labeled w, x, y and z, store data which is divided into four segments labeled 1, 2, 3 and 4. An example random distribution of the segments and their copies is shown, where: segments 1 and 3 are stored on storage unit w; segments 3 and 2 are stored on storage unit x; segments 4 and 1 are stored on storage unit y; and segments 2 and 4 are stored on storage unit z.

[0063] FIG. 1B illustrates an embodiment where a segment and its corresponding redundancy information are randomly distributed among the storage units. In FIG. 1B, four storage units 42, labeled w, x, y and z, store data which is divided into four segments labeled 1, 2, 3 and 4. The redundancy information for a segment may be based on one or more segments. In this example, two segments are used in what is called herein a “redundancy set.” The exclusive-or of the segments i,j in the redundancy set is computed, thus providing redundancy information R_i,j. The exclusive-or of the redundancy information R_i,jand segment i produces segment j. Similarly, the exclusive-or of redundancy information R_i,jand segment j produces segment i. Each segment in a redundancy set and the redundancy information are stored on different storage units. This approach for redundancy reduces storage requirements and is used primarily for archived data. An example random distribution of segments and the redundancy information is shown in FIG. 1B, where: redundancy information R_3,4for segments 3 and 4 is stored on storage unit w; segments 2 and 3 are stored on storage unit x; segment 1 is stored on storage unit y; and segment 4 and redundancy information R_1,2are stored on storage unit z. The redundancy information also may be created using many other techniques known in the art of fault tolerance.

[0064] When the redundancy information is a copy of a segment, the random distribution of segments may be represented in and tracked by a segment table 90, or catalog, such as shown in FIG. 2A. In particular, for data captured from a given source or for data from a given file, each segment, represented by a row 92A, has two copies, called A and B, which are represented by columns 94A. The columns 94A in the segment table 90A may be referred herein to as the “A list” or “B list,” respectively. Each list alternatively may be represented by a seed number for a pseudorandom number generator that is used to generate the list, or by a list or other suitable data structure such as a record, linked list, array, tree, table, etc. When using a pseudorandom number generator, care should be taken to ensure that the storage units indicated by the numbers for any given segment in the A and B lists are not the same. The contents of columns 94A indicate the storage unit on which a copy of a segment is stored.

[0065] The random distribution of segments and redundancy information based on two or more segments may be represented in and tracked by a segment table 90B, or a catalog, such as shown in FIG. 2B. In particular, for data captured from a given source or for data from a given file, each segment, represented by a row 92B, has a copy called A, represented in column 94B. Column 96B may be used to indicate where the corresponding redundancy information is stored. There are several ways to indicate where the redundancy information is stored. If the redundancy segments are identified as such in the table, then the order of the segments in the table may be used to infer which segments correspond to a given redundancy segment. In this case column 96B may be omitted. For example, the redundancy information may be treated as another segment, having its own row 92B in the segment table 90B. Alternatively, the column 96B may indicate the last segment in the redundancy set in which the segment is contained. In this embodiment, row 92B of the last segment of a redundancy set indicates a storage unit on which the redundancy information for that redundancy set is stored. In the implementation shown in FIG. 2B, column 96B indicates the segments within the redundancy set for the redundancy information.

[0066] Each segment table, or file map, may be stored separately from other segment tables. Segment tables may be stored together, as a catalog. Catalogs may be stored on a catalog manager 49, at individual clients, at a central database. or may be distributed among several databases or clients. Separate catalogs could be maintained, for example, for different types of media programs. For example, a broadcast news organization may have separate catalogs for sports news, weather, headline news, etc. The catalogs also may be stored on the storage units in the same manner as other data. For example, each client may use a seed for a random number generator to access the catalog. Such catalogs may be identified by other clients to access data or to handle recovery requests, for example, by sending a network broadcast message to all catalog managers or clients to obtain a copy of the catalog or of an individual segment table.

[0067] In order to access the segments of data, each segment should have a unique identifier. The copies of the segments may have the same unique identifier. Redundancy information based on two or more segments has its own identifier. The unique identifier for a segment is a combination of a unique identifier for the source, such as a file, and a segment number. The unique identifier for the source or file may be determined, for example, by a system time or other unique identifier determined when data is captured from the source or at the time of creation of the file. A file system, as described below, may access the catalog manager to obtain the segment table for each source or file which lists the segment identifiers and the storage units on which the segments and redundancy information are stored. Each storage unit also may have a separate file system which contains a directory of the segment identifiers and the location on that storage unit where they are stored. Application programs executed by a client may use the identifiers of a source or file, and possibly a range of bytes within the source or file to request data from the file system of the client. The file system of the client then may locate the segment table for the source or file, determine which segments need to be accessed and select a storage unit from which the data should be read for each segment, using the unique segment identifiers.

[0068] Referring again to FIGS. 1A and 1B, when an application 44 requests access to a selected segment of data on one of the storage units 42, the storage unit places the request on a queue 48 that is maintained for the storage unit. Applications may make such requests independently of each other or any centralized control, which makes the system more readily scalable. Where the redundancy information is a copy of a segment, the selection of a storage unit to which a request is sent may be controlled such that random fluctuations in the load applied by multiple applications 44 on multiple storage units 42 are balanced statistically and more equally over all of the storage units 42. For example, each request from an application 44 may be processed by the storage unit that has the shortest queue of requests. With any kind of redundancy information, the transfer of data between applications and storage units may be scheduled to reduce network congestion. The requests for data may be performed in two steps: a pre-read request which transfers the data from disk to a buffer on the storage unit, and a network transfer request which transfers data over the network from the buffer to the application. To process these two different requests, the queue 48 may include a disk queue and a network queue.

[0069] This combination of randomly distributed segments of data and corresponding redundancy information and the scheduling of data transfer over the network provides a system which can transfer multiple, independent high-bandwidth streams of data in both directions between multiple storage units and multiple applications in a scalable and reliable manner. Using copies of segments as redundancy information, the selection of a storage unit for read access may be based on the relative loads of the storage units, and performance may be improved.

[0070] Referring now to FIG. 3, an example process for storing multiple copies of segments of data in a randomly distributed manner over the several storage units will now be described in more detail. An example process using redundancy information based on two or more segments is described below in connection with FIG. 24. The following description is based on the real-time capture of motion video data. The example may be generalized to other forms of data, including, but not limited to other temporally continuous media, such as audio, or discrete media such as still images or text, or even other data such as sensory data.

[0071] It is generally well-known how to capture real-time motion video information into a computer data file, such as described in U.S. Pat. Nos. 5,640,601 and 5,577,190. This procedure may be modified to include steps for dividing the captured data into segments, and copying and randomly distributing the copies of the segments among the storage units. First. in step 120, the capturing system creates a segment table 90A (FIG. 2A). An image index, that maps each image to an offset into the stream of data to be captured, also typically is created. The indexed images may correspond to, for example, fields or frames. The index may refer to other sample boundaries, such as a period of time, for other kinds of data, such as audio. The capturing system also obtains a list of available storage units. One way to identify which storage units are available is described in more detail below in connection with FIGS. 10-12.

[0072] A segment of the data is created by the capturing system in step 121. The size of the segment may be, for example, one quarter, one half or one megabyte for motion video information. Audio information may be divided into, for example, segments having a size such as one-quarter megabyte. In order to provide alignment, if possible, of the segment size to divisions of storage and transmission. the size of the segment may be related, i.e., an integer multiple of, to an uncompressed or fixed data rate, disk block and track size, memory buffer size, and network packet (e.g., 64K) and/or cell sizes (e.g., 53 bytes for ATM). If the data is uncompressed or is compressed using fixed-rate compression, the segment may be divided at temporal sample boundaries which provides alignment between the image index and the segment table. Generally speaking, the segment size should be driven to be larger in order to reduce system overhead, which is increased by smaller segments. On the other hand, there is an increased probability that a convoy effect could occur if the amount of data to be stored and segment size are such that the data is not distributed over all of the storage units. Additionally, there is an increased latency to complete both disk requests and network requests when the segment sizes are larger.

[0073] Next, at least two of the storage units 42 are selected, in step 122, by the capturing system from the list of storage units available for storing the selected segment. Selection of the storage units for the copies of one segment is random or pseudorandom. This selection may be independent of the selection made for a previous or subsequent segment. The set of storage units from which the selection is made also may be a subset of all of the available storage units. The selection of a set of storage units may be random or pseudorandom for each source or file. The size of this subset should be such that each storage unit has at least two different segments of the data in order to minimize the likelihood of occurrence of a convoy effect. More particularly, the data should be at least twice as long (in segments) as the number of storage units in the set. The size of the subset also should be limited to reduce the probability that two or more storage units in the subset fail, i.e., a double fault may occur, at any given time. For example, the probability that two storage units out of five could fail is less than the probability that two storage units out of one hundred could fail, so the number of storage units over which data is distributed should be limited. However, there is a trade off between performance and subset size. For example, using randomly selected subsets of ten out of one-hundred storage units, when two of the one-hundred storage units fail, then ten percent of the files are adversely affected. Without subsets, one hundred percent of the files typically would be adversely affected.

[0074] In the rare likelihood of a double fault, i.e., where two or more storage units fail, a segment of data may be lost. In a standard video stream, the loss of a segment might result in a loss of one or two frames in a minute of program material. The frequency of such a fault for a given source or file is a function of its bandwidth and the number of storage units. In particular, where:

[0075] s=size of lost data in megabytes (MB),

[0076] n=initial number of storage units,

[0077] b=average bandwidth of storage units in MB per second,

[0078] MTBF=mean time between failures,

[0079] MTTR=mean time to repair or replace,

[0080] MTDF=mean time for a double fault failure, and

[0081] SMTBF=total system mean time between failures,

SMTBF = \frac{MTBF}{n}, and MTDF = \frac{1}{MTTR} * \frac{MTBF}{n} * \frac{MTBF}{(n - 1)} .

[0082] As an example, in a system with 100 storage units, each with a capacity of 50 gigabytes, where MTTR is one hour and MTBF is 1000 hours or six weeks, there likely will be 115 years to double fault failure. If the MTTR is increased to twenty-four hours, then there likely will be 4.8 years to double fault failure.

[0083] Referring again to FIG. 3, after two storage units are selected, the current segment then is sent to each of the selected storage units in step 124 for storage. These write requests may be asynchronous rather than sequential. The capture system then may wait for all storage units to acknowledge completion of the storage of the segment in the step 126. When data is stored in real time while being captured, the data transfer in step 124 may occur in two steps, similar to read operations discussed in more detail below. In particular, the client first may request a storage unit to prepare a free buffer for storing the data. The storage unit may reply with an estimated time for availability of the buffer. When that estimated time is reached, the capture system may request the storage unit to receive the data. The storage unit then may receive the data in its buffer, then transfer the data in its buffer to its storage medium and send an acknowledgment to the capture system.

[0084] If a time out occurs before an acknowledgment is received by the capturing system, the segment may be sent again either to the same storage unit or to a different storage unit. Other errors also may be handled by the capturing system. The operations which ensure successful storage of the data on the selected units may be performed by a separate thread for each copy of the segment.

[0085] After the data is successfully stored on the storage units, the segment table 90 is updated by the capturing system in step 127. If capture is complete, as determined in step 128, then the process terminates; otherwise, the process is repeated for the next segment by returning to step 121. The segment table may be maintained, e.g., in main memory, at the capture system as part of the file system. While the capturing system manages the segment table and selection of storage units in this example, other parts of the system could coordinate these activities as well, such as the catalog manager 49. The updated segment table may be sent to, for example, the catalog manager in step 129. Alternatively, the catalog manager may produce the segment table by using accumulated knowledge of system operation, and may send this table to the capture system on request.

[0086] FIG. 4 is a flowchart describing in more detail how a storage unit stores a segment of the captured data or redundancy information. The storage unit receives the segment of data from a capturing system in step 140 and stores the data in a buffer at the storage unit. Assuming the storage unit uses data files for storage, the storage unit opens a data file in step 142 and stores the data in the data file in step 144. The catalog manager may specify the location where the segment should be stored. The data may be appended to an existing data file or may be stored in a separate data file. As discussed above, the storage unit or the catalog manager may keep track of segments by using a unique identifier for each segment and by storing a table mapping the segment identifier to its location on the storage unit, in step 145. This table may implement the data file abstraction on the storage unit. When the storage unit actually writes data to its main storage may depend on other read and write requests pending for other applications. The management of these concurrent requests is addressed in more detail below. The file then may be closed in step 146. An acknowledgment may be sent to the capturing system in step 148.

[0087] When the process of FIGS. 3 and 4 is complete, the captured data is randomly distributed, with at least two copies for each segment, over several storage units. Multiple applications may request access to this data. The manner in which this access occurs is likely to be random. Accordingly, it should be apparent that any storage unit may receive multiple requests for both reading data from and writing data to files stored on the storage unit from multiple applications. In order to manage the requests, a queue 48 of requests is maintained by each of the storage units 42, as mentioned above. In the following description of an example embodiment, a storage unit maintains two queues: one for requests for disk access, and another for requests for network transfers. One embodiment of these disk and network queues is described in more detail below in connection with FIG. 19.

[0088] When data is requested by an application program executed on a client 44, a storage unit is selected to satisfy the request when each segment of data is stored on at least two storage units. The segment table 90 for the requested data is used for this purpose. The selection of a storage unit may be performed by the application program requesting the data, by a file system of the client executing the application program, through coordination among storage units or by another application such as a catalog manager. The selection may be random or pseudorandom, or based on a least recently used algorithm. or based on the relative lengths of the queues of the storage units. By selecting a storage unit based on the relative lengths of the queues on the available storage units, the load of the multiple applications may be distributed more equally over the set of storage units. Such selection will be described in more detail below in connection with FIGS. 16-18.

[0089] Small files may not be suitable for division into multiple segments for distribution over multiple storage units. Nonetheless, small files or small records may be stored within a storage unit. Each storage unit may combine its small files and records into larger segments for storage within the storage unit by using a log structured file system, such as described in “Serverless Network File Systems,” Ph.D. Thesis, Dept. of Computer Science, Univ. of California, Berkley, by Michael Donald Dahlin, 1995, and “The Zebra Striped Network File System,” by John H. Hartman et al., in ACM Transactions on Computer Systems, Vol. 13, No. 3, August 1995, pp. 274-310. A management of such files is simplified by limiting the log structured files to data stored within each storage unit.

[0090] To support use of a log structured file system in combination with the other aspects of the system described herein, a client indicates when storing data whether the data is to be stored as a “streaming file,” such as for video and audio data, that is segmented and distributed over several storage units or as a “journalled” file to be stored using a log structured file system within a storage unit. The size of the larger segments for the log structured file system may be the same or similar to the size of the segments of the streaming media files. The distinction between the streaming files and journalled files for each access may be made by default, may be specified by a client, may be determined by detecting a file size, or by sending or receiving message between the client and storage unit, or the determination may be made by the storage unit. Each storage unit maintains a log that is accessed for read, write, recovery and archiving functions on small files or records, and that tracks how two or more small files or records are combined into a larger segment. By performing all management of the log structured files on each storage unit, and eliminating knowledge of this structure from operations performed by the client, the benefits of a log structured file system may be provided without the inherent difficulties in maintaining cache coherencies and other problems involved with centralized control of the logs of the files. The logs or journals used in the log structured file system also may be used to enable rollback operations if stored over time. Such a log structured file system may be combined with a streaming file system where no redundancy information is stored for either journalled or streaming files.

[0091] The functionality provided through the log structured file system also enables a portion of a segment of a file to be read, modified, and/or written by a client operation. Operations used to support reading a small file from a log structured file may be applied to reading a portion of a segment of a streaming data file. If a storage unit has sufficient processing capability, instructions may be sent by a client to a storage unit to read, modify and write a portion of a segment.

[0092] More details of a particular embodiment will now be described. For this purpose, the storage unit 42 may be implemented as a server or as an independently controlled disk storage unit, whereas the applications 44 are called clients. Clients may execute application programs that perform various tasks. A suitable computer system to implement either the servers or clients typically includes a main unit that generally includes a processor connected to a memory system via an interconnection mechanism, such as a bus or switch. Both the server and client also have a network interface to connect them to a computer network. The network interface may be redundant to support fault tolerance. The client also may have an output device, such as a display, and an input device, such as a keyboard. Both the input device and the output device may be connected to the processor and memory system via the interconnection mechanism.

[0093] It should be understood that one or more output devices may be connected to the client system. Example output devices include a cathode ray tube (CRT) display, liquid crystal displays (LCD), printers, communication devices such as a modem or network interface, and video and audio output. It should also be understood that one or more input devices may be connected to the client system. Example input devices include a keyboard, keypad, trackball, mouse, pen and tablet, communication devices such as a modem or network interface, video and audio digitizers and scanner. It should be understood the invention is not limited to the particular input or output devices used in combination with the computer system or to those described herein.

[0094] The computer system may be a general purpose computer system which is programmable using a high level computer programming language, such as the “C” and “C++” programming languages. The computer system also may be specially programmed, special purpose hardware. In a general purpose computer system, the processor is typically a commercially available processor, of which the series x86 processors such as the Pentium II processor with MMX technology, available from Intel and similar devices available from AMD and Cyrix, the 680X0 series microprocessors available from Motorola, the Alpha series microprocessor available from Digital Equipment Corporation, and the PowerPC processors available from IBM are examples. Many other processors are available. Such a microprocessor may execute a program called an operating system, of which the WindowsNT, Windows 95, UNIX, IRIX, Solaris, DOS, VMS, VxWorks. OS/Warp, Mac 0S System 7 and OS8 operating systems are examples. The operating system controls the execution of other computer programs and provides scheduling, debugging, input/output control, compilation, storage assignment, data management and memory management, and communication control and related services. The processor and operating system define a computer platform for which application programs in high-level programming languages are written.

[0095] Each server may be implemented using an inexpensive computer with a substantial amount of main memory, e.g., much more than thirty-two megabytes, and disk capacity, e.g., several gigabytes. The disk may be one or more simple disks or redundant arrays of independent disks (RAID) or a combination thereof. For example, the server may be a Pentium or 486 microprocessor-based system, with an operating system such as WindowsNT or a real-time operating system such as VxWorks. The authoring system, capturing system and playback system may be implemented using platforms that currently are used in the art for those kinds of products. For example, the MEDIACOMPOSER authoring system from Avid Technology, Inc., of Tewksbury, Mass., uses a Power Macintosh computer from Apple Computer, Inc., that has a PowerPC microprocessor and a MacOS System 7 operating system. A system based on a Pentium II processor with MMX technology from Intel, with the WindowsNT operating system, also may be used. Example playback systems include the “SPACE” system from Pluto Technologies International Inc., of Boulder, Colo., or the AIRPLAY system from Avid Technology which uses a Macintosh platform. The catalog manager may be implemented using any platform that supports a suitable database system such as the Informix database. Similarly, an asset manager that tracks the kinds of data available in the system may be implemented using such a database.

[0096] The memory system in the computer typically includes a computer readable and writeable nonvolatile recording medium, of which a magnetic disk, optical disk, a flash memory and tape are examples. The disk may be removable, such as a floppy disk or CD-ROM, or fixed, such as a hard drive. A disk has a number of tracks in which signals are stored, typically in binary form, i.e., a form interpreted as a sequence of ones and zeros. Such signals may define an application program to be executed by the microprocessor, or information stored on the disk to be processed by the application program. Typically, in operation, the processor causes data to be read from the nonvolatile recording medium into an integrated circuit memory element, which is typically a volatile, random access memory such as a dynamic random access memory (DRAM) or static memory (SRAM). The integrated circuit memory element allows for faster access to the information by the processor than does the disk. The processor generally manipulates the data within the integrated circuit memory and then copies the data to the disk when processing is completed. A variety of mechanisms are known for managing data movement between the disk and the integrated circuit memory element, and the invention is not limited thereto. It should also be understood that the invention is not limited to a particular memory system.

[0097] It should be understood the invention is not limited to a particular computer platform, particular processor, or particular high-level programming language. Additionally, the computer system may be a multiprocessor computer system or may include multiple computers connected over a computer network.

[0098] As stated above, each storage unit 42, if accessed through server, and each application 44 may have a file system, typically part of the operating system, which maintains files of data. A file is a named logical construct which is defined and implemented by the file system to map the name and a sequence of logical records of data to locations on physical storage media. While the file system masks the physical locations of data from the application program, a file system generally attempts to store data of one file in contiguous blocks on the physical storage media. A file may specifically support various record types or may leave them undefined to be interpreted or controlled by application programs. A file is referred to by its name or other identifier by application programs and is accessed through the file system using commands defined by the operating system. An operating system provides basic file operations for creating a file, opening a file, writing a file, reading a file and closing a file. These operations may be synchronous or asynchronous, depending on the file system.

[0099] As described herein, data of a file or source is stored in segments, of which copies or other form of redundancy information are randomly distributed among multiple storage units.

[0100] Generally speaking for most file systems, in order to create a file, the operating system first identifies space in the storage which is controlled by the file system. An entry for the new file is then made in a catalog which includes entries indicating the names of the available files and their locations in the file system. Creation of a file may include allocating certain available space to the file. In one embodiment, a segment table for the file may be created. Opening a file typically returns a handle to the application program which it uses to access the file. Closing a file invalidates the handle. The file system may use the handle to identify the segment table for a file.

[0101] In order to write data to a file, an application program issues a command to the operating system which specifies both an indicator of the file, such as a file name, handle or other descriptor, and the information to be written to the file. Generally speaking, given the indicator of the file, an operating system searches the directory to find the location of the file. The data may be written to a known location within the file or at the end of the file. The directory entry may store a pointer, called a write pointer, to the current end of the file. Using this pointer, the physical location of the next available block of storage may be computed and the information may be written to that block. The write pointer may be updated in the directory to indicate the new end of the file. In one embodiment, the write operation randomly distributes copies of segments of the file among the storage units and updates the segment table for the file. The write operation also may cause a segment and corresponding redundancy information to be stored on different storage units.

[0102] In order to read data from a file, an application program issues a command to the operating system specifying the indicator of the file and memory locations assigned to the application where the read data should be placed. Generally speaking, an operating system searches its directory for the associated entry given the indicator of the file. The application program may specify some offset from the beginning of the file to be used, or, in a sequential file system, the directory may provide a pointer to a next block of data to be read. In one embodiment, the selection of a storage unit and the scheduling of data transfer is implemented as part of the read operation of the file system of the client.

[0103] The client may use a file system or a special code library with a defined application programming interface (API) to translate requests for portions of a file into requests for segments of data from selected storage units. The storage unit may have its own file system which may be entirely separate from the client file system. All of the segments on a storage unit may be stored, for example, in a single file at the storage unit. Alternatively, the client file system may use the storage units over the network as raw storage, using the catalog manager and segment tables to implement the file abstraction. The segment table for a file also may indicate the locations of each segment on the storage units selected for the segment.

[0104] A primary advantage of using a file system is that, for an application program, the file is a logical construct which can be created, opened, written to, read from and closed without any concern for the physical storage medium or location on that medium used by the operating system to store the data. In a network file system, the file system manages requests for data from a specified file from the various storage units, without requiring an application program to know any details about the physical storage where the data is stored or the computer network. If the storage unit has its own independent file system, the client file system also need not know details of the storage mechanism of the storage units. The storage units may use, for example, the file system associated with their own operating system, such as the WindowsNT file system or the file system of a real time operating system such as VxWorks, or a file system that allows asynchronous operations.

[0105] The storage units are interconnected with the clients and, optionally, the catalog manager using a computer network. A computer network is a set of communications channels interconnecting a set of computer devices or nodes that can communicate with each other. The nodes may be computers such as the clients, storage units and catalog managers, or communication devices of various kinds, such as switches, routers, gateways and other network devices. The communication channels may use a variety of transmission media including optical fibers, coaxial cable, twisted copper pairs, satellite links. digital microwave radio, etc.

[0106] A computer network has a topology which is the geometrical arrangement of the connection of the nodes by the network. Kinds of topologies include point-to-point connection, linear bus, ring connection, star connection, and multiconnected networks. A network may use various combinations of these basic topologies. The topology may vary depending on the physical installation. A non-blocking, switch-based network in which each node, i.e., client or storage unit, is connected directly to the same switch may be used. In some implementations, multiple clients and storage units may be connected on a physical loop or subnetwork which are interconnected into a switching fabric. The system also may be connected using multiple switches.

[0107] The network also has a network architecture which defines the protocols, message formats, and other standards to which communication hardware and software conform in order for communication to occur between devices on the network. A commonly-used network architecture is the International Standards Organization seven-layer model known as the Open Systems Interconnection reference model. The seven layers are the application, presentation, session, transport, network, link and physical layers. Each machine communicates with any other machine using the same communication protocol at one of these layers.

[0108] In one embodiment, the link layer preferably is one that retains the order of packets as they are received at the client in order to avoid the potential for an unlimited latency.

[0109] Accordingly, suitable link layer protocols include asynchronous transfer mode (ATM) networks, such as OC3, OC12, or higher bandwidth networks. An ATM system operating in the AAL5 mode is preferable. Ethernet networks with 100 Tx to gigabit (1,000 Tx) capacity also may provide efficient packet transmission from the source to the destination. Suitable Ethernet network platforms are available, for example, from 3Com of Santa Clara, Calif. An example ATM system is available from Fore Systems of Warrendale, Pa. or Giga-Net, of Concord, Mass. A FibreChannel, FDDI or HIPPI network also may be used. The different clients, the catalog manager and the storage units all may communicate using the link layer protocol. Communication at this layer also reduces overhead due to memory copies performed to process encapsulated data for each layer's protocol. A bandwidth distributed network file system from Polybus Systems Corporation in Tyngsboro, Mass., may be used.

[0110] Having now described computer platforms for one embodiment, some additional operations and details of one embodiment will now be described.

[0111] In one embodiment, there are processes for maintaining the storage units and the data stored on the storage units. For example, fault recovery procedures may involve the creation of additional copies of a file. Additionally, files may be deleted or added based on the need for availability of, i.e., reliability of access to, the file. Finally, some maintenance procedures may involve deleting files on a storage unit, copying the files to another storage unit and removing the storage unit from the system. A file also may be archived, or removed from the system to archival storage. These processes will now be described in more detail in connection with FIGS. 5-9. Such data management processes may be performed by the catalog manager, another storage unit, or a client. The performance of these processes by a client would not occupy the resources of the catalog manager or storage units, which may be used for other more important tasks, such as replying to client requests for data.

[0112] FIG. 5 is a flowchart describing in more detail how fault recovery may be performed when a storage unit becomes unavailable after its failure is detected. One way to detect such failure is described in more detail below in connection with FIGS. 10-12. Repeated failures to respond to requests also may be used to indicate failures. The success of this process depends on the number of copies of each segment within the system or a number of segments in a redundancy set. Given a number N of copies, then N−1 storage units may fail and the system still will operate without loss of data. After a storage unit fails, a new storage unit may be installed in its place, with lost data restored, or the lost data may be recreated and distributed over the remaining storage units. FIG. 5 describes a process for when the redundancy information is a copy of a segment. FIG. 25, described below, illustrates a process for when the redundancy information is based on two or more segments.

[0113] Additional copies of data may be made by first selecting the data, e.g., a file or source to be recovered, in step 200. The file to be recovered may be selected by a priority ordering, and may be selected either automatically or manually. This kind of recovery allows data from some files to be reconstructed and made available before data from other files is recovered. The lost segments of the data, i.e., those stored on the lost storage unit, are identified in step 202 using the segment table for the source. A new storage unit for each lost segment is selected in step 204, typically in the same manner as when data is originally captured, when a new storage unit is not available to replace the failed storage unit. Alternatively, the replacement storage unit is selected. A copy of the lost segment is read from an alternate storage unit in step 206 and stored in the selected storage unit. The file operations for steps 204 through 208 may be asynchronous and performed by separate threads for each segment. Such operation takes advantage of the many-to-many read/write capability provided in this network architecture. The segment table for the file then is updated upon the successful completion of the copy operation in step 208. When the process is complete, the catalog manager may be updated with the new segment table in step 209, if a catalog manager maintains the segment tables. If the original segment table was represented by a seed to a pseudorandom sequence generator, the actual table may need to be created and modified.

[0114] The speed of repopulation and redundancy restoration for an unloaded system using this process is defined by the following equation:

\frac{s}{(n - 1 + d) (b / 2)},

[0115] where:

[0116] s=size of lost files in megabytes (MB),

[0117] n=initial number of storage units,

[0118] b=average bandwidth of storage units, expressed in MB/second, and

[0119] d=user demand load, expressed in MB/second.

[0120] For example, if access to 50 gigabytes of storage is lost because one of ten storage units fails, then with n=10 storage units, with unit bandwidth b=10 MB/sec., then (n−1)=9 and (b/2)=5. Thus. recovery would take approximately 20 minutes with no other loads. This absolute recovery speed generally is reduced as a reciprocal of the varying playback load to clients, e.g., a 50% load results in 200% increase in repopulation time. When invoked, the redistribution task can run at a fast rate with multiple storage unit checkerboard switched to multiple storage units, but repopulation activities operate opportunistically, subordinated to client file service requests. The net effect is only a slight loss of total bandwidth of the storage units due to the failed storage unit. Prioritization of the file selection for recovery ensures that the most important files are recovered most quickly.

[0121] Recovery after failure of a storage unit also can be managed completely by the storage units that maintain the redundant data corresponding to the data on the failed storage unit and without a centralized control process that is described in connection with FIG. 5. A client application may detect that a storage unit has failed and avoid making requests to that storage unit. Also, the client may request an updated file map for any file or file segment for which its file map indicates a failed storage unit. To enable operational storage units to recover after failure of another storage unit, each storage unit may maintain a file map indicating, for each of its segments, the storage unit on which redundancy information is stored. When a failure of another storage unit is detected, the file maps may be searched by each storage unit to identify segments for which new redundancy information is to be generated and stored on another available storage unit. A storage unit may identify data it has stored and copy it to another randomly or pseudorandomly selected storage unit.

[0122] FIG. 6 is a flowchart describing in more detail how an additional copy of data may be made. This process may be invoked to make additional data copies available of mission critical or high-demand data. A date-stamp may be given to the new copy to indicate when the copy may be deleted. Given selected data, a segment of the data is selected in step 210. Each segment is assigned randomly a new storage unit in step 212, ensuring that each storage unit has at most one copy of a given segment. Next, the segment is stored on the selected storage unit in step 214. Upon successful completion of the storage of that segment, the segment table for the data is updated in step 216. If all of the segments of the data have not yet been copied, as determined in step 217, the process repeats by returning to step 210 to select the next segment of the data. When the process is complete, the catalog manager may be updated with the new segment table in step 218, if the catalog manager maintains the segment tables. Although this process is sequential over the segments, each segment may be processed using a separate thread, and the file operation of step 214 may be asynchronous. Such processing enables the copy to be made quickly. With this procedure, the segment table still may be represented using the seed for the pseudorandom number generator.

[0123] FIG. 7 is a flowchart describing in more detail how a copy of data is deleted. This process may be invoked. for example, when data is no longer in high demand. For example, a date stamp on a copy may be used to indicate when the data should be deleted. Given the segment table shown in FIG. 2 for given data, one of the sets of copies, i.e., a column in the table, is selected in step 220. Each segment in the column is deleted in step 222. Upon successful completion of the delete operation in step 222 for each segment, the segment table is updated in step 224. Steps 222 and 224 are repeated for segment. This process may be sequential over the segments or each segment may be processed by a separate thread. When the process is complete, the catalog manager may be updated with the new segment table in step 226, if the catalog manager maintains the segments tables.

[0124] FIG. 8 is a flowchart describing how an otherwise active storage unit may be removed from the system. The data available on the storage unit is identified, for example by identifying a list of its files using its file system. First, the storage unit is made unavailable for writing new segments. This step may be accomplished, for example, by notifying the catalog manager or by sending a broadcast message to all clients. The segments of each file are redistributed on the other storage units before the storage unit is removed from the system. Given this list of files, the next file to be processed is selected in step 230. Using the segment table, all segments of this file on the storage unit, including segments containing redundancy information, are identified in step 232. The next segment to be processed is selected in step 234. The selected segment is assigned a new storage unit in step 235 by a random selection from the remaining storage units, assuring that no storage unit has more than one copy of a given segment. The data is then written to the newly selected storage unit in step 236. Upon successful completion of that write operation, the segment table is updated. When all the segments for a given file are redistributed, as determined in step 238, the segment table may be sent to the catalog manager if appropriate in step 239. The segments may be processed sequentially or by separate threads using asynchronous file operations. The segments may be deleted from the old storage unit after the catalog manager is updated. Processing continues with the next file, if any, as determined in step 240. If all files have been redistributed, this process is complete and the storage unit may be removed from the system.

[0125] FIG. 9 is a flowchart describing how data may be archived or copied for backup. This process involves copying of one copy of each segment of the data from the available storage units into a backup storage system, such as an archival storage medium. Each copy set and any redundancy information also may be deleted from all storage units. This process may be performed by selecting a copy set, e.g., the A list, from a column of the segment table in step 250. Alternatively, each segment may be read in order and the selection of a storage unit for each segment may be performed using techniques applied by other applications as described above. Each segment from the selected copy set is read from its storage unit and is stored on a storage medium in step 252. Upon successful copying of each segment to the storage medium, all of the remaining segments from all the remaining copy sets or any redundancy information may be deleted from the storage units in step 254. The segments may be processed sequentially or by separate threads using asynchronous file operations. The catalog manager then may be updated in step 256.

[0126] How the storage units may be monitored to determine availability and to detect failures will now be described in connection with FIGS. 10 through 12. There are several ways to determine whether storage units are available, including polling the storage units, handling exceptions from the storage units, or by the storage units periodically informing an application or applications of their availability. In one embodiment, in addition to the catalog manager 49 or some other client both may monitor which storage units 42 are active in the system and maintain a catalog of segment tables for each file. One method for monitoring the storage units is shown in FIGS. 10-12. Each storage unit available on the system establishes a process which periodically informs the catalog manager that it is available. In particular, this process may be considered a state machine having a first state 60 in which the storage unit periodically increments a counter, for example, in response to a timer interrupt or event from a system timer. When this counter reaches a certain predetermined amount, such as a hundred milliseconds, a transition to another state 62 occurs. In the transition to state 62, a signal, called a “ping,” is sent to the catalog manager by the storage unit. This signal may be a small message, even one ATM cell, that does not use much bandwidth to transmit. This signal may include an identifier of the storage unit, and possibly other information such as the capacity, efficiency and/or bandwidth availability of the storage unit. At the next timer interrupt or event, the counter is reset and a transition back to state 60 occurs.

[0127] The catalog manager may keep track of the available storage units. For this purpose, the catalog manager may use a list 70 of storage units, an example of which is shown in FIG. 11. This list of storage units may be implemented as a table indexed by the identifiers of the storage units as indicated at 72. If the storage unit is present or available, the bandwidth, memory capacity or other information about the power of the storage unit is made available in column 74. The count since the last “ping” from the storage unit also is present as indicated in column 76. If this count exceeds a predetermined amount, such as three hundred milliseconds, the storage unit is considered out of service and fault recovery procedures, such as described above, may be followed. An example tracking process which maintains the list 70 of storage units will now be described in more detail in connection with FIG. 12.

[0128] FIG. 12 is a state machine describing a tracking process which may be performed by the catalog manager to determine which storage units are available. One of these state machines may be established for each storage unit as a process on the catalog manager. The first state 80 is a waiting state in which the count value 76 for the storage unit in the list 70 of storage units is incremented for the storage unit in response to periodic timer interrupts. When a “ping” is received from the storage unit, the transition occurs to state 82. In state 82, the presence of this storage unit in list 70 is verified. If the storage unit is in the list 70, the count 76 for the storage unit is reset, other information about the storage unit may be updated, and a transition back to state 80 occurs. For example, when indicating that a storage unit is active, the storage unit also may indicate whether it has free space for storage or whether it is full or near capacity. If the storage unit is not in the list, it is added to the list with a reset count and a transition back to state 80 occurs. After a given increment, if the count for the storage unit is greater than a predetermined time out value, such as three hundred milliseconds, fault recovery procedures are performed. In particular, the storage unit is removed from list 70 and fault recovery procedures are performed in state 84. If a “ping” from a storage unit is received by the catalog manager and if that storage unit does not have a corresponding tracking process, then the catalog manager adds the storage unit to the list and creates a tracking process for the storage unit. When a new storage unit is added, a target capacity may be determined and one or more other storage units may be instructed to transfer some of its data to the new storage unit.

[0129] In addition to having a catalog manager 49, the system also may include a database, called an asset manager, which stores a variety of data about the media sources available in the system such as an index for each file. The catalog manager and asset manager also may be combined. One useful kind of information for storing in the asset manager is a table, shown in FIG. 13, that relates equivalent data files based on a source identifier and a range within that source, such as shown in U.S. Pat. No. 5,267,351. The source identifier is an indication of the original source of data, which may be an analog source, whereas the data actually available is a digitized copy of that source stored on the storage units. In particular, the table has an entry for a source identifier 100, a range within the source identifier 102, and an indication 104, such as list of data files, of equivalent data from that source. The list 104 may be used to identify one of the data files for a source, and in turn access the segment table for that file to determine where segments of the data are distributed on the various storage units. The segment table 90A of FIG. 2A may be incorporated into this list 104 of FIG. 13 as shown at 106 and 108. The segment table 90B of FIG. 2B similarly may be incorporated into list 104. Such equivalency among data also may be maintained by any application program.

[0130] Since the catalog manager is a database that monitors how data is distributed on the various storage units, it also should be designed to enhance fault tolerance and availability and to reduce its likelihood of being a bottleneck. Accordingly, the catalog manager should be implemented using conventional distributed database management techniques. Also, highly available machines, such as those from Marathon Technologies, Tandem Computers, Stratus, and Texas Micro, Inc., may be used to implement the catalog manager. There also may be several catalog managers that are used by separate client applications. Alternatively, each client application may maintain its own copy of catalogs locally, using standard techniques to maintain consistency between multiple copies of the data. In this manner, a catalog manager is not a central point of failure. A client also may act as its own catalog manager. The catalogs also may be treated as data of which its segments and redundancy information are randomly distributed among the storage units. Each client may have a segment table, or random number generator seed representing the segment table, for each catalog.

[0131] Having now described how data may be captured and stored onto storage units, and how the storage of data on the storage units may be managed, client applications that perform authoring and playback will now be described in more detail in connection with FIGS. 14 and 15.

[0132] There are several kinds of systems that may be used to author, process and display multimedia data. These systems may be used to modify the data, define different combinations of data, create new data and display data to a user. A variety of techniques are known in the art for implementing these kinds of systems.

[0133] Multimedia authoring, processing and playback systems typically have a data structure which represents the multimedia composition. The data structure ultimately refers to clips of source material, such as digitized video or audio, using an identifier of the source material, such as a unique identifier or a file name, and possibly a temporal range within the source material defining the clip. The identifier may be of a type that may be used with a list of equivalent data files to identify a file name for the source material. An index may be used to translate the temporal range in the source into a range of bytes within a corresponding file. This range of bytes may be used with the segment table for the file to identify segments of data that are needed and the storage units from which the data is retrieved.

[0134] FIG. 14 shows an example list structure that may be used to represent part of a multimedia composition. In an example shown in FIG. 14, there are several clips 260, each of which includes a reference to a source identifier, indicated at 262, and a range within the source, as indicated at 264. Generally, there may be such a list for each track of media in a temporal composition. There are a variety of data structures which may be used to represent a composition. In addition to a list structure, a more complex structure is shown in PCT Published Application WO93/21636 published on Oct. 28, 1993. Other example representations of multimedia compositions include those defined by Open Media Framework Interchange Specification from Avid Technology, Inc., Advanced Authoring Format (AAF) from the multimedia Task Force, QuickTime from Apple Computer, DirectShow from Microsoft, and Bento also from Apple Computer, and as shown in PCT Publication W096/26600.

[0135] The data structure described above and used to represent multimedia programs may use multiple types of data that are synchronized and displayed. The most common example is a television program or film production which includes motion video (often two or more streams or tracks) with associated audio (often four or more streams or tracks). As shown in FIG. 15, the client computer may have a corresponding set 290 of memory buffers 294 allocated in the main memory. Each buffer may be implemented as a “serializing” buffer. In other words, the client inserts data received from a storage unit into these independently accessible portions and reads from the set of buffers sequentially. Since requests may be sent to several storage units and data may be received at different times for the same stream, the buffers may not be filled in sequence when written, but are read out in sequence to be displayed. In FIG. 15, the filled in buffers indicate the presence of data in the buffer. Any empty buffer may be filled at any time as indicated at 293 and 295. However, each set of buffers has a current read location 291 from which data is read and which advances as time progress as indicated in 297. A subset 292, 296 of these buffers may be allocated to each stream of data.

[0136] Each buffer in the set of buffers has a size that corresponds to a fixed number of segments of data, where the segment size is the size of file segments stored on the storage units. There may be several, e.g., four, audio buffers per stream 292 of audio data, where each buffer may contain several, e.g., four, segments. Similarly, each video stream 296 may have several, e.g., four, buffers each of which contains several, e.g., four, segments. Each of the buffers may be divided into independently accessible portions 298 that correspond in size to the size of data packets for which transfer is scheduled over the network.

[0137] Because the video and audio data may be stored in different data files and may be combined arbitrarily, better performance may be obtained if requests for data for these different streams on the client side are managed efficiently. For example, the client application may identify a stream for which data can be read, and then may determine an amount of data which should be read, if any. A process for performing this kind of management of read operations is shown in U.S. Pat. No. 5,045,940. In general, the client determines which stream has the least amount of data available for display. If there is a sufficient amount of buffer space in the set of buffers for that stream to efficiently read an amount of data, then that data is requested. It is generally efficient to read data when the available space in memory for the selected stream is large enough to hold one network transmission unit of data. When it is determined that data for a stream should be requested, each segment of the data is requested from a storage unit selected from those on which the segment is stored.

[0138] A general overview of a process by which a composition may be converted into requests for data in order to display the data will now be described in connection with FIG. 16. In order to know what files to request from the storage unit, an application program executed on the client system may convert a data structure representing a composition, such as shown in FIG. 14, into file names and ranges within those files in step 270 in FIG. 16. For example, for each source identifier and range within that source, a request may be sent to the asset manager. In response, the asset manager may return a file name for a file containing equivalent media corresponding to the received source identifier and range. The segment table for the file and the list of available storage units also may be catalog manager.

[0139] When the client requests a segment of data for a particular data stream, the client selects a storage unit, in step 272, for the segment that is requested. This selection, in one embodiment where the redundancy is provided by copying each segment, will be described in more detail below in connection with FIGS. 17 and 18. In general, the storage unit with the shortest queue 48 (FIG. 1) may be selected. The client then reads the data from the selected storage unit for the segment, in steps 274 through 278. Step 274 may be understood as a pre-read step in which the client sends a request to a storage unit to read desired data from nonvolatile storage into faster, typically volatile storage. The request to the storage unit may include an indication of how much time is required from the time the request is made until that requested data must be received at the client, i.e., a due time. After a pre-read request is accepted, the client waits in step 276. The request is placed in the storage unit's queue 48, and the due time may be used to prioritize requests as described below. Data is transferred from the storage unit in step 278 after data becomes available in a buffer at the storage unit. This step may involve scheduling of the network usage to transfer the data to maximize efficiency of network utilization. The received data is stored in the appropriate buffer at the client, and ultimately is processed and displayed in step 280. If the segment is lost at the storage unit, the redundancy information may be used to reconstruct the segment.

[0140] There are several ways to initiate the pre-read requests, including selection of a storage unit, in step 274 and the data transfer in step 278. For example, the MediaComposer authoring system from Avid Technology, Inc., of Tewksbury, Mass., allows a user to set either a number of clips or an amount of time as a look-ahead value, indicating how far ahead in a composition the application should initiate read requests for data. A program schedule for a television broadcast facility also may be used for this purpose. Such information may be used to initiate selection of a storage unit and pre-read requests. Such pre-reads may be performed even if buffer space is not available in buffers 290 (FIG. 15), as is shown in European patent application 0674414A2, published Sep. 9, 1995. The amount of available space in the buffers 290 (FIG. 15) may be used to initiate data transfers in step 278 (FIG. 16), or to initiate both pre-reads (step 274) and data transfers (step 278).

[0141] One process which enables a client to make an adequate estimate of which storage unit has the shortest queue of requests, without requiring an exhaustive search of all the available storage units, will now be described in connection with FIGS. 17 and 18. First, the client sends a request with a threshold E1 to a first storage unit in step 330. The threshold E1 is a value indicating an estimate of time by which the request should be serviced. This estimate may be expressed as a time value, a number of requests in the disk queue of the storage unit, such as four, or other measure. The meaning of this threshold is that the request should be accepted by the storage unit if the storage unit can service the request within the specified time limit, for example. The client receives a reply from the storage unit in step 332. The reply indicates whether the request was accepted and placed in the disk queue of the storage unit or whether the request was rejected as determined in step 334. If the request is accepted, the client is given an estimate of time at which the data will be available in a buffer at the storage unit in step 336. For example, if the data for the requested segment already is in a buffer, the storage unit indicates that the data is immediately available. The client then may wait until it is time to request transfer of the data (step 278 in FIG. 16) some time after the estimated time has passed. If the request is rejected, an estimate of the amount of time the storage unit actually is likely to take, such as the actual size in number of entries of the disk queue, is returned from the storage unit. This actual estimate is added to a value K to obtain a threshold E2 in step 340. The value K may be two, if representing a number of disk queue entries. Threshold E1 and value K may be user-definable. A request is sent to a second storage unit in step 342 indicating the threshold E2. The client then receives a reply in step 344, similar to the reply received in step 332. If this reply indicates that the request was accepted, as determined in 346, the client has an estimate of time at which the data will be available at the second storage unit, as indicated in step 336 after which the client may wait to schedule the data transfer. Otherwise, an unconditional request, one with a large threshold, is sent to the first storage unit in step 348. An acknowledgment then is received in step 350 indicating the estimate of time at which the data will be available in a buffer at the storage unit, as indicated at step 336.

[0142] The storage unit. on the other hand, does not know whether it is the first or second storage unit selected by the client when it receives a request. Rather, the storage unit simply receives requests as indicated in step 360. The threshold indicated in the request is compared to the storage unit's own estimate of the time the client will need to wait in step 362. for example by comparing the size of the disk queue of the storage unit to the specified threshold. If the threshold in the request is greater than the estimate made by storage unit, the request is placed in the disk queue and an estimate of the time when the data will be available in a buffer at the storage unit is determined in step 364. This estimate may be determined, for example, based on disk access speed, disk queue length and possibly a running average of recent performance. An acknowledgment is sent to the client in step 336 including the estimated time of availability of the data in the buffer at the storage unit. Otherwise, a rejection is sent in step 368 indicating this estimate, such as the actual size of the disk queue.

[0143] The storage unit may keep track of which segments are in which buffers on the storage unit. Segment data may be read from the storage medium into any free buffer or into a buffer occupied by the least recently used segment. In this manner, data for a segment may be immediately available in a buffer if that segment is requested a second time.

[0144] As an alternative, a client may use another method to select a storage unit from which data will be retrieved, as discussed below. After sending the request, the client may receive an acknowledgment from the storage unit indicating that the request is in the disk queue at the storage unit. Instead of receiving an estimate of time at which the data will be available in a buffer at the storage unit, the client may wait until a ready signal is received indicating that the storage unit has read the requested data into a specified buffer memory at the storage unit. During this waiting period, the client may be performing other tasks, such as issuing requests for other data segments, displaying data or processing data. One problem with this alternative is that the client accepts an unsolicited message, i.e., the ready signal from the storage unit, in response to which the client changes context and processes the message. The client could be busy performing other operations. Although this process does provide a more accurate estimate of the time at which data is available in a buffer at the storage unit, the ability to change contexts and to process incoming messages quickly involves more complexity at the client.

[0145] There are several other ways a storage unit may be selected from the segment table for a file when the segment table tracks copies of each segment. For example, when a client is making a file read request, the client may pick randomly from either the “A” list or “B” list for the file in question. Alternatively, the client may review all of its currently outstanding requests, i.e., requests sent but not yet fulfilled, and pick which storage unit out of the storage units on the A and B lists for the segment currently has the fewest outstanding requests. This selection method may reduce the chance of a client competing with its own outstanding requests, and tends to spread requests more evenly over all the storage units. Alternatively, rather than examining outstanding requests, a client may examine a history of its recent requests, e.g., the last “n” requests, and for the next request pick whichever storage unit from the A list and B list for the segment has been used less historically. This selection method tends to spread requests more evenly over all the storage units, and tends to avoid a concentration of requests at a particular storage unit. The client also may request from each storage unit a measure of the length of its disk queue. The client may issue the request to the storage unit with the shortest disk queue. As another possibility, the client may send requests to two storage units and ultimately receive the data from only one. Using this method on a local area network, the client may cancel the unused request. On a wide area network, the storage unit that is ultimately selected may cancel the unused request at the other storage unit.

[0146] A storage unit will likely receive multiple requests from multiple applications. In order to manage the requests from multiple applications to ensure that the most critical requests are handled first, a queue 48 (FIG. 1) is maintained for each storage unit. The queue may be maintained in several parts, depending on the complexity of the system. In particular, the storage unit may maintain different queues for disk access and for network transfers. The queue may segregate requests from time-sensitive applications using data having specific due times, e.g., for playback to broadcast, from requests from other applications, such as capture systems, authoring tools or service and maintenance applications. Storage requests may be separated further from requests from authoring tools and requests from service and maintenance programs. Requests from authoring tools may be separated further from service and maintenance requests.

[0147] FIG. 19 illustrates one embodiment of queue 48, utilizing a disk queue 300 and a network queue 320. The disk queue has four subqueues 302, 304, 306 and 308, one for each of the playback, capture, authoring and service and maintenance client programs, respectively. Similarly, the network queue 320 has four subqueues 322, 324, 326 and 328.

[0148] Each queue includes one or more entries 310, each of which comprises a request field 312 indicating the client making the request and the requested operation, a priority field 314 indicating the priority of the request, and a buffer field 316 indicating the buffer associated with the request. The indication of the priority of the request may be a deadline, a time stamp, an indication of an amount of memory available at the client, or an indication of an amount of data currently available at the client. A priority scheduling mechanism at the storage unit would dictate the kind of priority stamp to be used.

[0149] The priority value may be generated in many ways. The priority value for an authoring or playback system is generally a measure of time by which the application must receive the requested data. For example, for a read operation, the application may report how much data (in milliseconds or frames or bytes) it has available to play before it runs out of data. The priority indication for a capture system is generally a measure of time by which the client must transfer the data out of its buffers to the storage unit. For example, for a write operation, the application may report how much empty buffer space (in milliseconds, frames or bytes) it has available to fill before the buffer overflows. Using milliseconds as a unit of measure, the system may have an absolute time clock that could be used as the basis for ordering requests in the queue 48, and all applications and storage units may be synchronized to the absolute time clock. If such synchronization is not practical, the application may use a time that is relative to the application that indicates how much time from the time the request is made that may pass until the requested data should be received by the client. Assuming low communication latency, the storage unit may convert this relative time to an absolute time that is consistent with the storage unit.

[0150] The storage unit processes the requests in its disk queues 302-308 in their priority order, i.e, operating on the requests in the highest priority queue first, in order by their priority value, then the requests in successively lower priority queues. For each request, the storage unit transfers data between the disk and the buffer indicated by the request. For a read request, after the request is processed, the request is transferred from the disk queue to the network queue. For a write request, the request is removed from the disk queue after the write operation completes successfully.

[0151] In one embodiment to be described in more detail below, the storage unit uses the network queue to prioritize network transfers in the process of scheduling those transfers. In this embodiment, clients request transfer of data over the network. If a storage unit receives two such requests at about the same time, the storage unit processes the request that has a higher priority in its network queue. For a read request, after the request is processed, the request is removed from the network queue. For a write request, the request is transferred from the network queue to the disk queue, with a priority depending on the availability of free buffers, after the transfer completes successfully. If the time has passed for a request in the network queue to be processed, the request may be dropped indicating that the client is no longer operating or did not request the network transfer in time.

[0152] Data transfers between the storage units and clients over the computer network may be scheduled to improve efficiency. In particular, scheduling data transfers improves bandwidth utilization of the computer network. Such scheduling of the network usage should be performed particularly if the bandwidth of the link between a client and a switch is on the same order of magnitude as the bandwidth of the link between the storage unit and the switch. In particular, if the storage unit sends data and the client receives data at the link speed of their respective network connections, data is not likely to accumulate at a network switch or to experience other significant delays.

[0153] In order to enforce such utilization of the network, a mechanism may be provided that forces each client to receive data from only one storage unit, and that forces each storage unit to send data to only one client, at any given time. For example, each client may have only one token. The client sends this token to only one storage unit to request transfer of the data for a selected segment. The token may indicate the deadline by which the data must be received by the client, i.e., the priority measure, and the specified segment. Each storage unit sends data to only one client at a time, from which it has received a token. The storage unit only accepts one token at a time. After the data is transferred, the storage unit also returns the token.

[0154] Another network scheduling process will now be described in connection with FIGS. 20 and 21. This process provides a similar result but does not use a token. Rather a client requests a communication channel with a storage unit, specifying a segment and an amount of time E3 that the client is willing to wait for the transfer to occur. The client also may specify a new due time for the segment by which the client must receive the data.

[0155] Referring now to FIG. 20, the client process for transferring data over the network will now be described. At any point in time during the playback of a composition, each buffer has a segment of data associated with it and a time by which the data must be available in the buffer for continuous playback. As is known in the art, the application associates each of the buffers with a segment during the playback process. As shown above in connection with FIGS. 17 and 18, each segment that a client has preread has an associated estimated time by which the data will be available at the storage unit. Accordingly, the client may order the buffers by their due time and whether the requested data is expected to be available in a buffer at the storage unit. This ordering may be used by the client to select a next buffer for which data will be transferred in step 500. The client requests a communication channel with the storage unit in step 502, specifying a waiting time E3. This value E3 may be short, e.g., 100 milliseconds, if the client does not need the data urgently and if the client may perform other operations more efficiently. This value E3 may be longer if the client needs the data urgently, for example, so that it does not run out of data for one of its buffers. In step 504, the client receives a reply from the storage unit. If the storage unit indicates that the request is rejected, as determined in step 506, a revised estimated time is received with the message in step 508. This revised estimated time may be used to update the buffer list in step 510 from which buffers are selected. Processing returns to step 500 to select another buffer. A buffer for which the segment is on the same storage unit as the previously selected segment probably should not be selected. If the storage unit otherwise accepts the request, the data ultimately is received in step 518.

[0156] The process from the point of view of the storage unit will now be described in connection with FIG. 21. The storage unit receives a request from a client in step 520 indicating waiting time E3. If the data is not yet available in the buffers at that storage unit, as determined in step 522, the storage unit rejects the request in step 524 and computes a revised estimated time which is sent to the client. If the data is otherwise available and the network connection of the storage unit is not busy, as determined in step 526, then the client becomes an “active client” and the communication channel is granted by the storage unit in step 528, allowing data to be transferred. If the network connection of the storage unit is busy transferring data to another client, the storage unit maintains a request from a “waiting client,” to which data is transferred after the data transfer for the “active client” is completed. In order to determine whether the current client should be the “waiting client,” the storage unit estimates a time by which the transfer could occur, in step 530, based on the number of requests with earlier deadlines in the network queue multiplied by the network transmission time for each request. If the computed estimated time of availability is greater than the waiting time E3, indicating the client is not willing to wait that long, as determined in step 532, the request is rejected in step 524. Also, if the specified priority of this request is lower than the priority for any current waiting client, as determined in step 534, the request is rejected in step 524. Otherwise, the request from any current waiting client is rejected in step 536 and this new client is designated as the current waiting client. When a transfer to the active client is completed, the waiting client becomes the active client and the data is transferred.

[0157] In order to transfer data from a client to a storage unit, a similar process may be used for scheduling the network transfer and for transferring the data from a buffer in the storage unit to nonvolatile storage. From the point of view of the client, this process will now be described in connection with FIG. 22. This process may be used to implement step 124 and 126 in FIG. 3.

[0158] Unlike the process of reading in which the client may place data into an arbitrary point within its set of buffers, the data to be transferred to a storage unit typically comes from a read pointer from a set of buffers used by the capture system. The capture system typically produces one or more streams of video information as well as one or more streams of audio information. Accordingly, the capture system may select one of the data streams according to the amount of free buffer space in the stream to receive captured data. This buffer at the current read pointer of the selected stream is selected in step 600. A write request is then sent to the storage unit in step 602. The request includes an identifier for the segment, a due time or other priority value, and a threshold E4 indicating an amount of time the client is willing to wait. The due time is used by the storage unit to prioritize network transfer requests. The threshold E4 is used by the client, similar to threshold E3 discussed above, to permit the client to efficiently schedule its own operations. The client, after sending the request to the storage unit, eventually receives a reply in step 604. If the reply indicates that the write request was rejected, as determined in step 606, the reply includes an estimated time by which the storage unit will be available to receive the data. This estimated time may be used by the client to schedule other operations. If the storage unit accepts the request to write the data, the client then sends, in step 608, a portion of the segment of the data to the storage unit. A reply may be received in step 610 indicating whether or not the write request was successful, as analyzed in step 612. A failure may involve recovery processes in step 614. Otherwise the process is complete as indicated in step 616.

[0159] From the point of view of the storage unit, the storage unit receives the write request from the client in step 620. The request indicates a due time or other priority stamp which is used to place the request within the network queue. The storage unit then determines in step 622 if a buffer is available for receiving the data. The storage unit may make such a buffer available. In the unlikely event that no buffers are available, the request may be rejected in step 624. Otherwise, a request is put in the network queue in step 626 indicating the buffer allocated to receive the data, its priority stamp, and other information about the transfer. Next, the storage unit determines if the network connection is busy in step 628. If the network connection is not busy, the storage unit accepts the request in step 630 and sends a message to this effect to the client. The client then transfers the data which is received by the storage unit in step 632 and placed in the designated buffer. If the designated buffer is now full, as determined in step 634, the buffer is placed in the disk queue with an appropriate priority stamp in step 636. The storage unit's processing of its disk queue will eventually cause the data to be transferred from the buffer to permanent storage. Otherwise, the storage unit waits until the client sends enough data to fill the buffer as indicated in step 638.

[0160] If the network connection of the storage unit is busy, as determined in step 628, the storage unit computes, in step 640, an estimated time by which the network connection of the storage unit should be available. If this computed time is greater than the indicated waiting time E4, as determined in step 642, the request is rejected in step 624 with an estimate of the time of availability of the storage unit. If the storage unit expects to be able to transfer the data within the waiting time E4 indicated by a client, the storage unit compares the priority of the request with the priority of a request for any currently waiting client, in step 644. If this request is of a lower priority than the request of the currently waiting client, the request is rejected. Otherwise, the request from the currently waiting client is rejected, and this new request is made the next request to be processed in step 646.

[0161] These processes for scheduling transfer of data over the network also may be used without using redundancy information and without using the methods of selection of a storage unit described above.

[0162] Additional embodiments for use when the redundancy information is created from two or more segments will now be described in connection with FIGS. 24 and 25.

[0163] Referring now to FIG. 24, an example process for storing segments of data with redundancy information in a randomly distributed manner over several storage units will now be described in more detail. This process is generally similar to the process described above in connection with FIG. 3. First, in step 700, the capturing system creates a segment table 90B (FIG. 2B). An image index that maps each image to an offset in the stream of data to be captured, also typically is created. The indexed images may correspond to, for example, fields or frames of the video. The index may refer to other sample boundaries, such as a period of time, for other kinds of data, such as audio. The capturing system also obtains a list of available storage units, as described above. The capturing system also receives an indication of a redundancy set size, either automatically based on the list of available storage units or from a user. In general, the redundancy set size should be less than the number of available storage units, and may be a significantly smaller subset. A counter is also used to keep track of which segments are in a given redundancy set. This counter is reset to zero in step 700. An exclusive-or memory is also used, which is reset to all binary unasserted values, e.g., “0”.

[0164] A segment of data is then created by the capturing system in step 720. An appropriate size for this segment was discussed above in connection with the description of FIG. 3. The counter is also incremented in step 720.

[0165] The current segment is stored locally as an exclusive-or of any segment already stored in the exclusive-or memory, in step 722. A storage unit is selected for the segment in step 724. Selection of the storage unit for a segment is random or pseudorandom. This selection may be independent of the selection made for any previous redundancy set. However, the selection should ensure that each segment in a redundancy set is stored on a different storage unit. Each file may use only a subset of the available storage units as discussed above in connection with the description of FIG. 3.

[0166] After a storage unit is selected for the segment, the segment is sent to the storage unit in step 726 for storage. The capture system then may wait for the storage unit to acknowledge completion of storage of the segment in step 728. When data must be stored in real-time while being captured, the data transfer in step 726 may occur in two steps, similar to read operations, as discussed above. After the data is successfully stored on the storage units, the segment table 90B is updated by the capturing system in step 730.

[0167] If the counter is currently equal to the redundancy set size, as determined in step 732, the contents of the local exclusive-or memory is the redundancy information. This redundancy information is then stored on the storage units. In particular, the counter is reset in step 734. A storage unit is selected for the redundancy information in step 736. The redundancy information is sent to the selected storage unit in step 738. The capturing system then waits for acknowledgment of successful storage in step 740. The segment table may then be updated in step 742.

[0168] If capture is complete, as determined in step 128, then the process terminates; at this time any redundancy information stored in the exclusive-or memory should be stored in a storage unit in step 745, using a procedure similar to step 734 through 742. The updated segment table is then sent to the catalog manager in step 746. If the counter is not equal to the redundancy set size in step 732, and if capturing is not complete as determined in step 744, process continues by creating the next segment of data and incrementing the counter in step 720.

[0169] As discussed above in connection with FIG. 5, the redundancy information allows data to be recovered if one of the storage units has failed. FIG. 25 illustrates a process for performing such failure recovery when the redundancy information is based on a redundancy set containing two or more segments. As in FIG. 5, a file to be recovered is selected in step 750. Any lost segments of that file are identified in step 752. The redundancy set containing a lost segment is then read in step 754. This step involves reading the redundancy information for the set created by exclusive-or of the segments in the set, and reading the remaining segments of the redundancy set. An exclusive-or of the remaining segments and the redundancy information is then computed in step 756 to reconstruct the lost segment. A storage unit for each reconstructed lost segment is then selected in step 758, similar to step 204 in FIG. 5. The reconstructed lost segments are stored in the selected storage units. The segment table is updated upon successful completion of the storage operations. The updated segment table is then sent to the catalog manager in step 762.

[0170] It is also possible to convert a file having one kind of redundancy information, e.g., a copy of the segment, to another kind of redundancy information, e.g., an exclusive-or of two or more segments. For example, an additional copy of data may be created using a process shown in FIG. 6. After this process is completed, the other form of redundancy information (the exclusive-or results of segments) may be deleted. Similarly, the process shown in FIG. 24 may be used with stored data to create exclusive-or redundancy information. After creation of such information, any extra copy of data may be deleted using the process shown in FIG. 7. The form in which a file has redundancy information may vary from file to file and may be based on, for example, a priority associated with the file and an indication of the form of the redundancy information may be stored in the catalog manager.

[0171] By scheduling data transfers over the network and by distributing the load on the storage units with selected access to randomly distributed segments of data with redundancy information, this system is capable of efficiently transferring multiple streams of data in both directions between multiple applications and multiple storage units in a highly scalable and reliable manner, which is particularly beneficial for distributed multimedia production.

[0172] One application that may be implemented using such a computer network is the capability to send and return multiple streams to other external digital effects systems that are commonly used in live production. These systems may be complex and costly. Most disk-based nonlinear video editing systems have disk subsystems and bus architectures which cannot sustain multiple playback streams while simultaneously recording an effects return stream, which limits their abilities to be used in an online environment. Using this system, several streams may be sent to an effects system, which outputs an effects data stream to be stored on the multiple storage units. The several streams could be multiple camera sources or layers for dual digital video effects.

[0173] It is also possible to have multiple storage units providing data to one client to satisfy a client's need for a high bandwidth stream of data that has a higher bandwidth than any one storage unit. For example, if each of twenty storage units had a 10 MB/s link to a switch and a client had a 200 MB/s link to the switch, the client could read 200 MB/s from twenty storage units simultaneously, permitting transfer of a data stream for high definition television (HDTV), for example.

[0174] Using the procedures outlined above, storage units and clients operate using local information and without central configuration management or control. A storage unit may be added to the system during operation without requiring the system to be shut down. The storage unit simply starts operation, informs clients of its availability, and then establishes processes to respond to access requests. This expandability complements the capability and reliability of the system.

[0175] Having now described a few embodiments, it should be apparent to those skilled in the art that the foregoing is merely illustrative and not limiting, having been presented by way of example only. Numerous modifications and other embodiments are within the scope of the invention.

Claims

What is claimed is:

1. A data storage system, comprising:

a plurality of storage units;

a plurality of client systems, wherein each client system has a file system through which an application executed on the client system accesses data;

a network interconnecting the plurality of storage units and the plurality of client systems;

wherein the file system of each client system accesses data in one or more files using the plurality of storage units, wherein a file has a name and includes segments of data and redundancy information for each segment, wherein the redundancy information for a segment is one or more copies of the segment;

wherein the application executed on the client system accesses data in a file using a request to the file system indicating the name of the file;

wherein client code accessed by the file system in each client system includes means for writing data to a file comprising:

means for selecting, for each segment of the data, at least two of the storage units for storing the segment;

means for initiating a request to store each segment of the data to each of the at least two storage units selected for the segment, wherein the request includes an identifier of the segment; and

means for locally accessing information indicative of the at least two storage units on which each segment of a file is stored;

wherein each storage unit identifies a location on the storage unit for storing a received segment of data, stores the received segment of data at the identified location and maintains information associating the identifier of the segment of data with a location of each segment of data on the storage unit;

wherein client code accessed by the file system in each client system includes means for reading data from a file comprising:

means for selecting, for each segment of the requested data, one of the storage units on which the segment is stored using the locally accessed information indicative of the at least two storage units on which each segment of a file is stored; and

means for reading each segment of the requested data from the selected storage unit for the segment, including sending a request, for each segment, to the storage unit selected for the segment including the identifier of the segment; and

means for providing the read data to the application; and

wherein each storage unit retrieves a requested segment of data from the storage unit using the information associating the identifier of the segment of data with a location of each segment of data on the storage unit to obtain the location of the segment of data on the storage unit.

2. The data storage system of claim 1, wherein the means for reading each segment of the requested data includes means for scheduling data transfers over the network to efficiently utilize network bandwidth.

3. The data storage system of claim 1, wherein the means for reading each segment of the requested data comprises:

a plurality of buffers, wherein each buffer corresponds to a segment of the requested data;

means for ordering the buffers by a due time at the client and whether the requested data is expected to be available in a buffer at the storage unit; and

means for selecting a segment to be requested from a storage unit according to the ordering of the buffers.

4. A distributed file system, comprising:

a plurality of storage units;

a plurality of client systems; and

a network interconnecting the plurality of storage units and the plurality of client systems;

wherein each client system has a file system through which an application executed on the client system accesses data in a file by using a request to the file system using a name for the file;

wherein data of a file is divided into segments, wherein each segment has an identifier, and wherein the segments of a file are distributed and stored among the plurality of storage units;

wherein each storage unit stores a segment of a file at a location on persistent storage in the storage unit and locally maintains information that associates the identifier of the segment with the location of the segment on the persistent storage;

wherein each client system had local access to information indicating, for each file, the storage units on which segments of the file are stored; and

wherein the file system in each client system includes means for reading data of a file, the means for reading comprising:

means for accessing locally the information indicating the storage unit on which each segment of the data is stored;

means for sending a request, for each segment of the data, over the network to the storage unit that stores the segment including the identifier of the segment;

means for receiving each requested segment over the network from the storage units; and

means for combining the received segments to provide the data of the file; and

wherein each storage unit includes means, operative in response to a request from a client system including an identifier of a segment, for accessing the locally maintained information using the identifier of the segment to obtain the location of the segment from persistent storage and means for transferring the segment to the client over the network.

5. The distributed file system of claim 4, wherein the segments of each file are distributed nonsequentially among the storage units.

6. The distributed file system of claim 5, wherein a copy of each segment of each file is distributed among the storage units, and wherein the means for sending a request for each segment includes means for selecting one of the storage units for the segment and sending the request to the selected storage unit for the segment.

7. The distributed file system of claim 6, wherein each storage unit includes a queue of requests for data from the client systems and the means for selecting a storage unit, in each client system, includes means for selecting the storage unit with approximately the shortest queue of requests.

8. The distributed file system of claim 7, wherein the means for selecting the storage unit with approximately the shortest queue of requests comprises:

means for selecting a first one of the storage units if the first storage unit can transfer the segment within a first estimated time;

means for selecting a second one of the storage units if the second one of the storage units can transfer the segment within a second estimated time and if the first one of the storage units cannot transfer the segment within the first estimated time; and

means for selecting the first one of the storage units if the second one of the storage units cannot transfer the segment within the second estimated time.

9. The distributed file system of claim 7, wherein the means for selecting the storage unit with approximately the shortest queue of requests comprises:

means for requesting the segment from a first one of the storage units, indicating a first estimated time;

means for requesting the segment from a second one of the storage units, indicating a second estimated time, if the first one of the storage units rejects the request

means for requesting the segment from the first one of the storage units if the second one of the storage units rejects the request.

10. The distributed file system of claim 9, wherein each storage unit includes:

means for rejecting a request for a segment if the request cannot be serviced by the storage unit within an estimated time indicated by the request; and

means for accepting a request for a segment if the request can be serviced by the storage unit within an estimated time indicated by the request.

11. The distributed file system of claim 7, further comprising means for ensuring that each storage unit sends data to only one client at a time and each client system requests data from only one storage unit at a time.

12. The distributed file system of claim 11, wherein the means for ensuring includes, in each client system, means for issuing a request to a storage unit selected for a segment to transfer the segment, and, in each storage unit, means for accepting or rejecting the request to transfer the segment according to whether the transfer can be performed within an estimated time.

13. The distributed file system of claim 4, further comprising means for ensuring that each storage unit sends data to only one client at a time and each client system requests data from only one storage unit at a time.

14. The distributed file system of claim 13, wherein the means for ensuring includes, in each client system, means for issuing a request to a storage unit selected for a segment to transfer the segment, and, in each storage unit, means for accepting or rejecting the request to transfer the segment.

15. The distributed file system of claim 4, wherein the means for sending a request, for each segment of the data, over the network to the storage unit that stores the segment including the identifier of the segment, includes:

means for sending a request to the storage unit to read the segment from persistent storage into a buffer at the storage unit; and

means for sending a request to the storage unit to transfer the segment from the buffer at the storage unit over the network to the client system.

16. The distributed file system of claim 15, wherein the means for sending a request to the storage unit to transfer the segment operates such that the client requests transfer of a segment from only one storage unit at a time.

17. The distributed file system of claim 16, wherein the client system includes:

a plurality of buffers, wherein each buffer corresponds to a segment of the requested data;

means for ordering the buffers according to a due time at the client for the corresponding segment and whether the segment is expected to be available in the buffer in the storage unit; and

wherein the means for sending a request to a storage unit to transfer a segment requests transfer of the first available segment first according to the ordering of the buffers.

18. The distributed file system of claim 15, wherein the client system includes:

a plurality of buffers, wherein each buffer corresponds to a segment of the requested data;

means for ordering the buffers according to a due time at the client for the corresponding segment and whether the segment is expected to be available in the buffer in the storage unit; and

wherein the means for sending a request to a storage unit to transfer a segment requests transfer of the first available segment first according to the ordering of the buffers.

19. The distributed file system of claim 15, wherein the means for sending a request to a storage unit to transfer a segment includes means for determining which segment of the data is first available in a buffer at a storage unit, and means for sending a transfer request to the storage unit for the first available segment.

20. The distributed file system of claim 4, wherein the information indicating, for each file, the storage units on which segments of the file are stored, includes a data file for storing a mapping between segments of a data file and the storage unit on which each segment is stored.

21. The distributed file system of claim 20, wherein the data file for maintaining the mapping is stored in the file system such that segments of the data file are distributed among the storage units.

22. The distributed file system of claim 6, wherein the copy of a segment is stored on a storage unit different from the storage unit that stores the segment, whereby, upon failure of a storage unit that stores a segment or a copy of the segment, an additional copy of the segment can be reconstructed and stored on one or more other storage units.

Patent Citations (101)

Patent	Date	Inventor	Cited By
US4887204(A)	1989-12-01	Johnson et al.	Applicant
US5262875(A)	1993-11-01	Mincer et al.	Applicant
US5333299(A)	1994-07-01	Koval et al.	Applicant
US5371852(A)	1994-12-01	Attanasio et al.	Applicant
US5394526(A)	1995-02-01	Crouse et al.	Applicant
US5420984(A)	1995-05-01	Good et al.	Applicant
US5423037(A)	1995-06-01	Hvasshovd	Applicant
US5434994(A)	1995-07-01	Shaheen et al.	Applicant
US5442749(A)	1995-08-01	Northcutt et al.	Applicant
US5463765(A)	1995-10-01	Kakuta et al.	Applicant
US5473362(A)	1995-12-01	Fitzgerald et al.	Applicant
US5485474(A)	1996-01-01	Rabin	Applicant
US5508732(A)	1996-04-01	Bottomley et al.	Applicant
US5510905(A)	1996-04-01	Birk	Applicant
US5517652(A)	1996-05-01	Miyamoto et al.	Applicant
US5521630(A)	1996-05-01	Chen et al.	Applicant
US5526132(A)	1996-06-01	Tsubota et al.	Applicant
US5537408(A)	1996-07-01	Branstad et al.	Applicant
US5537533(A)	1996-07-01	Staheli et al.	Applicant
US5542087(A)	1996-07-01	Neimat et al.	Applicant
US5544327(A)	1996-08-01	Dan et al.	Applicant
US5544347(A)	1996-08-01	Yanai et al.	Applicant
US5546118(A)	1996-08-01	Ido	Applicant
US5550577(A)	1996-08-01	Veriest et al.	Applicant
US5550982(A)	1996-08-01	Long et al.	Applicant
US5553005(A)	1996-09-01	Voeten et al.	Applicant
US5555244(A)	1996-09-01	Gupta et al.	Applicant
US5555404(A)	1996-09-01	Torbjørnsen et al.	Applicant
US5559549(A)	1996-09-01	Hendricks et al.	Applicant
US5559641(A)	1996-09-01	Kajimoto et al.	Applicant
US5559764(A)	1996-09-01	Chen et al.	Applicant
US5559808(A)	1996-09-01	Kostreski et al.	Applicant
US5559984(A)	1996-09-01	Nakano et al.	Applicant
US5566297(A)	1996-10-01	Devarakonda et al.	Applicant
US5574845(A)	1996-11-01	Benson et al.	Applicant
US5581784(A)	1996-12-01	Tobagi et al.	Applicant
US5583561(A)	1996-12-01	Baker et al.	Applicant
US5583868(A)	1996-12-01	Rashid et al.	Applicant
US5585852(A)	1996-12-01	Agarwal	Applicant
US5586264(A)	1996-12-01	Belknap et al.	Applicant
US5592612(A)	1997-01-01	Birk	Applicant
US5592626(A)	1997-01-01	Papadimitriou et al.	Applicant
US5594924(A)	1997-01-01	Ottesen et al.	Applicant
US5610841(A)	1997-03-01	Tanaka et al.	Applicant
US5623690(A)	1997-04-01	Palmer et al.	Applicant
US5642171(A)	1997-06-01	Baumgartner et al.	Applicant
US5644720(A)	1997-07-01	Boll et al.	Applicant
US5647047(A)	1997-07-01	Nagasawa	Applicant
US5684963(A)	1997-11-01	Clement	Applicant
US5692128(A)	1997-11-01	Bolles et al.	Applicant
US5694334(A)	1997-12-01	Donahue et al.	Applicant
US5712976(A)	1998-01-01	Falcon, Jr. et al.	Examiner
US5732239(A)	1998-03-01	Tobagi et al.	Applicant
US5734925(A)	1998-03-01	Tobagi et al.	Applicant
US5737595(A)	1998-04-01	Cohen et al.	Applicant
US5737747(A)	1998-04-01	Vishlitzky et al.	Applicant
US5754882(A)	1998-05-01	Tobagi et al.	Applicant
US5757415(A)	1998-05-01	Asamizuya et al.	Applicant
US5768681(A)	1998-06-01	Dan et al.	Applicant
US5799174(A)	1998-08-01	Muntz et al.	Applicant
US5829046(A)	1998-10-01	Tzelnic et al.	Applicant
US5862312(A)	1999-01-01	Mann et al.	Applicant
US5893086(A)	1999-04-01	Schmuck et al.	Applicant
US5911046(A)	1999-06-01	Amano	Examiner
US5915094(A)	1999-06-01	Kouloheris et al.	Examiner
US5917538(A)	1999-06-01	Asamizuya	Examiner
US5920702(A)	1999-07-01	Bleidt et al.	Applicant
US5926649(A)	1999-07-01	Ma et al.	Applicant
US5933603(A)	1999-08-01	Vahalia et al.	Applicant
US5940838(A)	1999-08-01	Schmuck et al.	Applicant
US5940841(A)	1999-08-01	Schmuck et al.	Applicant
US5946686(A)	1999-08-01	Schmuck et al.	Applicant
US5950015(A)	1999-09-01	Korst et al.	Applicant
US5950199(A)	1999-09-01	Schmuck et al.	Applicant
US5956734(A)	1999-09-01	Schmuck et al.	Applicant
US5960446(A)	1999-09-01	Schmuck et al.	Applicant
US5963963(A)	1999-10-01	Schmuck et al.	Applicant
US5974424(A)	1999-10-01	Schmuck et al.	Applicant
US5987477(A)	1999-11-01	Schmuck et al.	Applicant
US5996089(A)	1999-11-01	Mann et al.	Applicant
US5999976(A)	1999-12-01	Schmuck et al.	Applicant
US6021408(A)	2000-02-01	Ledain et al.	Examiner
US6021508(A)	2000-02-01	Schmuck et al.	Applicant
US6023706(A)	2000-02-01	Schmuck et al.	Applicant
US6032216(A)	2000-02-01	Schmuck et al.	Applicant
US6047309(A)	2000-04-01	Dan et al.	Applicant
US6061732(A)	2000-05-01	Korst et al.	Applicant
US6070191(A)	2000-05-01	Narendran et al.	Applicant
US6112223(A)	2000-08-01	Chadwick et al.	Applicant
US6134596(A)	2000-10-01	Bolosky et al.	Examiner
US6138221(A)	2000-10-01	Korst et al.	Applicant
US6160547(A)	2000-12-01	Roth	Applicant
US6185621(B1)	2001-02-01	Romine	Examiner
EP701198	1996-03-01		Applicant
EP740247	1996-10-01		Applicant
EP2312318	1997-10-01		Applicant
GB2299424	1996-10-01		Applicant
GB2312316	1997-10-01		Applicant
GB2312317	1997-10-01		Applicant
GB2312319	1997-10-01		Applicant
WO98/10586	1998-03-01		Applicant

Non-Patent Literature (113)

Drapeau, A.L. et al. “Striped Tape Arrays”, IEEE Symposium on Mass Storage Systems, p.(s):257-265, 1993.Applicant
Birk, Y, “Deterministic Load-Balancing Schemes For Disk-Based Video-on-Demand Storage Servers”, IEEE Symposium on Mass Storage Systems, p.(s):17-25, 1995.Applicant
Liu et al., “Performance of a Storage System For Supporting Different Video Types and Qualities”, IEEE Journal on Selected Areas in Communications, p.(s):1314-1331, 1996.Applicant
Chen et al., “RAID: High Performance, Reliable Secondary Storage”, ACM Computing Surveys, vol. 26, No. 2, p.(s) 145-185, 06/1994.Applicant
Triantafillou et al., “Overlay Striping and Optimal Parallel I/O For Modern Applications”, Parallel Computing, p(s) 21-43, 1997.Applicant
Buddhikot et al., “Design of large Scale Multimedia Storage Server”, Computer Networks and ISDN Systems, pp. 503-517, 1994.Applicant
Flynn, R et al., “Disk Striping and Block Replication Algorithms for Video File Servers”, IEEE Proceedings of Multimedia Applications, pp. 590-597, 1996.Applicant
Ganger, G.R et al., “Disk Subsyster Load Balancing: Disk Striping VS Conventional Data Placement”, IEEE transactions on Computers, p.(s) 40-49, 1993.Applicant
Adam, Joel F., et al., “A Network Architecture for Distributed Multimedia Systems”, Proc. IEEE Intl. Conf. Multimedia, 1994, pp. 76-85.Applicant
Alemany, Juan, et al., “Random Striping for News on Demand Servers,” Dept. of Computer Science & Engineering, University of Washington, Feb. 1997,pp. 1-15.Applicant
Anderson, David P., “Real-time Disk Storage and Retrieval of Digital Audio/Video Data,” Computer Science Div., University of California at Berkeley, Aug. 8, 1991, pp. 1-26.Applicant
Anderson, David P., “Meta-Scheduling for Distributed Continuous Media,” Computer Science Division, University of California at Berkeley, Oct. 4, 1990, pp. 1-32.Applicant
Asami, Satoshi, et al., “The Design of Large-Scale, Do-It-Yourself RAIDs,” Nov. 10, 1995, pp. 1-30.Applicant
Baker, Mary, et al, “Availability in the Sprite Distributed File System”, in Operating Systems Review, Apr. 1991, 4 pages.Applicant
Bartal, Yair, et al., “The Distributed κ-Server Problem—A Competitive Distributed Translator For κ-Server Algorithms”, 1992 IEEE, pp. 344-353.Applicant
Berson, Steven, et al, “Randomized Data Allocation for Real-time Disk I/O”, Compcon 96, pp. 286-290, 1996.Applicant
Bestavros, Azer, “An Adaptive Information Dispersal Algorithm for Time-Critical Reliable Communication”, In Network Mgmt. and Control, vol. II, pp. 423-438, Plenum Pub., 1994.Applicant
Birk, Yitzhak, “Random RAIDs with Selective Exploitation of Redundancy for Higher Performance Video Servers”, EE Department, Israel Institute of Technology, 1997 IEEE, pp. 13-23.Applicant
Bohossian, Vasken, et al., “Computing in the RAIN: A Reliable Array of Independent Nodes,” California Institute of Technology, Dec. 3, 1998, pp. 1-19.Applicant
Bolosky, William J., et al., “The Tiger Video Fileserver,” Technical Report, Sixth International Workshop on Network and Operating System Support for Digital Audio and Video, Apr., 1996.Applicant
Brinkmann, André, et al., “Efficient, Distributed Data Placement Strategies for Storage Area Networks”(Date Unknown).Applicant
Brubeck, David W., et al., “Hierarchical Storage Management in a Distributed VOD System”, University of California at Berkeley, IEEE Multimedia, Fall 1996, pp. 37-47.Applicant
Buddhikot, Milind M., et al., “Design of a Large Scale Multimedia Storage Server”, Computer Networks and ISDN Systems 27, 1994, pp. 503-517.Applicant
Cabrera, Luis-Felipe, et al, “Swift: Using Distributed Disk Stripping to Provide High I/O Data Rates”, Computing Systems 4, Fall 1991, pp. 405-436.Applicant
Devarakonda, Murthy, et al, “Recovery in the Calypso File System”, ACM Transactions on Computer Systems, vo. 14, No. 3, Aug. 1996, pp. 287-310.Applicant
Gifford, David K., et al, “The Cedar File System,” Communications of the ACM, vol. 31, No. 3, Mar. 1998, pp. 288-298.Applicant
The Computer Science and Engineering Handbook; A CRC Handbook, 1997, pp. 1851-1869.Applicant
Copeland, George, et al., “Data Placement in Bubba”, ACM, 1988, pp. 99-108.Applicant
Coyne, Robert A., et al., “Storage Systems for National Information Assets”, Lawrence Livermore National Laboratory, IEEE, 1992, pp. 626-633.Applicant
Dan, Asit, et al., “Buffering and Caching in Large-Scale Video Servers”, IBM Research Division, Compcon, 1995.Applicant
Dannengberg, Roger B., et al., “A Comparison of Streams and Time Advance As Paradigms For Multimedia Systems,” Carnegie Mellon Information Technolgy Center, Mar. 1994, pp. i-18.Applicant
Dias, Daniel M., et al., “A Scalable and Highly Available Web Server”, IBM Research Division, Proc. IEEE, Compcon 1996, pp. 85-92.Applicant
Dibble, Peter C., et al., “Bridge: A High-Performance File System for Parallel Process”, Proc. 8th Intl. Conf. Dist. Comp. Sys., Jun. 1988, pp. 154-161.Applicant
Elnozahy, E.N., “Storage Strategies for Fault-Tolerant Video Servers,”Carnegie Mellon University, Aug. 1996, pp. 1-11.Applicant
Encyclopedia of Computer Science, Third Edition, 1993 “Distributed Systems,” pp. 476-555. “Network Architecture,” pp. 920-929. “Operating Systems,” pp. 966-989.Applicant
Escobar-Molano, Martha L., “An Optimal Resource Scheduler for Continuous Display of Structured Video Objects,” IEEE Transactions on Knowlegde and Data Engineering, vol. 8, No. 3, Jun. 1996, pp. 508-511.Applicant
Federighi, Craig, et al., “A Distributed Hierarchical Storage Manager for a Video-on-Demand System”, ISAT/SPIE, Feb. 1994, pp. 1-13.Applicant
Feuquay, Jay, “A Distributed Parallel Storage Architecture and its Potential Application Within EOSDIS”, In Proc. 4th NASA GSFC Mass Storage, Mar. 1995.Applicant
Flynn, Robert, et al., “Disk Striping and Block Replication Algorithms for Video File Servers”, XP-002105211, IEEE Proceedings of Multimedia 1996, pp. 590-597.Applicant
Ganger, Gregory R., et al., “Disk Subsystem Load Balancing: Disk Striping vs. Conventional Data Placement”, IEEE 1993, pp. 40-49.Applicant
Ghandeharizadeh, Shahram, et al., “Continuous Retrieval of Multimedia Data Using Parallelism,” IEEE Transactions on Knowledge and Data Engineering, vol. 3, No. 4, Aug. 1993, pp. 658-669.Applicant
Gibson, Garth A., et al., “A Case for Network-Attached Secure Disks”, Carnegie Mellon University, SMU-CS-96-142, Sep. 26, 1996.Applicant
Gollapudi, Sreeivas, et al., “Net Media: A Client-Server Distributed Multimedia Database Environment,” University at Buffalo, Dept. of Computer Science, Technical Report 96-06, Apr. 1996, pp. 1-17.Applicant
Haskin, Roger L., et al, “The Tiger Shark File System”, Proc. IEEE Computer Conference, Mar. 1996, pp. 226-231.Applicant
Haskin, Roger L., “Tiger Shark—a scalable file system for multimedia”, in IBM Journal of Research and Development, vo. 42, No. 2, Mar. 1998, pp. 185-197.Applicant
Hartman, John H., et al., “The Zebra Striped Network File System,” ACM Transactions on Computer vol. 13, No. 3, Aug. 1995, pp. 274-310.Applicant
Hsieh, Jenwei, et al., “Performance of a Mass Storage System for Video-on-Demand,” Journal of Parallel and Distributed Computing, vol. 30, 1995, pp. 147-167.Applicant
Keeton, Kimberly, “The Evaluation of Video Layout Strategies for a High-Performance Storage Server,” Computer Science Division, University of California, Berkeley, Nov. 1995, pp. 1-27.Applicant
Krishnamurthy, A., et al., “Connection-Oriented Service Renegotiation for Scalable Video Delivery,” May 1994, In Proc. of 1st IEEE Intl. Conf. on Multimedia Computer and Systems (ICMCS '94), pp. 502-507.Applicant
Ladin, Rivka, et al., “Providing High Availability Using Lazy Replication,” ACM Transactions on Computer Systems, vol. 10, No. 4, Nov. 1992, pp. 360-391.Applicant
Lee, Edward K., et al, “Petal: Distributed Virtual Disks”, in The Proceedings of 7th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, 1996, 9 pages.Applicant
Li, Qing, et al., “A Dynamic Data Model for a Video Database Management System,” ACM Computing Surveys, vol. 27, No. 4, Dec. 1995, pp. 602-606.Applicant
Lin, Ying-Dar, “A Hierarchical Network Storage Architecture for Video-on-Demand Services”, atopma; Chiao Tung University, IEEE 1996, pp. 355-364.Applicant
Liskov, Barbara, “Replication in the Harp File System,” ACM 1991, pp. 226-238.Applicant
Little, T.D.C., et al., “Probabilistic Assignment of Movies to Storage Devices in a Video-on-Demand System”, In Proc. 4th Intl. Workshop of Network and OS for Digital Audio and Video, Nov. 1992, pp. 213-224.Applicant
Menascé, Daniel A., “An Analytic Model of Hierarchical Mass Storage Systems with Network-Attached Storage Devices”, Sigmegtrics 1996 ACM, pp. 180-189.Applicant
Microsoft NetShow Professional Video Server Data Sheets: “How it Works” “Markets & Applications” “NetShow Pro Specifications” “Overview”.Applicant
Miller, Ethan L., et al., “RAMA: A Filesystem for Massively Parallel Computers”, Proc. 12th IEEE Symp. Mass Storage, 1993, pp. 163-168.Applicant
Miller, Ethan L., “RAMA: Easy Access to a High-Bandwidth Massively Parallel File System”, 1995 USENIX Technical Conf., Jan. 16-20, 1995, pp. 59-70.Applicant
Muntz, Richard, et al, “Design of a Fault Tolerant Real-time Storage System for Multimedia Applications”, in 1998 Intl. Computer Performance and Dependability Symposium (IPDA'98), Sep. 1998.Applicant
Narendran, B., et al, “Data Distribution Algorithms for Load Balanced Fault-Tolerant Web Access”, XP-002105212, IEEE 1997, pp. 97-105.Applicant
Neufeld, Gerald, “Design of a Variable Bit Rate Continuous Media File Server for an ATM Network,” University of British Columbia, Jul. 11, 1995, pp. 1-11.Applicant
O'Keefe, Matthew T., “Shared File Systems and Fibre Channel”, University of Minnesota, Mar. 1998.Applicant
Oomoto, Eitetsu, et al, “OVID: Design and Implementation of a Video-Object Database System”, IEEE 1993, pp. 629-643.Applicant
Ozden, Banu, “Fault-tolerant Architectures for Continuous Media Servers”, Proc. ACM SIGMOD Intl. Conf., Jun. 1996, pp. 79-90.Applicant
Popek, Gerald J., et al “Replication in Ficus Distributed File Systems”, Proc. Workshop Mgmt. Replicated Data, 1990, pp. 5-10.Applicant
Rabin, Michael, “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” Journal of the Association for Computing Machinery, vol. 36, No. 2, Apr. 1989, pp. 335-448.Applicant
The RAIDbook, A Source Book for Disk Array Technology, Fourth Edition, Aug. 8, 1994, pp. ii-45.Applicant
Rakow, Thomas C., et al, “The V3 Video Server—Managing Analog and Digital Video Clips”, ACM Computing Surveys, 1993, pp. 556-557.Applicant
Reddy, A.L. Narasimha, “Disk Scheduling in a Multimedia I/O System”, Proc. 1st Intl. ACM Conf. on Multimedia, Aug. 1-6, 1993.Applicant
Rowe, Lawrence, et al., “A Continuous Media Player”, Proc. 3rd Int. Workshop on Network and OS Support for Digital Audio and Video, Nov. 1992.Applicant
Rowe, Lawrence, et al., “Indexes for User Access to Large Video Databases”, ISAT/ISPIE, Feb. 1994, pp. 1-10.Applicant
Rowe, Lawrence, et al., “MPEG Video in Software: Representation, Transmission, and Playback”, ISAT/ISPIE, Feb. 1994, pp. 1-11.Applicant
Sandsta, Olay, et al, “Video Server on an ATM Connected Cluster of Workstations”, XVII International Conference of the Chilean Computer Science Society, Nov. 1997.Applicant
Santos, Jose Renato, et al, “Comparing Random Data Allocation and Data Striping in Multi-media Servers”, Sigmetrics 2000, ACM, pp. 44-55.Applicant
Santos, Jose Renato, et al, “Design of the RIO (Randomized I/O) Storage Server”, UCLA CSD Tech Rp., Jun. 1997.Applicant
Satyanarayanan, Mahadev, et al, “Coda: A Highly Available File System For A Distributed Workstation Environment”, IEEE, vol. 39, No. 4, Apr. 1990, pp. 447-459.Applicant
Shenoy, Prashant J. et al, “Efficient Striping Techniques for Multimedia File Servers”, Dept. of Computer Sciences, University of Texas at Austin, TR 96-27, Oct. 1996.Applicant
Shenoy, Prashant J. et al, “Issues In Multimedia Server Design”, Dept. of Computer Sciences, University of Texas at Austin, ACM Computing Surveys, vol. 27, No. 4, pp. 636-639, Dec. 1995.Applicant
Shillner Robert A. et al, “Simplifying Distributed File Systems Using a Shared Logical Disk”, Dept. of Computer Science, Princeton University, Tech. Rep. 524-96, (1996).Applicant
Siegal, Alex et al, “Deceit: A Flexible Distributed File System”, (1992), Proc. IEEE, 1990, pp. 15-16.Applicant
Software Patent Institute Database of Software Technologies, “Interactive Computer/Video Server”, Aug. 1991.Applicant
Software Patent Institute Database Software Technologies, “MMPacking: Load and Storage Balancing Algorithm for Distributed Multimedia Servers”, Apr. 1996.Applicant
Soltis, Steven R., et al, “The Global File System” Dept. of Electrical Engineering and Laboratory for Computational Science and Engineering, University of Minnesota, Proceedings of the Fifth NASA Goddard Space Flight Center Conference on Mass Storage Systems and Technologies, Sep. 1996, pp. 1-23.Applicant
Stephenson, Thomas et al, “Mass Storage Systems for Image Management and Distribution” Twelfth IEEE Symposium on Mass Storage System, IEEE 1993, pp. 233-240.Applicant
Teaff, Danny, et al, “The Architecture of the High Performance Storage System (HPSS)”, Proc. Goddoard Conf. Mass Storage, Mar. 1995.Applicant
Tewari, Renu et al, “Design and Performance Tradeoffs in Clustered Video Servers” 1996, IEEE Proceedings of Multimedia '96, 27 pages.Applicant
Tewari, Renu et al, “High Availability in Clustered Multimedia Servers” IBM Research Division and Dept. of Computer Science, University of Texas at Austin, Feb. 26, 1996. pp. 645-654.Applicant
Tewari, Renu et al, “Placement of Multimedia Blocks on Zoned Disks”, Proceedings IS&T, SPIE Mult. Comp. Net., Jan. 1996.Applicant
Tewari, Renu et al, “Real-Time Issues for Clustered Multimedia Servers”, IBM Research Report, RC 20020, Apr. 1995.Applicant
Thekkath, Chandramohan, et al, “Frangipani: A Scalable Distribute File System”, Proc. 16th ACM Symp. Oper. Sys. Princ., Oct. 1997, pp. 224-237.Applicant
Tierney, Brian et al, “Distributed Parallel Data Storage Systems: A Scalable Approach to High Speed Image Servers”, Proceedings ACM Multimedia, Oct. 1994.Applicant
Tierney, Brian et al, “The Image Server System: A High-Speed Parallel Distributed Data Server”, Lawrence Berkeley Laboratory Technical Report, LBL-36002, 1994, pp. 1-12.Applicant
Tierney, Brian et al, “System Issues in Implementing High Speed Distributed Parallel Storage Systems”, Proceedings USENIX High Speed Networking, Aug. 1994.Applicant
Tierney, Brian L. et al, “Using High Speed Networks to Enable Distributed Parallel Image Server Systems”, Proceedings Supercomputing (IEEE), Nov. 1994.Applicant
Triantafillou, Peter et al, “Overlay striping and optimal parallel I/O for modern applications”, Parallel Computing 24, 1998, pp. 21-43.Applicant
Walker, Bruce, et al, “The LOCUS” Distributed Operating System, University of California at Los Angeles, ACM 1983, pp. 49-70.Applicant
Wil, Uffe et al, “Hyperform: A Hypermedia System Development Environment”, ACM Transactions on Information Systems, vol. 15, No. 1, Jan. 1997, pp. 1-31.Applicant
Wittenburg, T.M. et al, “An Adaptive Document Management System for Shared Multimedia Data”, In Proceedings 1994 IEEE Intl. Conf. Multimedia, May 1994.Applicant
Wu, Min-You, “Scheduling for Interactive Operations In Parallel Video Servers”, University at Buffalo, Department of Computer Science Technical Report 96-23, Dec. 1996.Applicant
Wu, Min-You, “Scheduling for Large-Scale Parallel Video Servers”, University at Buffalo, Department of Computer Science Technical Report 96-09, May 1996.Applicant
Alemany, Juan A., “Data Placement Algorithms for News-On-Demand Servers”, A Dissertation submitted . . . University of Washington. Dec. 2, 1997, pp. ii-127.Applicant
Chee, Michael A.L. Sam, “Scheduling in the Server of a Distributed Multimedia Information System”, A Thesis presented to the University of Waterloo, 1991, pp. 1-222.Applicant
Chervenak, Ann Louise, “Tertiary Storage: An Evaluation of New Applications”, A Dissertation submitted . . . to University of California at Berkeley, 1994, pp. 1-175.Applicant
Dahlin, Michael Donald, “Severless Network File Systems”, A Dissertation submitted . . . University of California at Berkeley, 1995, pp. 1-166.Applicant
Erickson, Grant M., “The Design and Implementation of the Global File System in Silicon Graphics' Irix”, Requirements for the Degree of MS submitted to the University of Minnesota, Mar. 1998, 1-45.Applicant
Liu, Chien-Liang (Jonathan), “Effective Schemes To Guarantee The Real-Time Retrieval Of Digital Continuous Media”, A Thesis submitted to . . . University of Minnesota, Jul. 1996, pp. 1-160.Applicant
Miller, Ethan Leo, “Storage Hierarchy Management for Scientific Computing”, A Dissertation submitted . . . University of California at Berkeley, 1995, pp. 1-120.Applicant
Mitzenmacher, Michael David, “The Power of Two Choices In Randomized Load Balancing”, A Dissertation submitted to . . . University of California at Berkeley, Fall 1996, pp. 1-115.Applicant
Sandhu, Harjinder Singh, “File Replication and Performance in Large-Scale Distributed Systems”, A Thesis submitted . . . University of Toronto, Jan. 1991, 1-117.Applicant
Siegal, Alexander, Ph.D., “Performances in flexible distributed file systems”, A Dissertation . . . Conell University, May 1992, pp. 1-163.Applicant
Soltis, Steven R., “The Design and Implementation of a Distributed File System based on Shared Network Storage”, A Thesis . . . University of Minnesota, Aug. 1997, pp. 1-111.Applicant
Tan, Shih-Shan, Ph.D., A distributed file system server for networked multiprocessor workstations, a UMI Dissertation . . . Arizona State University, May 1989.Applicant

Abstract