Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
1998-04-01
2003-03-04
Courtenay, III, St. John (Department: 2151)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
C709S241000, C709S241000, C709S201000
Reexamination Certificate
active
06529932
ABSTRACT:
FIELD OF THE INVENTION
This invention relates generally to transaction processing, and more particularly to distributed transaction processing in a network with asynchronous communications in the form of messages.
BACKGROUND OF THE INVENTION
In distributed databases, a transaction may involve operations to be performed at different sites. The operations in a transaction must be performed atomically (i.e., either all of them are performed or none of them is performed.) Atomic transaction implementation is typically based on a commit protocol, such as the widely used two-phase commit protocol. In a “prepare” phase of the two-phase commit protocol, a transaction coordinator asks all resource managers involved in the transaction to vote whether each of them can guarantee the execution of its part of the transaction. If all votes are positive, the transaction coordinator in a “commit” phase asks each resource manager to actually carry out its respective operation.
The implementation of the conventional two-phase commit for distributed transaction processing in a network with asynchronous communications poses significant problems. With asynchronous communications, one application sends a request to a receiving application regardless of whether the receiving application is operating. The request is passed through the network which includes nodes that can come on or off at random intervals. There is no guarantee when the request will reach the receiving application and when the requesting application will receive a response from the receiving application. In the conventional commit process, after sending a positive vote in the prepare phase, a resource manager may have to lock up its resource so that it will be able to fulfill its promise of performing the requested operation when it receives a commit instruction from the transaction coordinator. When applied to distributed databases, the two-phase commit protocol locks up the data in a database involved in the transaction so that no changes requested by other clients can be made. Due to the unpredictable delivery time of asynchronous communications, the database may be locked up for an unacceptably long time and become useless.
SUMMARY OF THE INVENTION
In accordance with the present invention, there is provided a method and system for processing distributed transactions that integrates the execution of operations of a transaction on separate computers with the exactly-once in-order message delivery of a message queuing system to allow the transaction operations to be performed atomically and asynchronously. In a distributed transaction, a first application on a first computer requests a local resource manager to perform a first operation and uses a message queue (MQ) server to send a request message to a second application on a remote computer for the performance of a second operation. The local resource manager and the MQ server of the first computer are coordinated to perform the first operation and send the request message in a local committed transaction. The message is delivered exactly once and in sequence to a target message queue for the second application on the remote computer. The second application uses the MQ server of the remote computer to read the message and uses a second resource manager to perform the requested second operation in a second local committed transaction. As part of the second local committed transaction, the MQ server of the remote computer sends an acknowledgment which is delivered by the message queuing system to the MQ server of the first computer.
In accordance with another aspect of the invention, a connector computer is used to bridge two different message queuing systems to allow the processing of a distributed transaction which involves computers in the two message queuing systems. The connector computer is connected to both message queuing systems and has a connector application. When an application in the first message queuing system initiates a transaction and sends a request message to an application on a second computer in the second message queuing system, the message is routed to a message queue of the connector computer. The connector application translates the message into the format of the second message queuing system and forwards the translated message to the second computer.
The advantages of the invention will become apparent with reference to the following detailed description when taken in conjunction with the drawings in which:
REFERENCES:
patent: 4499576 (1985-02-01), Fraser
patent: 4584679 (1986-04-01), Livingston et al.
patent: 4623886 (1986-11-01), Livingston
patent: 4656474 (1987-04-01), Mollier et al.
patent: 4736369 (1988-04-01), Barzilai et al.
patent: 4769815 (1988-09-01), Hinch et al.
patent: 4853842 (1989-08-01), Thatte et al.
patent: 5063562 (1991-11-01), Barzilai et al.
patent: 5072370 (1991-12-01), Durdik
patent: 5163131 (1992-11-01), Row et al.
patent: 5193090 (1993-03-01), Filipiak et al.
patent: 5247676 (1993-09-01), Ozur et al.
patent: 5261002 (1993-11-01), Perlman et al.
patent: 5285445 (1994-02-01), Lehnert et al.
patent: 5287103 (1994-02-01), Kasprzyk et al.
patent: 5367523 (1994-11-01), Chang et al.
patent: 5412717 (1995-05-01), Fischer
patent: 5432715 (1995-07-01), Shigematsu et al.
patent: 5442637 (1995-08-01), Nguyen
patent: 5465328 (1995-11-01), Dievendorff et al.
patent: 5491791 (1996-02-01), Glowny et al.
patent: 5499297 (1996-03-01), Boebert
patent: 5526358 (1996-06-01), Gregerson et al.
patent: 5526489 (1996-06-01), Nilakantan et al.
patent: 5528605 (1996-06-01), Ywoskus et al.
patent: 5546391 (1996-08-01), Hochschild et al.
patent: 5555415 (1996-09-01), Allen
patent: 5557748 (1996-09-01), Norris
patent: 5572522 (1996-11-01), Calamvokis et al.
patent: 5572582 (1996-11-01), Riddle
patent: 5613012 (1997-03-01), Hoffman et al.
patent: 5627766 (1997-05-01), Beaven
patent: 5689706 (1997-11-01), Rao et al.
patent: 5758184 (1998-05-01), Lucovsky et al.
patent: 5761507 (1998-06-01), Govett
patent: 5764625 (1998-06-01), Bournas
patent: 5768614 (1998-06-01), Takagi et al.
patent: 5777987 (1998-07-01), Adams et al.
patent: 5778384 (1998-07-01), Provino et al.
patent: 5781703 (1998-07-01), Desai et al.
patent: 5793861 (1998-08-01), Haigh
patent: 5799321 (1998-08-01), Benson
patent: 5806065 (1998-09-01), Lomet
patent: 5812773 (1998-09-01), Norin
patent: 5812819 (1998-09-01), Rodwin et al.
patent: 5815667 (1998-09-01), Chien et al.
patent: 5819042 (1998-10-01), Hansen
patent: 5819272 (1998-10-01), Benson
patent: 5828653 (1998-10-01), Goss
patent: 5832514 (1998-11-01), Norin et al.
patent: 5835727 (1998-11-01), Wong et al.
patent: 5838907 (1998-11-01), Hansen
patent: 5845081 (1998-12-01), Rangarajan et al.
patent: 5854901 (1998-12-01), Cole et al.
patent: 5864669 (1999-01-01), Osterman et al.
patent: 5870540 (1999-02-01), Wang et al.
patent: 5872968 (1999-02-01), Knox et al.
patent: 5872971 (1999-02-01), Knapman et al.
patent: 5875301 (1999-02-01), Duckwall et al.
patent: 5875306 (1999-02-01), Bereiter
patent: 5878056 (1999-03-01), Black et al.
patent: 5881051 (1999-03-01), Arrowood et al.
patent: 5887275 (1999-03-01), Nguyen et al.
patent: 5901138 (1999-05-01), Bader et al.
patent: 5916307 (1999-06-01), Piskiel et al.
patent: 5920697 (1999-07-01), Masters et al.
patent: 5922049 (1999-07-01), Radia et al.
patent: 5930479 (1999-07-01), Hall
patent: 5956340 (1999-09-01), Afek et al.
patent: 5959995 (1999-09-01), Wicki et al.
patent: 5987496 (1999-11-01), Shen et al.
patent: 6012059 (2000-01-01), Neimat et al.
patent: 6012094 (2000-01-01), Leymann et al.
patent: 6058389 (2000-05-01), Chandra et al.
patent: 6088816 (2000-07-01), Nouri et al.
patent: 6154128 (2000-11-01), Wookey et al.
patent: 6157927 (2000-12-01), Schaefer et al.
patent: 6167358 (2000-12-01), Othmer et al.
patent: 6173422 (2001-01-01), Kimura et al.
patent: 6182086 (2001-01-01), Lomet et al.
patent: 6397352 (2002-05-01), Chandrasekaran et al.
patent: 6401136 (2002-06-01), Britton et al.
IBM. “Data communication and inter-product communication” 1995, p. 1-4.*
IBM. “MQSeries System Administration”.
Dadiomov Alexander
Habusha Uri
Renous Raphael
Bullock, Jr. Lewis A.
Courtenay III St. John
Leydig , Voit & Mayer, Ltd.
Microsoft Corporation
LandOfFree
Method and system for distributed transaction processing... 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 system for distributed transaction processing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for distributed transaction processing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3074177