“…Furthermore, we color an edge blue if at least one of the ports is well known (i.e., less than 1024) and red if both ports are not well known (1024 or greater). 2 Since multiple flows can occur between the same pair of IPs in the time interval, H is a multi-digraph, meaning it admits multiple edges between any pair of vertices, and we aggregate the multi-edges to create the desired graph, G. Specifically, for each source vertex i and destination vertex j of H, let Bi,j (Ri,j) be the sum of edge weights, total bytes, over the blue (red) edges from i to j. If Bi,j > Ri,j (Ri,j ≥ Bi,j), create a blue (red) edge from i to j in G. Thus our final graph, G, has colored,…”