This class is responsible for finding Request-Response motifs.
Intuitively, a request response motif is a communication pattern between two
hosts where one host sends a message to a second host, and the receiving host
then sends something back to the first host.
More formally, a sequence S of k nodes n_1, n_2, n_3 ... n_k forms a
Request-Response motif if and only if:
- k >= 3
- n_1 and n_k belong to the same host (which we will call H_s)
- Nodes n_2 to n_(k-1) inclusive belong to the same host (which we will
call H_r)
- H_s != H_r
- n_2 is the child of n_1
- n_k is the child of n_(k-1)
- Apart from the two family relations above, no nodes in S may have any
family
- nodes n_2 to n_(k-1) inclusive are consecutive
- The number of nodes between n_2 and n_(k-1) is less than or equal to the
parameter maxLEResponder
- The number of nodes between n_1 and n_k (in the graph, not in S) is less
than or equal to the parameter maxLERequester
The motif itself comprises all nodes in S plus all edges that connect nodes
adjacent in the sequence S.