Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network monitoring
Reexamination Certificate
2000-07-17
2003-11-25
Meky, Moustafa M. (Department: 2157)
Electrical computers and digital processing systems: multicomput
Computer network managing
Computer network monitoring
Reexamination Certificate
active
06654805
ABSTRACT:
FIELD OF THE INVENTION
This invention relates to the field of distributed data processing where a data processing operation takes place over a plurality of data processing units which are connected to each other via a network.
BACKGROUND OF THE INVENTION
It is increasingly common to distribute a data processing operation over a plurality of data processing units, with each of the units communicating over a data communications network (e.g., the Internet). One reason for this is that a particular data processing unit may be able to do a job better than another, so a first unit makes a request for a second unit to do a particular job and then to return the result back to the first unit.
It is also very common for there to be a large number of intermediate data processing units (also known as “nodes”) in between the originating unit that makes a request and the destination unit that is being requested to do the work. Each intermediate unit receives the request, performs some initial processing to determine what to do with it, and then forwards it on to the next unit.
A popular mechanism for carrying out such distributed data processing is called asynchronous message queuing, where applications communicate with each other by sending messages to queues, which can then be accessed by the receiving application at a time that is convenient for that receiving application. IBM's MQSeries (trademark) software product, which has been on the market for a number of years, is the most popular example of this type of software.
Frequently, messages which flow between data processing units in an asynchronous message queuing network are considered “high value” messages, and for such messages it is very important for the originating data processing unit to be able to locate such messages should they become lost on their way to the destination unit. The term “lost” is taken to mean that the message is safe, but its location is unknown. A message could be lost, for example, if a link is broken between units or if the target messaging address is not known on one of the intermediate nodes. In such situations, the message will be unable to advance towards the destination unit until either the link is repaired or by correcting the routing (i.e., address resolution) configuration on the node in error.
The only way known in the prior art to locate such lost messages would be to have an operator “visit” (either physically or electronically) each of the nodes of the messaging network and search through the various message queues (e.g., the dead letter queues (DLQs) and the transmission queues (TXQs). However, this is obviously very time consuming and inefficient.
Various prior art teachings have employed a test message which is sent by an originating data processing unit into the network of intermediate units on its way to a destination unit. The test message arrives at various intermediate units in the network on its way to the destination unit and reports are sent back to the originating unit by each intermediate unit to report the exact path that the test message took on its way through the network. For example, the well known Advanced Peer to Peer Networking (APPN) and TCP/IP (Transmission Control Protocol/Internet Protocol) provide such functionality. U.S. Pat. No. 5,668,800 (commonly assigned to IBM Corp.) is another example of such prior art. See also, IBM's co-pending patent application entitled “Data Processing with Distributed Messaging Problem Determination” (IBM docket no. UK9-98-137, U.S. Pat. Ser. No. 300,045 filed Apr. 27, 1999, corresponding to UK patent application no. GB 9828686.7 filed Dec. 24, 1998). However, such prior art identifies the path of a test message but does not locate the lost (application) message. Such prior art provides an operator with a possible (but not guaranteed) route that a lost message might have taken.
SUMMARY OF THE INVENTION
According to one aspect, the present invention provides in an asynchronous message queuing network, a data processing method of finding a lost message, including steps of: sending a first message from an originating data processing unit to an intermediate data processing unit, the message including an indication that the message is traceable; sending a tracer message from an originating data processing unit to an intermediate data processing unit, the tracer message identifying the first message as a lost message which the originating data processing unit would like to find; at the intermediate data processing unit, upon receiving the tracer message, checking to determine whether the first message exists within the intermediate data processing unit, and sending a reply message back to the originating unit if the first message is found within the intermediate data processing unit; and at the intermediate data processing unit, if the first message is not found within the intermediate data processing unit, determining whether the first message has passed through the intermediate data processing unit, and if the first message has passed through the intermediate data processing unit, determining a neighboring data processing unit which received the first message from the intermediate data processing unit and forwarding the tracer message to the neighboring data processing unit.
According to a second aspect, the invention provides an intermediary data processing apparatus for use in an asynchronous messaging and queuing data processing network, the apparatus having: a receiving unit for receiving a message from a first data processing apparatus; a forwarding unit for forwarding the received message on to a second data processing apparatus; a determining unit for determining whether a message received from the first data processing apparatus has a flag set to indicate that the received message is traceable; a storing unit for storing, in response to the determining unit determining that a message has been received with the flag set, an indication that the received message has the flag set to indicate that the received message is traceable and for storing an indication of the second data processing apparatus which the forwarding unit has forwarded the received message on to; a unit for receiving a tracer message from the first data processing application, the tracer message including an indication of a lost message; a unit for, in response to receipt of the tracer message, determining whether the lost message exists within the intermediary data processing apparatus, and, if the lost message does not exist within the intermediary data processing apparatus, consulting the storing unit and using the stored indication of the second data processing apparatus to forward on the tracer message to the second data processing apparatus that corresponds to the stored indication, so that the tracer message follows the path taken by the lost message.
According to a third aspect, the invention provides a method corresponding to the apparatus of the second aspect.
According to a fourth aspect, the invention provides a computer program product, stored on a computer readable storage medium for, when run on a computer, carrying out the method of the third aspect.
Accordingly, with the present invention, lost messages can be found in a highly efficient manner without requiring that an operator “visit” each node in the network to search manually for the lost message. Instead, the tracer message traverses the network following the same path that the lost message took, making the search for the lost message very quick and efficient. That is, nodes that the lost message did not enter are not searched thus greatly speeding up the process of finding a lost message.
REFERENCES:
patent: 5384768 (1995-01-01), Fujii
patent: 5477536 (1995-12-01), Picard
patent: 5668800 (1997-09-01), Stevenson
patent: 5675741 (1997-10-01), Aggarwal et al.
patent: 5805798 (1998-09-01), Kearns et al.
patent: 5822533 (1998-10-01), Saito et al.
patent: 5825751 (1998-10-01), Papierniak et al.
patent: 5862335 (1999-01-01), Welch, Jr. et al.
patent: 5862336 (1999-01-01), Nakagaki et al.
pa
Aldred Barry Keith
Beaven Paul Anthony
Fisk Brian Phillip Ernest
Clay A. Bruce
Meky Moustafa M.
Osman Ramy M.
LandOfFree
Data processing technique for message tracing in an... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data processing technique for message tracing in an..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data processing technique for message tracing in an... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3144518