|Publication number||US6412017 B1|
|Application number||US 08/673,929|
|Publication date||Jun 25, 2002|
|Filing date||Jul 1, 1996|
|Priority date||Jul 1, 1996|
|Also published as||US7200847, US7430744, US7788678, US7814499, US20020144252, US20060136484, US20060200831, US20070162519|
|Publication number||08673929, 673929, US 6412017 B1, US 6412017B1, US-B1-6412017, US6412017 B1, US6412017B1|
|Inventors||Dave D. Straube, Aaron M. Contorer, Arnold S. Miller, Balan S. Raman, Pradyumna K. Misra, Michael R. C. Seaman|
|Original Assignee||Microsoft Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (42), Non-Patent Citations (19), Referenced by (92), Classifications (7), Legal Events (6)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention relates generally to facilities for replicating data in a distributed system, and more particularly to an improved facility for urgently replicating data in a distributed network environment.
In a distributed network environment, multiple copies of replicated data, such as multiple copies of files, objects, directory structures, programs or databases, are typically distributed throughout the network. For example, in a wide area network (WAN) comprised of multiple local area networks (LANs), a separate copy of replicated data may reside in at least one file server or workstation located on each of the LANs.
A benefit to having replicated data in the above-described distributed network includes facilitating access to the replicated data by each of the nodes on the network. Nodes may simply obtain the desired data locally on their LAN rather than seeking the data from another node on the WAN in a perhaps more costly and time-consuming manner. In addition, replicated data helps to distribute the load on any given node that would otherwise have to maintain the data and respond to all requests for such data from all other nodes on the network. A further benefit includes enhancing system reliability, e.g., no one node (which may fail) exclusively possesses access to required data. Databases, network directory services and groupware are typical products that take advantage of replication.
Since the replicated data may change and multiple copies of the replicated data are distributed throughout the network, replication facilities must typically employ some scheme for reconciling any differences and ensuring a certain amount of consistency between the replica set. A replica set is considered to have strong consistency if the changes to the data are reconciled simultaneously throughout the set at some ordained time. Weak consistency is a concept which allows the replicas to be moderately, yet tolerably, inconsistent at various times.
As can be appreciated, maintaining strong consistency generally requires the use of more resources, e.g., at least in terms of reduced available bandwidth. Moreover, strong consistency becomes more and more impractical, and at some point almost impossible, to guarantee as the numbers of replicas increase in a distributed system. This is mostly due to performance limitations, network partitioning, and the like. Consequently, most replicated systems implement some level of weak consistency.
An improved replication facility which provides a standardized interface for replication that can be used regardless of the underlying file system is described in commonly assigned U.S. patent application Ser. No. 08/181,704, now U.S. Pat. No. 5,588.147, the entire description found therein being incorporated herein by reference. For ease of understanding, the general replication topology described therein can be thought of as a graph of unidirectional edges where changes are transmitted from a source to a destination. Replication occurs pairwise and in one direction. In other words, the destination is responsible for originating a request for replication from the source. This technique is known as pulling, since the destination attempts to pull the data from the source.
In this facility, a cursor is maintained at the destination for each connection (edge) it has to a source from which it pulls data. The cursors track the last change information received by the destination from the respective sources. Using a cursor, when a destination requests updates from a given source, the source provides the destination with 1) a list of objects (or other data structures) that have changed and 2) the type of change which has occurred for each object since the last replication to that destination. To avoid unnecessary transmission, the source also filters from this list any change items which it knows were originated or propagated by the requesting destination. The source then updates the cursor maintained at the destination based upon the replication information provided during that replication cycle.
After the list of changes is received at the destination, each object identified in the list attempts to reconcile itself with its counterpart object at the source using a class-specific reconciler. Class specific reconcilers allow each class of object to define for itself what it means to be consistent with other replica objects in its class. If a class specific reconciler is not available for a given data structure, e.g., a text file, then a default reconciler is used, which utilizes, for example, a “last writer wins” algorithm.
Because the above replication facility is “pull” driven by the destination, replication data is only sent to the destination at discrete intervals of time, usually set according to policies defined by the network system administrator and/or the system administrators of the source and destination. Moreover, to conserve network resources (such as available bandwidth), the discrete intervals of time are often set so as to provide only weak consistency.
As a result of the delay between time intervals, a relatively substantial amount of time may occur between replications. Although some delay is ordinarily acceptable with many types of replicated data, significant potential problems may arise with other types of data structures. In particular, changes to certain classes of objects such as password or access rights changes to user objects cannot be unduly delayed if system security is to be maintained.
As discussed above, the solution of decreasing the time interval between replications is not always practicable or even possible. Other solutions have been considered such as 1) tracking the differences between changed data structures to reduce the amount of data that needs to be transmitted during replication, i.e., data logging, or 2) expediting the replication of certain objects. However, such prior art solutions have required that the replicas possess both substantial knowledge of the complete replication topology and/or intimate knowledge of the operating environment of the other replicas. In other words, the replicas need to possess knowledge and/or assurance that all replicas are of similar implementation, e.g., that the replicas have been implemented on uniform homogeneous object sets thereby obviating the above difficulties. As such, these solutions are not amenable to a distributed system wherein the replicas may have different file systems and/or many object types. Similarly, objects created by third parties cannot be easily replicated unless those objects are created with specific knowledge of the topology and file systems in which they may be replicated.
Accordingly, a primary objective of the present invention is to provide a system and method of efficiently replicating data objects in a distributed system of replicas.
In accomplishing that objective, it is an aim of the invention to provide a replication facility that maintains incremental differencing information and replicates the differencing information upon a request for replication.
It is also an objective of the invention to provide a replication facility that enables the expedited replication of certain data objects deemed urgent.
It is a related objective to provide a replication facility wherein an object may initiate its propagation to other replicas in the system.
Another objective of the invention is to provide a system and method for replicating objects in an object-oriented environment.
Still another objective of the invention is to provide a system and method for replicating objects wherein any object can be replicated throughout one or more replicas in the system without the need for the object to have knowledge of the replication topology or the operating environment.
It is a related objective to provide a replication facility that is extensible and replicates objects independent of the type of file systems used to store those objects.
Briefly, the present invention provides a system and method for expediting the replication of at least one specified object to a replica in a distributed computer system. A source object informs a source replica that it has changed, and the source extracts change information from the object. The source replica transmits information representative of the change to a destination replica, and the information is received at destination replica. The destination replica extracts the change information from the received information, and provides the change information to a replica object of the destination.
Other objects and advantages will become apparent from the following detailed description when taken in conjunction with attached drawings, in which:
FIG. 1 is a block diagram showing a representative distributed system in which the invention may be implemented and having a number of computer resources connected in a networked fashion;
FIG. 2 is a block diagram illustrating the details of the replication facility contained within the distributed operating system shown in FIG. 1;
FIG. 3 is a block diagram representing the general architecture and functional components of the replication facility suitable for use with the present invention;
FIG. 4 is a block diagram representing how replication information is exchanged between a remote source and a local destination;
FIG. 5 is a block diagram representing an area of memory within a workstation of FIG. 1 wherein information is logged corresponding to changes made to objects;
FIG. 6 is a flow diagram illustrating the steps taken when replicating and reconciling an object;
FIG. 7 is a representation of an object which is deemed to be an urgent object; and
FIG. 8 is a flow diagram illustrating the steps taken when replicating an urgent object.
While the invention is amenable to various modifications and alternative constructions, a certain illustrated embodiment thereof has been shown in the drawings and will be described below in detail. It should be understood, however, that there is no intention to limit the invention to the specific form disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention.
Turning to the drawings and referring first to FIG. 1, there is shown a block diagram of a distributed system, generally designated 20, in which the replication facility of the present invention may be implemented. The distributed system 20 illustrated herein comprises a number of computer-based resources 22 1-22 5, 24 1-24 2 and 26 interconnected in a networked fashion on an interconnection mechanism 28, which may be a local area network, wide area network or other distributed interconnection mechanism. The distributed system shown in FIG. 1 is intended to be exemplary of the type of distributed systems which are suitable for implementing the present invention.
Although not explicitly shown in FIG. 1, the present invention may be implemented in a multiple bus network topology, for example where a network server links multiple networks together, including configurations wherein the networks are running separate network operating systems. In addition, the present invention may be implemented on various types of networking topologies including bus, ring or star topologies.
Physically, the interconnection mechanism 28 may include any well-known data transmission medium, such as coaxial cable, fiber optic cable, or the like, in accordance with a chosen standard for hardware interfaces within each of the devices. Such standards, including ARCnet®, Ethernet® and Token Ring®, and their associated hardware interfaces, are well known in the art, and thus are not described in detail herein. Suffice it to say that a wide variety of interface hardware and software are commercially available to connect computer-based resources in a distributed system.
The distributed system 20 includes client workstations 22 1-22 5 which may be personal computers or the like, each including a memory 30 1-30 5 having a distributed operating system 32 loaded therein. In the described embodiment, each workstation 22 1-22 5 acts as a replica by maintaining a copy of the replicated data in its own file system. There is no requirement that the file systems of the various workstations be the same. Other devices, such as other workstations (not shown), network servers 24 1-24 2, a printer 26 and routers (not shown) are also present in the system 20.
The replication facility of the present invention is capable of replicating data independent of the specific file systems employed. Indeed, the replicas may be maintained in a memory independent of any file system. For example, a replica set may be maintained in the non-volatile random access memory (NVRAM) of a personal data assistant (PDA) or the like. However, for simplicity herein the replicas are generally referred to as being maintained in a file system.
In keeping with one aspect of the invention, as best shown in FIG. 2 the distributed operating system 32 of the workstations includes a replication facility 34 for replicating data structures throughout the system 20. Although virtually any type of data structure including files and file directories may be replicated by the replication facility 34, replicated data structures will hereinafter ordinarily be referred to as objects, both for purposes of simplicity and because the replication facility 34 is particularly suitable for object-oriented environments. As described in more detail below, the preferred replication facility 34 includes a reconciler 36 which applies the differencing information to change the namespace and/or content of a local object (on a given one of the workstations) to reflect changes made to a remote object (on another of the workstations). Such replication and reconciliation are performed on a pair-wise basis and in one direction, and enables multiple copies of objects to be replicated and reconciled across the distributed system 20. As used herein, the term “replication” should be considered as referring to both the replication and reconciliation of objects, where appropriate.
As shown in FIG. 3, in order to replicate objects among the replicas, which may exist on potentially different file systems, the distributed operating system 32 provides a replication engine comprising a standardized group of interfaces, known as ReplStore 38 (replicated object store). Clients call a ReplStore manager 40 which loads the appropriate ReplStore interfaces 38 according to the underlying file system. The ReplStore manager 40 also regulates access to the ReplStore interfaces 38. Both the ReplStore manager 40 and the ReplStore interfaces 38 are preferably provided in one or more Dynamic Link Libraries (DLLs), but may be provided in other ways, such as via drivers.
Using the ReplStore interfaces 38 thus provides the replication facility with access to the objects to be replicated regardless of the underlying file system. The ReplStore interfaces 38 specify signatures (such as parameters) so that the code for implementing the appropriate replication function or functions may be executed. The code that implements the function is ordinarily provided by objects or alternatively by other known implementations. In an object oriented system, the objects that provide the code comply with the signature specified in the interface, and are referred to as objects which “support” the interface. For example, an object store which stores objects in an object set may be configured to support the ReplStore interfaces 38 so that the objects of that object set may be replicated throughout the system.
As shown in FIG. 4, each workstation 22 in the distributed system having a replica includes a local object replicator agent (ORA) 42, which can interface with one or more remote ORAs 44 on the other workstations. The local ORA 42 is a replicator service that provides automatic support for replication. The local ORA 42 loads its ReplStore manager Dynamic Link Library (DLL) 40, which in turn loads the ReplStore interface 38 as previously described. Considered from the perspective of a local workstation such as the workstation 22 2, the local ORA 42 is responsible for communicating with a remote ORA 44 to facilitate the replication of changed objects. The local ORA 42 may be configured as remote procedural call (RPC) to service the replication requests of remote clients. Alternatively, other appropriate synchronous or asynchronous transport mechanisms may be utilized for replication, such as electronic mail, file transfer or direct network connections.
To reconcile the local object set with a remote object set, the local ORA 42 contacts the remote ORA 44 and provides information via a cursor 50 (FIG. 5) to the remote ORA 44 indicating the point (e.g., in time or any other monotonically increasing indicator of file system activity) from which replication is desired. The remote ORA returns changed object information to the local ORA 42 along with an updated cursor having information therein indicative of what point the source is at (e.g., an updated time stamp) with respect to the returned replication information. This updated replication point is stored at the destination 22 2 in the cursor 50 for that source 22 1, for use during the next replication cycle. Once the change information is present locally, the local ORA 42 invokes both the default and class specific reconcilers 88 and 90 to update its objects so as to be consistent with those of the remote replica which have changed since the point (e.g., time) identified in the cursor 50.
According to one aspect of the invention, because it is generally inefficient to transfer the entire object each time replication is desired, if an object is properly configured, the replication facility 34 of the present invention ordinarily attempts to communicate only the differencing information, i.e., changes made to an object rather than the changed object itself, whenever possible. This concept is referred to as incremental replication. Of course, the facility 34 may be arranged to transfer the entire object when it determines that the size of the object makes it more efficient to do so than to transfer and apply the differencing information.
In the situation where the object file system (OFS) is employed at a given workstation, to communicate the differencing information, the replication facility 34 according to the present invention utilizes information maintained in the OFS to optimize replication. By way of background, when OFS diskspace is initially formatted, an update sequence number (USN) is set to some floor value, (e.g., zero) in the OFS for that diskspace. After every create, modify, rename, delete or move operation, the USN is monotonically adjusted, i.e., increased for that disk volume. The OFS also maintains a move/rename/delete log that tracks changes to the name of an object. Unlike time (which can be modified and reset), USNs are only advanced. Therefore, it is preferable to utilize the USN for the cursor rather than a time stamp whenever the source node employs the OFS.
In operation, as shown at step 100 of the flow diagram of FIG. 6, when a destination (e.g., workstation 22 2) requests replication via its ORA to a connected source (e.g., workstation 22 1), it sends the source a cursor 50 (FIG. 5). The cursor 50 identifies from what point it last received replication information from that source, that is, the cursor 50 includes the USN and/or a time stamp (or whatever monotonic pointer the ReplStore uses to track file system activity) that was previously provided to it by the source 22 1 during the last replication. Thus, the destination 22 2 is essentially asking the source for all changes to objects it has had since the last cursor. The cursor 50 is relative to the source 22 1, so that even if a time stamp rather than a USN or the like is used, any time difference between the source 22 1 and the destination 22 2 is immaterial.
At step 102 the source 22 1 obtains a list of changes (including differencing information) in change log 52 and returns the list to the destination 22 2 when feasible. The individual change items 54 1—54 n in the list 52 can either be logged as they are made to objects at the source, or dynamically rebuilt from stored information. For example, if the OFS is employed, the change log 52 can be dynamically rebuilt from the USN entries 56 and the move/rename/delete log 58 in the OFS diskspace 60 (FIG. 3). Regardless of how the list 52 is obtained, as shown in FIG. 5 each changed item 5 4—54 n returned to the destination includes a type field 62 indicative of whether an object has undergone a create, modify, rename, delete or move operation, along with a serialized replication object identifier (ROBID) in field 64 that identifies which object has changed. A time stamp and the USN (if OFS) or equivalent pointer(s) corresponding to that change are provided in fields 66 and 68, respectively. Also included is a replication information block (RIB) 70.
The RIB 70 is used for propagation dampening, i.e., to determine if a change needs to be propagated to a particular node so that changes are only propagated once to each replica node in the system. To this end, the RIB 70 comprises 1) an originator field 72 that indicates which node in the distributed system of replicas originated the change, and 2) a propagator field 76 indicative of which replica in the distributed system propagated the change to the source 22 1. The originator field 72 will be the same as the propagator field 76 when the resource in which a change was originated was the one that propagated it to the source 22 1. To minimize network traffic, the source 22 1 reviews the change log and filters out change items 54 that were originated or propagated by the requesting destination 22 2 before transmission to the destination 22 2. However, because the content and the access rights on an object (security) can be separately changed and propagated, the RIB includes both content and security components, and treats each type of change separately with regard to propagation dampening. Thus, for example, if a security change is made at replica A for a given object while a content change is made at replica B for that same object, the respective changes will be propagated to the other replica and not filtered out, regardless of which direction was propagated first.
The change log 52 also includes a change data field 74 for transferring the difference information of MODIFY change types should the object class support differencing. If the object supports differencing, the source side ORA service fills in this data field with differencing information provided by the object. Significantly, the objects themselves can be appropriately configured to define the content of the change data field 74 independent of any prior agreements with the replication facility 34. Thus, objects created by third parties can essentially log and later apply the differencing information according to their own definitions.
When the change log 52 is received from the source 22 1 (step 106), the ORA of the destination 22 2 invokes the appropriate reconcilers 88 or 90 to make its objects consistent with those at the source 22 1. If the object is configured to apply differencing information, the class specific reconciler 88 applies the differencing information in data field 74 to each object identified in ROBID field 64 according to information contained in the object itself. This may or may not include information such as class information, but in any event enables the object itself to determine what it means to be consistent with its counterpart objects at other replicas. In essence, an object created by a third party capable of functioning with differencing information thus determines its own level of consistency with its counterpart replicas.
As shown in FIG. 2, the reconciler 36 contains a control component 80, a reconciler component 82, and a copying component 84 for duplicating objects. The control component 80 determines when reconciliation occurs, for example, upon a request to reconcile or after a certain amount of time. The control component 80 also provides security and determines who can request reconciliation.
The replication facility 34 of the present invention is capable of performing regular replication with objects that are not configured to perform incremental replication as described herein. For example, if an object at a remote source does not provide its changes, but instead is arranged to perform class-specific reconciliation, the replication facility 34 handles the class-specific reconciliation on its objects, as described in U.S. patent application Ser. No. 08/181,704, now U.S. Pat. No. 5,388,147. Thus, at steps 110-111 the control component 80 also determines the type of reconciliation for each object based upon what information was received from the destination.
The reconciler component 82 provides the functions that perform the various types of reconciliation as determined by the control component 80. Thus, the reconciler component 82 includes a class specific reconciler 88 capable of performing on-line class specific reconciliation (step 114) if the object provides a class. Optionally, if supported by an object's class code, a class specific reconciler may be provided that is capable of generating and consuming differences. Thus, in the preferred embodiment, at least one class specific reconciler will apply received differencing information to the objects according to instructions in the object (step 112), when differencing information is received from the source 22 1. Finally, a class independent reconciler 90 is also available when no class is specified, and functions according to a “last writer wins” rule to ensure identical content of objects (step 116).
When all objects in the log 52 have been reconciled as determined at step 118, the replication and reconciliation for that destination and source are completed.
By way of example of how an object is reconciled when the object has been configured to operate with differencing information, when a replicated object's content is changed at the source, a MODIFY operation is included in the cursor 50 as a change item. The type field 62 for the renamed object contains a value indicating that the object identified in ROBID field 64 was modified at the time stamp and USN (both relative to the source) that are present in fields 66 and 68, respectively. The originator content field 72 a and propagator content field 76 a in this instance both contain the identity of the source, since in the present example the object was renamed at that source. After the source side ORA service has received the MODIFY change from its corresponding ReplStore, the ORA service asks the object to generate differencing information (if the object supports differencing), which it then stores in the change data field 74.
When the differencing information is received, the destination 22 2 requests reconciliation via the control component 80, which recognizes the differencing information. The control component 80 invokes the class specific reconciler component 88 to apply the changes. The class specific reconciler, which supports differencing, evaluates the object for instructions on how to reconcile it with the provided differencing information. In this example, the class specific reconciler 88 would typically modify the content of the destination object so that the objects are consistent.
As can be appreciated, extraction, transmission and application of the differencing information are distinct steps which the replication service can individually optimize. For example, extraction (at the source) and application (at the destination) can be scheduled so as to not conflict with other activities or heavy system usage. Transmission can include compressing and/or encrypting the differencing information if desired, regardless of whether the objects themselves support compression or encryption. As previously described, transmission can utilize any suitable transport mechanism, either synchronous or asynchronous.
An advantage to the replication facility described herein is that the objects define the content of their own differencing information, and are not required to have knowledge of the replication service. Enabling objects to call such replication services provides for significant extensibility. Further, in the Object Linking and Embedding (OLE) model of the present invention, it can be dynamically determined whether an object supports the differencing interface. Consequently, as new classes of objects are added to existing systems, the replication service can immediately determine how replication can be optimized for that object.
Turning to another aspect of the invention, there is provided a mechanism within the above-described replication facility 34 that enables a changed object to propagate itself to its replicas without waiting for a destination to initiate a replication cycle. This type of replication will be referred to hereinafter as “urgent replication.” Urgent replication preferably functions on a push model, in which the source pushes a changed object to one or more destinations, although it is feasible to construct a pull model wherein a destination regularly polls a source seeking urgent changes. Alternatively, other types of replication of urgent objects may be accomplished. For example, the source may notify a destination that it has urgent changes available, whereby the destination will pull those changes when ready, after some time interval. The time interval may be zero.
To accomplish urgent replication, certain objects are configured to recognize changes to themselves that are defined to be urgent, as shown in step 200 of FIG. 8. By way of example, whenever the access rights or password of a user object is changed, the object can be arranged to report the change to the replication facility 34 using a function named ReplUrgentChangeNotify(), shown in FIG. 8 as step 202. Calling ReplUrgentChangeNotify() notifies the local ORA (via an RPC at step 204) that an object has an urgent change. Upon notification, the ORA promptly derives the urgent difference and propagates it as required. If the ORA service is not running, this function tags the object with a property time value at a field therein, as shown in field 94 in sample object 96 of FIG. 7. When the ORA service restarts, the timestamp is evaluated by the ORA service and if relatively recent, the urgent difference is derived and propagated as previously described.
At step 206, the replication facility 34 of the present invention evaluates the relative urgency of each object that has identified itself as being urgent, as determined according to policies set by the system administrator. For example, security-type changes may be considered urgent enough to propagate every three minutes, while group changes may be propagated every ten minutes. The differencing information is generated almost immediately after notification, but only a single difference is derived regardless of how many edges are present over which the difference will be replicated.
Thus, unlike incremental replication, at step 210 the ORA service, promptly, but synchronously, asks the object having an urgent change to generate its differencing information. Once the difference is obtained, a copy of it is delivered on each appropriate edge in the topology at step 212.
At step 214, the destination receives the differencing information and reconciles the objects as desired, preferably with relatively high priority. Communication between the source and destination takes place in the previously described manner over any suitable transport mechanism, however for security purposes synchronous replication is highly desirable. So that all replicas in the distributed system 20 receive the changes, the destination can be arranged to forward these urgent changes in a similarly urgent manner to other replicas that are not connected to the originating source.
As can be seen from the foregoing detailed description, there is provided a system and method for efficiently replicating data objects in a distributed system of replicas. The replication facility maintains incremental differencing information and replicates the differencing information upon a request for replication. The replication facility further enables the expedited replication of certain data objects deemed urgent, wherein a data structure may initiate its propagation to other replicas in the system. The replication facility replicates objects in an object-oriented environment, without the need for the replication objects to have knowledge of the replication topology or the operating environment. The replication facility is independent of the type of file systems used to store those objects, and is extensible.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4432057||Nov 27, 1981||Feb 14, 1984||International Business Machines Corporation||Method for the dynamic replication of data under distributed system control to control utilization of resources in a multiprocessing, distributed data base system|
|US4620276||Jun 2, 1983||Oct 28, 1986||International Business Machines Corporation||Method and apparatus for asynchronous processing of dynamic replication messages|
|US4714995||Sep 13, 1985||Dec 22, 1987||Trw Inc.||Computer integration system|
|US4714996||Nov 26, 1985||Dec 22, 1987||International Business Machines Corporation||Impact calculation for version management in a distributed information service|
|US4809170 *||Apr 22, 1987||Feb 28, 1989||Apollo Computer, Inc.||Computer device for aiding in the development of software system|
|US4853843||Dec 18, 1987||Aug 1, 1989||Tektronix, Inc.||System for merging virtual partitions of a distributed database|
|US4875159||Dec 22, 1987||Oct 17, 1989||Amdahl Corporation||Version management system using plural control fields for synchronizing two versions of files in a multiprocessor system|
|US4887204||Feb 13, 1987||Dec 12, 1989||International Business Machines Corporation||System and method for accessing remote files in a distributed networking environment|
|US4888681||Oct 19, 1987||Dec 19, 1989||International Business Machines Corporation||Space management system for data files having shared access|
|US4954941 *||Aug 31, 1988||Sep 4, 1990||Bell Communications Research, Inc.||Method and apparatus for program updating|
|US5001628||Sep 1, 1989||Mar 19, 1991||International Business Machines Corporation||Single system image uniquely defining an environment for each user in a data processing system|
|US5032979||Jun 22, 1990||Jul 16, 1991||International Business Machines Corporation||Distributed security auditing subsystem for an operating system|
|US5109486 *||Jan 6, 1989||Apr 28, 1992||Motorola, Inc.||Distributed computer system with network and resource status monitoring|
|US5113519||May 15, 1989||May 12, 1992||International Business Machines Corporation||Maintenance of file attributes in a distributed data processing system|
|US5133075 *||Dec 19, 1988||Jul 21, 1992||Hewlett-Packard Company||Method of monitoring changes in attribute values of object in an object-oriented database|
|US5151989||Feb 13, 1987||Sep 29, 1992||International Business Machines Corporation||Directory cache management in a distributed data processing system|
|US5155847 *||Aug 3, 1988||Oct 13, 1992||Minicom Data Corporation||Method and apparatus for updating software at remote locations|
|US5170480||Sep 25, 1989||Dec 8, 1992||International Business Machines Corporation||Concurrently applying redo records to backup database in a log sequence using single queue server per queue at a time|
|US5202971||Dec 17, 1990||Apr 13, 1993||International Business Machines Corporation||System for file and record locking between nodes in a distributed data processing environment maintaining one copy of each file lock|
|US5214776||Oct 18, 1989||May 25, 1993||Bull Hn Information Systems Italia S.P.A.||Multiprocessor system having global data replication|
|US5222217||Jan 18, 1989||Jun 22, 1993||International Business Machines Corporation||System and method for implementing operating system message queues with recoverable shared virtual storage|
|US5247673||Nov 16, 1990||Sep 21, 1993||Bull Hn Information Systems Italia S.P.A.||Multiprocessor system having distributed shared resources and dynamic global data replication|
|US5261094||Apr 8, 1991||Nov 9, 1993||International Business Machines Corporation||Asynchronous replication of data changes by distributed update requests|
|US5274789||Feb 25, 1991||Dec 28, 1993||Bull Hn Information Systems Italia S.P.A.||Multiprocessor system having distributed shared resources and dynamic and selective global data replication|
|US5278979 *||Dec 20, 1990||Jan 11, 1994||International Business Machines Corp.||Version management system using pointers shared by a plurality of versions for indicating active lines of a version|
|US5285528||Feb 22, 1991||Feb 8, 1994||International Business Machines Corporation||Data structures and algorithms for managing lock states of addressable element ranges|
|US5287453||Sep 18, 1990||Feb 15, 1994||Bull Hn Information Systems, Inc.||Fast remote file access facility for distributing file access requests in a closely coupled computer system|
|US5313646||Jun 10, 1991||May 17, 1994||Sun Microsystems, Inc.||Method and apparatus for translucent file system|
|US5333310 *||May 24, 1990||Jul 26, 1994||Hitachi, Ltd.||Data management method and system|
|US5388255 *||Dec 19, 1991||Feb 7, 1995||Wang Laboratories, Inc.||System for updating local views from a global database using time stamps to determine when a change has occurred|
|US5434994 *||May 23, 1994||Jul 18, 1995||International Business Machines Corporation||System and method for maintaining replicated data coherency in a data processing system|
|US5452448||Mar 10, 1993||Sep 19, 1995||Hitachi, Ltd.||Method of replicate file updating by monitoring file accesses and system therefor|
|US5471629 *||Jul 20, 1992||Nov 28, 1995||Hewlett-Packard Company||Method of monitoring changes in an object-oriented database with tuned monitors|
|US5551034 *||Jan 7, 1994||Aug 27, 1996||Cegelec||System for synchronizing replicated tasks|
|US5586310 *||Nov 23, 1993||Dec 17, 1996||International Business Machines Corporation||System for distributed database replicated read with exclusive central server transfer of primary copies|
|US5588147||Jan 14, 1994||Dec 24, 1996||Microsoft Corporation||Replication facility|
|US5600834 *||Apr 5, 1995||Feb 4, 1997||Mitsubishi Electric Information Technology Center America, Inc.||Method and apparatus for reconciling different versions of a file|
|US5649195||May 22, 1995||Jul 15, 1997||International Business Machines Corporation||Systems and methods for synchronizing databases in a receive-only network|
|US5675802||Mar 31, 1995||Oct 7, 1997||Pure Atria Corporation||Version control system for geographically distributed software development|
|US5740433 *||Aug 28, 1996||Apr 14, 1998||Tandem Computers, Inc.||Remote duplicate database facility with improved throughput and fault tolerance|
|US5765171 *||Dec 29, 1995||Jun 9, 1998||Lucent Technologies Inc.||Maintaining consistency of database replicas|
|US5832514 *||Jun 26, 1996||Nov 3, 1998||Microsoft Corporation||System and method for discovery based data recovery in a store and forward replication process|
|1||"Xcopy Function for Access Control Profiles," IBM Technical Disclosure Bulletin, vol. 37(1), 573-574 (1994).|
|2||Bierer, et al., NetWare 4 for Professionals, New Riders Publishing, 343-374, 420-421, 432-435 and 971-1045 (1993).|
|3||Cambell, Roy H. and Peter W. Madamy, "Considerations of Persistence and Security in Choices, an Object-Oriented Operating System," In Proceedings on the International Workshop on Computer Architectures to Support Security and Persistence of Information, 290-300 (1990).|
|4||Carl W. Symborski, Updating Software And Configuration Data In A Distributed Communications Network, 1988 IEEE, pp. 331-338.|
|5||Coulouris, George F. and Jean Dollimore, "Distributed Systems-Concepts and Design," Sections 8.4 and 10.9, 211-225 and 293-299.|
|6||Coulouris, George F. and Jean Dollimore, "Distributed Systems—Concepts and Design," Sections 8.4 and 10.9, 211-225 and 293-299.|
|7||*||D. Bierer, et al, NetWare 4 for Professionals, New Riders Publishing, pp. 364-374, 1993.*|
|8||Fowler, et al., "A User-Level Replicated File System," In Proceedings of the Summer 1993 USENIX Technical Conference, 279-290 (1993).|
|9||Hac, Anna, "A Distributed Algorithm for Performance Improvment Through File Replication, File Migration, and Process Migration," IEEE Transactions on Software Engineering, vol. 15(11), 1459-1470 (1989).|
|10||Mahadev Satyanarayanan, et al., Coda: A Highly Available File System for a Distributed Workstation Environment, 1990 IEEE, pp. 447-459.|
|11||Managing Networked Workstations, IEEE Spectrum (Apr. 1992) pp. 55-58.|
|12||Martin et al., "Development of the VAXDistributed Name Service," Digital Technical Journal, vol. 9, 9-15 (1989).|
|13||Puneet Kumar and M. Satyanarayanan, Log-Based Directory Resolution in the Coda File System, 1993 IEEE, pp. 202-213.|
|14||Purdin, et al., "A File Replication Facility for Berkeley Unix," Software-Practice and Experience, vol. 17 (12), 923-940 (1987).|
|15||Satyanarayanan, Mahadev, "Scalable, Secure, and Highly Available Distributed File Access," IEEE, 9-21 (1990).|
|16||Schulman, Mark, Que's Guide to Lotus Notes, 51-55 and 268-312 (1993).|
|17||Siegel, et al., "Deceit: A Flexible Distributed File System," Technical Report for Department of Computer Science, Ithaca, New York, 1-34 (1989).|
|18||Walker et al., "The LOCUS Distributed Operating System," Operating Systems Review, vol. 17(15), 49-70 (1983).|
|19||Wedde et al., "Operating System Support for Adaptive Distributed Real-Time Systems in Dragon Slayer," Operating Systems Review, vol. 23(3), 126-136 (1989).|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6587856||Dec 7, 1998||Jul 1, 2003||Oracle International Corporation||Method and system for representing and accessing object-oriented data in a relational database system|
|US6615223 *||Feb 29, 2000||Sep 2, 2003||Oracle International Corporation||Method and system for data replication|
|US6748374||Dec 7, 1998||Jun 8, 2004||Oracle International Corporation||Method for generating a relational database query statement using one or more templates corresponding to search conditions in an expression tree|
|US6775833||Oct 26, 2000||Aug 10, 2004||Cisco Technology, Inc.||Method of managing a scalable interface communication system|
|US6834286||Feb 6, 2001||Dec 21, 2004||Oracle International Corporation||Method and system for representing and accessing object-oriented data in a relational database system|
|US6889333 *||Nov 1, 2001||May 3, 2005||Microsoft Corporation||System and method for replicating data in a distributed system|
|US6928467 *||Feb 1, 2001||Aug 9, 2005||Inno Path Software, Inc.||Apparatus and methods for providing data synchronization by facilitating data synchronization system design|
|US7028182 *||Jan 26, 2000||Apr 11, 2006||Nexsys Electronics, Inc.||Secure network system and method for transfer of medical information|
|US7035847||Mar 15, 2002||Apr 25, 2006||Novell, Inc.||Server for synchronization of files|
|US7072911 *||Jul 24, 2002||Jul 4, 2006||Novell, Inc.||System and method for incremental replication of changes in a state based distributed database|
|US7143182||Oct 27, 2000||Nov 28, 2006||Cisco Technology, Inc.||Smart secretary for routing call objects in a telephony network|
|US7203687 *||Feb 26, 2004||Apr 10, 2007||International Business Machines Corporation||Peer-to-peer replication member initialization and deactivation|
|US7206910 *||Dec 17, 2002||Apr 17, 2007||Oracle International Corporation||Delta object replication system and method for clustered system|
|US7246145 *||Sep 29, 2000||Jul 17, 2007||Cisco Technology, Inc.||Fully distributed, scalable infrastructure, communication system|
|US7373362 *||Nov 19, 2001||May 13, 2008||Extended Systems, Inc.||Coordinated synchronization|
|US7386715||Feb 1, 2005||Jun 10, 2008||Microsoft Corporation||System and method for replicating data in a distributed system|
|US7415516||Jun 15, 2001||Aug 19, 2008||Cisco Technology, Inc.||Net lurkers|
|US7426539||Jan 9, 2003||Sep 16, 2008||Sony Computer Entertainment America Inc.||Dynamic bandwidth control|
|US7499904 *||Nov 25, 2003||Mar 3, 2009||Microsoft Corporation||System and method for client mastered replication of local files|
|US7506007||Mar 1, 2004||Mar 17, 2009||Microsoft Corporation||Interval vector based knowledge synchronization for resource versioning|
|US7529811||Aug 21, 2003||May 5, 2009||Microsoft Corporation||Systems and methods for the implementation of a core schema for providing a top-level structure for organizing units of information manageable by a hardware/software interface system|
|US7571443 *||Jun 6, 2001||Aug 4, 2009||Fujitsu Limited||Collaboration apparatus between information processing systems, integrated information processing system, and recording medium storing a collaboration program between information processing systems|
|US7587435||Nov 10, 2006||Sep 8, 2009||Sybase, Inc.||Replication system with methodology for replicating database sequences|
|US7606861||Jul 22, 2002||Oct 20, 2009||Nexsys Electronics||Medical network system and method for transfer of information|
|US7657517||Feb 2, 2010||Novell, Inc.||Server for synchronization of files|
|US7660833||Feb 9, 2010||Microsoft Corporation||Granular control over the authority of replicated information via fencing and unfencing|
|US7734826||Mar 15, 2002||Jun 8, 2010||Novell, Inc.||Client-server model for synchronization of files|
|US7739240 *||Dec 9, 2002||Jun 15, 2010||Hewlett-Packard Development Company, L.P.||Replication and replica management in a wide area file system|
|US7769719 *||Aug 3, 2010||International Business Machines Corporation||File system dump/restore by node numbering|
|US7779075||Aug 17, 2010||Sony Computer Entertainment America Inc.||Dynamic bandwidth control|
|US7788223||Aug 31, 2010||Microsoft Corporation||Resource freshness and replication|
|US7788678 *||Mar 20, 2007||Aug 31, 2010||Microsoft Corporation||Urgent replication facility|
|US7801913||May 30, 2003||Sep 21, 2010||Oracle International Corporation||System and method for querying data for implicit hierarchies|
|US7814499||Oct 12, 2010||Microsoft Corporation||Urgent replication facility|
|US7917534||Mar 29, 2011||Microsoft Corporation||Systems and methods for extensions and inheritance for units of information manageable by a hardware/software interface system|
|US7945695||Nov 2, 2006||May 17, 2011||Cisco Technology, Inc.||Smart secretary|
|US8010606||Jul 16, 2010||Aug 30, 2011||Sony Computer Entertainment America Llc||Dynamic bandwidth control|
|US8046424||Oct 25, 2011||Microsoft Corporation||Systems and methods for the utilization of metadata for synchronization optimization|
|US8156075 *||Dec 12, 2003||Apr 10, 2012||Critical Path Data Centre Limited||Method of automatically replicating data objects between a mobile device and a server|
|US8166101||Apr 24, 2012||Microsoft Corporation||Systems and methods for the implementation of a synchronization schemas for units of information manageable by a hardware/software interface system|
|US8238696||Aug 7, 2012||Microsoft Corporation||Systems and methods for the implementation of a digital images schema for organizing units of information manageable by a hardware/software interface system|
|US8260860||Jul 28, 2011||Sep 4, 2012||Sony Computer Entertainment America Llc||Dynamic bandwidth control|
|US8341134||Dec 10, 2010||Dec 25, 2012||International Business Machines Corporation||Asynchronous deletion of a range of messages processed by a parallel database replication apply process|
|US8352425||Jan 8, 2013||International Business Machines Corporation||Parallel apply processing in data replication with preservation of transaction integrity and source ordering of dependent updates|
|US8392387||Apr 2, 2012||Mar 5, 2013||International Business Machines Corporation||Asynchronous deletion of a range of messages processed by a parallel database replication apply process|
|US8495140||Jun 12, 2007||Jul 23, 2013||Cisco Technology, Inc.||Fully distributed, scalable infrastructure, communication system|
|US8533850||Jun 29, 2010||Sep 10, 2013||Hitachi, Ltd.||Fraudulent manipulation detection method and computer for detecting fraudulent manipulation|
|US8688634||Feb 27, 2004||Apr 1, 2014||International Business Machines Corporation||Asynchronous peer-to-peer data replication|
|US8850592||Apr 2, 2010||Sep 30, 2014||Hitachi, Ltd.||Unauthorized operation detection system and unauthorized operation detection method|
|US9124616 *||Jun 28, 2010||Sep 1, 2015||Hitachi, Ltd.||Computer system management method and client computer|
|US9244996||Jun 29, 2007||Jan 26, 2016||International Business Machines Corporation||Replicating data across multiple copies of a table in a database system|
|US20010039548 *||Mar 27, 2001||Nov 8, 2001||Yoshitake Shinkai||File replication system, replication control method, and storage medium|
|US20010042092 *||Jun 6, 2001||Nov 15, 2001||Fujitsu Limited||Collaboration apparatus between information processing systems, integrated information processing system, and recording medium storing a collaboration program between information processing systems|
|US20010048728 *||Feb 1, 2001||Dec 6, 2001||Luosheng Peng||Apparatus and methods for providing data synchronization by facilitating data synchronization system design|
|US20020174180 *||Mar 15, 2002||Nov 21, 2002||Novell, Inc.||Client-server model for synchronization of files|
|US20020184325 *||Jul 22, 2002||Dec 5, 2002||Killcommons Peter M.||Medical network system and method for transfer of information|
|US20020194205 *||Mar 15, 2002||Dec 19, 2002||Novell, Inc.||Server for synchronization of files|
|US20030051213 *||Sep 6, 2002||Mar 13, 2003||Hidetsugu Mitsui||Document passing system, document updating controller, client device, document management server, method of controlling updating of document, recording medium and program|
|US20030084361 *||Nov 1, 2001||May 1, 2003||Microsoft Corporation||System and method for replicating data in a distributed system|
|US20030097381 *||Nov 19, 2001||May 22, 2003||Richard Detweiler||Coordinated synchronization|
|US20040024807 *||Jul 31, 2002||Feb 5, 2004||Microsoft Corporation||Asynchronous updates of weakly consistent distributed state information|
|US20040111390 *||Dec 9, 2002||Jun 10, 2004||Yasushi Saito||Replication and replica management in a wide area file system|
|US20040117571 *||Dec 17, 2002||Jun 17, 2004||Chang Kevin K.||Delta object replication system and method for clustered system|
|US20040139158 *||Jan 9, 2003||Jul 15, 2004||Datta Glen Van||Dynamic bandwidth control|
|US20040186916 *||Mar 1, 2004||Sep 23, 2004||Bjorner Nikolaj S.||Interval vector based knowledge synchronization for resource versioning|
|US20040243576 *||May 30, 2003||Dec 2, 2004||Oracle International Corporation||System and method for querying data for implicit hierarchies|
|US20050015413 *||Dec 10, 2003||Jan 20, 2005||Dan Teodosiu||Granular control over the authority of replicated information via fencing and unfencing|
|US20050050053 *||Aug 21, 2003||Mar 3, 2005||Microsoft Corporation.||Systems and methods for the implementation of a core schema for providing a top-level structure for organizing units of information manageable by a hardware/software interface system|
|US20050063083 *||Oct 24, 2003||Mar 24, 2005||Dart Scott E.||Systems and methods for the implementation of a digital images schema for organizing units of information manageable by a hardware/software interface system|
|US20050114412 *||Nov 25, 2003||May 26, 2005||Microsoft Corporation||System and method for client mastered replication of local files|
|US20050144538 *||Feb 1, 2005||Jun 30, 2005||Microsoft Corporation||System and method for replicating data in a distributed system|
|US20050165807 *||Dec 20, 2004||Jul 28, 2005||Oracle International Corporation||Method and system for representing and accessing object-oriented data in a relational database system|
|US20050193024 *||Feb 27, 2004||Sep 1, 2005||Beyer Kevin S.||Asynchronous peer-to-peer data replication|
|US20050193037 *||Feb 26, 2004||Sep 1, 2005||Adiba Nicolas G.||Peer-to-peer replication member initialization and deactivation|
|US20050278385 *||Jun 10, 2004||Dec 15, 2005||Hewlett-Packard Development Company, L.P.||Systems and methods for staggered data replication and recovery|
|US20060112150 *||Jan 5, 2006||May 25, 2006||Brown David K||Server for synchronization of files|
|US20060136484 *||Dec 12, 2005||Jun 22, 2006||Microsoft Corporation||Urgent Replication Facility|
|US20060171523 *||Dec 12, 2003||Aug 3, 2006||Cognima Ltd.||Method of automatically replicating data objects between a mobile device and a server|
|US20070156791 *||Jan 5, 2006||Jul 5, 2007||Everhart Craig F||File system dump/restore by node numbering|
|US20070162519 *||Mar 20, 2007||Jul 12, 2007||Microsoft Corporation||Urgent Replication Facility|
|US20070168516 *||Feb 28, 2006||Jul 19, 2007||Microsoft Corporation||Resource freshness and replication|
|US20070288537 *||Jun 29, 2007||Dec 13, 2007||International Business Machines Corporation||Method and apparatus for replicating data across multiple copies of a table in a database system|
|US20070294355 *||Jun 19, 2006||Dec 20, 2007||Dallas Area Rapid Transit||Method and system for making a portable network user mailbox from an archived network post office without restoring to the original active post office|
|US20080031242 *||Jun 12, 2007||Feb 7, 2008||Cisco Technology, Inc.||Fully distributed, scalable infrastructure, communication system|
|US20080114816 *||Nov 10, 2006||May 15, 2008||Sybase, Inc.||Replication system with methodology for replicating database sequences|
|US20080263154 *||Jun 20, 2008||Oct 23, 2008||Sony Computer Entertainment America Inc.||Dynamic bandwidth control|
|US20100281116 *||Nov 4, 2010||Sony Computer Entertainment America Inc.||Dynamic bandwidth control|
|US20110078110 *||Mar 31, 2011||Sun Microsystems, Inc.||Filesystem replication using a minimal filesystem metadata changelog|
|US20110320508 *||Jun 28, 2010||Dec 29, 2011||Hitachi, Ltd.||Computer system management method and client computer|
|US20120203744 *||Oct 8, 2010||Aug 9, 2012||Shane Andrew Mercer||Maintaining data integrity across execution environments|
|EP1474752A1 *||Aug 4, 2003||Nov 10, 2004||Sony Computer Entertainment America Inc.||Dynamic bandwidth control|
|WO2004063935A1||Aug 4, 2003||Jul 29, 2004||Sony Computer Entertainment America Inc.||Dynamic bandwidth control|
|U.S. Classification||719/313, 717/170|
|Cooperative Classification||G06F9/54, G06F17/30215|
|European Classification||G06F9/54, G06F17/30F8D3M|
|Jul 26, 1996||AS||Assignment|
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:STRAUBE, DAVE D.;CONTORER, AARON M.;MILLER, ARNOLD S.;AND OTHERS;REEL/FRAME:008062/0463;SIGNING DATES FROM 19960627 TO 19960628
|Nov 4, 2003||CC||Certificate of correction|
|Dec 2, 2005||FPAY||Fee payment|
Year of fee payment: 4
|Nov 25, 2009||FPAY||Fee payment|
Year of fee payment: 8
|Nov 26, 2013||FPAY||Fee payment|
Year of fee payment: 12
|Dec 9, 2014||AS||Assignment|
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034541/0001
Effective date: 20141014