|Publication number||US7293192 B2|
|Application number||US 11/624,467|
|Publication date||Nov 6, 2007|
|Filing date||Jan 18, 2007|
|Priority date||Nov 24, 2003|
|Also published as||CA2543493A1, CA2543493C, CA2830530A1, CN1906593A, CN100492307C, DE602004027339D1, EP1533701A1, EP1533701B1, EP2104041A2, EP2104041A3, EP2104041B1, US7188273, US20050138461, US20070180302, WO2005050449A1|
|Publication number||11624467, 624467, US 7293192 B2, US 7293192B2, US-B2-7293192, US7293192 B2, US7293192B2|
|Inventors||Gregory Arthur Allen, Tudor Morosan|
|Original Assignee||Tsx, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (30), Non-Patent Citations (2), Referenced by (29), Classifications (16), Legal Events (2)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application is a divisional of U.S. patent application Ser. No. 10/718,616, filed Nov. 24, 2003, now U.S. Pat. No. 7,188,273 incorporated herein by reference.
The present invention relates to computer and network architecture and more particularly relates to a method and system for failover.
Society is increasingly relying on computers and networks to interact and conduct business. To achieve a high level of availability demanded in critical systems, unplanned downtime caused by software and hardware defects should be minimized.
The financial services industry is but one example of an industry that demands highly available systems. Indeed, a large number of data processing activities in today's financial industry are supported by computer systems. Particularly interesting are the so-called “real-time” and “near real-time” On-Line Transaction Processing (OLTP) applications, which typically process large numbers of business transactions over a prolonged period, with high speed and low latency. Besides their high speed of execution, these applications generally exhibit the following characteristics: (1) complex data processing, (2) reliable non-volatile data storage, and (3) high level of availability, i.e. the ability to support the services on a substantially uninterrupted basis. When implemented, however, existing applications tend to tradeoff between these performance requirements, since, due to their contradictory effects on the system behavior, no design can completely satisfy all of three characteristics simultaneously, as outlined in greater detail below.
First, complex data processing refers to the ability to perform, in a timely fashion, a large number of computations, database retrievals/updates, etc. This can be implemented through parallel processing, where multiple units of work are executed simultaneously on the same physical machine or on a distributed network. In some systems, the outcome of each transaction depends on the outcomes of previously completed transactions. The parallel aspects of such systems are, inherently, non-deterministic: due to race conditions, operating system scheduling tasks, or variable network delays, the sequence of thread execution can not be predicted. Non-deterministic systems have non-identical output, so they are not run in parallel on two different computing machines, with the intention of having one substitute for the other in case of failure.
Second, reliable non-volatile data storage refers to the ability to persistently store the processed data, even if a number of the system's software or hardware components experience unexpected failure. This can usually be implemented by using Atomic, Consistent, Isolated, and Durable (“ACID”) transactions when accessing or modifying the shared data. ACID transactions can ensure the data integrity and persistence as soon as a unit of work is completed. Every committed ACID transaction is written into the non-volatile computer memory (hard-disk), which helps ensure the data durability, but it is very costly in terms of performance and typically slows down the whole system.
Third, highly available systems attempt to ensure that percentage of availability of a given computer system is as close as possible to 100% of the time. Such availability can be implemented through redundant software and/or hardware, which takes over the functionality in case a component failure is detected. In order to succeed, the failover replicates not only the data, but also the process state. As will be appreciated by those of skill in the art, state replication can be particularly challenging in non-deterministic systems (i.e. systems where computational processing of the same set of events can have more than one result depending on the order in which those events are processed).
Highly available software applications are usually deployed on redundant environments, to reduce and/or eliminate the single point of failure that is commonly associated with the underlying hardware. Two common approaches are known as hot failover and warm failover. Hot failover refers to simultaneously processing the same input in multiple systems, essentially providing complete redundancy in the event of a failure in one of those systems. Warm failover refers to replicating the state of the application (i.e. the data) in backup systems, without processing that data in the backup systems, but having applications capable of processing that data loaded and standing by in the event of failure of a primary system. Cold failover, which is not considered by many to be a form of high availability, refers to simply powering-up a backup system and preparing that backup system to assume processing responsibilities from the primary system.
In hot failover configurations, two instances of the application are simultaneously running on two different hardware facilities, processing copies of the same input. If one of them experiences a critical failure, a supplemental synchronization system can ensure that the other one will continue to support the workload. In the warm failover configurations, one of the systems, designated primary, is running the application; in case of failure, the second system, designated backup, which is waiting in a standby state, will “wake up”, take over, and resume the functionality.
The hot failover approach has two disadvantages. First, since the two systems are identical, a software defect will cause both of them to fail simultaneously, and second supplemental software has to run in order to keep the two systems in synchronism. In the case of non-deterministic systems, this synchronization effort can lead to an unacceptable (or otherwise undesirable) decrease in performance and complexity where the order of arrival of events must be guaranteed to be identical.
Also, concurrent systems used in such applications typically allow multiple threads to execute simultaneously, so they are inherently non-deterministic. Also non-deterministic are the systems with servers and geographically distributed clients, where the variable network delay delivers the messages to the server in an unpredictable sequence.
Warm failover can be used to overcome certain problems with hot failover. Warm failover can be another way to implement failover of non-deterministic systems, by replicating the system data to a redundant, backup system, and then restoring the application functionality to the secondary system. This approach has its drawbacks in the time required to recover the data to a consistent state, then to bring the application to a functional state, and lastly, to return the application to the point in processing where it left off. This process normally takes hours, requires manual intervention, and cannot generally recover the in-flight transactions.
A number of patents attempt to address at least some of the foregoing problems. U.S. Pat. No. 5,305,200 proposes what is essentially a non-repudiation mechanism for communications in a negotiated trading scenario between a buyer/seller and a dealer (market maker). Redundancy is provided to ensure the non-repudiation mechanism works in the event of a failure. It does not address the fail-over of an on-line transactional application in a non-deterministic environment. In simple terms, U.S. Pat. No. 5,305,200 is directed to providing an unequivocal answer to the question: “Was the order sent, or not?” after experiencing a network failure.
U.S. Pat. No. 5,381,545 proposes a technique for backing up stored data (in a database) while updates are still being made to the data. U.S. Pat. No. 5,987,432 addresses a fault-tolerant market data ticker plant system for assembling world-wide financial market data for regional distribution. This is a deterministic environment, and the solution focuses on providing an uninterrupted one-way flow of data to the consumers. U.S. Pat. No. 6,154,847 provides an improved method of rolling back transactions by combining a transaction log on traditional non-volatile storage with a transaction list in volatile storage. U.S. Pat. No. 6,199,055 proposes a method of conducting distributed transactions between a system and a portable processor across an unsecured communications link. U.S. Pat. No. 6,199,055 deals with authentication, ensuring complete transactions with remote devices, and with resetting the remote devices in the event of a failure. In general, the foregoing do not address the fail-over of an on-line transactional application in a non-deterministic environment.
U.S. Pat. No. 6,202,149 proposes a method and apparatus for automatically redistributing tasks to reduce the effect of a computer outage. The apparatus includes at least one redundancy group comprised of one or more computing systems, which in turn are themselves comprised of one or more computing partitions. The partition includes copies of a database schema that are replicated at each computing system partition. The redundancy group monitors the status of the computing systems and the computing system partitions, and assigns a task to the computing systems based on the monitored status of the computing systems. One problem with U.S. Pat. No. 6,202,149 is that it does not teach how to recover workflow when a backup system assumes responsibility for processing transactions, but instead directs itself to the replication of an entire database which can be inefficient and/or slow. Further, such replication can cause important transactional information to be lost in flight, particularly during a failure of the primary system or the network interconnecting the primary and backup system, thereby leading to an inconsistent state between the primary and backup. In general, U.S. Pat. No. 6,202,149 lacks certain features that are desired in the processing of on-line transactions and the like, and in particular lacks features needed to failover non-deterministic systems.
U.S. Pat. No. 6,308,287 proposes a method of detecting a failure of a component transaction, backing it out, storing a failure indicator reliably so that it is recoverable after a system failure, and then making this failure indicator available to a further transaction. It does not address the fail-over of a transactional application in a non-deterministic environment. U.S. Pat. No. 6,574,750 proposes a system of distributed, replicated objects, where the objects are non-deterministic. It proposes a method of guaranteeing consistency and limiting roll-back in the event of the failure of a replicated object. A method is described where an object receives an incoming client request and compares the request ID to a log of all requests previously processed by replicas of the object. If a match is found, then the associated response is returned to the client. However, this method in isolation is not sufficient to solve the various problems in the prior art.
Another problem is that the method of U.S. Pat. No. 6,574,750 assumes a synchronous invocation chain, which is inappropriate for high-performance On-Line Transaction Processing (“OLTP”) applications. With a synchronous invocation the client waits for either a reply or a time-out before continuing. The invoked object in turn may become a client of another object, propagating the synchronous call chain. The result can be an extensive synchronous operation, blocking the client processing and requiring long time-outs to be configured in the originating client.
While the foregoing patents feature some aspect of fault-tolerance and recoverability, they do not address the notion of failing-over an application to a separate system for non-deterministic systems used for on-line transaction processing.
It is an object of the present invention to provide a novel system and method for failover that obviates or mitigates at least one of the above-identified disadvantages of the prior art. According to an aspect of the invention, there is provided a system for failover comprising at least one client that is selectively connectable to at least one of a primary server and at least one backup server via a network connection. The primary server and the backup server can be connected to each other in a normal state during which the primary server processes messages from the client and maintains a transaction log respective to each of the messages in random access memory, and during which the backup server is operable to maintain a mirror image of the transaction log. The transaction log is periodically flushed to a non-volatile storage device respective to each server. When the backup server is unavailable, the client is only connected to the primary server in a primary-only state. Meanwhile, the primary server processes messages from the client and maintains a transaction log respective to each of the messages in random access memory. After each message is processed, the primary server transaction log is flushed to the primary server non-volatile storage device.
When the primary server is unavailable, the client is only connected to the backup server in a backup-only state. Meanwhile, the backup server initially recovers a last-known state of the primary server, processes messages from the client and maintains the backup server transaction log respective to each message in random access memory. After each message is processed, the transaction log is flushed to the backup server non-volatile storage device immediately after each said message is processed.
In another aspect of the invention, a system for failover comprises at least one client, a primary server and at least one backup server interconnected via at least one network connection. The primary server(s) and the backup server(s) each execute an application for processing messages received from the clients, maintain a transaction log in random access memory, execute a replication agent and execute a checkpoint agent for flushing the transaction log to a non-volatile storage device respective to each said server. In this aspect of the invention, the system has three different states: a normal states, a primary-only state and a backup-only state. During the normal state only the primary server application processes messages and writes results thereof to the primary server transaction log and the replication agents are operable to mirror the primary server transaction log in the backup server transaction log and each transaction log is flushed according to a predefined criteria. During the primary-only state, the primary server application processes messages and writes the results to the primary server transaction log and the transaction log is simultaneously flushed to the primary server non-volatile storage device. During the backup-only state, only the backup server application processes the messages and writes the results thereof to the backup server transaction log and the backup server transaction log is simultaneously flushed to the backup server non-volatile storage device.
In another aspect of the invention, the client is connected to a primary server coupled to a backup server in a normal state, during which the primary server processes messages from the client and maintains a transaction log respective to each message in random access memory. Meanwhile, the backup server is operable to maintain a mirror image of the transaction log and the transaction logs are periodically flushed to a non-volatile storage device respective to each and server. When the backup server is unavailable, however, the client is only connectable to the primary server. At this time, the primary server processes messages from the client and maintains a transaction log respective to each message in random access memory. Meanwhile, the primary server transaction log is flushed to the primary server non-volatile storage device after each message is processed. When the primary server is unavailable, on the other hand, the client is only connected to the backup server, during which said backup server initially recovers a last-known state of said primary server and then processes messages from said client and maintains said backup server transaction log respective to each said message in random access memory. Meanwhile, the transaction log is flushed to the backup server non-volatile storage device immediately after each message is processed.
In yet another aspect of the present invention, the client is connected to a primary server coupled to a backup server when both servers are available. During this time, the primary server processes messages from the client and maintains a transaction log respective to each message in random access memory. Meanwhile, the backup server is operable to maintain a mirror image of the transaction log and the transaction logs are periodically flushed to a non-volatile storage device respective to each server. When one of the servers (i.e. either the primary or the backup server) is unavailable, the client is connectable to the server that is available, during which time the available server processes messages from the client and maintains a transaction log respective to each message in random access memory. Meanwhile, the available server transaction log is flushed to the non-volatile storage device respective thereto after each said message is processed.
In yet another aspect of the invention, at least one client is connectable to a plurality of interconnectable servers. Each server is operable to process messages from the client and maintains transaction records in respect to the messages in a transaction log stored in volatile storage. Each server is also operable to flush the transaction log to a non-volatile storage device respective to the server after each message is processed, wherein when more than one server is available then only one of the servers processes the messages and the remainder of the servers maintain a mirror image of the transaction log. The transaction logs are flushed on a periodic basis, and wherein when only one of the servers is available then the transaction log is flushed more frequently than said periodic basis.
In another aspect of the invention there is provided, a method for operating a system for failover comprising the steps of:
The invention will now be described by way of example only, and with reference to the accompanying drawings, in which:
Referring now to
Clients 54 each belong to individuals or entities that will use their respective client 54 to submit requests to primary server 62. Each client 54 is typically a computing device such as a personal computer having a keyboard and mouse (or other input devices), a monitor (or other output device) and a desktop-module connecting the keyboard, mouse and monitor and housing one or more central processing units, volatile memory (i.e. random access memory), non-volatile memory (i.e. hard disk devices) and network interfaces to allow the client 54 to communicate over network 58. However, it is to be understood that client 54 can be any type of computing device, such as a personal digital assistant, cell phone, laptop computer, email paging device etc.
Primary server 62 can be any type of computing device operable to receive and process messages from clients 54, such as Sun Fire V480 running a UNIX operating system, from Sun Microsystems, Inc. of Palo Alto Calif., and having four central processing units each operating at about 900 megahertz and having about four gigabytes of random access memory. However, it is to be emphasized that this particular server is merely exemplary, a vast array of other types of computing environments for primary server 62 are within the scope of the invention. The type of message being received and processed by primary server 62 is not particularly limited, but in a present embodiment, server 62 operates an on-line trading system, and is thus able to process messages that include requests to purchase, sell, cancel etc. securities that can be traded on-line. More particularly, server 62 is operable to maintain a central matchine engine, where requests are executed against each other, and against a central repository of orders to thereby process the trading of securities. Primary server 62 is also connected to a primary non-volatile storage 66 that maintains all non-volatile data associated with the requests and processing thereof for primary server 62.
Backup server 70 typically has the identical (or substantially identical) computing environment as primary server 62. More particularly, the computing environment of backup server 70, including its hardware, operating system, applications, etc. will render backup server 70 operable to completely substitute the functionality of primary server 62 in the event of a failure of primary server 62. Accordingly, backup server 70 is also connected to a backup non-volatile storage 74 that maintains all non-volatile data associated with the requests and processing thereof for backup server 70.
System 50 also includes a replication link 78 that interconnects primary server 62 and backup server 70. In a present embodiment, replication link 78 itself includes a main link 82 and a failsafe link 86 to provide greater robustness in communications between primary server 62 and backup server 70.
Further details about the functions of primary server 62, backup server 70 and replication link 78, and by extension the various types of hardware that can be used to implement servers 62 and 70, will become apparent in the discussion below.
Referring now to
Referring still to
Primary server 62 also includes a transaction log TLP that in a present embodiment resides in volatile memory (i.e. random access memory) of primary server 62. Requests that are processed by application process APP are executed as a sequence of discrete ACID transactions. Thus, during the execution of a transaction by application process APP, the details of the transaction are prepared as a transaction record that is written to transaction log TLP. The details of the transaction typically includes changes made to the database tables and queues that are used to track the requests and otherwise facilitate the processing performed by system 50.
Transaction log TLP also connects to a checkpoint agent CAP which in turn connects to primary non-volatile storage 66. Transaction log TLP and checkpoint agent CAP cooperate to periodically flush the contents of transaction log TLP to primary non-volatile storage 66. The criteria to determine when to flush (i.e. save) the contents of transaction log TLP to primary non-volatile storage 66 depends on the state in which system 50 is operating. In the normal state shown in
Primary server 62 also includes a replication agent RAP that is also connected to transaction log TLP. Backup server 70 also includes a replication agent RAB that communicates with a backup transaction log TLB also resident in backup server 70. In turn, backup transaction log TLB connects to its own checkpoint agent CAB. Similar to transaction log TLP and checkpoint agent CAP, transaction log TLB and checkpoint agent CAB cooperate to periodically flush the contents of transaction log TLB to backup non-volatile storage 74. Thus, in the normal state of system 50 in
Primary server 62 and backup server 70 also each respectively include a primary failover agent FAP and a backup failover agent FAB. Failover agent FAP and failover agent FAB are operable to periodically test the integrity of link 78 and each other. In a present embodiment, failover agent FAP will periodically deliver a keep-alive signal (e.g. “Are you alive?”) to failover agent FAB, to which failover agent FAB is expected to periodically respond (e.g. “Yes I am). Provided such requests are responded to by failover agent FAB, and provided primary server 62 continues to operate normally, then system 50 will remain in the state shown in
It should now be apparent that failover agent FAP, failover agent FAB, replication agent RAP and replication agent RAB are operable to make use of both main link 82 and failsafe link 86 that together comprise link 78, as appropriate or as otherwise desired. In this manner, system 50 can remain in the normal state as long as at least one of main link 82 and failsafe link 86 are operational.
Referring now to
Beginning first at step 210, messages are received.
Example format of message M
Thus, Field 1 of Table 1, “Client ID” contains an address or other identifier of client 54 2 with system 50. In the example of Table I, Client ID is simply populated with the data “client 54 2” but more typically, Client ID will include a user-id, and/or an Internet Protocol (“IP”) address of client 542. Field 2 of Table 1, “Message ID” contains an identifier to allow the elements in system 50 to distinguish this particular message from client 54 2 from other messages from client 54 2 that may now or in the future be generated by client 54 2. Typically, Message ID will be a sequence number, incrementing for each message generated by client 54 2. In the example of Table I, Message ID is simply populated with the data “0001”. Field 3 of Table 1, “Message Body” contains a service request, or another type of request or any other type of information that can be generated by a client 54 for processing by the particular application process APP. In the example of Table I, Message Body is simply populated with the data “X”, to generically denote such a message. For example, where application process APP is for processing financial transactions, then “X” can be a request to buy or sell a particular item.
Thus, once message M is received by application process APP, method 200 advances to step 220, at which point the message body X is processed in a manner corresponding to the design of application process APP. In the present embodiment, the message body X comprises a request, and application process APP is configured to process the request as a number of discrete transactions performed in sequence. (In other embodiments, however, such processing could simply be in the form of a single transaction, or a plurality of transactions performed in parallel, according to whether the processing of transactions is deterministic or non-deterministic). The individual transactions thus collectively comprise a work-flow that completes the message request. A simplified example of a workflow is represented generally in
At step 230, each of the transactions from step 220 are performed so that the entirety of the processing related to message body X is performed. (It should be noted that the remaining steps, 230-270 are actually performed on each of the individual transactions discussed in relation to step 220, but the remaining discussion is focused on one such transaction so as to not obscure the description of the embodiment.) Thus, where “X” represented a buy order, then application process APP would process such an order. Having so performed the transaction, a request to commit the transaction is generated.
At step 240, the changes associated with each of the transactions used to process the request in message body X, and a commit request C for those transactions, are written as a record to transaction log TLP. Next, at step 250, the record written at step 240 is replicated or mirrored.
At step 260, replication is confirmed. More particularly to the present embodiment, it is confirmed whether transaction log TLP and transaction log TLB were successfully changed according to commit request C. If the answer generated at step 260 is “yes”, then method 200 advances to step 270, at which point the commit is acknowledged.
If however, at step 260 replication is not confirmed, then method 200 advances to step 280. Such failure can occur in a variety of ways. For example, backup server 70 can lose power or experience a crash, preventing the actual replication at step 250 or at least the confirmation thereof at step 260. In this situation, at step 280 system 50 will switch to the primary-only state, which is discussed below in relation to method 300. Alternatively, link 78 can be broken, also preventing the replication at step 250 and/or confirmation thereof at step 260, also leading system 50 to switch to the primary-only state in association with method 300. A still further possibility, though somewhat less likely, is that the portion of server 62 operating transaction log TLP fails, preventing transaction log TLP from being updated, even though all other aspects of server 62 and system 50 are functioning normally. In this situation, at step 280 system 50 will switch to the backup-only state, which is discussed below in relation to method 400. (Of note, while not explicitly discussed herein, it should now be understood that other types of states can be invoked at step 280.)
Concurrent with the performance of method 200, checkpoint agent CAP will, at various intervals, flush the contents of transaction log TLP to non-volatile storage 66, while checkpoint agent CAB will periodically flush the contents of transaction log TLB to non-volatile storage 74. It should be noted that checkpoint agents CA can perform their functions independently of each other, and need not flush at the same time. Checkpoint agent CAB will also periodically update all of the tables 94 and queues 98 in backup server 70 based on the record(s) in transaction log TLB. The intervals when such flushing occurs need not depend on the performance of method 200, and can thus be performed substantially independently from method 200. The intervals can be based on pre-set time periods, or a predefined number of transaction records being held in volatile memory, or can even be based on the amount of random access memory being occupied by each transaction log TL such that flushes to non-volatile storage are performed as a means of freeing up such random access memory. Other intervals and/or criteria to be used for flushing the contents of each transaction log TL will now occur to those of skill in the art.
Referring now to
Referring now to
In general, steps 310-330 will be performed substantially the same way as steps 210-230. However, at step 340 method 300 begins to differ from method 200, as the transaction records are only written to primary transaction log TLP. At step 350, the changes to transaction log TLP written at step 340 are immediately flushed to non-volatile storage 66 by checkpoint agent CAP. At step 360, the commit requested at step 330 is acknowledged, whereby transaction log TLP will return an acknowledgement to application process APP, in much the same way an acknowledgment is returned at step 270 of method 200, but wherein such acknowledgment does not include any acknowledgment from backup server 70.
Next, at step 370 a determination is made as to whether backup server 70 has become available. Step 370 will typically be performed by failover agent FAP which will attempt to communicate with failover agent FAB to see if link 78 is now active and/or whether backup server 70 is back online. Thus, if at step 370, it is determined that backup server 70 is now available, then method 300 advances to step 380 at which point the state is changed. More particularly, the primary-only state of system 50 in
It should be understood that many modifications to method 300 are possible. In particular, it should be noted that steps 370 and 380 can be eliminated altogether, in favour of having a system administrator (or other IT professional operating system 50) power-down and then bring up system 50, manually modifying transactions logs TL and non-volatile storage devices 66 and 74 to synchronize their states. Alternatively, where step 370 is used, then it will be understood that at step 380 transaction logs TL and non-volatile storage devices 66 and 74 will be synchronized, preferably, though not necessarily, in an automated fashion, prior to the recommencement of method 200.
Referring now to
Referring now to
Beginning at step 410, it is assumed that system 50 is operating in the normal state shown in
However, if, at step 415, failover agent FAB of backup server 70 fails to detect the keep-alive signal, then at step 415 it is determined that “no”, primary server 62 is unavailable, and method 400 advances to step 420. Such a determination could be made for a number of reasons. For example, if primary server 62 fails then it will be determined that primary server 62 is unavailable. It should be noted that the failure of primary server 62 can occur in a number of ways. Primary server 62 could completely shut down and thus fail to maintain the “keep-alive” signal, or a portion of primary server 62 could fail and thereby indicate that failover agent FAP should identify such a failure to failover agent FAB, and expressly request that backup server 70 assume responsibility for processing messages for clients 54.
At step 420, the integrity of the replication link is verified. In this event, backup server 70 can attempt to communicate with primary server 62 via Network 58 to see if primary server 62 is still operational, and, if during such communication it is determined that server 62 is still operational, but that link 78 has failed, then the answer returned at step 420 will be “Link Failure” and backup server 70 can simply flush the contents of transaction log TLB to non-volatile storage 74 and enter a wait state. Backup server 70 can then wait for reactivation of link 78 while system 50 enters the primary-only state in
Thus, at step 425, backup server 70 will switch itself to the backup-only state. In a present embodiment, backup server 70 will immediately flush transaction log TLB to non-volatile storage 74. Additionally, backup server 70 will recreate the data environment as it existed on primary server 62 at the time of failure, using the transaction log of flushed transaction records stored on non-volatile storage 74. Further, failover agent FAB will bring application process APB out of its “warm” state into a hot state, and otherwise prepare backup server 70 to receive messages from clients 54.
At step 430, backup server will begin to receive messages from clients 54. It should be noted that, in a present embodiment, such message requests will automatically start being delivered to backup server 70 once clients 54 fail to communicate with primary server 62 and are subsequently informed that backup server 70 is available. More particularly, each client 54 will be provided with a network address for both server 62 and server 70 prior to commencement of method 200. Further, as part of the performance of step 210 of method 200, or step 310 of method 300, application process APP will send acknowledgements to the originating client 54. Thus when a client 54 fails to have a message delivery acknowledged, (or detects a loss of a keep-alive signal between the client 54 and server 62), then that client 54 will utilize the address of backup server 70. Once backup server 70 indicates to client 54 that it has completed its recovery and is ‘ready’, then client 54 will start to deliver that message (and all messages for which no update, (i.e. an indication of completion of processing) by primary server 62 was received) to application process APB of backup server 70. It should also be noted that, during initial communication between clients 54 and backup server 70, each client 54 and backup server 70 will perform some initial comparisons of Message IDs (or sequence numbers) from client 54 with processing results that were previously performed by primary server 62 during normal state and stored on backup server 70 to ensure no duplicates exist and thereby further ensure that no requests are performed twice. A more detailed discussion of how client 54 can behave in relation to step 430 will be provided in greater detail below in relation to method 500.
Method 400 then cycles through steps 435-455, which operate on backup server 70, but are performed substantially in the same way as steps 320-360 in method 300. At step 460, backup server 70 will check again (via failover agent FAB) whether primary server 62 has become available, and if, so, method 400 advances to step 465 where steps are taken to reactivate primary server 62 and then return system 50 to the normal state and regular operation under step 410. Such steps will include the synchronizing of transaction logs TL and non-volatile storage devices 66 and 74 according to the activities of backup server 70. However, if at step 460 backup server 70 determines that primary server 62 is still unavailable, then method 400 will return to step 430 to receive further messages from clients 54.
It should be understood that many modifications to method 400 are possible. In particular, it can be desired to collapse steps 415 and 420 as a single decision, wherein backup server 70 will simply proceed to step 425 if communication with primary server 62 is lost, regardless of whether the communication failure was due to a failure of primary server 62 or a failure of link 78. Where the loss of communication is simply due to a failure of link 78, and yet primary server 62 is continuing to operate normally, then system 50 will enter primary-only mode and operate method 300, while backup server 70 will simply wait to receive messages at step 430, but will not actually receive any such messages, as those messages are continuing to be processed by primary server 62 in accordance with method 300. When performing this modification it should now be understood that step 460 can also be eliminated. In certain applications, it may be preferred to employ this modification, and to perform these steps manually in order to reduce the time needed to reactivate system 50.
Referring now to
However the failure is experienced, method 500 then advances to step 520, at which point client 54 attempts to initiate communications with backup server 70. This is typically implemented by providing clients 54 with the network address of both primary server 62 and primary server 70, such that clients 54 are prepared for a failure of primary server 62 and are able to initiate method 500 to fail over to backup server 70.
At step 530, clients 54 will remain in a wait state until backup server 70 provides a recovery signal, or other signal that indicates that backup server 70 is ready to start processing messages from clients 54. Such a recovery signal from backup server 70 can be generated by backup server 70 according to, for example, step 429 of method 425 a.
Once the recovery signal is received from backup server 70, method 500 advances to step 540, at which point the client 54 will resend any outstanding requests to application process APB of backup server 70. Next, method 500 advances to step 550, at which point client 54 resumes normal transmission of requests, only now all requests are directed (again as embedded in a message from client 54) to application process APB of backup server 70.
While only specific combinations of the various features and components of the present invention have been discussed herein, it will be apparent to those of skill in the art that desired subsets of the disclosed features and components and/or alternative combinations of these features and components can be utilized, as desired. For example, step 210 “Receive Messages” of method 200 can be performed in a number of sub-steps to enhance functionality of method 200. Likewise, step 310 and step 430 can also be so modified. Referring now to
It should now be apparent that method 210 a can be modified as a means to effect step 310 or step 430, as the context requires. Of particular note, it is contemplated that a client 54 may be quite likely to send duplicate messages to backup server 70 as part of client 54 executing method 500 in a failover from primary server 62 to backup server 70. Thus, as client 54 performs step 540 of method 500 and resends outstanding messages to backup server 70, such outstanding messages may in fact be duplicates—i.e. messages that were successfully processed by server 62, and mirrored by server 70, but for which server 62 was unable to acknowledge to client 54. Thus, method 210 a can be used to effect step 430 of method 400 in order to manage such duplicate requests.
As another variation, step 250 of method 200 can also be carried out as a number of sub-steps. Referring now to
It is to be understood that primary server 62 and backup server 70 need not be implemented on two separate computing environments, but in fact could be implemented on a single computing environment, that includes multiple processors and which is partitioned into a virtual primary server and virtual backup server.
As another implementation, two separate servers can be divided into two partitions. The first partition of each machine can be designated a primary server, while the second partition can be designated a backup server. The primary server of the first machine is then coupled to the backup server of the second machine, and vice versa, in order to provide a double failover mechanism.
As another implementation, a plurality of backup servers can be connected to a primary server and employed to provide the potential for even higher availability of the system.
It should also be understood that the roles performed by the backup server and primary server can be reversed upon recovery of a failed primary server. For example, in the event that a primary server fails and the system fails over to a backup server, as previously described, then at such time as the primary server resumes operation, the backup server can then assume the role of the primary server and the primary server can adopt the role of the backup server.
The above-described embodiments of the invention are intended to be examples of the present invention and alterations and modifications may be effected thereto, by those of skill in the art, without departing from the scope of the invention which is defined solely by the claims appended hereto.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5305200||Nov 2, 1990||Apr 19, 1994||Foreign Exchange Transaction Services, Inc.||Financial exchange system having automated recovery/rollback of unacknowledged orders|
|US5381545||May 28, 1992||Jan 10, 1995||International Business Machines Corporation||Data backup and recovery in a data processing system|
|US5437022 *||Dec 17, 1992||Jul 25, 1995||International Business Machines Corporation||Storage controller having additional cache memory and a means for recovering from failure and reconfiguring a control unit thereof in response thereto|
|US5596706||Aug 10, 1994||Jan 21, 1997||Hitachi, Ltd.||Highly reliable online system|
|US5742792 *||May 28, 1996||Apr 21, 1998||Emc Corporation||Remote data mirroring|
|US5987432||Dec 29, 1997||Nov 16, 1999||Reuters, Ltd.||Fault-tolerant central ticker plant system for distributing financial market data|
|US6000020 *||Apr 1, 1997||Dec 7, 1999||Gadzoox Networks, Inc.||Hierarchical storage management from a mirrored file system on a storage network segmented by a bridge|
|US6101497 *||Apr 25, 1997||Aug 8, 2000||Emc Corporation||Method and apparatus for independent and simultaneous access to a common data set|
|US6154847||Sep 1, 1994||Nov 28, 2000||International Business Machines Corporation||Method and system for performing resource updates and recovering operational records within a fault-tolerant transaction-oriented data processing system|
|US6199055||Nov 5, 1997||Mar 6, 2001||E-Stamp Corporation||System and method for providing fault tolerant transcriptions over an unsecured communication channel|
|US6202149||Sep 30, 1998||Mar 13, 2001||Ncr Corporation||Automated application fail-over for coordinating applications with DBMS availability|
|US6308287||Nov 2, 1998||Oct 23, 2001||International Business Machines Corporation||Transaction processing system, method and computer program product|
|US6480970 *||Jun 7, 2001||Nov 12, 2002||Lsi Logic Corporation||Method of verifying data consistency between local and remote mirrored data storage systems|
|US6493826||Jul 12, 2000||Dec 10, 2002||International Business Machines Corporation||Method and system for fault tolerant transaction-oriented data processing system|
|US6523087 *||Mar 6, 2001||Feb 18, 2003||Chaparral Network Storage, Inc.||Utilizing parity caching and parity logging while closing the RAID5 write hole|
|US6526487 *||Oct 22, 2001||Feb 25, 2003||Legato Systems, Inc.||Performing acknowledged operations on original and mirrored copies of data|
|US6574750||Jan 6, 2000||Jun 3, 2003||Oracle Corporation||Preserving consistency of passively-replicated non-deterministic objects|
|US6681339 *||Jan 16, 2001||Jan 20, 2004||International Business Machines Corporation||System and method for efficient failover/failback techniques for fault-tolerant data storage system|
|US6823336 *||Sep 26, 2000||Nov 23, 2004||Emc Corporation||Data storage system and method for uninterrupted read-only access to a consistent dataset by one host processor concurrent with read-write access by another host processor|
|US6910150 *||Oct 15, 2001||Jun 21, 2005||Dell Products L.P.||System and method for state preservation in a stretch cluster|
|US6978347 *||Jan 22, 2004||Dec 20, 2005||Hitachi, Ltd.||Method and apparatus for re-synchronizing paired volumes via communication line|
|US7055059 *||Dec 27, 2002||May 30, 2006||Emc Corporation||Remote data mirroring|
|US7058850 *||Jul 31, 2002||Jun 6, 2006||Hewlett-Packard Development Company, L.P.||Method and system for preventing data loss within disk-array pairs supporting mirrored logical units|
|US7058853 *||Jun 11, 2001||Jun 6, 2006||Hewlett-Packard Development Company, L.P.||Highly available transaction processing|
|US20040078645 *||Dec 16, 2002||Apr 22, 2004||Hitachi, Ltd.||Storage unit subsystem|
|US20040103342 *||Jul 29, 2003||May 27, 2004||Eternal Systems, Inc.||Consistent message ordering for semi-active and passive replication|
|US20050159927 *||Jan 20, 2004||Jul 21, 2005||International Business Machines Corporation||Remote enterprise management of high availability systems|
|US20060174076 *||Mar 30, 2006||Aug 3, 2006||Hitachi, Ltd.||Data processing system including storage systems|
|US20070140112 *||Dec 21, 2005||Jun 21, 2007||Nortel Networks Limited||Geographic redundancy in communication networks|
|WO2003009139A1||Jul 16, 2002||Jan 30, 2003||Transact In Memory Inc||Parallelized redo-only logging and recovery for highly available main memory database systems|
|1||Ioannidis, S. et al., On using Network Memory to Improve the Performance of Transaction-Based Systems, Technical Report, Online? No. 190., Apr. 14, 1997.|
|2||Polyzois, C.A. et al., Association for Computing Machinery: "Evaluation of Remote Backup Algorithms for Transaction processing Systems", proceedings of the ACM Sigmod International Conference on Management of Data, San Diego, Jun. 2-5, 1992, N.Y., ACM, US. Jun. 2, 1992.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7725764||Aug 4, 2006||May 25, 2010||Tsx Inc.||Failover system and method|
|US7765290 *||May 30, 2008||Jul 27, 2010||International Business Machines Corporation||Methods and arrangements to detect a failure in a communication network|
|US7975174||Jul 5, 2011||Tsx Inc.||Failover system and method|
|US8020037 *||Sep 23, 2008||Sep 13, 2011||Netapp, Inc.||Creation of a test bed for testing failover and failback operations|
|US8244949||Nov 6, 2008||Aug 14, 2012||Nec Infrontia Corporation||Slot interface access unit, method thereof, and program thereof, as well as redundancy configuration of main unit, and replacing method of the same|
|US8285905 *||Oct 18, 2011||Oct 9, 2012||Nec Infrontia Corporation||Redundancy configuration and replacement method in a system including a master main unit and slave main units|
|US8473774 *||Apr 28, 2008||Jun 25, 2013||Nec Infrontia Corporation||Main device redundancy configuration and main device replacing method|
|US8631277||Dec 10, 2010||Jan 14, 2014||Microsoft Corporation||Providing transparent failover in a file system|
|US8713353 *||Aug 8, 2011||Apr 29, 2014||Nec Corporation||Communication system including a switching section for switching a network route, controlling method and storage medium|
|US8788579 *||Sep 9, 2011||Jul 22, 2014||Microsoft Corporation||Clustered client failover|
|US8825885||Oct 30, 2012||Sep 2, 2014||Microsoft Corporation||Data communication protocol|
|US8850025||Oct 30, 2012||Sep 30, 2014||Microsoft Corporation||Data communication coordination with sequence numbers|
|US8850261 *||Jun 1, 2011||Sep 30, 2014||Microsoft Corporation||Replaying jobs at a secondary location of a service|
|US8856582||Jun 30, 2011||Oct 7, 2014||Microsoft Corporation||Transparent failover|
|US8909977 *||Dec 31, 2013||Dec 9, 2014||Tsx Inc.||Failover system and method|
|US9071661||Aug 29, 2014||Jun 30, 2015||Microsoft Technology Licensing, Llc||Data communication coordination with sequence numbers|
|US20060271929 *||May 27, 2005||Nov 30, 2006||Computer Associates Think, Inc.||Method and system for providing job forecasting in a computer system|
|US20080126832 *||Aug 4, 2006||May 29, 2008||Tudor Morosan||Failover system and method|
|US20080247308 *||Apr 4, 2007||Oct 9, 2008||Cisco Technology, Inc.||Providing session redundancy using priority during a syncing process|
|US20080288686 *||Apr 28, 2008||Nov 20, 2008||Nec Infrontia Corporation||Main device redundancy configuration and main device replacing method|
|US20090287954 *||Nov 6, 2008||Nov 19, 2009||Nec Infrontia Corporation||Slot interface access unit, method thereof, and program thereof, as well as redundancy configuration of main unit, and replacing method of the same|
|US20100036950 *||Feb 11, 2010||Electronics And Telecommunications Research Institute||Method and apparatus for providing home contents|
|US20100269121 *||Oct 21, 2010||Accenture Global Services Gmbh||Exchangeable application components|
|US20110296232 *||Dec 1, 2011||Nec Corporation||Communication system, communication unit, control unit, and controlling method|
|US20120311375 *||Jun 1, 2011||Dec 6, 2012||Microsoft Corporation||Redirecting requests to secondary location during temporary outage|
|US20120311377 *||Jun 1, 2011||Dec 6, 2012||Microsoft Corporation||Replaying jobs at a secondary location of a service|
|US20130066941 *||Sep 9, 2011||Mar 14, 2013||Microsoft Corporation||Clustered client failover|
|US20140115380 *||Dec 31, 2013||Apr 24, 2014||Tsx Inc.||Failover system and method|
|WO2013036697A3 *||Sep 7, 2012||May 2, 2013||Microsoft Corporation||Clustered client failover|
|U.S. Classification||714/6.3, 714/E11.106, 714/E11.08|
|International Classification||G06F11/20, G06F11/00|
|Cooperative Classification||G06F11/2097, G06F11/2007, G06F11/2071, G06F11/2046, G06F11/2028, G06F11/1482, G06F11/1687, G06F11/2041|
|European Classification||G06F11/20P2E, G06F11/20S2P, G06F11/20P8|
|Mar 23, 2011||FPAY||Fee payment|
Year of fee payment: 4
|Apr 22, 2015||FPAY||Fee payment|
Year of fee payment: 8