A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
The current invention relates to business processes and in particular to a system and method to provide BPEL support for correlation aggregation.
Business Process Execution Language (BPEL) is an industry specification for describing business processes. BPEL is a conversational-based system, this means that if two partners are communicating, they have to know what they are communicating about. Thus unsolicited messages are not supported, partners can only receive messages for which they are waiting. A BPEL process can be initiated via a message as well as receive messages after it is initiated. A BPEL engine determines if an incoming message is to either instantiate an instance or be routed to an existing instance by looking at the operation name. Therefore a process cannot have an initial receive and a mid-process receive using the same operation.
A system and method are disclosed for providing BPEL support for correlation aggregation. One such system can comprise a business process engine, executing on one or more application servers organized in a cluster, wherein each application server executes on one or more microprocessors. The system can further comprise a database including a table which stores records relating to message groups and business process instances. When a message is received by the business process engine, the business process engine can determine an identity associated with the message, and check the database to determine if there is an entry associated with the identity. If there is no entry associated with the identity, then the business process engine can instantiate a first business process instance associated with the identity, and if there is an entry associated with the identity, then the business process engine can route the message to a business process instance associated with the identity.
In accordance with an embodiment of the invention, a plurality of messages can be received which all use the same operation and also share some common identity in the message content. The first message from the plurality of messages that is received can instantiate a new instance and the rest of the messages can be routed to the new instance.
In the following description, the invention will be illustrated by way of example and not by way of limitation in the figures of the accompanying drawings. References to various embodiments in this disclosure are not necessarily to the same embodiment, and such references mean at least one. While specific implementations are discussed, it is understood that this is provided for illustrative purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without departing from the scope and spirit of the invention.
Furthermore, in certain instances, numerous specific details will be set forth to provide a thorough description of the invention. However, it will be apparent to those skilled in the art that the invention may be practiced without these specific details. In other instances, well-known features have not been described in as much detail so as not to obscure the invention.
BPEL is a conversational-based system in which partners who are communicating need to know what they are communicating about. In a typical business process, data, in the form of messages, needs to be collected from a plurality of partners, e.g., a customer, a service provider, etc. To begin this process, a message is received which creates a new instance of the business process. The business process can include mid-process receive activities, which enable the process to wait and collect messages from the other partners before completing processing. However, the first message received by the system is not necessarily the “first” message, i.e., the message the business process is waiting for to initiate processing. As such, other messages may be held by the system while the system waits for the “first” message to begin processing. In many environments, this adds unnecessary delay to the business process. For example, a business process can be used in the insurance industry to open a claim and gather information related to that claim. In this scenario, partners may include a claims adjuster, an appraiser, the insured customer, etc. Messages from these partners may not always be received in the same order, so if the business process is only configured to wait for a message from the customer to open a claim, the business process may be left waiting while it receives messages from other partners. In such a scenario, the business process should be initiated when any message from a partner is received, rather than a particular “first” message.
In accordance with an embodiment of the invention, a plurality of messages can be received which all use the same operation and also share some common identity in the message content. The first message from the plurality of messages that is received can instantiate a new instance and the rest of the messages can be routed to the instance instantiated.
To support this operation, a new database table 108 can be created to store a record for each of these message groups. When a first message comes in, having a first identity, a new row can be populated in the table associated with this identity. When subsequent messages come in for the same group, which share the first identity, the engine can detect the existence of the record in that table and can route the messages to the existing instance. When a first message for a different group comes in, having a second identity, another new row can be populated in the table and subsequent messages associated with that group, which share the second identity, can be routed to the new instance. As used herein, the first message for a particular message group refers to the first message received and processed by the BPEL engine, even though this may not be the first message sent for this group. Thus, when a series of messages for a message group are sent, whichever is the first to be received and processed by the BPEL engine is the “first message” regardless of the order in which those messages were created and/or sent. Additionally, for a BPEL process using correlation, the same operation (or eventName) is allowed to be used in entry receive and mid-process receive.
In accordance with an embodiment of the invention, the common identity shared by the groups of messages can be the BPEL correlationSet value, which can be stored as part of a primary key in a table. This can ensure that one record is created for a message group. Using the database to coordinate receives of these messages also enables the solution to work across multiple nodes in a server cluster. The synchronization of related messages can be performed at the database layer, which enables the system to work in a clustered environment.
In accordance with an embodiment of the invention, during static analysis of a BPEL process, operations (or eventNames) are identified that are used in both entry receives and mid-process receives. For a BPEL process using correlation, a new message is always routed to either a new instance or an existing instance. Additionally, the engine performs the message routing. The message can be an invoke message creating a new instance or a callback message continuing an existing instance.
In accordance with an embodiment of the invention, error conditions can be encountered under some circumstances. For example, if msg4 308 and msg5 400 are received in close succession, the system can experience a race condition. This is possible where msg4 closes the first instance of P1 310, but the engine routes msg5 400 as callback to that instance instead of creating a new second instance of P1 402. In this case, if a sixth message, msg6 404, arrives, the engine will route this to the entry receive of the new second instance of P1 402. While the new instance of P1 iterates, additional messages, such as msg7 406, and msg8 408, can be routed to the second instance of P1 402 via the Continue_Receive activity. However, because, in this example, msg5 initially got routed to a closed instance of P1 310 (which was closed by msg4 308), msg5 could not be handled. Processing of msg5 then falls to the “Recovery” part of the BPEL engine, which can routed msg5 to Continue_Receive.
In another example of an error condition, if expected messages (for example msg6 404, msg7 406 and msg8 408) are not received, then msg5 400 becomes an unhandled callback message waiting for a subscriber. An engine recovery module can try to process this message and fail as there is no subscriber available.
To deal with these error scenarios a number of options are available. For example, a limit can be placed on recovery of callback messages using maxRecoverAttempt. This count specifies the number of attempts auto recovery will make to recover an invoke/callback message. Once the number of recover attempts exceeds this count, the state of message is changes to “exhausted”.
Additionally, a custom SQL script could be written to check for following criteriaCallback is in state=0. Correlation value for this callback exists in CORRELATION_GROUP in closed state (state=0). This indicates the callback is marked for a closed aggregation instance. Users can choose to cancel/purge these instances based on business logic.
In accordance with an embodiment of the invention, BPEL is designed as a conversation based system. As such, it does not handle unsolicited messages, the application is always aware of the messages coming as part of correlation aggregation and chooses to subscribe and process or ignore the message according to business needs.
Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those skilled in the software art. The invention may also be implemented by the preparation of application specific integrated circuits or by interconnecting an appropriate network of conventional component circuits, as will be readily apparent to those skilled in the art.
The various embodiments include a computer program product which is a storage medium (media) having instructions stored thereon/in which can be used to program a general purpose or specialized computing processor(s)/device(s) to perform any of the features presented herein. The storage medium can include, but is not limited to, one or more of the following: any type of physical media including floppy disks, optical discs, DVDs, CD-ROMs, microdrives, magneto-optical disks, holographic storage, ROMs, RAMs, PRAMS, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs); paper or paper-based media; and any type of media or device suitable for storing instructions and/or information. The computer program product can be transmitted in whole or in parts and over one or more public and/or private networks wherein the transmission includes instructions which can be used by one or more processors to perform any of the features presented herein. The transmission may include a plurality of separate transmissions. In accordance with certain embodiments, however, the computer storage medium containing the instructions is non-transitory (i.e. not in the process of being transmitted) but rather is persisted on a physical device.
The foregoing description of the preferred embodiments of the present invention has been provided for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations can be apparent to the practitioner skilled in the art. Embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the relevant art to understand the invention. It is intended that the scope of the invention be defined by the following claims and their equivalents.
This application claims benefit to the following U.S. Provisional Patent Application: U.S. Provisional Patent Application No. 61/601,987 entitled “SYSTEM AND METHOD TO PROVIDE BPEL SUPPORT FOR CORRELATION AGGREGATION,” by Glenn Mi et al., filed Feb. 22, 2012.
Number | Name | Date | Kind |
---|---|---|---|
5721913 | Ackroff et al. | Feb 1998 | A |
5978836 | Ouchi | Nov 1999 | A |
6003011 | Sarin et al. | Dec 1999 | A |
6161113 | Mora et al. | Dec 2000 | A |
6170002 | Ouchi | Jan 2001 | B1 |
6507845 | Cohen et al. | Jan 2003 | B1 |
6574736 | Andrews | Jun 2003 | B1 |
6606740 | Lynn et al. | Aug 2003 | B1 |
6742015 | Bowman-Amuah | May 2004 | B1 |
6889231 | Souder et al. | May 2005 | B1 |
6895573 | Norgaard et al. | May 2005 | B2 |
6970844 | Bierenbaum | Nov 2005 | B1 |
7020697 | Goodman et al. | Mar 2006 | B1 |
7062749 | Cyr et al. | Jun 2006 | B2 |
7124192 | High et al. | Oct 2006 | B2 |
7174514 | Subramaniam et al. | Feb 2007 | B2 |
7289966 | Ouchi | Oct 2007 | B2 |
7403989 | Beringer et al. | Jul 2008 | B2 |
7406432 | Motoyama | Jul 2008 | B1 |
7428495 | Dhar et al. | Sep 2008 | B2 |
7448046 | Navani et al. | Nov 2008 | B2 |
7451477 | Griffin et al. | Nov 2008 | B2 |
7464366 | Shukla et al. | Dec 2008 | B2 |
7493593 | Koehler | Feb 2009 | B2 |
7519711 | Mohindra et al. | Apr 2009 | B2 |
7603674 | Cyr et al. | Oct 2009 | B2 |
7631291 | Shukla et al. | Dec 2009 | B2 |
7644432 | Patrick et al. | Jan 2010 | B2 |
7676483 | Klug | Mar 2010 | B2 |
7680683 | Kilerio et al. | Mar 2010 | B2 |
7685604 | Baartman et al. | Mar 2010 | B2 |
7689562 | Shaad et al. | Mar 2010 | B2 |
7702736 | Ouchi | Apr 2010 | B2 |
7814142 | Mamou et al. | Oct 2010 | B2 |
7925527 | Flam | Apr 2011 | B1 |
7953696 | Davis et al. | May 2011 | B2 |
8046747 | Cyr et al. | Oct 2011 | B2 |
8069439 | Shukla et al. | Nov 2011 | B2 |
8146083 | Aggarwal et al. | Mar 2012 | B2 |
20020178119 | Griffin et al. | Nov 2002 | A1 |
20030135384 | Nguyen | Jul 2003 | A1 |
20030158832 | Sijacic et al. | Aug 2003 | A1 |
20030217094 | Andrews et al. | Nov 2003 | A1 |
20040230466 | Davis et al. | Nov 2004 | A1 |
20050027585 | Wodtke et al. | Feb 2005 | A1 |
20050049924 | DeBettencourt et al. | Mar 2005 | A1 |
20050071347 | Chau et al. | Mar 2005 | A1 |
20060069995 | Thompson et al. | Mar 2006 | A1 |
20060074703 | Bhandarkar et al. | Apr 2006 | A1 |
20060074734 | Shukla et al. | Apr 2006 | A1 |
20060074915 | Bhandarkar et al. | Apr 2006 | A1 |
20070016465 | Schaad | Jan 2007 | A1 |
20070240112 | Haselden et al. | Oct 2007 | A1 |
20070276715 | Beringer et al. | Nov 2007 | A1 |
20080065656 | Theeten et al. | Mar 2008 | A1 |
20080301684 | Barros et al. | Dec 2008 | A1 |
20090125366 | Chakraborty et al. | May 2009 | A1 |
20090164985 | Balko et al. | Jun 2009 | A1 |
20090260021 | Haenel et al. | Oct 2009 | A1 |
20100100427 | McKeown et al. | Apr 2010 | A1 |
20100106546 | Sproule | Apr 2010 | A1 |
20100235213 | Channabasavaiah et al. | Sep 2010 | A1 |
20100251242 | Sivasubramanian et al. | Sep 2010 | A1 |
Entry |
---|
Kloppmann, M.; Konig, D.; Leymann, F.; Pfau, G.; Roller, D., “Business process choreography in WebSphere: Combining the power of BPEL and J2EE,” (2000) IBM Systems Journal , vol. 43, No. 2, pp. 270-296 [retrieved from http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5386791&isnumber=5386781]. |
Bradshaw, Deanna et al., Oracle BPEL Process Manager Developer's Guide 10g (10.1.3.1.0) Oracle, Jan. 2007. |
Beecher, Virginia et al., Oracle Fusion Middleware Developer's Guide for Oracle SOA Suite, 11g Oracle, Dec. 2009. |
Fogel, Steve et al., Oracle Database Administrator's Guide 11g Oracle, Mar. 2008. |
Oracle BPEL Process Manager—Data Sheet Oracle, 2009. |
Rittman, Mark, Oracle Purchases Collaxa, Launchs Oracle BPEL Processs Manager RittmanMead.com, Jun. 30, 2004. |
Clugage, Kevin et al., The Oracle BPEL Process Manager: BPEL + Human Workflow Oracle, Mar. 14, 2006. |
BPEL4People—wikipedia definition Wikipedia.org, Retrieved Apr. 10, 2012. |
Kloppmann, Matthias et al., WS-BPEL Extension for People—BPEL4People IBM, SAP, White paper, Jul. 2005. |
Collaxa WSOS 2.0: An introduction Collaxa, Sep. 6, 2002. |
Kennedy, Mark, Oracle BPEL Process Manager Quick Start Guide, 10g Oracle, Sep. 2006. |
Liu, Sa, Business Process Automation and Web Service Choreography Technische Universitat Hamburn-Harburg, Jun. 29, 2004. |
Collaxa—Orchestration Server Developer's Guide Version 2.0 Beta 2 Collaxa, 2002. |
Kloppmann, Matthias et al., WS-BPEL Extension for Sub-Processes—BPEL SPE IBm, SAP, Sep. 2005. |
Agrawal, Ashish et al., Web Service Human Task (WS-HumanTask), Version 1.0 Active Endpoints, Inc., 2007. |
Agrawal, Ashish et al., WS-BPEL Extension for People (BPEL4People), Version 1.0 Active Endpoints, Inc., 2007. |
Number | Date | Country | |
---|---|---|---|
20130219412 A1 | Aug 2013 | US |
Number | Date | Country | |
---|---|---|---|
61601987 | Feb 2012 | US |