Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing

Figure 3

Relative comparison of the three algorithms for 50-node networks using the 𝑘-shortest lexicographic solution as a reference: first 25 positions in the sorted solution vectors.