Patent ID: 8533279

Claim:
In a distributed information network, a system for assembling messages in an input set of messages into one or more message assemblies, each message having an out node in the network and an in node in the network, the system comprising: one or more message collection servers; each collection server being configured, to: a) construct a 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 the out node of the message and the second vertex is the in node of the message; order the vertices according to a time stamp of each vertex; construct a connectivity matrix A of the directed graph in which a kk′ =1 if a directed path exists from the vertex k′ to the vertex k and a kk′ =0, otherwise modify the matrix A in an iterative process in a process comprising: for k=1 to kmax, kmax being a number of vertices in the graph: if there is a vertex k′<k on the node of k such that a correlation from the vertex k′ to the vertex k allowed, and if the current value of a kk′ ≠1, introducing a directed edge into the directed graph from the vertex k′ to the vertex k; setting a kk′ =1; if k is an out vertex and the corresponding in vertex is k″, setting Ak″=Ak or Ak″, where Ak is the kth row of the matrix A and Ak″ is the kth row of the matrix A; and partitioning the directed graph into disjoint subgraph, each subgraph being an assembly of messages from the input message set.