US 6,704,782 B1Grant
System and methods for real time progress monitoring in a computer network
Issue Date:2004-03-09
•23 Claims
•9 Drawing Sheets
Abstract
A method of monitoring data distribution progress in a computer network including a Distribution Manager and an end-user terminal communicating with the Distribution Manager through at least one node in the network. The Distribution Manager generates an identifier associated with the distribution along with a routing to the end-user terminal through the network. The Distribution Manager updates a Distribution State Table, maintaining information describing the progress of the distribution, and a Node State Table, maintaining information describing the status of the node in the network. The distribution data is then sent to the end-user terminal via the selected routing. Data are collected at the node from the end-user terminal describing the status of the end-user terminal and those data are transferred to the Distribution Manager. The Distribution Manager updates the distribution State and Node State Tables with the data received from the Node.
Metadata
Assignee
- International Business Machines Corporation
Inventors
- Jeffrey Mark Achtermann
- Alberto Giammaria
- John Conrad Sanchez
Application Information
Application Number:US 09/458,269
Filing Date:1999-12-09
Priority Date:1999-12-09
Art Unit:7
Classifications
IPC:
G06F 15173
Field of Search:
709220709221709222709223709224370252370254
Patent Drawings (9 sheets)
Description
Cross-Reference to Related Applications
[0002] Related subject matter may be found in the following commonly assigned, co-pending U.S. patent applications, both of which are hereby incorporated by reference herein:
[0003] Ser. No. 09/460,855 (AT9-99-275), entitled “APPARATUS FOR DATA DEPOTING AND METHOD THEREFOR”;
[0004] Ser. No. 09/460,853 (AT9-99-276), entitled “APPARATUS FOR RELIABLY RESTARTING INTERRUPTED DATA TRANSFER AT LAST SUCCESSFUL TRANSFER POINT AND METHOD THEREFOR”;
[0005] Ser. No. 09/438,436 (AT9-99-655), entitled “APPARATUS FOR CONNECTION MANAGEMENT AND METHOD THEREFOR”;
[0006] Ser. No. 09/458,268 (AT9-99-324), entitled “COMPUTER NETWORK CONTROL SYSTEMS AND METHODS”;
[0007] Ser. No. 09/460,852 (AT9-99-325), entitled “METHODS OF DISTRIBUTING DATA IN A COMPUTER NETWORK AND SYSTEMS USING THE SAME”;
[0008] Ser. No. 09/458,269 (AT9-99-315), entitled “SYSTEMS AND METHODS FOR REAL TIME PROGRESS MONITORING IN A COMPUTER NETWORK; and
[0009] Ser. No. 09/460,851 (AT9-99-316), entitled “APPARATUS FOR AUTOMATICALLY GENERATING RESTORE PROCESS DURING SOFTWARE DEPLOYMENT AND METHOD THEREFOR”.
Technical Field
[0010] The present invention relates generally to data processing systems, and in particular, to systems and methods for real time progress monitoring in a computer network.
Background Information
[0011] Network distribution of software products has become one of the most important means by which a software vendor can efficiently and conveniently support its customers. Notwithstanding, these procedures take time, which often results in frustration and impatience on the part of the receiving customers. For example, a distribution of a large software package (i.e., greater than 100 megabytes) to a large number of end user machines (i.e., greater than a 1000) can take many hours if not days. During this time, the end users are often left wondering about the status of the download. In addition, a distribution can encounter a variety of errors and similar anomalies, including unavailable target machines on the network, failed installation on various end user machines, and network outages. In these cases, both the distributing entity and the end users have a vested interest in monitoring the distribution progress.
[0012] Currently available software distribution methods provide little, if any, feedback to the end users with regards to the progress and status of the download process. Often the end users are presented with a simple hourglass icon on their computer screens which indicates that the process has been initiated, but provides little information as to when the distribution might finish or if any errors have been encountered. It is not until the distribution is finally finished, that the end user is provided with a dialog box indicating that either the download has been successful or that an error has occurred at some point during the process. The actual source of any errors may or may not be clearly identified. Moreover, once a distribution has been initiated, it cannot be canceled, unless the downloading server is restarted by specific invocation of a command line. When this happens, the states of each node in the network can be left in an indeterminate state.
[0013] In sum, the need has arisen for systems and methods which reduce the level of frustration often experienced by end users patiently awaiting the receipt of a software distribution. Among other things, these systems and methods should allow the end users to monitor the progress to get a reasonable idea of when the distribution might finish as well as advising those end users of any errors which have occurred which are affecting the download process.
Summary of the Invention
[0014] The principles of the present invention are embodied in methods of monitoring data distribution progress in computer networks, as well as the computer networks themselves. According to these principles, a method of monitoring data distribution progress is disclosed for a computer network including a Distribution Manager and an end-user terminal communicating with the Distribution Manager through at least one node in the network. The Distribution Manager generates an identifier associated with the distribution and a routing to the end-user terminal through the network. A Distribution State Table maintaining information describing the progress of the distribution is updated by the Distribution Manager along with a Node State Table maintaining information describing a status of the Node in the network. The distribution data is transmitted to the end-user via the selected routing. Data describing the status of the end-user terminal is collected from the end-user terminal at the Repeater and then transmitted to the Distribution Manager. The Distribution Manager updates the Distribution State and Node State Tables with the data received from the Node.
[0015] The present invented principals are also embodied in a computer network which includes a server for running a Distribution Manager for controlling operations in an associated database. A source repeater is coupled to the server and operates in response to an application program, the application program initiating a data distribution. The network includes a plurality of target machines for receiving data during a distribution and generating status information in response. A gateway repeater is coupled to the plurality of target machines and collects status information generated by the target machines and transmits that status information to the Distribution Manager for storage in the corresponding tables within the database. The status data is transmitted to the Distribution Manager via at least one other repeater in the network. A user interface allows user access to data stored within the tables within the interface.
[0016] The principles of the present invention provides substantial advantages over the prior art. Among other things, it allows a system administrator, or even an authorized endpoint user, to monitor the status of a data distribution being made across a computer network for a multiplicity of targets. The ability to monitor the status of the distribution allows for an estimation of the time required to complete the distribution as well as a means for detecting anomalies occurring during the distribution. For example, the ability to monitor allows the monitoring party to determine if a given end-point is unavailable or has failed to successfully download the data being distributed.
[0017] The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention.
Brief Description of the Drawings
[0018] For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
[0019] FIG. 1 is a high level diagram of an exemplary computer networking system suitable for practicing the principles of the present invention;
[0020] FIG. 2 is a more detailed functional block diagram of a processing system suitable for use in one or more of the processing nodes of the system in FIG. 1;
[0021] FIG. 3 is a flow diagram illustrating a bulk data distribution procedure embodying the principles of the present invention;
[0022] FIG. 5aprovides a status chart pie graph representing the number of targets in each state;
[0023] FIG. 5billustrates a time spent chart which is a histogram displaying the minimum, average, and maximum time spent by the targets in each state;
[0024] FIG. 5cillustrates a display of the information from the Node State Table from the database; and
[0025] FIG. 5dillustrates a graphical display of a distribution topology.
Detailed Description
[0026] In the following description, numerous specific details are set forth to provide a thorough understanding of the present invention. However, it will be obvious to those skilled in the art that the present invention may be practiced without such specific details. In other instances, well-known circuits have been shown in block diagram form in order not to obscure the present invention in unnecessary detail. For the most part, details concerning timing considerations and the like have been omitted inasmuch as such details are not necessary to obtain a complete understanding of the present invention and are within the skills of persons of ordinary skill in the relevant art. Referring to the drawings, depicted elements are not necessarily shown to scale, and like or similar elements are designated by the same reference numeral through the several views.
[0027] FIG. 1 is a high level functional block diagram of a computer network 100 suitable for practicing the principles of the present invention. It should be noted that network 100 is for illustrative purposes and that in actual applications of the principles of the present invention, network 100 may include a larger or even much larger number of network nodes and corresponding cross-connections.
[0028] Network 100 is based upon a server 101 operating in conjunction with a database 120. For purposes of the present discussion, server 101 maintains the distribution manager software system (“distribution manager”) which provides overall status monitoring for the bulk transfer of data throughout network 100, and manages database 120.
[0029] The network system 100 includes source system 101, one or more fan-out or, repeaters 110, 111, 118, 119, and a plurality of endpoints 112-117 (which may also be referred to as target machines or, simply, targets). Additionally, certain repeaters, such as 118 and 119, are directly connected to one or more endpoints, in the exemplary embodiment of FIG. 1, endpoints 112-114 or 115-117, respectively, and may be referred to as “gateway” repeaters (or, simply, “gateways”).
[0030] Source system 101 provides distribution services with respect to resources 112-117. Note that source system 101 and endpoints 112-117 interface to repeaters 110 and 111 using the same methodologies as repeaters 110 and 111 interface with, for example, repeaters 118 and 119. Viewed logically, source system 101 may include a source repeater 104 which includes application 108 constituting the software to be distributed. In other words, as an artisan of ordinary skill would recognize, as used herein, a repeater may be a logical element, that may be, but is not necessarily associated with a physical stand-alone hardware device in network 100. Repeater 110 may be the primary repeater through which resources 112-114 receive their data transfers, and repeater 111, likewise, may primarily service endpoints 115-117. It would be understood by an artisan of ordinary skill that additional repeaters may be inserted into the network and may be arranged in a multi-level hierarchy according to the demands imposed by the network size.
[0031] Gateway repeaters 118 and 119 are such repeaters in the exemplary embodiment of FIG. 1.
[0032] However, network system 100 may provide cross connections in order to provide redundant, parallel communication paths should the primary communication path to the endpoint become unavailable. For example, in FIG. 1, endpoint 114 has a primary pathway to source system 101 through repeaters 118 and 110. (A source system, such as source system 101 may also be referred to as a source node.) Should repeater 110 become unavailable, source system 101 can transfer bulk data to endpoint 114 via an alternative pathway through repeaters 118 and 111. Additionally, should repeater 118 become unavailable, endpoint 114 may receive data via repeaters 111 and 119.
[0033] A graphics user interface (GUI) 107 is provided, as discussed further below, to allow the system user or administrator monitoring of data distributions across the network. Graphics user interface 107 is effectuated, for example, by a workstation or PC similar to that illustrated in FIG. 2. Data distributions may be initiated by graphical users interfaces and/or applications programs 108a-lrunning at any of the endpoints 112-117.
[0034] FIG. 2 is a high level functional block diagram of a representative data processing system 200 suitable for practicing the principles of the present invention. System 200 is an example of endpoint 106, and also may be used to implement server 101 and various repeaters throughout system 100. Processing system 200, includes a central processing system (CPU) 201 operating in conjunction with a system bus 202. CPU 201 may be for example, a reduced instruction set computer (RISC), such as an IBM POWER Processor, or a complex instruction set computer (CISC). System bus 202 operates in accordance with a standard bus protocol, such as the ISA protocol, compatible with CPU 201.
[0035] CPU 201 operates in conjunction read-only memory (ROM) 203 and random access memory (RAM) 204. Among other things, ROM 16 supports the basic input output system (BIOS). RAM 204 includes for example, DRAM (Dynamic Random Access Memory) system memory and SRAM (Static Random Access Memory) external cache.
[0036] I/O Adapter 205 allows for an interconnection between the devices on system bus 202 and external peripherals, such as mass storage devices (e.g., a hard drive, floppy drive or CD/ROM drive), or a printer. A peripheral device 206 is for example, coupled to a peripheral control interface (PCI) bus, and I/O adapter 205 therefore may be, for example, a PCI bus bridge.
[0037] User interface adapter 207 couples various user input devices, such as keyboard 208, mouse 209, touchpad 210 or speaker 211 to the processing devices on bus 202.
[0038] Display adapter 212 supports a display 213 which may be for example a cathode ray tube (CRT), liquid crystal display (LCD) or similar conventional display unit. Display adapter 212 may include among other things a conventional display controller and frame buffer memory.
[0039] System 200 can be selectively coupled to a computer or telecommunications network through communications adapter 214. Communications adapter 214 may include for example, a modem for connection to a telecommunications network and/or hardware and software for connecting to a computer network such as a local area network (LAN) or wide area network (WAN).
[0040] FIG. 3 is a flow diagram illustrating a bulk data distribution monitoring procedure 300 embodying the principles of the present invention. The application running on a given source repeater 104 in system 100 initiates the procedure by prompting the distribution manager to register the distribution. Specifically, at Step 301, the selected source repeater 104 passes a description of the data to be distributed along with a list of endpoints 112-117 to the distribution manager at Step 301. The distribution manager then, at Step 302, generates a unique ID identifying the distribution transaction and determines a routing to the endpoints 112-117 through the hierarchy of repeaters. As noted above, the distribution manager has available to it a multiplicity of redundant paths which allows it to optimize performance. For example, the distribution manager could select the communications links which have the best available bandwidth at the time.
[0041] At Step 303 the distribution manager creates and updates a Distribution State Table and Node State Table, in database 102 and associated with the distribution transaction by the unique ID. In the preferred embodiment, the distribution manager creates an entry in the Distribution State Table such as shown in TABLE 1 and an entry in the Node State Table such as shown in TABLE 2. In the preferred embodiment, the Distribution Table is arranged in a number of rows and columns, with each distribution assigned a row and the corresponding columns representing the data fields for that distribution. As can be seen from TABLE 1, a given entry in the Distribution State Table identifies the distribution by its ID, and the source repeater, and maintains corresponding timing parameters describing the progress of the transaction. With regards to the Node State Table, a row (entry) is created for each node involved in the distribution, including all repeaters and targets. Each node is identified by a unique node ID. The columns (fields) are associated with the distribution through the use of the distribution ID. Each Node State Table entry maintains information concerning the state of the corresponding node, and in particular, information tracking the performance of the node with respect to selected timing parameters.
[0042] The distribution manager sends the unique distribution ID to the source repeater at Step 304. Then, at Step 305, the data being distributed (i.e., the distribution data) is passed from the given source repeater 104 through the repeater hierarchy via the route defined by the Distribution Manager. The distribution process continues at Step 306 until all of the endpoints 112-117 have received the distribution data. During this time, each repeater maintains information for each of the corresponding targets, such as that provide din TABLE 3. A method and apparatus for checkpoint restarts which may be used in conjunction with the associated data in TABLE 3 is described in the commonly owned, co-pending U.S. Patent Application entitled “Apparatus for Restarting Interrupted Data Transfer and Method Therefor” (Ser. No. 09/460,853) incorporated herein by reference.
[0043] The statistics of TABLE 3 for a given end-point can be used to make the following calculations, which can be returned to the Distribution Manager for updating the database:
[0044] transfer speed=number of bytes downloaded/(current time−time download started)
[0045] time remaining=(distribution size−byte offset)/transfer speed
[0046] download time=time download finished−contact time; and
[0047] total install time=time application finished−contact time.
[0048] Endpoint operations are typically ongoing through the distribution transaction. Possible states of a given endpoint, such as one of endpoints 112-117 are shown in TABLE 4. As can be seen, the downloading process to a given target processor can be successful, can fail, be rejected or halt due to a lack of memory space. The target processor may also be performing other tasks and therefore be unavailable. The downloading process can also be canceled, paused or interrupted by a user or application (via a GUI or command line interface). Moreover, the distribution lifetime may elapse and the operation simply expire. In particular, any time a target processor enters or leaves a pause, unavailable state, or interrupted state, a message, such as that shown in TABLE 5, is sent through the network to the Distribution Manager such that the Distribution and Node State Tables can be updated. However, in an embodiment of the present invention, this messaging may be disabled by the system administrator, to reduce network traffic.
[0049] Each endpoint 112-117 generates a message on its final status, including for example, the information listed in TABLE 6. The various exceptions which may be thrown and reported in the message are given in TABLE 7. This information (i.e., successful, failed, available, etc.) is returned to the parent (gateway) repeaters 118 and 119 associated with the given one of endpoints 112-117. At Step 307, each of these parent repeaters 105 collects and bundles the status information received from the corresponding one of endpoints 112-117. Repeaters 118 and 119 continue to do this until either a specified time interval has elapsed or all of the endpoints 112-117 associated with that repeater 105, and receiving the distribution data, have reported back (Step 308). The process then repeats itself at Step 309 where the next higher repeaters collect and bundle the status information received from the gateway repeaters 118 and 119. Specifically, each level collects and bundles the status information from the next lower level of repeaters, until then information is received by the server 101 (Step 311). The distribution manager application running on server 101 then updates the distribution state and mode state tables in the database at Step 312. As a result, at Step 313, the status information is available to the system users through a graphics user interface (GUI), command line program or custom SQL query.
[0050] In the case of successful transactions at the endpoint 106 level, the results of the processing, if any, of the distributed data are returned to the calling application 106. Preferably, these results are stored in the database by the Distribution Manager. It should be noted that final status data and results can be returned through the same route taken by the data distribution, but that this is not a requirement.
[0051] FIGS. 5a-5dare illustrations of exemplary GUI window display which are preferably used to allow the system high level administrators and/or end users access to information regarding the data distribution. The upper half of these windows display the global status of the current distribution. The tree view on the left provides a filter for the display of distributions with certain properties while the view on the right side shows the global status of the distribution wherein each row represents an active or completed distribution and the columns show data from the Distribution State Table from the database.
[0052] The bottom half of the GUI windows show various ways of displaying specific information. For example, in FIG. 5a, a status chart is provided as a pie graph representing the number of targets in each state. In FIG. 5b, a time spent chart is shown which is a histogram displaying the minimum, average, and maximum time spent by the targets in each state. A display of the information from the Node State Table from the database is shown in FIG. 5c. It is also noted that a distribution topology, which would be a graphical view displaying the hierarchy of the repeaters and targets and the state of each node could also be displayed in the lower window of the GUI. Such an exemplary graphical display of the distribution topology is shown in FIG. 5d.
[0053] Although the present invention and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
| TABLE 1 |
|---|
| Distribution State Table |
| TABLE 2 |
|---|
| Node State Table |
| TABLE 3 |
|---|
| Repeater Endpoint Information |
| TABLE 4 |
|---|
| Target States |
| TABLE 5 |
|---|
| Status Message |
| TABLE 5a |
|---|
| Node Status List |
| TABLE 6 |
|---|
| Control Message |
| TABLE 7 |
|---|
| Exceptions |
Claims
What is claimed is:
1. A method of monitoring data distribution progress in a computer network including a distribution manager and an end-user terminal communicating with the distribution manager through at least one node in the network, the method comprising the steps of:
generating an identifier associated with the distribution and a routing to the end-user terminal through the network with the distribution manager;
updating a distribution state table with the distribution manager, the distribution state table maintaining information describing progress of the distribution;
updating a node state table with the distribution manager, the node state table maintaining information describing a status of the node in the network;
transmitting distribution data to the end-user terminal via the selected routing;
collecting data at the node from the end-user terminal describing the status of the end-user terminal;
transmitting the data collected at the node to the distribution manager; and
updating the distribution state and node state tables with the data received from the node.
2. The method of claim 1 and further comprising the step of generating a user display using information maintained in the distribution state and node state tables.
3. The method of claim 1 and further comprising the step of maintaining intermediate status data describing a state of the end-user terminal at the node.
4. The method of claim 1 and further comprising the step of initiating the distribution, said step comprising the substep of transmitting a description of the distribution and a list of end-user terminals from the node to the distribution manager.
5. The method of claim 1 and further comprising the steps of:
processing the distribution data at the end-user terminal to generate results; and
passing the results to a calling application through the node.
6. A method of monitoring data distribution in a network including a server running a distribution manager, a source repeater communicating with the server, a second repeater communicating with the source repeater, and a plurality of target machines communicating with the second repeater, the method comprising the steps of:
initiating a distribution with an application associated with the source repeater;
in response to said step of initiating, generating an identifier for the distribution with the distribution manager;
generating a distribution table in the database with the distribution manager corresponding to the identifier, the distribution table storing global status data for the distribution;
generating an endpoint table in the database with the distribution manager corresponding to the identifier for each of the repeaters and target machines in the network, the endpoint tables storing status data for each repeater and target machine;
transmitting distribution data from the source repeater to the target machines via the second repeater;
generating final status data at each target machine;
collecting the final status data with the second repeater;
transmitting the collected status data from the second repeater to the server via the source repeater; and
updating the distribution and endpoint tables in the database with the distribution manager.
7. The method of claim 6 and further comprising the step of generating a user display using data in the distribution and endpoint tables in the database.
8. The method of claim 7 wherein the user display comprises a graphics user interface generated at a terminal coupled to the server.
9. The method of claim 6 and further comprising the step of collecting intermediate status information generated by selected ones of the endpoints with the second repeater.
10. The method of claim 6 wherein said step of collecting final status data with the second repeater comprises the step of collecting final status data until final status data has been received from each of the target machines.
11. The method of claim 6 wherein said step of collecting final status data with the second repeater comprises the step of collecting final status data until a predetermined time period expires.
12. The method of claim 6 and further comprising the steps of:
processing the distribution data within the target processors to generate results; and
returning the results to the application through the second and source repeaters.
13. The method of claim 6 wherein the second repeater comprises a gateway repeater.
14. A computer network comprising:
a server for running a distribution manager, the distribution manager operable to generate tables within a database for storing information describing progress of a data distribution;
a plurality of target machines for receiving distribution data from a source within said network and generating status data in response; and
a repeater operable to effectuate the exchange of status data between said target machines and said distribution manager for updating said tables in said database.
15. The computer network of claim 14 wherein said tables comprise a table maintaining data describing an global status of a distribution and tables maintaining data describing status of each target machine in the network during the distribution.
16. The computer network of claim 14 wherein each of said target machines generates status information when said target machine enters or exits a state selected from the group consisting of pause, unavailable and interrupted.
17. The computer network of claim 14 wherein each of said target machines generates status information including an exception message selected from the group consisting of an application error and a distribution error messages.
18. The computer network of claim 14 wherein each of said target machines generates status information including an exception message selected from the group consisting of a disk full and out of memory messages.
19. The computer network of claim 14 wherein said repeater comprises a source repeater.
20. The computer network of claim 14 wherein said repeater comprises a gateway repeater.
21. A computer network comprising:
a server for running a distribution manager for controlling operations in an associated database;
a source repeater coupled to said server and operating in response to an application program, said application program initiating a data distribution;
a plurality of target machines for receiving data during a said distribution and generating status information in response;
a gateway repeater coupled to said plurality of target machines for collecting status information generated by said target machines, said gateway repeater transmitting said status information to said distribution manager for storage in corresponding tables within said database via at least one other repeater comprising said network; and
a user interfacing allowing user access to data stored within said tables within said interface.
22. The computer network of claim 21 wherein said at least one other repeater comprises said source repeater.
23. The computer network of claim 21 wherein said user interface comprises a graphics user interface.
Patent Citations (43)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4523206(A) | 1985-06-01 | Sasscer | Applicant |
| US4697266(A) | 1987-09-01 | Finley | Applicant |
| US5367643(A) | 1994-11-01 | Chang et al. | Applicant |
| US5446874(A) | 1995-08-01 | Waclawsky et al. | Applicant |
| US5448230(A) | 1995-09-01 | Schanker et al. | Applicant |
| US5455934(A) | 1995-10-01 | Holland et al. | Applicant |
| US5457683(A) | 1995-10-01 | Robins | Applicant |
| US5542047(A) | 1996-07-01 | Armstrong | Examiner |
| US5566306(A) | 1996-10-01 | Ishida | Applicant |
| US5572678(A) | 1996-11-01 | Homma et al. | Applicant |
| US5586256(A) | 1996-12-01 | Thiel et al. | Applicant |
| US5590124(A) | 1996-12-01 | Robins | Applicant |
| US5680602(A) | 1997-10-01 | Bloem et al. | Applicant |
| US5701482(A) | 1997-12-01 | Harrison et al. | Applicant |
| US5724516(A) | 1998-03-01 | Temoshenko | Applicant |
| US5745783(A) | 1998-04-01 | Suzuki et al. | Applicant |
| US5754763(A) | 1998-05-01 | Bereiter | Applicant |
| US5778224(A) | 1998-07-01 | Tobe et al. | Examiner |
| US5781735(A) | 1998-07-01 | Southard | Examiner |
| US5799323(A) | 1998-08-01 | Mosher, Jr. et al. | Applicant |
| US5805920(A) | 1998-09-01 | Sprenkle et al. | Applicant |
| US5819083(A) | 1998-10-01 | Chen et al. | Applicant |
| US5842212(A) | 1998-11-01 | Ballurio et al. | Applicant |
| US5905868(A) | 1999-05-01 | Baghai et al. | Examiner |
| US5964839(A) | 1999-10-01 | Johnson et al. | Examiner |
| US5978845(A) | 1999-11-01 | Reisacher | Examiner |
| US6070190(A) | 2000-05-01 | Reps et al. | Examiner |
| US6108782(A) | 2000-08-01 | Fletcher et al. | Examiner |
| US6118783(A) | 2000-09-01 | Kunito | Examiner |
| US6141785(A) | 2000-10-01 | Hur et al. | Examiner |
| US6175874(B1) | 2001-01-01 | Imai et al. | Examiner |
| US6415333(B1) | 2002-07-01 | Vasell | Examiner |
| US6434115(B1) | 2002-08-01 | Schwartz et al. | Examiner |
| EP192120 | 1986-08-01 | Applicant | |
| EP711088 | 1996-05-01 | Applicant | |
| EP871123 | 1998-10-01 | Applicant | |
| IE66464 | 1994-04-01 | Applicant | |
| JP7-50673 | 1995-02-01 | Applicant | |
| JP9-331323 | 1997-12-01 | Applicant | |
| JP10-303890 | 1998-11-01 | Applicant | |
| SU1741145 | 1992-06-01 | Applicant | |
| WO97/15018 | 1997-04-01 | Applicant | |
| WO97/38624 | 1997-10-01 | Applicant |
Non-Patent Literature (19)
- “Error Handler Activation Procedure,” IBM Technical Disclosure Bulletin, vol. 37 No. 08, Aug. 1994, pp. 231-232.Applicant
- “Transferring Bulk Data in Message Queueing System,” IBM Technical Disclosure Bulletin, vol. 41 No. 01, Jan. 1998, pp. 437-438.Applicant
- “Execution Time Dynamic Data Collection at First Detection of Failure,” IBM Technical Disclosure Bulletin, vol. 37 No. 06B, Jun. 1994, pp. 391-392.Applicant
- “Variable Paged Array′ Datatype,” IBM Technical Disclosure Bulletin, vol. 37 No. 07, Jul. 1994, pp. 89-92.Applicant
- “Distributing a Document Using a Regional Reference,” IBM Technical Disclosure Bulletin, vol. 33 No. 3A, Aug. 1990, p. 251.Applicant
- “Using Data Link Control-Level Feedback to Control Application Buffer Usage and Packet Loss,” IBM Technical Disclosure Bulletin, vol. 41 No. 01, Jan. 1998, pp. 199-204.Applicant
- “Dynamic Determination of Network Topology,” IBM Technical Disclosure Bulletin, vol. 38 No. 03, Mar. 1995, pp. 411-418.Applicant
- “Pointer Collection and Reporting for Error Recovery Procedures Branching,” IBM Technical Disclosure Bulletin, vol. 39 No. 07, Jul. 1996, pp. 87-90.Applicant
- “Hybrid Switch Control Scheme for Fast Point-to-Point/Multicast/Hunt-Group Connection Setup,” IBM Technical Disclosure Bulletin, vol. 37 No. 11, Nov. 1994, pp. 641-646.Applicant
- “Flow Control of Prioritized Data in a Multimedia Communications System,” IBM Technical Disclosure Bulletin, vol. 37 No. 01, Jan. 1994, pp. 531-532.Applicant
- “Distributed Object Encapsulation of Customer Information Control System Distributed Transaction Processing,” IBM Technical Disclosure Bulletin, vol. 38 No. 01, Jan. 1995, pp. 177-180.Applicant
- “Reconciliation of Shadowed Mail Items with Master,” IBM Technical Disclosure Bulletin, vol. 33 No. 6B, Nov. 1990, pp. 120-121.Applicant
- “Riadata—An Automated Retain Incident Analysis Facility,” IBM Technical Disclosure Bulletin, vol. 34 No. 10A, Mar. 1992, pp. 278-283.Applicant
- Cao G. et al., “Low-cost Checkpointing with Mutable Checkpoints in Mobile Computing Systems,” International Conference on Distributed Computing Systems, 18th, Amsterdam, May 26-29, 1998, Proceedings, pp. 464-471.Applicant
- Wiener, J.L. et al., “OODB Bulk Loading Revisited: the Partitioned-list Approach,” International Conference on Very Large Data Bases, 21st, Zurich, Sep. 11-15, 1995, Proceedings of VLDB '95, pp. 30-41.Applicant
- Muntz, D.A. et al., “Evaluating Delayed Write in a Multilevel Caching File System,” IFIP/IEEE International Conference on Distributed Platforms, [Dresden, Feb. 27-Mar. 1, 1996], Proceedings: Client/Server and Beyond, pp. 415-429.Applicant
- Jakoby, A. et al., “Data Transmission in Processor Networks,” International Workshop on Distributed Algorithms, 9th, Proceedings of WDAG '95, pp. 145-159.Applicant
- Joshi, A. et al., “On Disconnected Browsing of Distributed Information,” International Workshop on Research Issues in Data Engineering, 7th, Birmingham, UK, Apr. 7-8, 1997, Proceedings: High Performance Database Management for Large-scale Applications, pp. 101-107.Applicant
- Saglietti, F., “Dynamic Decision on Checkpointing by Use of Reduced Ordered Binary Decision Diagrams,” International Conference on Computer Safety, Reliability and Security, 16th, York, UK, Sep. 7-10, 1997, [Proceedings of ] SAFECOMP '97.Applicant