Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing

<table><svg height="11.175" id="M168" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 10.6125 11.175" width="10.6125" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M594 511q0 -122 -171 -157l1 -2q158 -33 158 -159q0 -52 -34.5 -95t-90.5 -65q-76 -33 -217 -33h-223l8 28q63 5 79.5 19t26.5 72l83 426q9 48 -2.5 60t-77.5 17l6 28h259q195 0 195 -139zM499 509q0 59 -37 83t-91 24q-36 0 -51 -9q-17 -9 -22 -44l-35 -195h62
q82 0 128 37t46 104zM481 199q0 71 -48 102.5t-121 31.5h-56l-37 -201q-11 -58 7.5 -77t80.5 -19q76 0 125 44.5t49 118.5z" id="x1D435"></path></g>
</svg> path, conflicting with the paths from the maximum independent set due to different selection of edge directions.</table>

Journal of Applied Mathematics

fig11

Figure 11

Figure 11: Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing 