The invention provides a method and system for fusing message paths that occurred in a first domain in a communication network, with message paths that occurred in a second domain in the communication network a communication channel exists between the two domains. A first message path that occurred in the first domain and included a message sent to the second domain along the communication channel is fused to a second path that occurred in the second domain that included the message received from the first domain. Each message that is transmitted in the communication channel between the two domains is assigned a message unique identifier that allows each domain to associate a message sent from one domain to the other with a response message sent in the opposite direction.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method for fusing one or more instances of one or more message paths observed by a first collector to one or more instances of one or more message paths observed by a second collector, the first collector collecting message data from a first domain in a communication network, and the second collector collecting message data from a second domain in the communication network, there being one or more communication channels between the first and second domains, the first collector monitoring messages received in the first domain or sent from the first domain via the one or more communication channels, the second collector monitoring messages received in the second domain or sent from the first domain via the one or more communication channels, wherein each message transmitted on any one of the one or more communication channels has an associated message unique identifier (MUID), the method comprising: a. receiving from the first collector data indicative of instances of one or more message paths that occurred in the first domain and receiving from the second collector data indicative of instances of one or more message paths that occurred in the second domain, the data including a path unique identifier (PUID) of each instance of each of the one or more message paths, and the data including, for each message transmitted on one of the one or more communication channels, a MUID of the message; and b. for each of one or more instances of a first message path observed by the first collector, fusing the message path to a second message path observed the second collector, wherein the first and second message paths include a message having the same MUID.
2. The method according to claim 1 wherein step (b) is performed a number of times as required until all possible fusions have been made.
3. The method according to claim 1 further comprising a step of generating a undirected graph in which every MUID in the received data is a node, and in which two nodes are joined together with an edge if the received data includes an instance of a PUID that included the two nodes of the graph, and step (b) is performed on connected components of the graph.
4. The method according to claim 3 further comprising a step of removing connected components of the graph containing at least one MUID observed by only one of the collectors in the received data, and step (b) is performed after removal of the connected components from the graph containing at least one MUID observed by only one of the collectors in the received data.
5. The method according claim 1 further comprising synchronizing a first clock of the first collector and a second clock of the second collector, wherein the synchronization comprises calculating a time difference between the two clocks based on arrival and departure times of messages in the communication channel between the two domains.
6. The method according to claim 5 wherein calculating the time difference involves one or both of (a) comparing a time on the first clock that a message was sent from the first domain with a time on the second clock that the message was received in the second domain, and (b) comparing a time on the second clock that a message was sent from the second domain with a time on the first clock that the message was received in the first domain.
7. The method according to claim 1 further comprising calculating one or more values of one or more parameters of one or more of the fused message paths.
8. The method according to claim 7 wherein one or more of the parameters is selected from a transit time on at least a portion of the one or more of the fused message paths, and a processing time at each of one or more nodes in the one or more of the fused paths.
9. The method according to claim 7 further comprising issuing an alert when a determined value of one or more of the parameters exceeds a predetermined threshold.
10. The method according claim 7 further comprising calculating statistics of one or more of the parameters of one or more nodes, messages or paths.
11. The method according to claim 10 further comprising issuing an alert when the value of any statistic exceeds a predetermined threshold.
12. A system for fusing one or more instances of one or more message paths observed by a first collector to one or more instances of one or more message paths observed by a second collector, the first collector collecting message data from a first domain in a communication network, and the second collector collecting message data from a second domain in the communication network, there being one or more communication channels between the first and second domains, the first collector monitoring messages received in the first domain or sent from the first domain via the one or more communication channels, the second collector monitoring messages received in the second domain or sent from the first domain via the one or more communication channels, wherein each message transmitted on any one of the one or more communication channels has an associated message unique identifier MUID, the system comprising a processor configured to: a. receive from the first collector data indicative of instances of one or more message paths that occurred in the first domain and receive from the second collector data indicative of instances of one or more message paths that occurred in the second domain, the data including a path unique identifier (PUID) of each instance of each of the one or more message paths, and the data including, for each message transmitted on one of the one or more communication channels, a MUID of the message; and b. for each of one or more instances of a first message path observed by the first collector, fuse the message path to a second message path observed the second collector, wherein the first and second message paths include a message having the same MUID.
13. The system according to claim 12 wherein the processor is configured to perform step (b) a number of times as required until all possible fusions have been made.
14. The system according to claim 12 , wherein the processor is further configured to execute a step of generating an undirected graph in which every MUD in the received data is a node, and in which two nodes are joined together with an edge if the received data includes an instance of a PUID that included the two nodes of the graph, and step (b) is performed on connected components of the graph.
15. The system according to claim 14 wherein the processor is further configured to execute a step of removing connected components of the graph containing at least one MUID observed by only one of the collectors in the received data, and step (b) is performed after removal of the connected components from the graph containing at least one MUID observed by only one of the collectors in the received data.
16. The system according claim 12 wherein the processor is further configured to perform synchronizing a first clock of the first collector and a second clock of the second collector, wherein the synchronization comprises a step of calculating a time difference between the two clocks based on arrival and departure times of messages in the communication channel between the two domains.
17. The system according to claim 16 wherein the step of calculating the time difference involves one or both of (a) comparing a time on the first clock that a message was sent from the first domain with a time on the second clock that the message was received in the second domain, and (b) comparing a time on the second clock that a message was sent from the second domain with a time on the first clock that the message was received in the first domain.
18. The system according to claim 12 wherein the processor is further configured to execute a step of calculating one or more values of one or more parameters of one or more of the fused message paths.
19. The system according to claim 18 wherein one or more of the parameters is selected from a transit time on at least a portion of the one or more of the fused message paths, and a processing time at each of one or more nodes in the one or more of the fused paths.
20. The system according to claim 18 wherein the processor is further configured to issue an alert when a determined value of one or more of the parameters exceeds a predetermined threshold.
21. The system according to claim 18 wherein the processor is further configured to execute a step of calculating statistics of one or more of the parameters of one or more nodes, messages or paths.
22. The system according to claim 21 wherein the processor is further configured to execute a step of issuing an alert when the value of any statistic exceeds a predetermined threshold.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
January 12, 2011
May 7, 2013
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.