Techniques for use with application monitoring to obtain transaction data

• US 20050049924A1
• Filed: 08/27/2003
• Published: 03/03/2005
• Est. Priority Date: 08/27/2003
• Status: Abandoned Application

• Current Assignee: Service Integrity, Inc.
• Original Assignee: Service Integrity, Inc.
• Inventors: DeBettencourt, Jason, Lara, Marco, Yamane, Stanley
• Application Number:
  US10/648,982
• Publication Number:
  US 20050049924A1
• Time in Patent Office: Days
• US Class Current: 705/21
• CPC Class Codes: G06F 11/3476 Data logging G06F11/14, G06F11/2205 take precedence
• CPC Class Codes: G06F 11/3495 for systems
• CPC Class Codes: G06F 2201/87 Monitoring of transactions
• CPC Class Codes: G06F 2201/875 Monitoring of systems including the internet
• CPC Class Codes: G06Q 20/202 Interconnection or interaction of plural electronic cash registers [ECR] or to host computer, e.g. network details, transfer of information from host to ECR or from ECR to ECR
• CPC Class Codes: H04L 43/028 by filtering

Abstract

Described are techniques used with application monitoring in connection with performing Web Services. Associated with each application performing a service are one or more application servers and associated stream sensors. The stream sensors filter received XML messages in accordance with a set of rules to gather data. The filtered data is gathered at each point and then may be aggregated locally for each transaction by an aggregation service. Data may be gathered from each aggregation service by a global aggregator. Rules are specified initially and may be revised during runtime while gathering data. Rules are evaluated at runtime in accordance with the data stream.

Claims

1. A method for obtaining data about a transaction in a computer system comprising:

receiving at least one message at each of a plurality of nodes in connection with performing a service of said transaction;

filtering said at least one message at each of said plurality of nodes in accordance with a current set of one or more rules producing local filtered data at each of said plurality of nodes; and

processing said local filtered data producing aggregated data about said transaction.

2. The method of claim 1, wherein the plurality of nodes includes one of:

a single instance of a web service, an application server, a host computer, a geographical computer site.

3. The method of claim 1, wherein at least two nodes of said plurality of nodes are associated with performing processing for a single application.

4. The method of claim 1, wherein said filtering at each of said plurality of nodes is performed while said each node is servicing a request.

5. The method of claim 4, further comprising:

collecting said aggregated data from each of said plurality of nodes about said transaction.

6. The method of claim 4, further comprising:

collecting said aggregated data from a portion of said plurality of nodes about said transaction.

7. The method of claim 1, further comprising:

aggregating XML message data received at each of said plurality of nodes, said plurality of nodes being a distributed network of service node peers.

8. The method of claim 6, wherein each of said plurality of nodes is an application performing an operation in connection with servicing a transaction.

9. The method of claim 8, wherein said current set of rules is evaluated in accordance with each received message.

10. The method of claim 9, further comprising:

revising said current set of rules at one of said plurality of nodes while said one node is servicing a request.

11. The method of claim 9, wherein each rule in said current set of rules includes a condition portion and an action portion, and the method further comprising:

evaluating a condition portion of a first rule in accordance with a first received message wherein said condition portion evaluates to false and said action portion is not performed; and

evaluating said condition portion of said first rule in accordance with a second received message wherein said condition portion evaluates to true and said action portion is performed.

12. The method of claim 11, wherein said action portion includes performing at least one of:

outputting data to a destination and invoking an application.

13. The method of claim 1, wherein a transaction is determined in accordance with at least one of:

a transaction identifier, a customer identifier, and a timestamp included in each of said at least one message.

14. The method of claim 13, wherein said processing includes analyzing said local filtered data at at least a portion of said plurality of nodes in accordance with a time-coherency and key-value pattern matching.

15. The method of claim 14, further comprising:

determining a first time for performing a first operation at a first of said plurality of nodes;

determining a second time for performing a second operation at a second of said plurality of nodes;

analyzing first local filtered data at said first node using an identifier associated with a transaction producing a first transaction data set;

analyzing second local filtered data at said second node using said identifier producing a second transaction data set; and

determining that said first and second transaction data sets are messages received by each of said first and second nodes for performing different operations for a same transaction at different points in time.

16. The method of claim 15, further comprising:

determining a processing path of operations performed by one or more of said plurality of nodes in connection with servicing said transaction in accordance with said identifier associated with said transaction.

33. The method of claim 1, wherein at least some of the processing of the local filtered data is performed at each of the plurality nodes.

34. The method of claim 4, wherein the filtering is performed in real time.

17. A computer program product method for obtaining data about a transaction in a computer system comprising:

executable code that receives at least one message at each of a plurality of nodes in connection with performing a service of said transaction;

executable code that filters said at least one message at each of said plurality of nodes in accordance with a current set of one or more rules producing local filtered data at each of said plurality of nodes; and

executable code that processes, at each of said plurality of nodes, said local filtered data producing aggregated data about said transaction.

18. The computer program product of claim 17, wherein each of at least a portion of said plurality of nodes is one of:

a single instance of a web service, an application server, a host computer, a geographical computer site.

19. The computer program product of claim 17, wherein at least two nodes of said plurality of nodes are associated with performing processing for a single application.

20. The computer program product of claim 17, wherein said executable code that filters at each of said plurality of nodes performs filtering in real-time while said each node is servicing a request.

21. The computer program product of claim 20, further comprising:

executable code that collects said aggregated data from each of said plurality of nodes about said transaction.

22. The computer program product of claim 20, further comprising:

executable code that collects said aggregated data from a portion of said plurality of nodes about said transaction.

23. The computer program product of claim 17, further comprising:

executable code that aggregates XML message data received at each of said plurality of nodes, said plurality of nodes being a distributed network of service node peers.

24. The computer program product of claim 22, wherein each of said plurality of nodes is an application performing an operation in connection with servicing a transaction.

25. The computer program product of claim 24, wherein said current set of rules is evaluated in accordance with each received message.

26. The computer program product of claim 25, further comprising:

executable code that revises said current set of rules at one of said plurality of nodes while said one node is servicing a request.

27. The computer program product of claim 25, wherein each rule in said current set of rules includes a condition portion and an action portion, and the computer program product further comprising:

executable code that evaluates a condition portion of a first rule in accordance with a first received message wherein said condition portion evaluates to false and said action portion is not performed; and

executable code that evaluates said condition portion of said first rule in accordance with a second received message wherein said condition portion evaluates to true and said action portion is performed.

28. The computer program product of claim 27, wherein said action portion includes performing at least one of:

outputting data to a destination and invoking an application.

29. The computer program product of claim 17, wherein a transaction is determined in accordance with at least one of:

a transaction identifier, a customer identifier, and a timestamp included in each of said at least one message.

30. The computer program product of claim 29, wherein said executable code that processes includes executable code that analyzes said local filtered data at at least a portion of said plurality of nodes in accordance with a time-coherency and key-value pattern matching.

31. The computer program product of claim 30, further comprising:

executable code that determines a first time for performing a first operation at a first of said plurality of nodes;

executable code that determines a second time for performing a second operation at a second of said plurality of nodes;

executable code that analyzes first local filtered data at said first node using an identifier associated with a transaction producing a first transaction data set;

executable code that analyzes second local filtered data at said second node using said identifier producing a second transaction data set; and

executable code that determines that said first and second transaction data sets are messages received by each of said first and second nodes for performing different operations for a same transaction at different points in time.

32. The computer program product of claim 31, further comprising:

executable code that determines a processing path of operations performed by one or more of said plurality of nodes in connection with servicing said transaction in accordance with said identifier associated with said transaction.