Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
1999-03-12
2002-06-25
Burgess, Glenton B. (Department: 2152)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
C709S227000, C709S237000, C707S793000
Reexamination Certificate
active
06411981
ABSTRACT:
BACKGROUND OF THE INVENTION
The invention relates generally to transaction processing, and particularly to a two-phase commit (2PC) transaction protocol for use between transaction processing systems interconnected by a network.
Transaction processing, among other things, often involves a change in state of some form of information collection (e.g., “database”). In fact, a transaction is often defined as an explicitly delimited operation, or set of operations, that change or otherwise modify the content of the database from one consistent state to another. Changes or modifications are treated as a single unit in that all changes/modifications of a transaction are formed and made permanent (i.e., the transaction is “committed”), or none are made (i.e., the transaction is “aborted”). Failures occurring during the execution of a transaction may result in the transaction being aborted, and whatever partial changes were made to the database can be undone to return it to a consistent state.
A paradigm has been developed to insure that the conclusion of a transaction results in maintaining the consistency of the database. Known as the “two-phase commit” (2PC) protocol, this paradigm provides a procedure to coordinate the operation of resources whose participation has been enlisted in the transaction in a name that insures that the participating resources effect the desired change. For example, a transfer of funds from an account of one depositor to the account of another depositor of the same bank will result in a debit to the account of the first depositor, and a concomitant credit to the account of the second depositor, all of which can be handled by a transaction. The bank application will initiate the transaction, perhaps calling upon the services of a disk process resource to retrieve the account information of one depositor so that the debit can be made. Another disk process resource may be employed to retrieve the account of the other depositor to credit that account. In this example, and according to the 2PC protocol, the transaction will conclude with both disk process resources agreeing that the changes have been made according to the 2PC protocol.
Of course, the 2PC protocol is most often used in a homogeneous transaction processing system such as a single multi-tasking processor unit, or one with multiple processor units tightly interconnected in a cluster arrangement. Initiating transactions, and monitoring those transactions between different transaction processing systems, whether heterogeneous or homogeneous, can be a bit more difficult. However, recently there has been proposed a Transaction Internet Protocol (TIP), using the 2PC paradigm by a Transaction Internet Protocol working group of the Internet Engineering Task Force (IETF). This protocol has now been formally accepted as a formal standard (RFC) by the IETF. Attached hereto, as Appendix A is the final version of the IETF paper describing TIP and its requirements.
Briefly, the papers describe a simple 2PC protocol applicable to transactions involving resources in a distributed, Internet-connected transaction. Basically, two models are suggested: a “Push” model and “Pull” model. The Push model is initiated by an application on a first transaction processing system making a request of the transaction manager of that system to “export” a transaction to a second transaction monitoring system to perform some work on behalf of the application. The transaction manager of the first system will “push” the transaction to the second system by sending a message to the transaction manager of the second system. The message asks the second system to start a transaction as a subordinate of the first system, and return the name, for example “X,” for that transaction on the second system together with the Internet address of the transaction. The application on the first system will then send a message to the desired resource (e.g., a disk process) on the second system, asking it to “do some work, and make it part of the transaction that your transaction manager already knows of by the name of X.” Because the first system's transaction manager knows that it sent the transaction to the second system transaction manager, the first system transaction manager knows to involve the second system transaction manager in the 2PC process.
In the Pull model, the application on the first system merely sends a message to a resource on the second system, requesting that it “do some work, and make it part of a transaction that my transaction manager knows by the name of Y.” The resource process on the second system then asks its transaction manager to enlist in the transaction Y. At that point, the transaction is locally initiated on the second system, and the second system transaction manager will “pull” the transaction (Y) over from the first system. As a result of this pull, the first system's transaction manager knows to involve the second system's transaction manager in the 2PC process.
In the Pull model, the resource must wait to perform the task requested of it by the application until the transaction manager of the second system receives the Pull response from the first system and then notifies the resource to proceed. Unfortunately, this pull of a transaction can be time consuming.
SUMMARY OF THE INVENTION
The present invention provides a modification to the Pull model of the Transaction Internet Protocol that allows for much more efficient and faster operation.
According to the present invention, at least first and second transaction processing systems are available, each including a transaction manager and various resources applicable for use in a transaction. The two systems are coupled for access to the Internet for communicating therebetween. An application program resident on the first system initiates a transaction, and as a part of that transaction, sends a request for work to be performed by a resource managed by a process (the recipient of the request) on the second system. The request will contain an identification of the transaction. The recipient process will notify its associated transaction manager which, in turn, will initiate a (second) transaction at the second system. When the second transaction is created, the transaction manager will instruct the recipient process to perform the requested activity under the aegis of the second transaction, and then notify the transaction manager of the first system of the second transaction together with the identification of the associated transaction at the first system. The transaction manager of the first system (now, the “Beginner” transaction manager), upon receiving the identification of the transaction started on the second system, will register that transaction as a subordinate to the transaction initiated at the first system, and will send a “Pull Response” to the transaction manager (now, the “Subordinate” transaction manager) on the second system that the registration has been completed. The recipient process, when its requested task is complete, will check with its (local) transaction manager, the Subordinate transaction manager, to determine if the Pull Response has been received. If so, the recipient process will respond as necessary to the application program of the first system. To conclude the transaction, the application program initiates and “End Transaction” to cause the transaction manager to initiate the two-phase commit protocol. This will include the transaction manager of the second system.
A principal advantage of the invention is that TIP technique is employed to perform a transaction over two systems connected by an Internet link in a manner that precludes a recipient process from having to wait until its associated (Subordinate) transaction manager receives back a Pull Response from the Beginner transaction manager of the first (requesting) system. Rather, while the second system is waiting for that Pull response, the associated recipient process has initiated the requested activity, and can be ready to reply to the requesting applicat
Evans Keith B.
Gondi Albert C.
Hansen Roger J.
Klein Johannes
Lanka Sitaram V.
Burgess Glenton B.
Compaq Computer Corporation
Flynn Kimberly
Oppenheimer Wolf & Donnelly
Sherry Leah
LandOfFree
Method and apparatus for conducting a transaction between... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for conducting a transaction between..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for conducting a transaction between... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2974327