Abstract: 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.

Abstract: 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.

Abstract: In a distributed information network, a method and system for assembling messages in an input set of messages into one or more message assemblies. The method involves constructing an initial directed graph of the set of messages, wherein the directed graph consists of pairs of a first vertex and a second vertex, wherein, for each message in the set of messages, a first vertex is an the out node of the message and the second vertex is the in node of the message. A connectivity matrix is defined on the initial directed graph that is modified in an iterative process. A final directed graph is produced that is partitioned into disjoint subgraphs, each subgraph being an assembly of messages from the input message set.