|Publication number||US7950015 B2|
|Application number||US 11/845,508|
|Publication date||May 24, 2011|
|Filing date||Aug 27, 2007|
|Priority date||Sep 20, 2002|
|Also published as||CN1689298A, CN1689298B, US20040060054, US20070294386, WO2004027661A2, WO2004027661A3|
|Publication number||11845508, 845508, US 7950015 B2, US 7950015B2, US-B2-7950015, US7950015 B2, US7950015B2|
|Inventors||Rajarshi Das, Ian Nicholas Whalley|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (56), Non-Patent Citations (33), Referenced by (1), Classifications (18), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application is a continuation of application number 10/252,324, filed Sep. 20, 2002, now abandoned.
The present invention is related to the following applications entitled: “Method and Apparatus for Publishing and Monitoring Entities Providing Services in a Distributed Data Processing System”, Ser. No. 10/252,816, “Method and Apparatus for Automatic Updating and Testing of Software”, Ser. No. 10/252,868, “Self-Managing Computing System”, Ser. No. 10/252,247, and “Adaptive Problem Determination and Recovery in a Computer System”, Ser. No. 10/252,979, all filed even date hereof, assigned to the same assignee, and incorporated herein by reference.
1. Technical Field
The present invention relates generally to an improved data processing system, and in particular, to a method and apparatus for managing hardware and software components. Still more particularly, the present invention provides a method and apparatus for automatically identifying and combining components to achieve functionality requirements.
2. Description of Related Art
Modern computing technology has resulted in immensely complicated and ever-changing environments. One such environment is the Internet, which is also referred to as an “internetwork.” The Internet is a set of computer networks, possibly dissimilar, joined together by means of gateways that handle data transfer and the conversion of messages from a protocol of the sending network to a protocol used by the receiving network. When capitalized, the term “Internet” refers to the collection of networks and gateways that use the TCP/IP suite of protocols. Currently, the most commonly employed method of transferring data over the Internet is to employ the World Wide Web environment, also called simply “the Web”. Other Internet resources exist for transferring information, such as File Transfer Protocol (FTP) and Gopher, but have not achieved the popularity of the Web. In the Web environment, servers and clients effect data transaction using the Hypertext Transfer Protocol (HTTP), a known protocol for handling the transfer of various data files (e.g., text, still graphic images, audio, motion video, etc.). The information in various data files is formatted for presentation to a user by a standard page description language, the Hypertext Markup Language (HTML). The Internet also is widely used to transfer applications to users using browsers. Often times, users of may search for and obtain software packages through the Internet.
Other types of complex network data processing systems include those created for facilitating work in large corporations. In many cases, these networks may span across regions in various worldwide locations. These complex networks also may use the Internet as part of a virtual product network for conducting business. These networks are further complicated by the need to manage and update software used within the network.
As software evolves to become increasingly ‘autonomic’, the task of installing and configuring software will, more and more, be performed by the computers themselves, as opposed to being performed by administrators. The current installing and configuring mechanisms are moving towards an “autonomic” process. For example, many operating systems and software packages will automatically look for particular software components based on user-specified requirements. These installation and update mechanisms often connect to the Internet at a preselected location to see whether an update or a needed component is present. If the update or other component is present, the message is presented to the user in which the message asks the user whether to download and install the component. An example of such a system is the package management program “dselect” that is part of the open-source Debian GNU/Linux operating system.
A next block towards “autonomic” computing involves identifying and installing/downloading necessary hardware and software components without requiring user intervention. In such a next generation system, an autonomic configuration utility would install components in response to the detection of a need for particular functionality. In such a circumstance, there may not be a single hardware or software component for providing the needed functionality. Thus, it would be desirable for there to be a scheme whereby needed functionality may be obtained in the absence of a single component for providing the necessary functionality.
The present invention is directed toward a method, computer program product, and data processing system for providing an improved directory service for storing information about hardware and software components. The directory service stores not only the information that other components require to locate, and make use of, the components listed in the directory, but is also able to dynamically construct ‘meta services’ that fulfill a client's functionality requirements.
In response to a request from the client for particular functional requirements, the directory service determines a set of hardware and/or software components to provide the needed functionality. The components in the set are then combined and configured to achieve the necessary functionality via logical deduction from domain knowledge. A history mechanism allows for already derived configurations of hardware or software components to be recalled immediately.
The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further objectives and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:
With reference now to the figures,
In the depicted example, server 104 is connected to network 102 along with storage unit 106. In addition, clients 108, 110, and 112 are connected to network 102. These clients 108, 110, and 112 may be, for example, personal computers or network computers. In the depicted example, server 104 provides data, such as boot files, operating system images, and applications to clients 108-112. Clients 108, 110, and 112 are clients to server 104. Network data processing system 100 may include additional servers, clients, and other devices not shown. In the depicted example, network data processing system 100 is the Internet with network 102 representing a worldwide collection of networks and gateways that use the Transmission Control Protocol/Internet Protocol (TCP/IP) suite of protocols to communicate with one another. At the heart of the Internet is a backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, government, educational and other computer systems that route data and messages. Of course, network data processing system 100 also may be implemented as a number of different types of networks, such as for example, an intranet, a local area network (LAN), or a wide area network (WAN).
Peripheral component interconnect (PCI) bus bridge 214 connected to I/O bus 212 provides an interface to PCI local bus 216. A number of modems may be connected to PCI local bus 216. Typical PCI bus implementations will support four PCI expansion slots or add-in connectors. Communications links to clients 108-112 in
Additional PCI bus bridges 222 and 224 provide interfaces for additional PCI local buses 226 and 228, from which additional modems or network adapters may be supported. In this manner, data processing system 200 allows connections to multiple network computers. A memory-mapped graphics adapter 230 and hard disk 232 may also be connected to I/O bus 212 as depicted, either directly or indirectly.
Those of ordinary skill in the art will appreciate that the hardware depicted in
The data processing system depicted in
With reference now to
An operating system runs on processor 302 and is used to coordinate and provide control of various components within data processing system 300 in
Those of ordinary skill in the art will appreciate that the hardware in
As another example, data processing system 300 may be a stand-alone system configured to be bootable without relying on some type of network communication interfaces As a further example, data processing system 300 may be a personal digital assistant (PDA) device, which is configured with ROM and/or flash ROM in order to provide non-volatile memory for storing operating system files and/or user-generated data.
The depicted example in
The present invention is directed toward an improved directory service for storing information about hardware and software components. Throughout this document, the term “service” is used to described both hardware and software components. In an autonomic computing paradigm, services may be procured and combined (bound) dynamically according to functional requirements. Thus, hardware and software components in an autonomic computing environment are referred to as “services” to emphasize the fact that in autonomic computing, the system components are deployed for current functional requirements only. Thus, an autonomic computing system is not statically constructed at build time from a fixed and unchanging set of components, but rather dynamically utilizes available “services” as required.
Sometimes the functionality required of an autonomic computing system cannot be provided by a single service alone. In such cases, the required functionality may be achieved by combining a number of services together. Thus, the directory service provided by the present invention stores not only the information that other components require to locate, and make use of, the services listed in the directory, but is also able to dynamically construct “meta-services” that fulfill a client's request.
For example, if a client asks the directory to provide details for a certain type of service (including, but not limited to, the location or identity of that service) that is not available in the directory, then a simple directory service would simply respond that no such services were available. However, the improved directory service has the capability to derive (or to cause another software entity to derive), either based on pre-programmed knowledge or on-the-fly deduction, a mechanism by which components available in the directory may be combined in order to obtain functionality equivalent to that of the services originally sought by the requesting client.
Consider, for example, a situation where a requesting service (e.g., a software component) asks the directory for information about available services that can provide 1 PB (Petabyte) of direct-access storage space. In the case where the directory does not contain information about any such services, but does contain information about ten services, each of which can provide 100 TB (Terabytes) of direct-access storage space, the directory service can then return a response to the requesting service indicating that if the requesting service combined the ten services, it would obtain the equivalent of the service that was originally requested.
In a preferred embodiment, directory service 401 may provide directory services through the use of standardized directory service schemes such as Web Services Description Language (WSDL) and systems such as Universal Description, Discovery, and Integration (UDDI), which allow a program to locate entities that offer particular services and to automatically determine how to communicate and conduct transactions with those services. WSDL is a proposed standard being considered by the WorldWide Web Consortium, authored by representatives of companies, such as International Business Machines Corporation, Ariba, Inc., and Microsoft Corporation. UDDI version 3 is the current specification being used for Web service applications and services. Future development and changes to UDDI will be handled by the Organization for the Advancement of Structured Information Standards (OASIS).
Composition service 402 will first try to fulfill the request via history database 405, which stores the results of previously-derived combinations of services. If no applicable previously-derived combination is available, composition logic 403 will be employed to derive a new combination of available services that satisfies the functional requirements of the request. Composition logic 403 is, in a preferred embodiment, software that utilizes information about components in available services database 406 information regarding the combinability of components from combination hints 404 to derive a combination of components meeting the functional requirements of requesting service 400's original request.
Turning now to the process flow represented by
If the request cannot be met from available services (block 502: No), the request is forwarded to composition service 402 (block 505). Composition service 402 receives the request (block 506) and determines whether the request can be satisfied from history database 405 (block 507). If so (block 507: Yes), a response from history database 405 is returned (block 509). If not (block 507: No), composition logic 403 is used to derive a combination providing the necessary functionality (block 510). This new combination is entered into history database 405 (block 508), and a response returned (block 509). Directory service 401 then receives composition services 402's response (block 511) and returns the response to the client (block 504).
As can be seen from
The E-R (entity-relationship) approach to database modeling provides a semantics for the conceptual design of databases. With the E-R approach, database information is represented in terms of entities, attributes of entities, and relationships between entities, where the following definitions apply. The modeling semantics corresponding to each definition is illustrated in
Entity: An entity is a principal object about which information is collected. For example, in a database containing information about personnel of a company, an entity might be “Employee.” In E-R modeling, an entity is represented with a box. An entity may be termed weak or strong, relating its dependence on another entity. A strong entity exhibits no dependence on another entity, i.e. its existence does not require the existence of another Entity. As shown in
Attribute: An attribute is a label that gives a descriptive property to an entity (e.g., name, color, etc.). Two types of attributes exist. Key attributes distinguish among occurrences of an entity. For example, in the United States, a Social Security number is a key attribute that distinguishes between individuals. Descriptor attributes merely describe an entity occurrence (e.g., gender, weight). As shown in
Relationships: A relationship is a connectivity exhibited between entity occurrences. Relationships may be one to one, one to many, and many to many, and participation in a relationship by an entity may be optional or mandatory. For example, in the database containing information about personnel of a company, a relation “married to” among employee entity occurrences is one to one (if it is stated that an employee has at most one spouse). Further, participation in the relation is optional as there may exist unmarried employees. As a second example, if company policy dictates that every employee have exactly one manager, then the relationship “managed by” among employee entity occurrences is many to one (many employees may have the same manager), and mandatory (every employee must have a manager).
As shown in
The “base” entity in
Ternary relationship “provides1” 710 relates each component (706) with one or more base functionalities (714) under a particular usage (712). Ternary relationship “provides1” 710 denotes that a particular component (706), when used in a certain way (712), provides one or more base functionalities (714).
Ternary relationship “synthesize” 716 relates one or more base functionalities (714) with a combination method (combination method entity 718) and a corresponding derived functionality (derived functionalities entity 720). Ternary relationship “synthesize” 716 denotes that one or more base functionalities (714) may be combined in a certain manner (718) to achieve a derived functionality (720). For example, converting a graphics file from a “BMP” (bitmap) file to “TIFF” (tagged image file format) file might be a base functionality and converting a TIFF file to a “GIF” (graphics interchange format) may be yet another base functionality. Converting from BMP to GIF format would then be a derived functionality achievable by applying the combination method of feeding the output from a BMP-to-TIFF conversion service into a TIFF-to-GIF conversion service. It should be noted that in
“Combinable” relationship 722 relates a combination method (718) with one or more components (706). “Combinable” relationship 722 denotes that a particular group of components may be combined according to a particular combination method (718). Thus, in the case of the aforementioned graphics file format conversions, “combinable” relationship 722 would store an indication that two particular conversion services could be combined by feed the output of one into the input of the other. Thus, if a certain functionality must be derived from base functionalities, “combinable” relationship 722 may be consulted to ensure that a particular group of components may be combined in the way necessary to achieve the desired derived functionality.
A combination of components (706) combining a set of base functionalities (714) into a derived functionality (720) is a combination, represented by “combination” entity 724, which is related to entities 706, 714, and 720 via relationships 722, 728, and 730. “Combination scheme” attribute 726 of “combination” entity 724 represents information for forming or using the combination. Combination entity 724 provides a history mechanism for storing already-derived combinations. “Combination scheme” attribute 726 may contain, for example, combination method information (e.g., from “combination method” entity 718), or any other pertinent information for using or forming a combination (such as instructions for forming the combination from individual components or a copy of a combined software component incorporating the code from individual components).
A database schema such as the schema described in
In accordance with a preferred embodiment of the present invention, a database schema such as is described in
The process depicted in
Each time the subroutine is invoked, a determination is made as to whether any functional requirements remain to be addressed (block 802). If no additional functional requirements remain (block 802: No), the solution so far should be returned as the result (block 804).
If any functional requirements do remain (block 802: Yes), a determination is made as to whether any components have been selected for inclusion in the solution so far (block 806). If so (block 806: Yes), then a determination is made as to whether any of the remaining requirements can be met by components already selected for inclusion in the solution (block 808). If not (block 808: No) or if no components have been selected so far, the process continues to block 812.
If there is a requirement that is met by an already selected component (block 808: Yes), then usage information (i.e., information that instructs a client on how to use the component in question to achieve the desired functionality) is added to the list of constraints in the solution so far (block 810). A recursive call is then made to address any remaining functional requirements (block 811).
In block 812, a determination is made as to whether there is a requirement that may be met by a single component that has not yet been selected for inclusion in the solution so far. If so (block 812: Yes), the component is added to the list of components in the solution so far (block 814), usage information for that component is added to the solution so far (block 810), and the subroutine is recursively called to handle any remaining functional requirements (block 811).
If none of the functional requirements may be satisfied by a single component (block 812: No), a determination is made as to whether a functional requirement may be met with a combination of functions (block 816). If so (block 816: Yes), the subroutine is called recursively to find a set of components meeting the functional requirements needed to achieve the necessary derived functional requirement (block 818). The result of the recursive subroutine call is then checked to see if the components returned by the subroutine may be combined in the necessary way (block 819). If not (block 819: No), the process makes additional subroutine calls to find combinable components (block 818). If a properly combinable set of components is found (block 819: Yes), the components are added to the solution so far (block 814), usage information specifying how to combine and use the components is added to the solution so far (block 810), and the subroutine is called recursively to address any remaining functional requirements (block 811).
Once a solution is returned by the subroutine, the combination derived is stored in the history database (block 820). One of ordinary skill in the art will recognize that a history database may be implemented using conventional database storage techniques or by making modifications to program logic in a language that supports tabled logic programming or self-modifying code, such as Prolog, or through any other appropriate means, not limited to a simple database representation.
While the preferred embodiment depicted in
Additional variations on the present invention are possible. For example, the process of deriving combinations may be done in a distributed fashion, so that multiple solutions are returned from a plurality of composition services operating concurrently and a best solution is chosen from the returned solutions. Another variation is to offer two or more possible combinations to the requesting client, possibly with additional information to be used as selection criteria, and allowing the client to choose one of the possible combinations presented. Another way in which multiple solutions may be supported is for the composition service (or directory service) to query the client for preferences that would aid in choosing a derived combination from a plurality of candidates, so that the composition service (or directory service) could then offer one or more solutions that best fit the client's preferences. For example, the client could be asked whether speed or reliability is a greater concern, and solutions could be offered in which the speed/reliability tradeoff is handled in accordance with the client's needs.
It is important to note that while the present invention has been described in the context of a fully functioning data processing system, those of ordinary skill in the art will appreciate that the processes of the present invention are capable of being distributed in the form of a computer readable medium of instructions or other functional descriptive material and in a variety of other forms and that the present invention is equally applicable regardless of the particular type of signal bearing media actually used to carry out the distribution. Examples of computer readable media include recordable-type media, such as a floppy disk, a hard disk drive, a RAM, CD-ROMs, DVD-ROMs, and transmission-type media, such as digital and analog communications links, wired or wireless communications links using transmission forms, such as, for example, radio frequency and light wave transmissions. The computer readable media may take the form of coded formats that are decoded for actual use in a particular data processing system. Functional descriptive material is information that imparts functionality to a machine. Functional descriptive material includes, but is not limited to, computer programs, instructions, rules, facts, definitions of computable functions, objects, and data structures.
The description of the present invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention, the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5638494||Jun 10, 1994||Jun 10, 1997||Mitel Corporation||Adaptive communication system|
|US5701400||Mar 8, 1995||Dec 23, 1997||Amado; Carlos Armando||Method and apparatus for applying if-then-else rules to data sets in a relational data base and generating from the results of application of said rules a database of diagnostics linked to said data sets to aid executive analysis of financial data|
|US5790789||Aug 2, 1996||Aug 4, 1998||Suarez; Larry||Method and architecture for the creation, control and deployment of services within a distributed computer environment|
|US5805776||Feb 14, 1994||Sep 8, 1998||Daimler Benz Aktiengesellschaft||Device for automatic generation of a knowledge base for a diagnostic expert system|
|US5832467||Sep 18, 1996||Nov 3, 1998||U.S. Philips Corporation||Behavior prediction for rule-based data processing apparatus|
|US5909544||Aug 23, 1995||Jun 1, 1999||Novell Inc.||Automated test harness|
|US5935264||Jun 10, 1997||Aug 10, 1999||Micron Technology, Inc.||Method and apparatus for determining a set of tests for integrated circuit testing|
|US5978911||Nov 12, 1997||Nov 2, 1999||International Business Machines Corp.||Automatic error recovery in data processing systems|
|US6023586||Feb 10, 1998||Feb 8, 2000||Novell, Inc.||Integrity verifying and correcting software|
|US6026374||May 30, 1996||Feb 15, 2000||International Business Machines Corporation||System and method for generating trusted descriptions of information products|
|US6055562||May 1, 1997||Apr 25, 2000||International Business Machines Corporation||Dynamic mobile agents|
|US6125359||Sep 23, 1997||Sep 26, 2000||Unisys Corporation||Method and apparatus for identifying the coverage of a test sequence in a rules-based expert system|
|US6182245||Aug 31, 1998||Jan 30, 2001||Lsi Logic Corporation||Software test case client/server system and method|
|US6199204||Sep 22, 1998||Mar 6, 2001||International Business Machines Corporation||Distribution of software updates via a computer network|
|US6216173 *||Feb 3, 1998||Apr 10, 2001||Redbox Technologies Limited||Method and apparatus for content processing and routing|
|US6219829||Feb 8, 2000||Apr 17, 2001||Compuware Corporation||Computer software testing management|
|US6256771||Oct 16, 1997||Jul 3, 2001||At&T Corp.||Method and apparatus for providing a dynamic service composition software architecture|
|US6286131||Dec 3, 1997||Sep 4, 2001||Microsoft Corporation||Debugging tool for linguistic applications|
|US6330561||Jun 26, 1998||Dec 11, 2001||At&T Corp.||Method and apparatus for improving end to end performance of a data network|
|US6330586||Feb 7, 1996||Dec 11, 2001||British Telecommunications Public Limited Company||Reconfigurable service provision via a communication network|
|US6353897||Jan 6, 1999||Mar 5, 2002||International Business Machines Corporation||Object oriented apparatus and method for testing object oriented software|
|US6360331||Apr 17, 1998||Mar 19, 2002||Microsoft Corporation||Method and system for transparently failing over application configuration information in a server cluster|
|US6463584||Mar 11, 1999||Oct 8, 2002||Telefonaktiebolaget Lm Ericsson||State copying method for software update|
|US6467088||Jun 30, 1999||Oct 15, 2002||Koninklijke Philips Electronics N.V.||Reconfiguration manager for controlling upgrades of electronic devices|
|US6473794||May 27, 1999||Oct 29, 2002||Accenture Llp||System for establishing plan to test components of web based framework by displaying pictorial representation and conveying indicia coded components of existing network framework|
|US6529950||Jun 17, 1999||Mar 4, 2003||International Business Machines Corporation||Policy-based multivariate application-level QoS negotiation for multimedia services|
|US6567957||Jan 4, 2001||May 20, 2003||Cadence Design Systems, Inc.||Block based design methodology|
|US6584455||Dec 14, 1999||Jun 24, 2003||International Business Machines Corporation||System and method for predicting design errors in integrated circuits|
|US6631367||Dec 28, 2000||Oct 7, 2003||Intel Corporation||Method and apparatus to search for information|
|US6751608||Oct 16, 2001||Jun 15, 2004||At&T Corp.||Method and apparatus for improving end to end performance of a data network|
|US6779016||Feb 11, 2000||Aug 17, 2004||Terraspring, Inc.||Extensible computing system|
|US6804709||Feb 20, 2001||Oct 12, 2004||Microsoft Corporation||System uses test controller to match different combination configuration capabilities of servers and clients and assign test cases for implementing distributed testing|
|US6834341||Feb 22, 2000||Dec 21, 2004||Microsoft Corporation||Authentication methods and systems for accessing networks, authentication methods and systems for accessing the internet|
|US6851115||Jan 5, 1999||Feb 1, 2005||Sri International||Software-based architecture for communication and cooperation among distributed electronic agents|
|US6892218||Sep 15, 2003||May 10, 2005||Certeon, Inc.||Extending network services using mobile agents|
|US6912532||May 22, 2001||Jun 28, 2005||Benjamin H. Andersen||Multi-level multiplexor system for networked browser|
|US6957393 *||Mar 19, 2002||Oct 18, 2005||Accenture Llp||Mobile valet|
|US6970869||Aug 31, 2000||Nov 29, 2005||Sun Microsystems, Inc.||Method and apparatus to discover services and negotiate capabilities|
|US7024487 *||Aug 31, 2001||Apr 4, 2006||Hitachi, Ltd.||Assistant server and path connection control method for service provider's network|
|US7185342||Jul 24, 2001||Feb 27, 2007||Oracle International Corporation||Distributed service aggregation and composition|
|US20020087668||Dec 29, 2000||Jul 4, 2002||San Martin Raul S.||Automatic upgrade of live network devices|
|US20020100036||Sep 20, 2001||Jul 25, 2002||Patchlink.Com Corporation||Non-invasive automatic offsite patch fingerprinting and updating system and method|
|US20020120685||Apr 10, 2002||Aug 29, 2002||Alok Srivastava||System for dynamically invoking remote network services using service descriptions stored in a service registry|
|US20020143819||Apr 12, 2002||Oct 3, 2002||Cheng Han||Web service syndication system|
|US20020174414||Dec 21, 2001||Nov 21, 2002||Fujitsu Limited||Test specification formation supporting apparatus, method, and program, and recording medium|
|US20020183866||Jul 24, 2002||Dec 5, 2002||Dean Jason Arthur||Method and system for diagnosing machine malfunctions|
|US20030023710||May 24, 2001||Jan 30, 2003||Andrew Corlett||Network metric system|
|US20030046615||Dec 22, 2000||Mar 6, 2003||Alan Stone||System and method for adaptive reliability balancing in distributed programming networks|
|US20030154279||Mar 26, 2001||Aug 14, 2003||Ashar Aziz||Symbolic definition of a computer system|
|US20030200293||Apr 18, 2002||Oct 23, 2003||International Business Machines Corporation||Graphics for end to end component mapping and problem - solving in a network environment|
|US20030212924||May 8, 2002||Nov 13, 2003||Sun Microsystems, Inc.||Software development test case analyzer and optimizer|
|US20030235158||Mar 9, 2001||Dec 25, 2003||Chung-Chieh Lee||Protocol for a self-organizing network using a logical spanning tree backbone|
|US20040236843||Nov 15, 2001||Nov 25, 2004||Robert Wing||Online diagnosing of computer hardware and software|
|EP1134658A2||Mar 14, 2001||Sep 19, 2001||Sun Microsystems, Inc.||A system and method for comprehensive availability management in a high-availability computer system|
|JPH1115849A||Title not available|
|WO2002093290A2||May 8, 2002||Nov 21, 2002||Nokia Corporation||Service discovery access to user location|
|1||Addis et al., "Negotiating for Software Services", 2000, IEEE, pp. 1039-1043.|
|2||Bagchi et al., "Dependency Analysis in Distributed Systems using Fault Injection: Application to Problem Determination in an e-commerce Environment", Distributed Operations and Management, 2001, 11 pages.|
|3||Brown et al., "An Active Approach to Chartacterizing Dynamic Dependencies for Problem Determination in a Distributed Environment", Seventh IFIP/IEEE International Symposium on Integrated Network Management, 2001, 14 pages.|
|4||Butler et al., "Error Burst Metric for Failure Trajectory Analysis", International Transmission System, IEE Colloquium, The Institution of Electrical Engineers, 1994, IEE, Savoy Place, London WC2R 0BL, UK, 4 pages.|
|5||Faratin et al., "Using Similarity Criteria to Make Negotiation Trade-Offs", 2000, IEEE, pp. 1-8.|
|6||Faratin, "Automated Service Negotiation Between Autonomous Computational Agents", Dec. 2000, University of London, Department of Electronic Engineering, Queen Mary & Westfield College, pp. 1-255. http://ccs.mit.edu/peyman/pubs/peyman-thesis.pdf.|
|7||Feng et al., "Updating Semantic Information to Support Coordination in Distributes Software Development Environments", p. 13-22, 1993 IEEE, retrieved from IEEE database Mar. 4, 2004.|
|8||Gavrilovska et al., "A Practical Approach for 'Zero' Downtime in an Operational Information System", Jul. 2002, retrieved from IEEE database Mar. 4, 2004.|
|9||Gavrilovska et al., "A Practical Approach for ‘Zero’ Downtime in an Operational Information System", Jul. 2002, retrieved from IEEE database Mar. 4, 2004.|
|10||Goswami et al., "Prediction-Based Dynamic Load-Sharing Heuristics", IEEE Transactions on Parallel and Distributed Systems, vol. 4, No. 6, Jun. 1993, pp. 638-648.|
|11||Grosof, IBM Research Report RC20836, "Courteous Logic Programs: Prioritized Conflict Handling for Rules", May 1997, 63pp.|
|12||Guttman, "Service Location Protocol: Automatic Discovery of IP Network Services", IEEE Internet Computing, IEEE Service Center, Piscataway, NJ, US, vol. 3, No. 4, Jul. 1, 1999, pp. 71-80.|
|13||Hellerstein et al., "Mining Event Data for Actionable Patterns", IBM Thomas J. Watson Research Center, Hawthorne, New York, The Computer Management Group, 2000, 12 pages.|
|14||Hellerstein, "An Approach to Selecting Metrics for Detecting Performance Problems in Information Systems", Proceedings of the Second International Conference on Systems Management, Jun. 19-21, 1996, Toronto, Canada, pp. 1-11.|
|15||http://www.ibm.com/research/autonomic, "Autonomic Computing: IBM's Perspective on the State of Information Technology", Oct. 2001, pp. 1-40.|
|16||IBM Technical Disclosure Bulletin, Mar. 2002, No. 455, p. 499, "Distributed UDDI (Universal Description Discovery and Integration) Registry Lookup and Storage".|
|17||IEEE 100 The Authoritative Dictionary of IEEE Standards Terms, "failover", Dec. 2000, Standards Information Network IEEE Press, Seventh Edition, p. 413.|
|18||Itae et al., "DANSE: Dynamically Adaptive Networking Service Environment", NTT R&D, The Telecommunication Association, Mar. 10, 2001, vol. 50, No. 3, pp. 10-20.|
|19||Keller et al.,"Classification and Computation of Dependencies for Distributed Management", Proceedings of the Fifth IEEE Symposium on Computers and Communications, 2000, pp. 78-83.|
|20||Lee et al., "Error/Failure Analysis Using Event Logs from Fault Tolerant Systems", Fault-Tolerant Computing, 1991, FTCS-21. Digest of Papers, Twenty-First International Symposium, 1991, pp. 10-17.|
|21||Ma et al., "Event Browser: A Flexible Tool for Scalable Analysis of Even Date", Distributed Operations and Management, 1999, pp. 1-12.|
|22||Ma et al., "Mining Mutually Dependent Patterns", IEEE Conference on Data Mining, 2001, pp. 1-20.|
|23||Newton's Telecom Dictionary, "Denial of Service Attack", Feb. 2002, CMP Books, 18th Edition, p. 214.|
|24||Panagos et al., "Synchronization and Recovery in a Client-Server Storage System", p. 209-223, 1997 The VLDB Journal, retrieved from ACM Portal database Mar. 4, 2004.|
|25||Piccinelli et al., "Dynamic Service Aggregation in Electronic Marketplaces", Computer Networks 37 (2001), Elsevier Science Publishers B.V., Amsterdam, NL, vol. 37, No. 2, Oct. 2001, pp. 95-109.|
|26||Quinlan et al., "Induction of Logical Program: FOIL and Related Systems", New Generation Computing 13, 1995, pp. 287-312, 28 pages.|
|27||Rouvellou et al., "Combining Different Business Rules Technologies: A Rationalization", Proc. Of the OOPSLA 2000 Workshop on Best-Practices in Business Rule Design and Implementation, Minneapolis, MN, Oct. 2000, pp. 1-6.|
|28||Stevens, "18.2 Connection Establishment and Termination", TCP/IP Illustrated, vol. 1: The Protocols, Addison-Wesley, 1994, pp. 15-16, 229-234.|
|29||Tang et al., "Analysis and Modeling of Correlated Failures in Multicomputer Systems", IEEE Transactions on Computers, vol. 41, No. 5, May 1992, pp. 567-577.|
|30||Thottan et al., "Proactive Anomaly Detection Using Distributed Intelligent Agents", IEEE Network, Sep./Oct. 1998, pp. 21-27.|
|31||Van Den Heuvel W-J et al: "Service Representation, Discovery, and Composition for E-marketplaces", Cooperative Information Systems. 9th International Conference Coopis 2001. Proceedings (Lecture Notes in Computer Science vol. 2172), Proceedings, Trento, Italy, Sep. 5-7, 2000, pp. 270-284.|
|32||Vilalta et al., "Predictive Algorithms in the Management of Computer Systems", IBM Systems Journal, vol. 41, No. 3, 2002, pp. 461-474.|
|33||Yajnik et al., "STL: A Tool for On-Line Software Update and Rejuvenation", p. 258, 1997 IEEE, retrieved from IEEE database Mar. 4, 2004.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US9344843||Oct 17, 2014||May 17, 2016||Sap Se||Providing context sensitive service bundles|
|U.S. Classification||718/104, 709/226|
|International Classification||G06F9/46, H04L29/12, G06F9/50, H04L29/08, G06F15/173|
|Cooperative Classification||H04L67/125, H04L69/329, H04L67/16, G06F9/5044, H04L61/1541, H04L29/12113|
|European Classification||H04L29/08N11M, H04L29/12A2C, H04L29/08A7, G06F9/50A6H, H04L61/15C|
|Jan 2, 2015||REMI||Maintenance fee reminder mailed|
|May 24, 2015||LAPS||Lapse for failure to pay maintenance fees|
|Jul 14, 2015||FP||Expired due to failure to pay maintenance fee|
Effective date: 20150524