Copyright Notice
A portion of the disclosure of this patent document contains material that 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 files or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings that form a part of this document: Copyright 2006-2008, eBay Inc., All Rights Reserved.
Technical Field
This disclosure relates to methods and systems supporting computing and data processing systems. More particularly, the disclosure relates to configuring a processing pipeline used to process request and response messages in a service-oriented architecture.
Related Art
In Service Oriented Architecture (SOA), there are typically many communicating reusable services that are deployed in several machines. In large-scale enterprises, like eBay, eTrade, or Google for example, there could be thousands of different services deployed in thousands of machines. It is most common and efficient for these services to communicate with each other. Further, external access is also typically provided for some of these services. In communicating with each other, various different types of communication protocols may be used for efficiently and optimization reasons. Communication between service providers and service consumers can be accomplished using some pre-defined protocol. In the web services case, this protocol can be the Simple Object Access Protocol (SOAP). SOAP is a protocol for exchanging Extensible Mark-up Language (XML)-based messages over computer networks, normally using Hypertext Transport Protocol (HTTP/HTTPS). SOAP often forms the foundation layer of the web services protocol stack providing a basic messaging framework upon which abstract layers can be built. There are several different types of messaging patterns in SOAP; but, by far the most common is the Remote Procedure Call (RPC) pattern, in which one network node (the client) sends a request message to another node (the server) and the server immediately sends a response message to the client. In a typical SOA implementation, Service Consumers communicate with Service Providers using a specific underlying transport protocol (e.g., HTTP). There are several Message Exchange Patterns (MEP) for interactions between a service consumer and a service provider. In a Request-Response MEP, typically the response is sent back using the same transport the request was sent in. This typically requires the client to hold on to the connection until the response arrives, which could be inefficient and sometimes inconvenient depending on how long the processing of the request takes. It would be desirable, in some cases, to have the response come in potentially via a different transport (e.g., Simple Mail Transfer Protocol-SMTP). Further, most conventional SOA framework products require either use of the same transport for requests and responses in a request-response MEP, or require use of different message exchange patterns, such that responses are processed off-line and communicated via other means. For these reasons, it would be beneficial to decouple request and response processing, including their transports, for a request-response MEP, in a SOA. Additionally it is also beneficial to have the system support plugging in custom transports transparently for both requests and responses.
U.S. Patent Application No. 2005/0223109 describes a system wherein services such as product services, real-time services, and common services are deployed in a services oriented architecture. These services may, for example, be deployed for use in a variety of enterprise data integration functions.
U.S. Patent Application No. 2007/0011126 describes a service-oriented architecture (SOA) and accompanying method. In one embodiment, the SOA includes one or more service requesters coupled to one or more service providers via a bus. The bus includes runtime-binding functionality to facilitate interaction between the one or more service requesters and the one or more service providers. A registry, which stores information pertaining to a service provided by the one or more service providers, communicates with one or more service providers and/or requesters and the bus. In a more specific embodiment, bus includes a Service-Integration Bus (SIB) that includes a Service-Factory (SF) module for facilitating implementing the runtime binding functionality and for selectively invoking the service. Functionality of the SOA is strategically organized into various tiers and layers, including a requester tier, a provider tier, a business-process services tier, an infrastructure-services tier, an SIB layer, a persistence layer, and so on.
U.S. Patent Application No. 2005/0267947 describes a system including a service bus, which can act as an intermediary between a client and a service. Messages to the service bus arrive on a transport and can be processed to determine a destination to route and/or publish the message to, a transformation to perform on the message, and/or security processing. The message is then sent out on a transport bound for a service or another service bus. A response to the message can follow an inverse path through the service bus.
Thus, a computer-implemented system and method for decoupling processing of request and response messages supporting different pluggable respective transports in a service-oriented pipeline architecture is needed.
Embodiments illustrated by way of example and not limitation in the figures of the accompanying drawings, in which:
In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of some example embodiments. It will be evident, however, to one of ordinary skill in the art that the present invention may be practiced without these specific details.
As described further below, according to various example embodiments of the disclosed subject matter described and claimed herein, there is provided a computer-implemented system and method for decoupling processing of request and response messages supporting different pluggable respective transports in a service-oriented pipeline architecture. Various embodiments are described below in connection with the figures provided herein.
In particular, as depicted in the various figures included herewith, the SOA message processing model is independent of a specific transport mechanism, as transport-specific processing is made pluggable (e.g. transport processing modules can be added or removed without requiring a significant level of re-design or re-configuration). The decoupling of request and response processing and the ability to plug in custom transports for either of those, allows efficient processing and resource utilization. Additionally, new transport protocols can be added to the SOA seamlessly without having to change the SOA processing model.
The various embodiments described herein include a SOA framework on a pipeline based architecture where requests and responses are processed in separate pipelines. At the end of each pipeline (whether request or response) is a Dispatcher, which dispatches the processed message to the destination. This Dispatcher can be either a request dispatcher or a response dispatcher as the case may be. Additionally, the pipeline is abstracted, such that one of the choices provided for the destination can be a transport mechanism, as is the case with client side request dispatcher and server side response dispatcher. Further, a transport and a specific interface associated with the transport, which each transport can implement, is abstracted. These transports are made available for use, by specifying them in the service and client configuration files. Thus, additional transports can be written and plugged in, on to an existing system, without knowing anything about the framework or affecting existing services. These transports can be selected for request and responses separately. Further, using this de-coupled and pluggable transports architecture, we can implement efficient local binding of services and consumers in the same Java Virtual Machine (NM) at runtime through simple configuration changes. This is achieved through implementing what is called a ‘Local Transport’, which is yet another transport implementation that follows the same transport interface, but actually directly hands off the request to the server side request pipeline, without a physical transport being involved. This is a highly desirable thing to have in a large scale distributed computing environment, such as eBay.
Referring to
A Servlet is an object that receives a request and generates a response based on that request. A Servlet container is a specialized web server that supports Servlet execution. The Servlet container combines the basic functionality of a web server with certain Java/Servlet specific optimizations and extensions, such as an integrated Java runtime environment, and the ability to automatically translate specific Uniform Resource Locators (URLs) into Servlet requests. Individual Servlets are registered with a Servlet container, providing the container with information about what functionality they provide, and what URL or other resource locator they will use to identify themselves. The Servlet container is then able to initialize the Servlet as necessary and deliver requests to the Servlet as they arrive. Many containers have the ability to dynamically add and remove Servlets from the system, allowing new Servlets to quickly be deployed or removed without affecting other Servlets running from the same container. Servlet containers are also referred to as web containers or web engines. Servlet interface 104 can be implemented as a servlet container in a particular embodiment. Servlet interface 104 can process incoming synchronous messages and dispatch the processed messages into the Service Provider Framework (SPF) 110 described in more detail below. SPF 110 can receive messages, typically a service request, and after processing the messages in the manner described below, SPF 110 may dispatch the messages to an appropriate service 111. Prior to being dispatched to services 111, the incoming message can be initially processed by a number of modules in a pipelined architecture, each module performing a particular operation on the received message. These processing modules can include a G11N processing module 112. The term “G11N” as used herein refers to the operations of internationalization and localization. In computing, internationalization and localization (also spelled internationalisation and localisation) are means of adapting computer software for non-native environments, especially other nations and cultures. Internationalization is the conventional process of designing a software application no that it can be adapted to various languages and regions without engineering changes. Localization is the conventional process of adapting software for a specific region or language by adding locale-specific components and translating text. Due to their length, the terms are frequently abbreviated to G11N as shown in
Messages received by system 100 can be configured for a variety of communication protocols. Although many SOA implementations use SOAP as a communications protocol, particular embodiments of system 100 can be used with a communication or messaging protocol that is either a proprietary protocol or some other standard messaging protocol other than SOAP. Most communication protocols for use with SOA implementations, whether SOAP or another protocol, typically use a common basic messaging structure. In general, this messaging structure consists of a message header followed by a message payload or message body. In most cases, the message header contains most of the protocol-specific data. The message payload typically contains data content that is generally common (or can be made common) for all supported communication protocols. For this reason, particular embodiments can isolate protocol-specific message processing into a set of relatively compact protocol-specific message processors—one for each protocol supported by system 100. As will be described in more detail below, the protocol-specific message processors can be ‘plugged in’ or added to the system 100 architecture without a significant level of re-design or re-configuration of the system. Portions of the incoming message that are common to all supported protocols can be efficiently processed in a message pipeline of SPF 110 as described below. Because the portions of the incoming message processed by the message pipeline of SPF 110 are protocol-agnostic (i.e. not protocol specific), the insertion of a new or different protocol-specific message processor does not affect (and therefore does not require modification to) the message pipeline of SPF 110. In this manner, the embodiments described herein can support a variety of communication protocols in an SOA implementation without causing system re-designs or redundancies. These pluggable protocol processors can be registered in a configuration file. In this manner, various pluggable protocol processors can be conveniently added (i.e. plugged into) or removed from the message pipeline of SPF 110 without significant effort.
Referring now to
Server Message Processor (SMP) 207 is the main driver for processing the incoming message. At its initialization time, SMP 207 reads all the service configuration files 209 and initializes the appropriate modules, service implementation instances, and any special handlers, etc. Handlers are processing logic components that are plugged into the pipeline in the manner described above. The handlers act on the message, typically just the header portion of the message. Examples of these handlers include security, logging, etc. as shown in
As part of the processing operations performed by the server message processor 207, the message header of the incoming message can be decoded to determine the particular protocol for which the incoming message is coded (or compatible with). Once the specific protocol corresponding to the incoming message is determined, a corresponding one of the protocol-specific-processors 210 can be activated to operate upon the header of the incoming message of the same or compatible protocol type. As mentioned above, the specific protocol processor 210 is invoked at each of the processing steps performed by the SMP 207. The specific protocol processor 210 processes the protocol-specific headers (e.g. SOAP envelope, in the case of SOAP) and a context is maintained to reflect the processed information. This context is also made available to the pipeline 212, in case any handler wants to look at the context. Once the specific protocol processor 210 returns, then the message is passed through the input/request pipeline 212. The protocol-agnostic portion of the incoming message (e.g. message payload and transport headers) is run through the input pipeline 212 for staged processing. In a particular embodiment, the pipeline 212 can include several stages. For example, a first stage of pipeline 212 can be a logging stage 225 for handling logging of the incoming message. Logging stage 225 can be used to generate a record for the received message. A second stage of pipeline 212 can be an authentication stage 226 for handling authentication operations on the incoming message. Various types and degrees of message authentication can be implemented at this stage. A third stage of pipeline 212 can be a G11N stage 227 for handling the operations of internationalization and localization on the incoming message. As described above, internationalization and localization operations can be used to regionalize a message so appropriate results are produced. Other stages can be added to pipeline 212 to enable the insertion of one or more pluggable processors for handling a variety of data formats and for decoding a message payload coded in a particular data format. It will be apparent to those of ordinary skill in the art upon reading this disclosure that other stages can similarly be added to pipeline 212 in which other operations 228 could similarly be performed on the protocol-agnostic portions of the incoming message. Further, because of the pipeline architecture of the described embodiment, various stages of the pipeline can be performed in parallel thereby increasing efficiency of the system 100.
Once the protocol-agnostic portion of the incoming message is processed by each of the stages of pipeline 212, the message can be dispatched to a corresponding service implementation module 220 via a request dispatcher 216. At the point where the incoming message is passed to the request dispatcher 216, de-serialization of the message payload is performed, if de-serialization has not already been performed by one of the stages in pipeline 212. It is beneficial to push de-serialization of the message payload to the later stages of processing; because, de-serialization can be a time-consuming and expensive process. The service implementation module 220 can then perform the requested service based on the service request.
As the service implementation module 220 generates output in response to the request for service, server message processor 207 can perform post-processing on the protocol-agnostic portion of the output data using an output pipeline 214. In a manner similar to input pipeline 212, output pipeline 214 can be divided into stages, each stage performing an operation on the protocol-agnostic portion of the output data. Once the protocol-agnostic portion of the output data is processed by each of the stages of pipeline 214, the protocol-specific portion of the output data is processed by the one of the protocol-specific processors 210. At this point, the output message, which can either be an output data message generated in response to the service request or an error message, can be dispatched to a transport module 222 via the response dispatcher 218. Transport module 222 can deliver the output message to a service requester via a selected transport. In the case of a synchronous communication, the transport module may simply return to the SMP 207, which in turn returns the response to the servlet container.
Referring now to
The Client Message Processor (CMP) 307, in a particular example embodiment, is the main driver for processing the outgoing request message and for handling the received response. This is very much equivalent to the SMP 207 on the server side. The CMP 307 performs processing operations similar to the SMP 207; however, the CMP 307 operates on the client side. These processing operations, as described above, include running the request message through the request pipeline (Out pipeline 312), request dispatcher 316, response pipeline (In pipeline 314) and response dispatcher 318. Similar to the processing performed on the server side, an appropriate protocol-specific processor 310 is also invoked at each of these processing steps to formulate a request message that contains the selected protocol-specific envelope. Similarly, an appropriate protocol-specific processor 310 is also invoked for processing of the protocol-specific envelope in the response message as well. Again, similar to the server side, the client side also uses a hierarchy of configuration files, such as global, group and instance-specific configurations. As described above, the CMP 307 is responsible for managing these configurations.
As part of the processing operations performed by the client message processor 307, the message header of the outgoing message needs to be encoded to reflect the selected protocol. To do this, a corresponding one of the protocol-specific message processors 310 is activated to encode the header of the outgoing message of the same or compatible protocol type. Once the specific protocol processor 310 returns, the outgoing message is run through the request pipeline (Out pipeline 312) for staged processing of the protocol-agnostic portion of the message. In a particular embodiment, the pipeline 312 can include several stages. For example, a first stage of pipeline 312 can be a logging stage 325 for handling logging of the incoming message. Logging stage 325 can be used to generate a record for the received message. A second stage of pipeline 312 can be an authentication stage 326 for inserting the security credentials, authentication coding, and the like. As many stages can be added to pipeline 312 as necessary to enable customization of message processing. In fact, every portion of processing logic can be added as a stage (also referred to as a Handler) in the pipeline 312. Further, because of the pipeline architecture of the described embodiment, various stages of the pipeline can be performed in parallel thereby increasing efficiency of the system 100.
Once the protocol-agnostic portion of the outgoing message is processed by each of the stages of pipeline 312, the request message is dispatched to a transport factory module 320 via a request dispatcher 316. The request dispatcher 316 serializes the outgoing message into the wire data format that is selected/configured, before handing off the message to the transport factory module 320. The transport factory module 320 delegates transport of the message via one of a plurality of pluggable transport processors 322. A particular embodiment can offer support for a plurality of transport modes and protocols, such as a local transport (useful when the client and server are deployed in the same Java Virtual Machine—JVM), Hypertext Transport Protocol (HTFP), Simple Mail Transfer Protocol (SMTP), and the like. The transport factory module 320 sends the request message to the server via the respective one of the pluggable transport processors 322. The particular pluggable transport processor 322 chosen for transport of the request message can be configured by the CMP 307. It will be apparent to those of ordinary skill in the art upon reading this disclosure that other specific transport modes/protocols can similarly be added to transport factory 320 to enable transport of the processed request message in a variety of ways.
As the service implementation (on the server side) generates output in response to the request for service, the transport factory module 320 receives this response and passes control to the client message processor 307. Client message processor then invokes the appropriate protocol-specific processor 310 for processing the protocol-specific portion of the response message. The CMP 307 then runs the response message through the response pipeline (In pipeline) 314. In a manner similar to request pipeline 312, response pipeline 314 is also divided into stages, each stage performing an operation on the protocol-agnostic portion of the incoming response data. At this point, the incoming response message, which can be output data in response to a service request, is dispatched to a response dispatcher 318. Additionally, the client message processor 307 can send a response to the client application requester 305 via the SIF API 306.
Thus, as described above in connection with
The response transport, as desired by a client and sent across in the request message, is automatically selected for response on the server side (assuming the selected transport is available) by going through the transport factory as shown. If the selected response transport is HTTP, then the response simply amounts to a return to the servlet container, which handles the HTTP response. If the client selects, “LocalTransport” as a pluggable transport mechanism, then this selected transport mechanism is equivalent to using no physical transport and making an in-JVM call (i.e., a local java call). In a Local Transport, there is provided an option to skip serialization/deserialization for optimization purposes.
The example computer system 700 includes a processor 702 (e.g., a central processing unit (CPU), a graphics processing unit (GPU), or both), a main memory 704 and a static memory 706, which communicate with each other via a bus 708. The computer system 700 may further include a video display unit 710 (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)). The computer system 700 also includes an input device 712 (e.g., a keyboard), a cursor control device 714 (e.g., a mouse), a disk drive unit 716, a signal generation device 718 (e.g., a speaker) and a network interface device 720.
The disk drive unit 716 includes a machine-readable medium 722 on which is stored one or more sets of instructions (e.g., software 724) embodying any one or more of the methodologies or functions described herein. The instructions 724 may also reside, completely or at least partially, within the main memory 704, the static memory 706, and/or within the processor 702 during execution thereof by the computer system 700. The main memory 704 and the processor 702 also may constitute machine-readable media. The instructions 724 may further be transmitted or received over a network 726 via the network interface device 720.
Applications that may include the apparatus and systems of various embodiments broadly include a variety of electronic and computer systems. Some embodiments implement functions in two or more specific interconnected hardware modules or devices with related control and data signals communicated between and through the modules, or as portions of an application-specific integrated circuit. Thus, the example system is applicable to software, firmware, and hardware implementations. In example embodiments, a computer system (e.g., a standalone, client or server computer system) configured by an application may constitute a “module” that is configured and operates to perform certain operations as described herein. In other embodiments, the “module” may be implemented mechanically or electronically. For example, a module may comprise dedicated circuitry or logic that is permanently configured (e.g., within a special-purpose processor) to perform certain operations. A module may also comprise programmable logic or circuitry (e.g., as encompassed within a general-purpose processor or other programmable processor) that is temporarily configured by software to perform certain operations. It will be appreciated that the decision to implement a module mechanically, in the dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g. configured by software) may be driven by cost and time considerations. Accordingly, the term “module” should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired) or temporarily configured (e.g., programmed) to operate in a certain manner and/or to perform certain operations described herein. While the machine-readable medium 722 is shown in an example embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, mod/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present description. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media, and carrier wave signals. As noted, the software may be transmitted over a network using a transmission medium. The term “transmission medium” shall be taken to include any medium that is capable of storing, encoding or carrying instructions for transmission to and execution by the machine, and includes digital or analog communications signal or other intangible medium to facilitate transmission and communication of such software.
The illustrations of embodiments described herein are intended to provide a general understanding of the structure of various embodiments, and they are not intended to serve as a complete description of all the elements and features of apparatus and systems that might make use of the structures described herein. Many other embodiments will be apparent to those of ordinary skill in the art upon reviewing the above description. Other embodiments may be utilized and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. The figures provided herein are merely representational and may not be drawn to scale. Certain proportions thereof may be exaggerated, while others may be minimized. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
Thus, a computer-implemented system and method for decoupling processing of request and response messages supporting different pluggable respective transports in a service-oriented pipeline architecture. are disclosed. While the present invention has been described in terms of several example embodiments, those of ordinary skill in the art will recognize that the present invention is not limited to the embodiments described, but can be practiced with modification and alteration within the spirit and scope of the appended claims. The description herein is thus to be regarded as illustrative instead of limiting.
This application is a continuation of U.S. patent application Ser. No. 14/190,003, filed Feb. 25, 2014, which is a continuation of U.S. patent application Ser. No. 13/709,800, filed on Dec. 10, 2012, which is a continuation of U.S. Non-Provisional application Ser. No. 12/346,742, filed on Dec. 30, 2008, which are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
6865607 | de Jong | Mar 2005 | B1 |
7120639 | de Jong | Oct 2006 | B1 |
7131116 | Krishna | Oct 2006 | B1 |
7317733 | Olsson et al. | Jan 2008 | B1 |
7444619 | Mcmanus | Oct 2008 | B2 |
7530074 | Snodgrass | May 2009 | B1 |
7600131 | Krishna et al. | Oct 2009 | B1 |
7620934 | Falter et al. | Nov 2009 | B2 |
7631107 | Pandya | Dec 2009 | B2 |
7636353 | Sandoz et al. | Dec 2009 | B2 |
7694140 | Sachenko et al. | Apr 2010 | B1 |
7835380 | Aloni et al. | Nov 2010 | B1 |
7881336 | Majumdar et al. | Feb 2011 | B2 |
8135785 | Malladi et al. | Mar 2012 | B2 |
8341280 | Malladi et al. | Dec 2012 | B2 |
8443094 | Martikian | May 2013 | B2 |
8656038 | Malladi et al. | Feb 2014 | B2 |
8763008 | Malladi et al. | Jun 2014 | B2 |
8806506 | Malladi | Aug 2014 | B2 |
9195527 | Malladi et al. | Nov 2015 | B2 |
9264518 | Malladi et al. | Feb 2016 | B2 |
20010054172 | Tuatini | Dec 2001 | A1 |
20020010781 | Tuatini | Jan 2002 | A1 |
20020073236 | Helgeson et al. | Jun 2002 | A1 |
20020099738 | Grant | Jul 2002 | A1 |
20020116454 | Dyla et al. | Aug 2002 | A1 |
20020174340 | Dick et al. | Nov 2002 | A1 |
20030018832 | Amirisetty et al. | Jan 2003 | A1 |
20030043848 | Sonksen | Mar 2003 | A1 |
20030163589 | Bunce et al. | Aug 2003 | A1 |
20030163603 | Fry et al. | Aug 2003 | A1 |
20030172169 | Cheng | Sep 2003 | A1 |
20030172348 | Fry et al. | Sep 2003 | A1 |
20030191803 | Chinnici et al. | Oct 2003 | A1 |
20030233477 | Ballinger et al. | Dec 2003 | A1 |
20040015840 | Walker | Jan 2004 | A1 |
20040034615 | Thomson et al. | Feb 2004 | A1 |
20040064503 | Karakashian et al. | Apr 2004 | A1 |
20040064826 | Lim et al. | Apr 2004 | A1 |
20040068728 | Blevins | Apr 2004 | A1 |
20040107414 | Bronicki et al. | Jun 2004 | A1 |
20050066197 | Hirata et al. | Mar 2005 | A1 |
20050080873 | Joseph | Apr 2005 | A1 |
20050091672 | Debique et al. | Apr 2005 | A1 |
20050108518 | Pandya | May 2005 | A1 |
20050144137 | Kumar et al. | Jun 2005 | A1 |
20050149342 | Chao et al. | Jul 2005 | A1 |
20050183092 | Christensen et al. | Aug 2005 | A1 |
20050203957 | Wang et al. | Sep 2005 | A1 |
20050223109 | Mamou et al. | Oct 2005 | A1 |
20050232303 | Deforche | Oct 2005 | A1 |
20050267947 | Patrick et al. | Dec 2005 | A1 |
20060026591 | Backhouse et al. | Feb 2006 | A1 |
20060034431 | Ballinger | Feb 2006 | A1 |
20060047780 | Patnude | Mar 2006 | A1 |
20060106941 | Singhal | May 2006 | A1 |
20060123039 | Scheuerle, Jr. et al. | Jun 2006 | A1 |
20060129655 | Schlimmer | Jun 2006 | A1 |
20060174016 | Critchley et al. | Aug 2006 | A1 |
20060206523 | Gaurav et al. | Sep 2006 | A1 |
20060288208 | Dashora et al. | Dec 2006 | A1 |
20070005734 | Abdo | Jan 2007 | A1 |
20070006068 | Kren | Jan 2007 | A1 |
20070011126 | Conner et al. | Jan 2007 | A1 |
20070044069 | Doucette et al. | Feb 2007 | A1 |
20070067469 | Luik et al. | Mar 2007 | A1 |
20070073849 | Baikov et al. | Mar 2007 | A1 |
20070145138 | Snyder et al. | Jun 2007 | A1 |
20070150595 | Bhorania et al. | Jun 2007 | A1 |
20070168228 | Lawless | Jul 2007 | A1 |
20070168723 | Cabrera et al. | Jul 2007 | A1 |
20070174288 | Stoyanova | Jul 2007 | A1 |
20070233827 | Mcknight | Oct 2007 | A1 |
20070250766 | Medi et al. | Oct 2007 | A1 |
20070288488 | Rohrs et al. | Dec 2007 | A1 |
20070291791 | English et al. | Dec 2007 | A1 |
20080010629 | Berg et al. | Jan 2008 | A1 |
20080046874 | Kostoulas et al. | Feb 2008 | A1 |
20080049022 | Sherb et al. | Feb 2008 | A1 |
20080091821 | Dick et al. | Apr 2008 | A1 |
20080177848 | Wakhlu | Jul 2008 | A1 |
20080195634 | Christensen et al. | Aug 2008 | A1 |
20080209451 | Michels et al. | Aug 2008 | A1 |
20080222617 | Fernando et al. | Sep 2008 | A1 |
20080313372 | Fong et al. | Dec 2008 | A1 |
20080320019 | Bireley | Dec 2008 | A1 |
20090006429 | Champion et al. | Jan 2009 | A1 |
20090049200 | Lin | Feb 2009 | A1 |
20090112902 | Sthanikam et al. | Apr 2009 | A1 |
20090125628 | Dahlen | May 2009 | A1 |
20090150905 | Lin et al. | Jun 2009 | A1 |
20090157841 | Turner, Jr. et al. | Jun 2009 | A1 |
20100082830 | Malladi et al. | Apr 2010 | A1 |
20100083277 | Malladi et al. | Apr 2010 | A1 |
20100083281 | Malladi et al. | Apr 2010 | A1 |
20100169469 | Malladi et al. | Jul 2010 | A1 |
20130097332 | Malladi et al. | Apr 2013 | A1 |
20140181252 | Malladi et al. | Jun 2014 | A1 |
20140208332 | Malladi et al. | Jul 2014 | A1 |
20140351829 | Malladi et al. | Nov 2014 | A1 |
Entry |
---|
“U.S. Appl. No. 12/242,629, 312 Amendment filed Apr. 21, 2014”, 8 pgs. |
“U.S. Appl. No. 12/242,629, Examiner Interview Summary dated Jan. 13, 2014”, 2 pgs. |
“U.S. Appl. No. 12/242,629, Examiner Interview Summary dated Sep. 19, 2013”, 3 pgs. |
“U.S. Appl. No. 12/242,629, Final Office Action dated Aug. 2, 2012”. 49 pgs. |
“U.S. Appl. No. 12/242,629, Non Final Office Action dated Feb. 1, 2012”, 38 pgs. |
“U.S. Appl. No. 12/242,629, Notice of Allowance dated Mar. 31, 2014”, 10 pgs. |
“U.S. Appl. No. 12/242,629, PTO Response to Rule 312 Communication dated Jun. 19, 2014”, 2 pgs. |
“U.S. Appl. No. 12/242,629, Response filed Jul. 2, 2012 to Non Final Office Action dated Feb. 1, 2012”, 14 pgs. |
“U.S. Appl. No. 12/242,629, Response filed Sep. 13, 2013 to Final Office Action dated May 13, 2013”, 18 pgs. |
“U.S. Appl. No. 12/242,629, Response filed Dec. 3, 2012 to Final Office Action dated Aug. 2, 2012”, 17 pgs. |
“U.S. Appl. No. 12/242,639, Non-Final Office Action dated Jun. 9, 2010”, 8 pgs. |
“U.S. Appl. No. 12/242,639, Notice of Allowance dated Jan. 26, 2011”, 4 pgs. |
“U.S. Appl. No. 12/242,639, Notice of Allowance dated Oct. 26, 2010”, 4 pgs. |
“U.S. Appl. No. 12/242,639, Notice of Allowance dated Nov. 8, 2011”, 5 pgs. |
“U.S. Appl. No. 12/242,639, Response filed Oct. 12, 2010 to Non Final Office Action dated Jun. 9, 2010”, 10 pgs. |
“U.S. Appl. No. 12/242,653, Final Office Action dated Mar. 30, 2012”, 18 pgs. |
“U.S. Appl. No. 12/242,653, Non Final Office Action dated Sep. 16, 2011”, 29 pgs. |
“U.S. Appl. No. 12/242,653, Non Final Office Action dated Oct. 4, 2013”, 5 pgs. |
“U.S. Appl. No. 12/242,653, Notice of Allowance dated Feb. 14, 2014”, 5 pgs. |
“U.S. Appl. No. 12/242,653, Response filed Jan. 17, 2012 to Non Final Office Action dated Sep. 16, 2011”, 12 pgs. |
“U.S. Appl. No. 12/242,653, Response filed Jan. 30, 2014 to Non Final Office Action dated Oct. 4, 2013”, 10 pgs. |
“U.S. Appl. No. 12/242,653, Response filed Jul. 30, 2012 to Final Office Action dated Mar. 30, 2012”, 13 pgs. |
“U.S. Appl. No. 12/346,742, Final Office Action dated Sep. 19, 2011”, 15 pgs. |
“U.S. Appl. No. 12/346,742, Non Final Office Action dated Dec. 28, 2010”, 13 pgs. |
“U.S. Appl. No. 12/346,742, Notice of Allowance dated Aug. 20, 2012”, 9 pgs. |
“U.S. Appl. No. 12/346,742, Response filed Feb. 20, 2012 to Final Office Action dated Sep. 19, 2011”, 12 pgs. |
“U.S. Appl. No. 12/346,742, Response filed Jun. 27, 2011 to Non Final Office Action dated Dec. 28, 2010”, 12 pgs. |
“U.S. Appl. No. 13/709,800, Non Final Office Action dated Apr. 2, 2013”, 11 pgs. |
“U.S. Appl. No. 13/709,800, Notice of Allowance dated Oct. 8, 2013”, 12 pgs. |
“U.S. Appl. No. 13/709,800, Response filed Aug. 2, 2013 to Non Final Office Action dated Apr. 2, 2013”, 12 pgs. |
“U.S. Appl. No. 14/190,003, Corrected Notice of Allowance dated Nov. 5, 2015”, 9 pgs. |
“U.S. Appl. No. 14/190,003, Non Final Office Action dated Jun. 18, 2015”, 10 pgs. |
“U.S. Appl. No. 14/190,003, Notice of Allowance dated Oct. 8, 2015”, 13 pgs. |
“U.S. Appl. No. 14/190,003, Preliminary Amendment dated Mar. 13, 2014”, 8 pgs. |
“U.S. Appl. No. 14/190,003, Response filed Sep. 18, 2015 to Non Final Office Action dated Jun. 18, 2015”, 9 pgs. |
“U.S. Appl. No. 14/225,335, Final Office Action dated Apr. 7, 2015”, 5 pgs. |
“U.S. Appl. No. 14/225,335, Non Final Office Action dated Aug. 12, 2014”, 9 pgs. |
“U.S. Appl. No. 14/225,335, Notice of Allowance dated Jul. 22, 2015”, 6 pgs. |
“U.S. Appl. No. 14/225,335, Response filed Jan. 12, 2015 to Non Final Office Action dated Aug. 12, 2014”, 9 pgs. |
“U.S. Appl. No. 14/225,335, Response filed Jul. 6, 2015 to Final Office Action dated Apr. 7, 2015”, 6 pgs. |
“U.S. Appl. No. 14/452,482, Preliminary Amendment dated Aug. 27, 2014”, 9 pgs. |
U.S. Appl. No. 14/919,193, filed Oct. 21, 2015, System and Method for Processing Messages Using Native Data Serialization/Deserialization in a Service-Oriented Pipeline Architecture. |
U.S. Appl. No. 14/452,482, filed Aug. 5, 2014, System and Method for Processing Messages in a Service-Oriented Pipeline Architecture. |
Number | Date | Country | |
---|---|---|---|
20160165011 A1 | Jun 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14190003 | Feb 2014 | US |
Child | 15042842 | US | |
Parent | 13709800 | Dec 2012 | US |
Child | 14190003 | US | |
Parent | 12346742 | Dec 2008 | US |
Child | 13709800 | US |