|Publication number||US7409676 B2|
|Application number||US 10/689,417|
|Publication date||Aug 5, 2008|
|Filing date||Oct 20, 2003|
|Priority date||Oct 20, 2003|
|Also published as||US8006230, US8132180, US20050172306, US20080189717, US20080216098|
|Publication number||10689417, 689417, US 7409676 B2, US 7409676B2, US-B2-7409676, US7409676 B2, US7409676B2|
|Inventors||Manoj K Agarwal, Manish Gupta, Gautam Kar, Parviz Kermani, Anindya Neogi|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (9), Non-Patent Citations (28), Referenced by (76), Classifications (23), Legal Events (8)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention relates to data processing methods, systems and networks. In particular, the invention relates to systems, methods and computer programs for determining run-time dependencies between logical components of distributed or stand-alone data processing systems.
The identification and tracking of dependencies between components of distributed systems is becoming increasingly important for integrated fault management (problem determination, impact analysis and repair for a set of cooperating components or processes). Distributed systems can be represented as interacting service components, classified into multiple layers, where each layer provides services to layers above. Many service components have dependencies on other service components—such that failures occurring in one service component affect other services and ultimately customer applications. A dependency exists when a first component requires a service performed by another component in order for the first component to execute its functions.
Dependencies can exist between the components of different services on a single system and also between the client and server components of a service distributed across multiple systems and network domains. Typically, dependencies exist between various components of a distributed system, such as end-user services, system services, applications and their logical and physical components.
Relatively frequent failures is a characteristic of most complex operational systems. Recently, attempts have been made to reduce systems' mean time to recovery (MTTR) once failures are detected. In order to reduce MTTR, it is necessary to be able to quickly determine the root cause of a problem that is detected at a higher level, and then to resolve the problem. Many problem determination applications use a component dependency graph to pin-point the root cause.
For example, B. Gruschke, “Integrated Event Management: Event Correlation Using Dependency Graphs”, Proceedings of 9th IFIP/IEEE International workshop on Distributed Systems: Operations and Management (DSOM), 1998, discloses the use of a dependency graph for problem determination, mapping incoming alarms and events to nodes of the graph to identify dependent nodes which are a likely root cause of problems.
However, the discovery and recording of dependency information in a distributed system is a time-consuming and difficult task, since service components generally do not expose dependency information in a standard way. The lack of explicit dependency information makes the tasks of problem determination, isolation and resolution particularly difficult.
It is not acceptable to rely solely on dependency information within configuration files or machine-readable files provided by a software vendor, because the vendor's knowledge of dependencies may be limited and because static information within configuration files cannot provide a picture of dynamic, run-time dependencies. Emerging Web-based architectures allow the composition of applications at runtime and an application running within a Web application server may be instantiated and then terminated within a few seconds.
Furthermore, known techniques for automatically determining dependency information rely on fairly invasive middleware instrumentation or internal instrumentation—such as by embedding code which responds to Application Response Measurement (ARM) API calls (implementing The Open Group's Technical Standard C807) but this requires all components to implement the standard. In typical heterogeneous customer environments, which include a collection of hardware and software from different vendors, known approaches for intrumenting managed applications or objects to directly obtain dependency data are difficult and time consuming to implement, and therefore costly. Such instrumentation approaches may even be unusable in heterogeneous environments and in systems with security, licensing or other technical constraints.
One approach to instrumenting the components of a managed system is disclosed by P. Hasselmeyer in “Managing Dynamic Service Dependencies”, 12th International Workshop on Distributed Systems: Operations and Management (DSOM), France, 2001. Dependencies are made accessible to management applications as properties attached to components. Dependency data is supplied directly by the component having the dependency. The components can be polled or dependency change notifications can be generated at run-time.
A technique for determining dependency information is described by S. Bagchi, G. Kar and J. Hellerstein in “Dependency Analysis in Distributed Systems using Fault Injection: Application to Problem Determination in an e-commerce Environment”, 12th International Workshop on Distributed Systems: Operations and Management (DSOM), France, 2001. The described technique involves injecting a fault into a system during a testing phase and collecting measurements of the external behaviour of the system. The measurements are then analyzed and statistical regression analysis is used to determine the extent to which a quality of service metric depends on specific components. However, fault insertion and other “perturbation” techniques are reliant on the ability to insert controlled perturbations which will be effective in discovering dependencies. Furthermore, typical fault insertion techniques are limited to a testing phase because the insertion of faults is generally unacceptable at run-time.
C. Ensel, “Automated generation of dependency models for service management”, Workshop of the Open View University Association (OVUA), 1999, suggests that generation of service dependency models may be automated using a Neural Network and information collected at run-time. Information such as, for example, CPU usage of an application is taken from lower layers such as the operating system, middleware or transport system. According to Ensel, a time series of objects' activities may then be fed into a Neural Network to judge whether the objects appear to be related. Ensel states that a complex training process is required, but does not describe the training process or how the Neural Network would determine dependencies.
Aspects of the present invention provide methods, apparatus and computer programs for determining dependencies between logical components of a data processing environment by observing the run-time behaviour of the components comprising the environment.
A first embodiment of the invention provides a method, implemented in a data processing system, for determining run-time dependencies between logical components of a data processing environment, the method comprising the steps of:
The step of monitoring run-time activity of a component may include monitoring an activity period corresponding to the period between estimated start and end times for the processing of a request, or monitoring other run-time activity metrics for the monitored components such as the number of invocations within a monitoring period.
Most software vendors provide some integrated instrumentation for monitoring statistics, such as invocation and average execution time counters, for accounting and performance tuning purposes. Embodiments of the present invention can be implemented to use these existing monitoring features, avoiding the need for additional intrusive instrumentation of the components to be monitored.
In one embodiment, a set of monitoring agents cooperate with existing counters implemented within the monitored components. The monitoring agents generate an event on completion of processing of a request by the monitored resource, and the events are used to calculate an activity period which contains the period of execution of the component. A correlation identifier then compares the activity periods for different components to identify correlations, such as identifying components which have an activity period containing the activity period of other components. The correlation identifier may be implemented as a correlation-checking computer program.
In a particular embodiment, the correlation identifier determines whether a positive correlation between two components' run-time activity periods is identified consistently for a plurality of activity periods. The correlation identifier applies to each dependency relationship a ‘probability’ value (or ‘weight’) representing the proportion of compared activity periods for which a positive correlation is identified. The ‘probability’ value may be used to sort identified dependencies into an order for subsequent processing.
One embodiment determines whether an activity period of a first component contains the activity period of the second component to determine whether the first component has a synchronous dependency relationship with the second component. The first component's activity period contains the second component's activity period if two conditions are met: the start time of the second component is no earlier that the start time of the first component, and the end time of the first component is no later than the end time of the second component.
Vendors of ‘middleware’ computer programs, such as Web application servers, database servers and other application-enabling computer programs, typically provide interfaces for accessing essential management data (which can be in the form of logs) that pertains to the state of their programs and applications running on those programs. However, most vendors do not provide explicit information regarding dependencies between the components. A method according to an embodiment of the invention uses activity-related data which is accessible from a managed system, and computes probable dependencies between components of the managed system from the accessed activity data.
A method according to one embodiment of the invention includes data mining run-time monitoring data to construct a dynamic dependency graph between the components of a distributed application. The graph can be updated over time as more monitoring data becomes available. The graph may be used for problem analysis, impact analysis or other systems management applications.
One embodiment of the invention enables extracting of information for determining dependencies within systems (“micro-dependencies”) and across systems (“macro-dependencies”) of a distributed computing environment without the need to change either the applications installed on the managed systems or the existing application-enabling computer programs that provide run-time support to these applications.
One embodiment of the invention provides the ability to identify probable dependencies between logical components, such as between various cooperating server processes and application programs. The logical components of a data processing environment may include, for example, application programs, servlets and Enterprise Java Beans (EJBs) running within a Web application server, processes serving Uniform Resource Identifiers (URIs), processes executing Structured Query Language (SQL) requests and Web services components. The logical components may originate from a plurality of different vendors. In an enterprise system, a Web transaction (processing a URL request) is typically serviced by servlets which in turn may invoke EJBs or directly execute SQL queries. A Web application may issue SQL queries to a database server. Hereafter, references to the activity period or dependency of a URI should be interpreted as references to the process or transaction executing the URI, and references to the activity period or dependency of an SQL should be interpreted as references to the process or thread executing the SQL request (such as within a servlet or database server).
A second embodiment of the invention provides a data processing apparatus comprising:
One or more monitoring agents are preferably installed on the same data processing apparatus as the logical components to be monitored. The monitoring agents send monitoring data to the correlation identifier running on a different data processing apparatus.
A method, a correlation identifier and monitoring agents according to the invention may be implemented in computer program code, and made available as a computer program product comprising program code instructions for controlling the performance of operations within a data processing environment in which the program code runs. The computer program code may be recorded on a machine-readable recording medium or provided via any data transfer mechanism.
Embodiments of the invention are described below in detail, by way of example, with reference to the accompanying drawings in which:
Described below are apparatus and methods for dependency determination in distributed data processing environments, by computation of probable dependencies based on monitored run-time activity metrics. Dependency graphs are generated and the resulting dependency graphs can be used for problem determination. The methods described below may be used to identify runtime dependencies between, for example, servlets, Web server processes serving Uniform Resource Locators (URLs), Enterprise JavaBeans™ (EJBs), and Structured Query Language (SQL) server processes associated with a Web application.
Some portions of the following description are presented in terms of algorithms and symbolic representations of operations on data within a computer memory. Algorithmic descriptions and representations are used by persons skilled in the data processing arts to convey the substance of their work to others skilled in the art. An algorithm is a self-consistent sequence of steps leading to a desired result. The steps typically require physical manipulations of physical quantities—such as electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. The signals are conveniently referred to as bits, values, elements, symbols, characters, terms, numbers, or the like. Such terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities.
Unless stated otherwise, discussions within this patent specification utilizing terms such as “scanning”, “calculating”, “determining”, “replacing”, “generating”“initializing”, “outputting”, or the like, refer to the action and processes of a computer system, or similar electronic device, that manipulates and transforms data represented as physical (electronic) quantities within the registers and memories of the computer system into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
The present specification also discloses apparatus for performing the operations of the methods. Such apparatus may be specially constructed for the required purposes, or may comprise a general purpose computer or other device selectively activated or reconfigured by a computer program stored in the computer. The algorithms and displays presented herein are not inherently related to any particular computers or other apparatus. Various general purpose machines may be used with programs in accordance with the teachings herein. Alternatively, more specialized apparatus may be constructed to perform the required method steps.
The present patent specification also implicitly discloses a computer program, since it would be apparent to the person skilled in the art that the individual steps of the methods described herein can be put into effect by computer program code. The computer program is not intended to be limited to any particular programming language or implementation thereof. It will be appreciated that a variety of programming languages and coding thereof may be used to implement the teachings of the disclosure contained herein. Moreover, the computer program or programs are not intended to be limited to a single control flow. Other variants of the program can use different control flows and two or more steps of a described sequence may be performed in parallel rather than sequentially.
Such a computer program may be stored on any machine-readable medium. The readable medium may include storage devices such as magnetic or optical disks, memory chips, or other storage devices suitable for interfacing with a computer or similar device. The machine-readable medium may include a hard-wired medium such as exemplified in the Internet system, or wireless medium such as exemplified in the GSM mobile telephone system. The computer program or programs when loaded and executed on a computer system effectively results in an apparatus that implements the steps of the preferred method.
Where reference is made in any one or more of the accompanying drawings to steps or features which have the same reference numerals, those steps or features have substantially the same functions or operations for the purposes of this description.
The principles of the preferred method described herein have general applicability to the run-time determination of dependencies between logical components or processes in a computing system or network.
In the present embodiment, the agents 20 poll the system components to obtain activity-related metrics such as performance data, the number of requests sent to a component within a monitoring period or the average response time of a component. In particular, an agent 20 accesses static information within configuration files of the managed system or subsystem that it monitors, and accesses activity-related data within logs created by the managed system. An agent can run in the same host, or even the same process, as the managed system or subsystem or the agent can run on an entirely separate computer system.
The data gathered by an agent 20 from the managed system 10 is then forwarded to a Dependency Generator 30, the responsibility of which is to use this data to identify and record dependencies between system components and variables belonging to the managed system. Dependencies are estimated based on correlations between the run-time activity of components of the system. If the number of requests to a first component is related to the number of requests to a second component within a specific time period, or if the execution times of the two components show a positive correlation, the Dependency Generator 30 determines that a dependency relationship is likely based on the correlation. The operation of the Dependency Generator is described in more detail below.
The identified dependencies are then aggregated and persisted to a database or file system 50 by a Dependency Aggregator 40. A management client application 60 can access the stored dependency data via the Dependency Aggregator, and process the data in various ways such as to perform root-cause analysis, impact analysis, or to repair faults.
Example System and Method
Specific examples of a system implementing the above-described architecture and a method performing automated generation of dependencies are described below with reference to
The Web application server 100 populates an access log with URIs identifying accessed Web resources, and maintains log records including start and end times for processes running in the managed system 10. The Web application 120 includes a configuration file which identifies the dependence of URIs on the particular servlet which serves requests for the respective URI. The Web application server also includes counters and provides access to a system clock enabling monitoring of access counts and average response times of servlets and EJBs. In the example of IBM Corporation's WebSphere Application Server, counters are implemented within a Performance Monitoring Infrastructure (PMI) component 130.
The agents 20 and 22 then send the monitored data to a Dependency Generator 30 in the central management layer 80. The Dependency Generator 30 includes a correlation identifier for identifying 210 correlations. The correlation identifier determines an activity period for each process or component, using events indicating completion of request processing to compute theoretical start and end times. The correlation identifier then compares components' activity periods to identify correlations, as described below. A data mining method implemented in the Dependency Generator processes the identified correlations output by the correlation identifier to generate 220 identifications of probable dependencies between the monitored components.
The dependency information is persistently stored 230 in a repository under the control of a Dependency Aggregator 40—implemented as a Common Information Model (CIM) Object Manager. The CIM Object Manager 40 has the following functions:
The CIM Object Manager stores dependency information in a standard CIM format so that the information can be understood by management applications from multiple vendors.
The top-most layer 90 of the system comprises management applications 60 that pull 240 dependency data from the repository through the CIM Object Manager 40, for various uses including, for example, visualization, root cause analysis, and impact analysis applications.
The system described herein reuses existing monitoring data and logs from the managed system to obtain dependency information between URLs, servlets, EJBs and SQLs. URL-to-servlet mappings are obtained by parsing the access log of the Web application server 100 and other activity log records, using the static information present in configuration files of the installed Web application 120 which interfaces to the Web application server. Servlet-to-EJB, servlet-to-SQL, and EJB-to-SQL dependencies can be obtained from events generated through conventional database monitoring functions and the conventional activity monitoring functions of the Web application server 100. An API 132 of the monitoring infrastructure 130 provides access to performance-related activity data relating to processes running in the Web application server.
An example of an existing monitoring infrastructure which is suitable for use within the present embodiment is the Performance Monitoring Infrastucture (PMI) of IBM Corporation's WebSphere Application Server.
Monitoring and Generated Events
The monitoring infrastructure 130 and API 132 provide a framework to extract monitoring data from the Web application server (WAS) 100 and local application components 120 at runtime. The client side of this framework is externalized and published as a lightweight Java™ API 132 that allows monitoring data to be gathered from instrumented components. Within the Web application server 100, the monitoring infrastructure 130 on the server-side of the monitoring infrastructure API 132 keeps the performance data as raw counter values, whereas the agents 20,22 on the client side of the API 132 retrieve and manipulate the raw counters to provide more meaningful statistics such as average, time-weighted average, percentage change, rate, etc. This imposes less overhead on the Web application server 100 than if the Web application server was required to generate statistics from the raw data, and allows the server data to be shared across multiple clients.
A subset of the objects and resources pertaining to the Web application 120, Web application server 100 and the database server 110 are monitored. The monitored objects and resources are referred to hereafter as logical components and may include processes serving URLs, servlets, EJBs, SQL database server processes and database tables. However, since the monitoring methods implemented in the embodiment described here are not limited to monitoring specific types of logical components, the methods may be generalized to other types of logical components. In the present embodiment, the agent 20 obtains activity metrics including access counts and average response times of servlets and EJBs, and obtains accessed URLs from an HTTP access log. The dependence of a URL on the servlet which serves that URL is obtained from a Web application's configuration files. The agent 20 provides to the correlation identifier events for URLs, servlets, and EJBs; whereas agent 22 provides events for SQL request executions.
Each of the URLs, servlets, and EJBs can be modelled using the Common Information Model schema of the J2EE Management Specification (which is described, at the time of writing this specification). For example, we use the following CIM class for the servlet:
[Key, Override (“Name”) ]
The class CIM_Service is a CIM class that is a super class of class J2EE_Servlet. That is, J2EE_Servlet derives from CIM_Service which is present in the CORE CIM Schema. The field or property “Name” in the class is the key. Monitoring data obtained from the monitoring infrastructure interface 132 can be used to create an object of the above CIM class. Creating an object of the above J2EE_Servlet class amounts to using the functionality of the CIM Object Manager 40 to obtain an instance of J2EE_Servlet and to populate at least some of the fields in the instance, and then writing the object to the repository 50. The new instance is created with a different key set from other instances of class J2EE_Servlet already present in the repository 50. Similarly, CIM classes J2EE_EJB and J2EE_URLResource are used for Enterprise JavaBeans and Web-based resources identified by URLs.
The SQL events are modelled using the CIM_UnitOfWorkDefinition class of the CIM Metrics Model (described, at the time of writing. The specific CIM class eBIM_SQL used for modelling SQL events, which derives from class CIM_UnitOfWorkDefinition, is defined as follows:
[Key, Override(“Id”) ]
In the above class eBIM_SQL, “Id” is the key. Since this property is present in CIM_UnitOfWorkDefinition, we override the super class definition (as shown above). The agent that monitors the SQL information provides events to create new instances of the class eBIM_SQL. The method for creating a new instance for eBIM_SQL is the same as that described for J2EE_Servlet, including providing a unique key set for the new instance compared with instances already present in the repository 50.
In order to capture the dependency information between the above-described objects, such as for example the dependency between a servlet and an EJB, additional association classes have been defined as subclasses of the CIM_dependency class (see below). When the instances of the CIM classes pertaining to the URLs, servlets, EJBs, SQLs, and their dependencies are discovered, the CIM repository 50 in the middle layer 80 in
[Key, Override (“Antecedent”) ]
eBIM_SQL REF Antecedent;
[Key, Override (“Dependent”) ]
J2EE_Servlet REF Dependent;
The above new class eBIM_ServletExecutesSQL:CIM_Dependency associates an instance of J2EE_Servlet to an instance of eBIM_SQL (i.e. t the SQL request execution resulting from processing of the servlet). The new class derives from the class “CIM_Dependency” which is present in the CORE CIM Schema. The new class has two keys: “Antecedent” and “Dependent”, which are references to the corresponding antecedent SQL instance and dependent servlet instance, respectively. The property/attribute “DependencyStrength” corresponds to a measure of the consistency of identification of a dependency between the two instances, as computed by the dependency generator.
An additional subclass of CIM_dependency is the eBIM_Servlet2EJB association class whose parent superclass is J2EE_ServiceDependency. The new class eBIM_Servlet2EJB associates a servlet with an EJB. The dependent is an instance of J2EE_Servlet and the antecedent is the instance of J2EE_EJB (the JSR-77 IDE toolkit referenced above provides a definition of CIM classes with prefix “J2EE”).
[Key, Override (“Dependent”) ]
J2EE_Servlet REF Dependent;
[Key, Override (“Antecedent”) ]
J2EE_EJB REF Antecedent;
Similarly, additional relationships can exist between pairs of subcomponent types. The correlation engine uses the events that are sent by the agents 20 to compute the dependencies. The events are wrappers (java class objects) around the monitored data accessed by the agents.
It is well known to use a CIM framework for keeping and storing management information. The known CIM framework separates the management interface from the business interface, such that a vendor of a higher-level management application does not have to be concerned with the specific mechanism by which the management data of a product is provided to the CIM Object Manager. Such mechanisms are typically vendor-specific, and may change from one version of a product to another.
A client agent 20 polls the Web application server for performance data. Each time the client agent polls, it gets the latest values of the polled counters. If the number of requests made to a particular servlet is a required metric, each monitoring infrastructure client request returns the total number of requests made to the servlet (i.e. the number of requests within a defined time period, or from the time the client agent 20 started monitoring the Web application server 100). The client agent 20 runs on the same computer as the Web Application Server 100 and polls the Web Application Server at a regular interval of PI milliseconds. Each time the Web Application Server is polled, servlet and EJB events are generated corresponding to new requests completed for servlets and EJBs since the last poll. The generated events are sent to the Correlation Identifier of the Dependency Generator 30 within the management server 80. If the correlation identifier identifies a correlation between components, the Dependency Generator generates a new instance of the relevant subclass of the CIM_dependency class and the new dependency information is sent to the CIM repository 50.
For example, a servlet event contains:
Each servlet and EJB event also contains a time stamp that corresponds to the time of completion of the polling request (made to the Web Application Server by agent 20 in
An SQL event is sent to the management server 80 for each SQL request execution captured from a monitoring interface of the database server 110. Each event comprises an SQL query string, a time stamp that is defined to be the end time of the SQL request, and the start time of the query.
Computing Activity Periods from Events
On receiving an event, the Correlation Identifier of the Dependency Generator 30 (in
Since the agents 20 poll the Web Application Server 100 via the monitoring infrastructure 130 at regular intervals of length PI, a request for the services of an EJB or servlet which request completes at some time t will only be detected at PE≧t, the next monitoring infrastructure polling time that happens after time t. The event corresponding to the completion of the request, which event is generated at PE≧t, does not include the information that the request was completed at time t but rather a time stamp PE≧t, is assigned to the event. Thus, the estimate of the completion time could be in error by as much as PI. For this reason the correlation identifier calculates an interval, for use as the activity period, which interval can be relied on to cover the actual activity period of the event. To compute the activity period of an event, the time stamp of the event and the execution time of the component request represented by the event are used. Since the time stamp is already an attribute of the event, the Correlation Identifier can compute the execution time of a request from the corresponding event.
If the current event corresponds to the N+1th request to the servlet, then XN+1 (the execution time of the request) can be calculated by subtracting the product of the average response time TN and the total number of requests N (values of the event prior to the current one) from the product of the average response time TN+1 and the total number of requests N+1 (values of the current event). That is:
X N+1=(N+1)T N+1 −NT N
For the event corresponding to the first request to the servlet, the average response time value T1 is actually the execution time of the servlet request X1 corresponding to that event. Similarly, the execution time of a method execution corresponding to an EJB event can also be obtained.
The ‘activity period’ of an event is then obtained as follows. Let the ‘activity period’ of the N+1th request be denoted as [LN+1, RN+1]. As mentioned earlier, the time stamp carried by a servlet-related or EJB-related event is actually the time at which the monitoring infrastructure poll request completed (i.e. the completion of the request that resulted in the creation of this event). Let the time stamp carried by the event corresponding to the N+1th request be denoted as TSN+1. Define RN+1=TSN+1. The end time of the servlet request could lie anywhere in the interval [TSN+1−PI, TSN+1] implying that the earliest time that the request could have started is TSN+1−PI−XN+1. We define LN+1 to be this earliest possible start time, i.e.:
L N+1 =TS N+1 −PI−X N+1.
A small difference exists in the case of investigating dependencies of servlets on EJBs. For computing a servlet's activity period, we let:
L N+1 =TS N+1 −PI−X N+1 −PI
The reason for this difference is that it facilitates the containment of the activity period of an EJB, which is invoked by a servlet, into the activity period of the servlet. Such “containment” is defined below.
For some monitoring infrastructures, an assumption can validly be made that the EJB events pertaining to the EJB method calls made during a servlet request are generated no later than the servlet event pertaining to the completion of the servlet request.
Let us assume that the polling rate is sufficiently high that, between two successive polls, at most one request to servlet A can complete. The counter N corresponds to the total number of requests to servlet A that have completed since the polling began (i.e., since time 0). The counter TN records for servlet A the average execution time of a request to the servlet. After each new request to servlet A, the value of the counter N and TN are updated by the Web Application Server. The retrieved values of the counters N and TN at the end of each of the polling times (PE1, PE2, PE3, PE4, and PE5) are catalogued in the table shown below the timeline in
At the end of each poll the PMI client agent generates events for servlet A. These events are sent to the management clients 60 (see
In the case of SQL events, as opposed to the servlet and EJB events, the start and end time of every SQL request is known. Therefore, it is possible to determine the ‘activity period’ of each SQL request precisely, as:
An existing database monitoring interface can be used instead of Java Database Connectivity (JDBC) instrumentation, and yet it remains possible to obtain SQL information to construct such exact activity periods for SQL requests.
Whether a servlet, EJB, or an SQL event, references herein to the end time or start time of an event mean the end time or start time, respectively, of the activity period represented by the event. Every event carries a time stamp that equals the end time of the activity period that the event represents.
A method and algorithn for extracting dependency relationships from monitoring data is now described. Also described is a problem-determination application's solution to falsely-identified dependencies.
In the description below, services and components that depend on other services or components are referred to as ‘dependents’. Services and components on which other services or components depend are termed ‘antecedents’. In the dependency graph model of the distributed system, each resource or component is represented as a node and a dependency between nodes is represented as a directed edge or link. Attributes are maintained for each node to capture its runtime status. Weightings are calculated at run-time for the identified dependency relationships represented by edges.
Consider any two components, such as a servlet A and an EJB B for example. In the general case, A is said to be dependent on B if B's services are required for A to complete its own service. A weight may also be attached to the directed edge from A to B. Weightings may be interpreted in various ways, but in this specific implementation weightings are a quantitative measure of the extent to which A depends on B (i.e. a measure of the extent to which A may be affected by unavailability or poor performance of B). Any true dependency between A and B arises from an invocation of B from A, which may be synchronous or asynchronous. The example method described below handles synchronous invocations only but alternative embodiments, such as those identifying correlations between the numbers of component invocations instead of contained activity periods, may handle asynchronous invocations.
An activity period [b1, b2] of the component B is said to be contained in an activity period [a1, a2] of the component A if a1≦b1 and b2≦a2. As mentioned above, the activity periods of a component are assumed to have a one-to-one correspondence to the service request start and completions for that component, for simplicity. Therefore, for each service request completion for a component, the component's activity period can be computed from the corresponding event received at the Correlation Identifier (in
A depends on B with probability p (or A
The above definition of containment of an activity period into another period captures the following dependency type:
A dependency of the above type is called a true dependency. Any other type of dependency that is captured by our dependency definition is called a false dependency. A motivation for the definition for p given above is that the number p comes very close to the probability that a given execution of A invokes, directly or indirectly and at least once, the component B, and finishes only after the invocation to B returns.
If A calls B's methods on each request to A then, according to the above definition, p is 1.0. If only 20% of the requests to A result in calls to B then p is 0.2. Multiple calls or containment of activity periods of B per request to A are counted as a single call to B.
Similarly, the dependencies of Servlet S2 are S2→SQ2 and S2→SQ1, both of which are true dependencies. The dependency definition presented above assumes, for simplicity, a synchronous invocation model where A does not finish executing until all its invocations of B return.
A method (and an algorithmic representation of the method) is presented below for computing the dependencies for any given component, based on the definition above. The true dependencies for the given component include all the components that are directly and indirectly invoked by the given component. The method can also be expected to compute ‘false’ dependencies.
The calculated ‘probability’ value, p, in A
Dependency Extraction Method and Algorithm
A dependency extraction method and algorithm are presented herein informally, referring to servlet and SQL events by way of example only (without any intended limitation). Let Σsq1 denote the set of all SQLs and Σservlet denote the set of all servlets in a given Web application. Let A ε Σservlet. The method sets out to discover and update all dependencies A
A property that the method uses (which property can be assumed to be satisfied by the system of
Some definitions are presented here, to enable interpretation of the algorithmic representation of the method.
The following event lists are maintained in the CIM repository:
The dependencyList variable keeps the list of all those SQLs in Σsq1 for which dependencies have been detected so far.
The dependency extraction algorithm is presented below in a pseudo-code form. Based on the type (servlet or SQL) of the next event E receives, the following tasks are performed:
1. E of type servlet event:
a. Add E to the end of dependentList
b. if LPP is null then
i. set LPP to E
ii. increment #A by 1.
iii.computeHSQ( ), return,
c. else /* LPP is not null */
i. if HSQ is null then return
ii. if HSQ.next or LPP.next is null then return,
else set LPP to LPP.next, increment #A by 1,
updateDependencies( ), computeHSQ( ), goto 1.c.ii
2. E of type SQL event:
a. Add E to the end of antecedentList
b. if LPP is null then return
c. computeHSQ( )
d. if HSQ.next or LPP.next is null then return,
else set LPP to LPP.next, increment #A by 1,
updateDependencies( ), goto 2.c
The main algorithm above includes the following subroutines:
1. if antecedentList is empty then return,
else set tempList to antecedentList if HSQ is null or to the
portion of the event list after HSQ (i.e., those SQL events
that have time stamps greater than or equal to the
2. while there is a next event to process in tempList
a. set temp to the next event in tempList
b. if temp.timestamp > LPP.timestamp then return
c. checkContainment(LPP, temp), HSQ = temp
1. tempHSQ = HSQ
2. if tempHSQ.timestamp < LPP.starttime then return
3. checkContainment(LPP, tempHSQ), goto 2
1. if depEvent.timestamp ≧ antEvent.timestamp and
depEvent.starttime ≦ antEvent.starttime then add antEvent.id
to dependencyList if not already done, increment by 1 the
counter #(antEvent.id, A), corresponding to dependency
The main algorithm shown above preserves the following properties:
In the non-boundary case (i.e. when both LPP and HSQ are not null), on an arrival of an SQL event with time stamp less than LPP.timestamp, HSQ is set to this event; otherwise LPP is set to LPP.next (i.e. to the next servlet event, whenever it becomes available) and the count #A is incremented by one. In the latter case, the method continues to scan the SQL events earlier than the event pointed to by HSQ until an SQL event is reached which has an end time earlier than the start time of the new servlet event pointed to by LPP; thereafter the method scans the later SQL events to compute the new value for HSQ. Each time an SQL event is compared with the servlet event pointed to by the LPP, the method also checks for containment of the activity period of the SQL event within the servlet event, updating the dependencyList and corresponding frequency counts if required. This process is repeated with the new LPP and HSQ. The method outputs estimates of p-values by computing for each SQL B in the dependencyList the number #(B, A)/#A.
The above dependency extraction method has a desirable property that the number of event comparisons needed in order to ascertain all the probable dependencies is relatively low. If n is the number of activity periods contained in a given activity period, the number of event comparisons required to determine the set of probable dependencies is a linear function of n, represented as O(n).
Problem Determination using Probabilistic Graph
As discussed above, a dependency graph may be used to identify the root cause of a problem, which is visible at a high level, such as an end-user response time violation of a client transaction. It is assumed that the node state can be examined and a determination made at run-time of whether the node has a problem, and the assumption is valid for response-time related problems. A problem at a node will manifest itself in its parent nodes and thus appears as a end-user problem or Service Level Agreement (SLA) violation. A systematic top-down traversal of a graph is performed to visit the nodes in some order until a node is reached which shows a problem by its state, but whose children do not have a problem. For example, if it is observed that a particular URL's response time is higher than usual (a possible SLA violation), then a component dependency graph may be used to identify whether the problem lies in the servlet code (that services the URL) or in any of the EJBs or SQLs called by the servlet.
Root cause analysis using dependency graphs is described in a number of references including the paper by B. Grushke “Integrated Event Management: Event Correlation Using Dependency Graphs” (DSOM '98, referenced above). In a simple root cause analysis, a depth-first or breadth-first traversal of the graph can be performed to identify such nodes. The edge weights may or may not be used in deciding the traversal order. The following paragraph describes how dependency edge weights may be used to decide the traversal order of edges in the two-level graph of a component.
The presence of false dependency edges in a two-level graph complicates the traversal problem. The edge weights represent the computed “likelihood” of A depending on B. False dependencies may be identified from containment of activity periods due to concurrency of transactions flowing through the components of the server. Additionally, there may be certain components that tend to be active at the same time without a true dependency relationship. For example, a significant percentage of users may choose to invoke “search” immediately after going to the “main page” of a site. Therefore, it is likely that the activity periods of some of the components invoked by the servlet servicing the main page request will overlap with some invocations of the servlet servicing the search request, and vice versa. This may result in detection of false dependencies (based on the above definition) for both servlets.
Clearly, traversal of false dependencies reduces the performance of a Problem Determination algorithm and increases the Mean Time To Recovery.
In order to optimize the search from any node A to its root causes, the dependencies of A in its two-level graph are sorted into a decreasing order of the p-value. This decreases the likelihood of having to investigate an antecedent node that is actually a false dependency, based on the premise that most of the true dependencies will precede the false ones in the traversal order. If A's problem is due to a component on which it depends, then as the dependencies of A are investigated (in the descending order of the p-value), the Problem Determination application stops when it encounters a problem component. This should avoid the Problem Determination application continuing to process all identified dependencies including false ones.
However, the specific workload of the monitored system may be such that the empirical probability of a false dependency can be higher than that of a true dependency. For instance, A may have a true dependency on B, but if A invokes B only 5% of the times that A is active, then p is 0.05 and a false dependency could have a higher p-value. In order to further decrease the likelihood of having to look at false dependencies during problem determination, another statistic can be used as described below.
Improved Traversal Order for Problem Determination Applications
Additional statistics and heuristic transformations of the basic ‘probability’ values may be used by a Problem Determination application to avoid investigating false dependencies during root cause analysis. In particular, a “reverse probability” of a dependency A→B, called the r-value, may be used. Both the p-value and the r-value are used together to sort the dependencies in the two-level graph of a node so that the likelihood of a true dependency being higher in the sorted list is more than simply sorting based on only the p-value.
Conceptually speaking, the r-value is similar to the definition of p-value. We define the r-value as the probability that a given activity period of the component B is contained in an activity period of the component A, where the definition of containment is as described earlier. We estimate the r-value as follows. Let, (φ(A, B) denote the number of activity periods of B, seen so far, which were found to be contained in at least one activity period of A. Finally, let #B be the total number of activity periods of B seen so far. We take the number p(A, B)/#B as an estimate of r-value. To see the difference between p-value and r-value, consider the earlier example in which A invokes B only 5% of the time A is active. Suppose A is the only component that invokes B in the application, then the p-value will be close to 0.05 whereas the r-value will be close to 1.0. Another illustration of the difference between p and r-values is given in Table 1. The algorithm for computing p-values given above can be tailored to compute the r-values as well.
We then sort the dependencies at node A in the non-increasing order of:
This heuristic uses the two statistics to effectively transform the weights (or computed probabilities) of all dependencies of a node. The dependencies of a node are then sorted in non-increasing order of these new weights. The rationale for choosing the heuristic is the following. The first term coarsely sorts the dependencies of a node so that edges with high p- or high r-values are catapulted up in the order. A dependency is more likely to be true if at least one of these is high. The product term, pr, performs finer grain sorting among equals. A dependency is more likely to be true if both p- and r-values are high compared to the case when only one of the values is high.
However, the heuristic ‘max(p, r)+pr’ penalizes the true dependencies which have low p- and r-values. For example, if a servlet X executes an SQL Y rarely, but the SQL Y is frequently executed by some other servlets in an application, then the dependency Y of X will appear lower down in the sorted list of dependencies of X, because both p and r values will be small. However, there is an increased likelihood that if the problem in X is due to Y, then other servlets that more frequently call Y also have the same problem and we are able to identify Y through one these servlets.
Other such heuristics may be used to transform the basic weight values in a system-specific Problem Determination application. The presence of false dependencies can be coped with at the management application level.
Table 2 below shows the p- and r-values of some of the dependencies of Servlets S1 and S2, in the example in
Dependencies with their p- and r-values
S1 −> SQ1
S1 −> SQ2
S2 −> SQ1
S2 −> SQ2
Described below is an experimental evaluation which shows positive results for the above-described heuristic, max(p,r)+pr, for a benchmark application. The pathological case described above occurs only infrequently.
The dependency algorithm described above has been evaluated experimentally. The test system setup is described below, followed by measurements for accuracy, precision, and overhead of the algorithm.
The test system comprises three machines, such as represented in
The test system uses the known TPC-W bookstore application from University of Wisconsin as a benchmark application for evaluating the algorithm. (TPC-W is selected because the application has a sufficient number of dependencies for preliminary investigation purposes, without having a complicated program structure. Furthermore, TPC-W is easy to instrument and enables easy comparison between results achieved using the above-described algorithm and ideal results. The simplicity in structure and presence of only servlet-to-SQL dependencies facilitates analysis and debugging the mining-based approach. Although the above-described algorithm can tackle dependencies involving EJBs, there are no EJBs in the TPC-W application.) The University of Wisconsin's TPC-W application implementation is written in the Java(™) programming language and comprises 14 servlets, 46 SQL servlets and a database of 10,000 books. At the time of writing.
TPC-W provides three types of Web communication traffic mixes, as follows:
Unless otherwise specified, MIX3 is used in the experiments described below, for larger graph coverage within a given time period. The experiments involve applying the methods described above to discover the dependencies between servlets and SQLs. In the test system, there are 54 true servlet-to-SQL dependencies out of potential set of 644 dependencies.
The contribution of weight coming from false dependencies, from the total wtot, is defined as:
The above definition of the Percentage node-precision penalizes a false dependency more if the false dependency occurs higher in the list. The precision value reported in the following experiments is the mean percentage node-precision over the 14 servlets.
Accuracy and precision are measured on the test system as follows. The TPC-W application is instrumented with a transaction correlation program to find the actual set of the dependencies that should be discovered at each point in time as user transactions flow through the system. Thus accuracy and precision can be computed at each time point by comparing the dependency information generated by the above-described dependency algorithm with information generated in the same experiment by the instrumented transaction correlation program.
Accuracy and Precision for TPC-W Bookstore Application
A factor which may significantly impact the performance of the dependency algorithm is the degree of concurrency in the system. If multiple transactions proceed simultaneously, difficulties arise when trying to separate true dependencies from false dependencies using containment relationships.
The degree of concurrency of transactions on a Web Application Server may be increased by increasing the number of simultaneous customers or Web Browser emulators, thus keeping more threads in the available thread pool simultaneously active. The Web Application Server is configured to fork threads on demand with a minimum of 25 pre-forked threads. As customer load is increased, the number of simultaneously active threads grows, and the thread pool size is also automatically increased by the system beyond 25 if needed.
Table 3 shows the variation of accuracy and precision values with increasing customer load and concurrency (for traffic MIX3). The number of customers is increased until a significant percentage of URL requests timed out due to high workload. The Web Application Server machine used in the experiment was able to support up to 200 customers and so the experiments have been run up to 200 customers as a high load case. At 200 customers load-level, the client emulator which sends requests to the application program via the Web application server generates around 450-500 requests per minute. Each experiment was run for one-hour duration. It is likely that precision values could be increased by running experiments for longer periods.
#Avg active threads
Mean Precision %
(Avg thread pool size)
(std dev σ)
Table 4 shows the effect of the Performance Monitoring Infrastructure polling rate on precision and accuracy with a fixed load of 100 customers. The results in Table 4 show precision to be more sensitive to polling rate than accuracy. At lower polling rates, even though accuracy is 100% and the management overhead reduces, the precision also reduces. At higher load, a high polling rate is required to maintain high precision, but the overhead is also increased and such increases are undesirable at high load.
% (std dev σ)
The algorithm results showed 100% accuracy under all loads. Precision values decrease with increasing load. The standard deviation (v) for precision is low at low loads but rises at higher loads. Dependency extraction can be performed at low to medium loads and stopped, if the precision level of the graph is to be maintained. The operating load range of the algorithm may be determined by the acceptable level of precision, which may be objectively decided by the acceptable latency in computing the root cause of a problem. A lower precision typically leads to a higher latency in root cause computation.
Table 4 shows the variation of accuracy and precision at a fixed load of 100 customers by varying the Performance Monitoring Infrastructure (PMI) polling rate. A higher polling rate leads to increased management overheads. Table 5 shows preliminary overhead measurements, in terms of percentage increases in transaction response time and throughput, when dependency extraction is active, by varying the customer load and PMI polling interval. Each reading corresponds to an experiment run for 3 hours.
Polling Interval (milliseconds)
The embodiments of the invention described in detail above enable discovery of dependencies between system components using non-intrusive techniques. A system and method according to one embodiment of the invention can discover dependencies between any two monitored components in a managed system without any changes or modifications to the existing source code or executables comprising the managed system. The dependencies are constructed using only the data accessible from the managed system, such as logs and performance metrics, and this data is retrieved from the managed system by agents that poll the managed system for changes in state, or subscribe to events from the system.
The amount of manipulation of monitoring data performed by a monitoring agent depends on the specific implementation of the invention. If an agent is running on the same CPU as the monitored system, any computation by the agent imposes a processing overhead on the CPU. However, if the agent runs on a different CPU from the correlation identifier, network communication overhead is imposed by the sending of events from the agent to the management server running the correlation identifier. One embodiment balances these factors by the agent performing aggregation, such as averaging, and batching events to reduce network overhead. Alternative trade-offs between the processing overhead of the CPU of the monitored system and network communication overheads may be implemented by varying the amount of processing performed by the agents, the correlation identifier and the dependency aggregator.
According to the embodiment, a dependency generator identifies correlations between the run-time activity of logical components and uses the correlation results to generate estimates of the dependencies between the monitored components. The run-time activity data may include the number of requests made to a monitored component, the average response time of a monitored component so far, or other activity metrics. One dependency generation method requires an estimate of only the activity periods of the two components under consideration—which activity periods are estimated from the monitored run-time activity data. A ‘probability’ of a dependency is estimated from the consistency with which the monitoring data shows a positive correlation between components and, in some cases, also by reference to the attributes of the components. This estimate is updated as and when new data becomes available. The dependency extraction method does not rely on any specific measure of the probability of a dependency between components.
The computed ‘probability’ value, representing the consistency of identification of a positive correlation between a first component and a second component, can be updated from a Current Estimate value to a New Estimate value according to the result of comparing the run-time activity data of the first and second component for each execution of the components. In one embodiment, this update is in accordance with the rule:
where StepSize is the inverse of the total number of executions of the second component and Target is 1 if the comparison of the run-time activity data of the first and second component for the current execution results in a positive identification of a dependency relationship, and 0 otherwise.
One example statistic for estimating a ‘probability’ of dependency is the p-value (described above). Alternatively, a function of the two statistics r-value and p-value together can be used as a measure of the ‘probability’ of the dependency.
The update procedure for the p-value for a dependency is of the form:
where StepSize is the inverse of the total number of activity periods of the antecedent component and Target is a function of the activity periods of the antecedent and the dependent in the preferred embodiment. Target is I if the antecedent's activity period is contained in the activity period of the dependent in the preferred embodiment, otherwise the Target is 0. A similar update procedure can be applied to the r-value, except that the StepSize is then the inverse of the total number of activity periods of the dependent component.
The dependency results may be used by a number of different systems management applications such as visualization, root cause analysis for problem determination or impact analysis such as for determining the effects of taking system components off-line (for maintenance or upgrades). Containment of computed activity periods for logical components has been found to provide a good basis for discovering dependencies between synchronous components of a distributed system, but the method may also discover false dependencies. To reduce the likelihood of a problem determination application investigating false dependencies, a sorting heuristic may be used to increase the probability of true dependencies appearing high in a sorted list. Such sorting methods may use attributes such as the frequency of invocation of a component, or attach higher significance to apparent dependencies discovered when the monitored system is under light load conditions. In particular, a higher weightings can be applied to dependency results discovered when a small number of processes are running concurrently in the monitored system, or results discovered during high load conditions may be filtered out.
Alternative embodiments of the invention discover correlations between run-time activity metrics other than activity period containment to determine probable dependencies—such as discovering correlations between the frequency of execution of the components or the average execution period of the components. If there is a correlation between increases or decreases of average execution period for two components, and those increases or decreases are not explained by increasing or decreasing load, then it is likely that the two components are dependent on each other or share a dependency relationship with another component or resource.
Methods according to the invention may include a consideration of which of the identified dependency relationships are sufficiently consistently identified to be reported as dependencies. Weightings may be determined by combining the results of correlation comparisons for a plurality of different run-time activity characteristics and used to sort the dependencies in order, or computed ‘probability’ values may be compared with a minimum threshold value.
As will be understood by persons skilled in the art, additional modifications or additions may be made to the specific methods, apparatus and computer programs described in detail above without departing from the scope of the invention as set out in the claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5664093||Jul 25, 1996||Sep 2, 1997||General Electric Company||System and method for managing faults in a distributed system|
|US5696701||Jul 12, 1996||Dec 9, 1997||Electronic Data Systems Corporation||Method and system for monitoring the performance of computers in computer networks using modular extensions|
|US6249885||Oct 1, 1997||Jun 19, 2001||Karl S. Johnson||Method for managing environmental conditions of a distributed processor system|
|US6327677||Apr 27, 1998||Dec 4, 2001||Proactive Networks||Method and apparatus for monitoring a network environment|
|US6393480 *||Jun 21, 1999||May 21, 2002||Compuware Corporation||Application response time prediction|
|US6847970 *||Sep 11, 2002||Jan 25, 2005||International Business Machines Corporation||Methods and apparatus for managing dependencies in distributed systems|
|US20010020251||Mar 23, 2001||Sep 6, 2001||Sheikh Tahir Q.||System architecture for remote access and control of environmental management|
|US20010052087||Apr 27, 1998||Dec 13, 2001||Atul R. Garg||Method and apparatus for monitoring a network environment|
|US20020198983||Jun 26, 2001||Dec 26, 2002||International Business Machines Corporation||Method and apparatus for dynamic configurable logging of activities in a distributed computing system|
|1||"Systems Management: Application Response Measurement (ARM) API", OpenGroup Technical Standard C807, UK ISBN 1 85912-211-6 Jul. 1998.|
|2||A. Brown, G. Kar, and A Keller, "An Active Approach to Characterizing Dynamic Dependencies for Problem Determination in a Distributed Environment", International IFIP/IEEE Symposium on Integrated Network Management, 2001.|
|3||A. K. Iyengar, M. S. Squillante, L. Zhang, "Analysis and Characterization of Large-Scale Web Server Access Patterns and Performance", World Wide Web vol. 2,#1, 2, Jun. 1999.|
|4||A.Keller and G.Kar, "Classification and Computation of Dependencies for Distributed Management", 5<SUP>th </SUP>IEEE Symposium on Computers and Communications (ISCC), Jul. 2000.|
|5||B. Gruschke, "Integrated Event Management: Event Correlation using Dependency Graphs", Proceedings of 9<SUP>th </SUP>IFIP/IEEE International Workshop on Distributed Systems: Operations and Management (DSOM 98), Oct. 1998.|
|6||D. Thoenen, J. Riosa, and J. L. Hellerstein, "Event Relationship Networks: A Framework for Action Oriented Analysis for Event Management," Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, Seattle, WA, May 2001, IEEE, New York (2001), pp. 593-606.|
|7||Ensel, Christian, "New Approach for Automated Generation of Service Dependency Models" Second Latin American Network Operation and Management Symposium, LANOMS, 2001.|
|8||F. Kon and R. H. Campbell, "Dependence Management in Component-Based Distributed Systems," IEEE Concurency, vol. 8, No. 1, pp. 26-36, Jan.-Mar. 2000.|
|9||H. Hrasna, "Java(TM) 2 Platform, Enterprise Edition, Management Specification JSR-77", Sun Microsystems, Inc., 2002, Chapter JSR 77.6, pp. 53-79.|
|10||J. A. Farrell and H. Kreger, "Web services management approaches," IBM Systems Journal, vol. 41, No. 2, 2002.|
|11||J. Aman, C.K. Eilert, D. Emmes, P. Yocom, D. Dillenberger, "Adaptive Algorithms for managing a distributed data processing workload", IBM Systems Journal, vol. 36, No. 2, 1997.|
|12||J. Choi, M. Choi, and S. Lee, "An Alarm Correlation and Fault Identification Scheme Based on OSI Managed Object Classes," In 1999 IEEE International Conference on Communications, Vancouver, BC, Canada, 1999, pp. 1547-1551.|
|13||J.L. Hellerstein and S. Ma, "Mining Event Data for Actionable Patterns", The Computer Measurement Group, 2000.|
|14||*||Keller et al., "An Active Approach to Characterizing Dynamic Dependencies for Problem Determination in a Distributed Environment," 2001.|
|15||*||Keller et al., Dynamic dependencies in Application Service Management, Jun. 2000.|
|16||*||Keller et al., Towards a CIM Schema for RunTime Application Management, Oct. 2001.|
|17||M. Steinder & A. S. Sethi, "Increasing robustness of fault localization through analysis of lost, spurious, and positive symptoms", IEEE INFOCOM, 2002, pp. 322-331.|
|18||M. Steinder and A. S. Sethi, "Multi-layer Fault Localization using Probabilistic Inference in Bipartite Dependency Graphs", Technical Report 2001-02, CIS Dept., Univ. of Delaware, Feb. 2001.|
|19||M. Steinder and A. Sethi, "The present and future of event correlation: A need for end-to-end service fault localization," 2001.|
|20||M.J. Katchabaw et al, "Making Distributed Applications ManageableThrough Instrumentation," Journal of Systems and Software, vol. 45, 1997.|
|21||M.Y. Chen, E. Kiciman, E. Fratkin, A. Fox, and E. Brewer, "Pinpoint: Problem Determination in Large, Dynamic Internet Services", International Conference on Dependable Systems and Networks (DSN'02), Jun. 2002.|
|22||P. Hasselmeyer, "Managing Dynamic Service Dependencies," Proceedings of 12<SUP>th </SUP>International Workshop on Distributed Systems: Operations & Management (DSOM), Nancy, France, 2001.|
|23||R Agarwal, T. Imielinski, and A.Swami, "Mining association rules between sets of items in large databases", In Proc. Of the ACM SIGMOD Conference on Management of Data, pp. 207-216, May 1993.|
|24||S. Bagchi, G. Kar, J.L. Hellerstein, "Dependency Analysis in Distributed Systems using Fault Injection: Application to Problem Determination in an e-commerce Environment" 12<SUP>th </SUP>International Workshop on Distributed Systems: Operations & Management, Nancy, France, 2001.|
|25||S. Katker, "A Modeling Framework for Integrated Distributed Systems Fault Management", Proceedings of the IFIP/IEEE International Conference on Distributed Platforms ICDP'96, Dresden, Germany, 1996.|
|26||S. Rangaswamy, R. Willenborg, and W. Qiao, "Writing a Performance Monitoring Tool Using WebSphere Application Server's Performance Monitoring Infrastructure API", In IBM WebSphere Developer Technical Journal, Feb. 2002.|
|27||S. Yemini, S. Kliger et al., "High Speed and Robust Event Correlation," IEEE Communications Magazine, vol. 34, No. 5, pp. 82-90, May 1996.|
|28||*||The Open Group, "Systems Management: Distributed Software Administration," published on Jan. 1998.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7509416 *||Nov 3, 2006||Mar 24, 2009||Unisys Corporation||Dynamically updating subcomponents in a tiered remote monitoring system|
|US7631222 *||Aug 23, 2004||Dec 8, 2009||Cisco Technology, Inc.||Method and apparatus for correlating events in a network|
|US7653902 *||Dec 13, 2004||Jan 26, 2010||Sap Ag||Determining software deployment parameters|
|US7690001 *||Apr 29, 2005||Mar 30, 2010||Sap Ag||System and method for a management model event system|
|US7958159 *||Dec 19, 2005||Jun 7, 2011||Teradata Us, Inc.||Performing actions based on monitoring execution of a query|
|US8015139||Feb 28, 2008||Sep 6, 2011||Microsoft Corporation||Inferring candidates that are potentially responsible for user-perceptible network problems|
|US8065409||Feb 18, 2005||Nov 22, 2011||Cisco Technology, Inc.||Method of labeling alarms to facilitate correlating alarms in a telecommunications network|
|US8140614 *||Jun 2, 2005||Mar 20, 2012||International Business Machines Corporation||Distributed computing environment with remote data collection management|
|US8140659 *||May 8, 2001||Mar 20, 2012||Hewlett-Packard Development Company, L.P.||Calculating an estimated time to complete a request|
|US8234631 *||Aug 14, 2008||Jul 31, 2012||Dynatrace Software Gmbh||Method and system for tracing individual transactions at the granularity level of method calls throughout distributed heterogeneous applications without source code modifications|
|US8239828 *||Jan 8, 2008||Aug 7, 2012||International Business Machines Corporation||Method of recovering from software failures using replanning|
|US8245122||Jan 8, 2008||Aug 14, 2012||International Business Machines Corporation||Method and system for modeling user requests, applications and components used in dynamic application assembly|
|US8312426||Jan 7, 2008||Nov 13, 2012||International Business Machines Corporation||Method and system for simplified service composition in web environment|
|US8359571||Dec 19, 2005||Jan 22, 2013||International Business Machines Corporation||Computer method and apparatus for activity-based version selection in a configuration management system|
|US8387001 *||May 20, 2009||Feb 26, 2013||Infosys Technologies Limited||Method for finding an impact on a computer generated code|
|US8423827 *||Dec 28, 2009||Apr 16, 2013||International Business Machines Corporation||Topology based correlation of threshold crossing alarms|
|US8429610 *||Dec 20, 2005||Apr 23, 2013||International Business Machines Corporation||Computer method and apparatus for providing version-aware impact analysis|
|US8443074 *||Feb 28, 2008||May 14, 2013||Microsoft Corporation||Constructing an inference graph for a network|
|US8464225||May 6, 2007||Jun 11, 2013||Dynatrace Software Gmbh||Method and system for adaptive, generic code instrumentation using run-time or load-time generated inheritance information for diagnosis and monitoring application performance and failure|
|US8484611||Oct 15, 2007||Jul 9, 2013||International Business Machines Corporation||Method and system for simplified assembly of information processing applications|
|US8510733 *||Aug 4, 2006||Aug 13, 2013||Techila Technologies Oy||Management of a grid computing network using independent software installation packages|
|US8533687||Nov 30, 2009||Sep 10, 2013||dynaTrade Software GmbH||Methods and system for global real-time transaction tracing|
|US8589331 *||Oct 22, 2010||Nov 19, 2013||International Business Machines Corporation||Predicting outcomes of a content driven process instance execution|
|US8640149||Mar 26, 2008||Jan 28, 2014||International Business Machines Corporation||Method and apparatus for dynamic web service composition and invocation|
|US8645019 *||Dec 9, 2010||Feb 4, 2014||GM Global Technology Operations LLC||Graph matching system for comparing and merging fault models|
|US8707260 *||May 25, 2007||Apr 22, 2014||International Business Machines Corporation||Resolving interdependencies between heterogeneous artifacts in a software system|
|US8713525 *||Mar 25, 2010||Apr 29, 2014||International Business Machines Corporation||Software management system for network data processing systems|
|US8789037 *||Jul 5, 2012||Jul 22, 2014||Apple Inc.||Compatible trust in a computing device|
|US8799191 *||Aug 4, 2011||Aug 5, 2014||Christian Kayser||Method and system for generating a prediction network|
|US8898624||May 5, 2008||Nov 25, 2014||International Business Machines Corporation||Method and apparatus for simplified assembly of parametric information processing applications|
|US8930525 *||Apr 27, 2010||Jan 6, 2015||Hewlett-Packard Development Company, L.P.||Method and apparatus for measuring business transaction performance|
|US8949140||Apr 21, 2008||Feb 3, 2015||International Business Machines Corporation||Method and system for dynamic software reconfiguration triggered by component- or system- initiated events|
|US8949801||May 13, 2009||Feb 3, 2015||International Business Machines Corporation||Failure recovery for stream processing applications|
|US8954550 *||Feb 13, 2008||Feb 10, 2015||Microsoft Corporation||Service dependency discovery in enterprise networks|
|US8997039 *||Apr 22, 2013||Mar 31, 2015||International Business Machines Corporation||Injecting a fault into a stream operator in a data stream processing application|
|US9038033 *||Dec 9, 2011||May 19, 2015||Sencha, Inc.||Techniques and mechanisms for web application minification|
|US9047412||Feb 25, 2013||Jun 2, 2015||Dynatrace Corporation||System and method for extracting instrumentation relevant inheritance relationships for a distributed, inheritance rule based instrumentation system|
|US9231858||Dec 17, 2010||Jan 5, 2016||Dynatrace Software Gmbh||Completeness detection of monitored globally distributed synchronous and asynchronous transactions|
|US9274919||Apr 25, 2012||Mar 1, 2016||Dynatrace Software Gmbh||Transaction tracing mechanism of distributed heterogenous transactions having instrumented byte code with constant memory consumption and independent of instrumented method call depth|
|US9286032||Mar 15, 2013||Mar 15, 2016||International Business Machines Corporation||Automated software composition|
|US20020174214 *||May 8, 2001||Nov 21, 2002||Carl Michael R.||Internet transaction performance monitor|
|US20050166099 *||Feb 18, 2005||Jul 28, 2005||Jackson Shyu||Method of labeling alarms to facilitate correlating alarms in a telecommunications network|
|US20060041659 *||Aug 23, 2004||Feb 23, 2006||Hasan Masum Z||Method and apparatus for correlating events in a network|
|US20060130056 *||Dec 13, 2004||Jun 15, 2006||Erol Bozak||Determining software deployment parameters|
|US20060248503 *||Apr 29, 2005||Nov 2, 2006||Sabev Hristo K||System and method for a management model event system|
|US20060277283 *||Jun 2, 2005||Dec 7, 2006||International Business Machines Corporation||Distributed computing environment with remote data collection management|
|US20070032887 *||Jul 26, 2006||Feb 8, 2007||Brother Kogyo Kabushiki Kaisha||Information management system, information processing device, and program|
|US20070143744 *||Dec 20, 2005||Jun 21, 2007||International Business Machines Corporation||Computer method and apparatus for providing version-aware impact analysis|
|US20070143752 *||Dec 19, 2005||Jun 21, 2007||International Business Machines Corporation||Computer method and apparatus for activity-based version selection in a configuration management system|
|US20070180433 *||Jan 27, 2006||Aug 2, 2007||International Business Machines Corporation||Method to enable accurate application packaging and deployment with optimized disk space usage|
|US20080215601 *||Feb 27, 2008||Sep 4, 2008||Fujitsu Limited||System monitoring program, system monitoring method, and system monitoring apparatus|
|US20080222068 *||Feb 28, 2008||Sep 11, 2008||Microsoft Corporation||Inferring Candidates that are Potentially Responsible for User-Perceptible Network Problems|
|US20080222287 *||Feb 28, 2008||Sep 11, 2008||Microsoft Corporation||Constructing an Inference Graph for a Network|
|US20080276227 *||May 6, 2007||Nov 6, 2008||Bernd Greifeneder||Method and System for Adaptive, Generic Code Instrumentation using Run-time or Load-time generated Inheritance Information for Diagnosis and Monitoring Application Performance and Failure|
|US20080295065 *||May 25, 2007||Nov 27, 2008||Hawkins Jennifer L||System and method for resolving interdependencies between heterogeneous artifacts in a software system|
|US20090049429 *||Aug 14, 2008||Feb 19, 2009||Bernd Greifeneder||Method and System for Tracing Individual Transactions at the Granularity Level of Method Calls Throughout Distributed Heterogeneous Applications Without Source Code Modifications|
|US20090100407 *||Oct 15, 2007||Apr 16, 2009||Eric Bouillet||Method and system for simplified assembly of information processing applications|
|US20090177910 *||Jan 8, 2008||Jul 9, 2009||Zhen Liu||Method of recovering from software failures using replanning|
|US20090177955 *||Jan 8, 2008||Jul 9, 2009||Zhen Liu||Method and system for modeling user requests, applications and components used in dynamic application assembly|
|US20090204696 *||Feb 13, 2008||Aug 13, 2009||Ming Zhang||Service dependency discovery in enterprise networks|
|US20090276753 *||May 5, 2008||Nov 5, 2009||Eric Bouillet||Method and apparatus for simplified assembly of parametric information processing applications|
|US20100100867 *||May 20, 2009||Apr 22, 2010||Renuka Sindhgatta||Method for finding an impact on a computer generated code|
|US20100287543 *||Aug 4, 2006||Nov 11, 2010||Techila Technologies Oy||Management of a grid computing network using independent software installation packages|
|US20100293532 *||May 13, 2009||Nov 18, 2010||Henrique Andrade||Failure recovery for stream processing applications|
|US20110093688 *||Dec 20, 2010||Apr 21, 2011||Fujitsu Limited||Configuration management apparatus, configuration management program, and configuration management method|
|US20110161741 *||Dec 28, 2009||Jun 30, 2011||International Business Machines Corporation||Topology based correlation of threshold crossing alarms|
|US20110239189 *||Mar 25, 2010||Sep 29, 2011||International Business Machines Corporation||Software management system for network data processing systems|
|US20110264790 *||Apr 27, 2010||Oct 27, 2011||Michael Haeuptle||Method And Apparatus For Measuring Business Transaction Performance|
|US20120036092 *||Aug 4, 2011||Feb 9, 2012||Christian Kayser||Method and system for generating a prediction network|
|US20120066166 *||Sep 10, 2010||Mar 15, 2012||International Business Machines Corporation||Predictive Analytics for Semi-Structured Case Oriented Processes|
|US20120101974 *||Oct 22, 2010||Apr 26, 2012||International Business Machines Corporation||Predicting Outcomes of a Content Driven Process Instance Execution|
|US20120151290 *||Dec 9, 2010||Jun 14, 2012||GM Global Technology Operations LLC||Graph matching system for comparing and merging fault models|
|US20120278597 *||Jul 5, 2012||Nov 1, 2012||Dallas Blake De Atley||Compatible trust in a computing device|
|US20120317119 *||Feb 10, 2010||Dec 13, 2012||Hitachi, Ltd.||Product Line Type Development Supporting Device|
|US20130042154 *||Aug 12, 2011||Feb 14, 2013||Microsoft Corporation||Adaptive and Distributed Approach to Analyzing Program Behavior|
|US20130238936 *||Apr 22, 2013||Sep 12, 2013||International Business Machines Corporation||Partial fault tolerant stream processing applications|
|U.S. Classification||717/120, 718/106, 714/E11.207, 719/316, 714/40, 719/328, 717/121, 718/100, 714/26, 719/317, 707/999.1, 714/47.2, 714/47.3|
|International Classification||G06F9/46, G06F13/00, G06F11/00, G06F7/00, H04L29/08, G06F3/00, G06F9/44|
|Cooperative Classification||H04L67/02, G06F11/008|
|Oct 20, 2003||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AGARWAL, MANOJ K.;GUPTA, MANISH;KAR, GAUTAM;AND OTHERS;REEL/FRAME:014650/0642;SIGNING DATES FROM 20031007 TO 20031009
|Feb 8, 2008||AS||Assignment|
Owner name: DURA OPERATING CORP., MICHIGAN
Free format text: TERMINATION AND RELEASE;ASSIGNOR:GOLDMAN SACHS CREDIT PARTNERS, L.P., AS COLLATERAL AGRENT;REEL/FRAME:020478/0674
Effective date: 20080130
Owner name: UNIVERSAL TOOL & STAMPING COMPANY, INC., MICHIGAN
Free format text: TERMINATION AND RELEASE;ASSIGNOR:GOLDMAN SACHS CREDIT PARTNERS, L.P., AS COLLATERAL AGRENT;REEL/FRAME:020478/0674
Effective date: 20080130
Owner name: DURA AUTOMOTIVE SYSTEMS CABLE OPERATIONS, INC., MI
Free format text: TERMINATION AND RELEASE;ASSIGNOR:GOLDMAN SACHS CREDIT PARTNERS, L.P., AS COLLATERAL AGRENT;REEL/FRAME:020478/0674
Effective date: 20080130
Owner name: DURA GLOBAL TECHNOLOGIES, INC., MICHIGAN
Effective date: 20080130
Owner name: ATWOOD MOBILE PRODUCTS, INC., MICHIGAN
Effective date: 20080130
Owner name: DURA AUTOMOTIVE SYSTEMS, INC., MICHIGAN
Effective date: 20080130
Owner name: DURA OPERATING CORP.,MICHIGAN
Effective date: 20080130
Owner name: UNIVERSAL TOOL & STAMPING COMPANY, INC.,MICHIGAN
Effective date: 20080130
Owner name: DURA AUTOMOTIVE SYSTEMS CABLE OPERATIONS, INC.,MIC
Effective date: 20080130
Owner name: DURA GLOBAL TECHNOLOGIES, INC.,MICHIGAN
Effective date: 20080130
Owner name: ATWOOD MOBILE PRODUCTS, INC.,MICHIGAN
Effective date: 20080130
Owner name: DURA AUTOMOTIVE SYSTEMS, INC.,MICHIGAN
Effective date: 20080130
|Mar 19, 2012||REMI||Maintenance fee reminder mailed|
|Jun 29, 2012||SULP||Surcharge for late payment|
|Jun 29, 2012||FPAY||Fee payment|
Year of fee payment: 4
|Mar 18, 2016||REMI||Maintenance fee reminder mailed|
|Aug 5, 2016||LAPS||Lapse for failure to pay maintenance fees|
|Sep 27, 2016||FP||Expired due to failure to pay maintenance fee|
Effective date: 20160805