US 6,412,017 B1Grant
Urgent replication facility
Issue Date:2002-06-25
•30 Claims
•8 Drawing Sheets
Abstract
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 of a source replica determines that it has an urgent change to propagate through the distributed system, and informs a replication facility at the source replica of the urgent change. The facility extracts, or is provided with, the change information from that object, and the source replica communicates information representative of the change to a destination replica. A replication facility at the destination replica provides the change information to a destination replica object, which uses the information to make itself consistent with the source replica object.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Dave D. Straube
- Aaron M. Contorer
- Arnold S. Miller
- Balan S. Raman
- Pradyumna K. Misra
- Michael R. C. Seaman
Application Information
Application Number:US 08/673,929
Filing Date:1996-07-01
Priority Date:1996-07-01
Art Unit:7
Classifications
IPC:
G06F 946
Field of Search:
395712395683395619395617707201707203707511707202709206709207709313709315717170
Patent Drawings (8 sheets)
Description
Field of the Invention
[0002] 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.
Background of the Invention
[0003] 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.
[0004] 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.
[0005] 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.
[0006] 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.
[0007] 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.
[0008] 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.
[0009] 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.
[0010] 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.
[0011] 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.
[0012] 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.
Objects and Summary of the Invention
[0013] 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.
[0014] 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.
[0015] It is also an objective of the invention to provide a replication facility that enables the expedited replication of certain data objects deemed urgent.
[0016] It is a related objective to provide a replication facility wherein an object may initiate its propagation to other replicas in the system.
[0017] Another objective of the invention is to provide a system and method for replicating objects in an object-oriented environment.
[0018] 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.
[0019] 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.
[0020] 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.
[0021] Other objects and advantages will become apparent from the following detailed description when taken in conjunction with attached drawings, in which:
Brief Description of the Drawings
[0022] 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;
[0023] FIG. 2 is a block diagram illustrating the details of the replication facility contained within the distributed operating system shown in FIG. 1;
[0024] FIG. 3 is a block diagram representing the general architecture and functional components of the replication facility suitable for use with the present invention;
[0025] FIG. 4 is a block diagram representing how replication information is exchanged between a remote source and a local destination;
[0026] 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;
[0027] FIG. 6 is a flow diagram illustrating the steps taken when replicating and reconciling an object;
[0028] FIG. 7 is a representation of an object which is deemed to be an urgent object; and
[0029] FIG. 8 is a flow diagram illustrating the steps taken when replicating an urgent object.
[0030] 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.
Detailed Description of the Preferred Embodiment
[0031] 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 221-225, 241-242and 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.
[0032] 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.
[0033] 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.
[0034] The distributed system 20 includes client workstations 221-225which may be personal computers or the like, each including a memory 301-305having a distributed operating system 32 loaded therein. In the described embodiment, each workstation 221-225acts 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 241-242, a printer 26 and routers (not shown) are also present in the system 20.
[0035] 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.
[0036] 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.
[0037] 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.
[0038] 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.
[0039] 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 222, 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.
[0040] 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 222in the cursor 50 for that source 221, 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.
[0041] 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.
[0042] 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.
[0043] In operation, as shown at step 100 of the flow diagram of FIG. 6, when a destination (e.g., workstation 222) requests replication via its ORA to a connected source (e.g., workstation 221), 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 221during the last replication. Thus, the destination 222is essentially asking the source for all changes to objects it has had since the last cursor. The cursor 50 is relative to the source 221, so that even if a time stamp rather than a USN or the like is used, any time difference between the source 221and the destination 222is immaterial.
[0044] At step 102 the source 221obtains a list of changes (including differencing information) in change log 52 and returns the list to the destination 222when feasible. The individual change items 541—54nin 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 54—54nreturned 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.
[0045] 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 221. 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 221. To minimize network traffic, the source 221reviews the change log and filters out change items 54 that were originated or propagated by the requesting destination 222before transmission to the destination 222. 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.
[0046] 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.
[0047] When the change log 52 is received from the source 221(step 106), the ORA of the destination 222invokes the appropriate reconcilers 88 or 90 to make its objects consistent with those at the source 221. 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.
[0048] 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.
[0049] 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.
[0050] 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 221. 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).
[0051] 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.
[0052] 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 72aand propagator content field 76ain 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.
[0053] When the differencing information is received, the destination 222requests 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.
[0054] 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.
[0055] 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.
[0056] 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.
[0057] 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.
[0058] 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.
[0059] 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.
[0060] 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.
[0061] 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.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. In a distributed computer system, a method of expediting the replication of a source object in a source computer to a destination replica object in a destination replica in the system wherein the state of the source object has changed from a first to a second state, comprising the steps of:
notifying a source replication facility that the source object has changed state,
requesting, by the source replication facility in response to the notifying step, a difference generated with regard to the source object changed state and receiving the difference,
transmitting, by the source replication facility, the difference to the destination replica,
receiving, by the destination replica, the transmitted difference,
applying, by the destination replica, the difference to the destination replica object, and
assigning an urgency value to the change in the source object state, and sending the urgency value to the source replication facility, wherein the source replication facility delays for a time interval having a duration corresponding to the urgency value of the change before requesting or transmitting the difference.
2. The method of claim 1, further comprising the step of applying the difference to the destination replica object such that the destination replica object is consistent with the changed source object.
3. The method of claim 1, wherein the step of notifying the source replication facility includes invoking a method of a replication framework.
4. The method of claim 1, wherein the step of transmitting the difference includes a duplication of the entire source object.
5. The method of claim 1, wherein the step of requesting the difference comprises the source object generating differencing information.
6. The method of claim 1, further comprising the step of: the source replication facility reassigning the urgency value of the change, wherein the source replication facility uses the reassigned urgency value in determining the duration of the time interval.
7. The method of claim 1, further comprising the steps of: transmitting information to a second destination replica corresponding to the change to the source object; receiving the transmitted information at the second destination replica; extracting the change information from the received information at the second destination replica; and providing the change information to a replica object of the second destination replica.
8. The method of claim 1, further comprising the steps of: extracting destination change information from the replica object of the destination replica; transmitting information to a second destination replica corresponding to the destination change information; receiving the transmitted information at the second destination replica; extracting the change information from the received information at the second destination replica; providing the change information to a replica object of the second destination replica; and applying the destination change information to a destination replica object.
9. In a system of distributed computers, a system for expediting the replication of a source object which has changed at a source node to a counterpart object at a destination node, comprising:
signaling means associated with the source object for initiating generating a signal at the source node indicating that the source object at the source node has changed and assigning an urgency value to the change with respect to a predetermined criteria, and wherein the urgency value indicates changes as either urgent or non-urgent, and wherein urgent changes are pushed to the destination and non-urgent changes are pulled from the source,
a control means connected to the signaling means for receiving the signal generated by the signaling means and in response communicating to request information representative of the change to the source object, and to receive the change information,
a data communication mechanism at the source node connected to a data communication mechanism at the destination node for communicating information, representative of the change to the source object, from the source node to the destination node, and
means at the destination node for applying the received change information to the counterpart object at the destination node such that the counterpart object at the destination node is consistent with the changed source object at the source node.
10. The method of claim 1, further comprising the steps of: when communication between the source and the destination is unavailable, storing the received information and a received timestamp value; then after communication between the source and the destination becomes available, and if the received information corresponds to a relatively recent change, then expediting the replication of the object which has changed at the source.
11. In a distributed computer system, a method of expediting the replication of changes to at least one source object in a source to a destination replica in the system wherein the state of the source object has changed, comprising the steps of:
recognizing a change in state of a source object;
first notifying a source replication facility that the source object has changed and providing a value reflecting the urgency of the change,
second notifying the destination replica that the source object has changed and the urgency of the change,
transmitting from the destination replica to the source a request for change information after a time interval whose duration varies as a function of the value of the urgency of the change,
extracting change information at the source from the source object representative of the change to the source object wherein the source object generates the change information,
transmitting information from the source to the destination, the transmitted information including the extracted change information,
receiving the transmitted information at the destination replica,
extracting the change information from the received information, and
providing the change information to a replica object of the destination.
12. The method of claim 11, wherein the time interval is substantially zero.
13. A computer-readable medium having computer-executable instructions for a method of expediting the replication of a source object in a source computer to a destination replica object in a destination replica in the system wherein the state of the source object has changed from a first to a second state, the method steps comprising:
notifying a source replication facility that the source object has changed its state,
requesting, by the source replication facility in response to the notifying step, a difference generated with regard to the source object changed state and receiving the difference,
transmitting, by the source replication facility, the difference to the destination replica,
receiving, by the destination replica, the transmitted difference,
applying, by the destination replica, the difference to the destination replica object, and
assigning an urgency value to the change in the source object state, and sending the urgency value to the source replication facility, wherein the source replication facility delays for a time interval having a duration corresponding to the urgency value of the change before requesting or transmitting the difference.
14. The computer-readable medium of claim 13, further comprising computer-executable instructions for performing the step of applying the difference to the destination replica object such that the destination replica object is consistent with the changed source object.
15. The computer-readable medium of claim 13, wherein the step of notifying the source replication facility includes invoking a method of a replication framework.
16. The computer-readable medium of claim 13, wherein the step of transmitting the difference includes a duplication of the entire source object.
17. The computer-readable medium of claim 13, wherein the step of requesting the difference comprises the source object generating differencing information.
18. The computer-readable medium of claim 13, further comprising computer-executable instructions for performing the step of: the source replication facility reassigning the urgency value of the change, wherein the source replication facility uses the reassigned urgency value in determining the duration of the time interval.
19. The computer-readable medium of claim 13, further comprising computer-executable instructions for performing the steps of: transmitting information to a second destination replica corresponding to the change to the source object; receiving the transmitted information at the second destination replica; extracting the change information from the received information at the second destination replica; and providing the change information to a replica object of the second destination replica.
20. The computer-readable medium of claim 13, further comprising computer-executable instructions for performing the steps of: extracting destination change information from the replica object of the destination replica; transmitting information to a second destination replica corresponding to the destination change information; receiving the transmitted information at the second destination replica; extracting the change information from the received information at the second destination replica; providing the change information to a replica object of the second destination replica; and applying the destination change information to a destination replica object.
21. The computer-readable medium of claim 13, further comprising computer-executable instructions for performing the steps of: when communication between the source and the destination is unavailable, storing the received information and a received timestamp value; then after communication between the source and the destination becomes available, and if the received information corresponds to a relatively recent change, then expediting the replication of the object which has changed at the source.
22. A computer-readable medium having computer-executable instructions for a system for expediting the replication of a source object which has changed at a source node to a counterpart object at a destination node, the system comprising:
signaling means associated with the source object for initiating generating a signal at the source node indicating that the source object at the source node has changed and assigning an urgency value to the change with respect to a predetermined criteria, and wherein the urgency value indicates changes as either urgent or non-urgent, and wherein urgent changes are pushed to the destination and non-urgent changes are pulled from the source,
a control means connected to the signaling means for receiving the signal generated by the signaling means and in response communicating to request information representative of the change to the source object, and to receive the change information,
a data communication mechanism at the source node connected to a data communication mechanism at the destination node for communicating information, representative of the change to the source object, from the source node to the destination node, and
means at the destination node for applying the received change information to the counterpart object at the destination node such that the counterpart object at the destination node is consistent with the changed source object at the source node.
23. A computer-readable medium having, computer-executable instructions for a method of expediting the replication of changes to at least one source object in a source to a destination replica in the system wherein the state of the source object has changed, the steps comprising:
recognizing a change in state of a source object;
first notifying a source replication facility that the source object has changed and providing a value reflecting the urgency of the change,
second notifying the destination replica that the source object has changed and the urgency of the change,
transmitting from the destination replica to the source a request for change information after a time interval whose duration vanes as a function of the value of the urgency of the change,
extracting change information at the source from the source object representative of the change to the source object wherein the source object generates the change information,
transmitting information from the source to the destination, the transmitted information including the extracted change information,
receiving the transmitted information at the destination replica,
extracting the change information from the received information, and
providing the change information to a replica object of the destination.
24. The computer-readable medium of claim 23, wherein the time interval is substantially zero.
25. The method of claim 1 wherein the source object initiates the notifying step.
26. The system of claim 9 wherein the source object comprises the signaling means.
27. The method of claim 11 wherein the source object initiates the first notifying step.
28. The computer-readable medium of claim 13 wherein the source object initiates the notifying step.
29. The computer-readable medium of claim 28 wherein the source object comprises the signaling means.
30. The computer-readable medium of claim 23 wherein the source object initiates the first notifying step.
Patent Citations (42)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4432057(A) | 1984-02-01 | Daniell et al. | Applicant |
| US4620276(A) | 1986-10-01 | Daniell et al. | Applicant |
| US4714995(A) | 1987-12-01 | Materna et al. | Applicant |
| US4714996(A) | 1987-12-01 | Gladney et al. | Applicant |
| US4809170(A) | 1989-02-01 | Leblang et al. | Examiner |
| US4853843(A) | 1989-08-01 | Ecklund | Applicant |
| US4875159(A) | 1989-10-01 | Cary et al. | Applicant |
| US4887204(A) | 1989-12-01 | Johnson et al. | Applicant |
| US4888681(A) | 1989-12-01 | Barnea et al. | Applicant |
| US4954941(A) | 1990-09-01 | Redman | Examiner |
| US5001628(A) | 1991-03-01 | Johnson et al. | Applicant |
| US5032979(A) | 1991-07-01 | Hecht et al. | Applicant |
| US5109486(A) | 1992-04-01 | Seymour | Examiner |
| US5113519(A) | 1992-05-01 | Johnson et al. | Applicant |
| US5133075(A) | 1992-07-01 | Risch | Examiner |
| US5151989(A) | 1992-09-01 | Johnson et al. | Applicant |
| US5155847(A) | 1992-10-01 | Kirouac et al. | Examiner |
| US5170480(A) | 1992-12-01 | Mohem et al. | Applicant |
| US5202971(A) | 1993-04-01 | Henson et al. | Applicant |
| US5214776(A) | 1993-05-01 | Bagnoli et al. | Applicant |
| US5222217(A) | 1993-06-01 | Blount et al. | Applicant |
| US5247673(A) | 1993-09-01 | Costa et al. | Applicant |
| US5261094(A) | 1993-11-01 | Everson et al. | Applicant |
| US5274789(A) | 1993-12-01 | Costa et al. | Applicant |
| US5278979(A) | 1994-01-01 | Foster et al. | Examiner |
| US5285528(A) | 1994-02-01 | Hart | Applicant |
| US5287453(A) | 1994-02-01 | Roberts | Applicant |
| US5313646(A) | 1994-05-01 | Hendricks et al. | Applicant |
| US5333310(A) | 1994-07-01 | Sakai | Examiner |
| US5388255(A) | 1995-02-01 | Pytlik et al. | Examiner |
| US5434994(A) | 1995-07-01 | Shaheen et al. | Examiner |
| US5452448(A) | 1995-09-01 | Sakuraba et al. | Applicant |
| US5471629(A) | 1995-11-01 | Risch | Examiner |
| US5551034(A) | 1996-08-01 | Herz | Examiner |
| US5586310(A) | 1996-12-01 | Sharman | Examiner |
| US5588147(A) | 1996-12-01 | Neeman et al. | Applicant |
| US5600834(A) | 1997-02-01 | Howard | Examiner |
| US5649195(A) | 1997-07-01 | Scott et al. | Applicant |
| US5675802(A) | 1997-10-01 | Allen et al. | Applicant |
| US5740433(A) | 1998-04-01 | Carr et al. | Examiner |
| US5765171(A) | 1998-06-01 | Gehani et al. | Examiner |
| US5832514(A) | 1998-11-01 | Norin et al. | Examiner |
Non-Patent Literature (18)
- D. Bierer, et al, NetWare 4 for Professionals, New Riders Publishing, pp. 364-374, 1993.Applicant
- Carl W. Symborski, Updating Software And Configuration Data In A Distributed Communications Network, 1988 IEEE, pp. 331-338.Applicant
- Mahadev Satyanarayanan, et al., Coda: A Highly Available File System for a Distributed Workstation Environment, 1990 IEEE, pp. 447-459.Applicant
- Managing Networked Workstations, IEEE Spectrum (Apr. 1992) pp. 55-58.Applicant
- Puneet Kumar and M. Satyanarayanan, Log-Based Directory Resolution in the Coda File System, 1993 IEEE, pp. 202-213.Applicant
- “Xcopy Function for Access Control Profiles,” IBM Technical Disclosure Bulletin, vol. 37(1), 573-574 (1994).Applicant
- Bierer, et al., NetWare 4 for Professionals, New Riders Publishing, 343-374, 420-421, 432-435 and 971-1045 (1993).Applicant
- 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).Applicant
- Coulouris, George F. and Jean Dollimore, “Distributed Systems—Concepts and Design,” Sections 8.4 and 10.9, 211-225 and 293-299.Applicant
- Fowler, et al., “A User-Level Replicated File System,” In Proceedings of the Summer 1993 USENIX Technical Conference, 279-290 (1993).Applicant
- 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).Applicant
- Martin et al., “Development of the VAXDistributed Name Service,” Digital Technical Journal, vol. 9, 9-15 (1989).Applicant
- Purdin, et al., “A File Replication Facility for Berkeley Unix,” Software-Practice and Experience, vol. 17 (12), 923-940 (1987).Applicant
- Satyanarayanan, Mahadev, “Scalable, Secure, and Highly Available Distributed File Access,” IEEE, 9-21 (1990).Applicant
- Schulman, Mark, Que's Guide to Lotus Notes, 51-55 and 268-312 (1993).Applicant
- Siegel, et al., “Deceit: A Flexible Distributed File System,” Technical Report for Department of Computer Science, Ithaca, New York, 1-34 (1989).Applicant
- Walker et al., “The LOCUS Distributed Operating System,” Operating Systems Review, vol. 17(15), 49-70 (1983).Applicant
- Wedde et al., “Operating System Support for Adaptive Distributed Real-Time Systems in Dragon Slayer,” Operating Systems Review, vol. 23(3), 126-136 (1989).Applicant