Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing

<table><svg height="11.4625" id="M165" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 12.5875 11.4625" width="12.5875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.4)"><path d="M716 28l-8 -28h-254l8 28q55 5 66 17.5t5 47.5l-30 145h-232l-74 -138q-21 -43 -11 -54.5t72 -17.5l-6 -28h-235l8 28q53 7 73.5 21t53.5 70l319 540l33 8q6 -43 33 -176l80 -381q10 -49 26.5 -63t72.5 -19zM495 281l-49 264h-2l-149 -264h200z" id="x1D434"></path></g>
</svg>, <svg height="11.75" id="M166" style="vertical-align:-0.15048pt" version="1.1" viewbox="0 0 12.1125 11.75" width="12.1125" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.4)"><path d="M682 629q-1 -16 -1.5 -72t-2.5 -86l-31 -4q-5 92 -51 129t-139 37q-100 0 -177 -49t-116 -125t-39 -162q0 -122 66 -201t182 -79q83 0 137 42.5t112 128.5l26 -15q-12 -31 -42.5 -88t-45.5 -75q-139 -27 -199 -27q-148 0 -243 81.5t-95 226.5q0 173 129.5 274.5
t325.5 101.5q114 0 204 -38z" id="x1D436"></path></g>
</svg>, and <svg height="11.175" id="M167" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 13.775 11.175" width="13.775" 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="M780 372q0 -191 -178 -297q-128 -75 -335 -75h-250l7 27q61 7 77 22t28 76l77 398q11 62 0 76.5t-77 22.5l6 28h292q164 0 258.5 -67.5t94.5 -210.5zM678 375q0 119 -73 180.5t-201 61.5q-62 0 -82 -13q-17 -7 -25 -53l-80 -427q-8 -47 -4 -62t26 -20q24 -6 80 -6
q166 0 262.5 95t96.5 244z" id="x1D437"></path></g>
</svg> paths belonging to the maximum independent set. These paths do not have any conflicting edges.</table>

Journal of Applied Mathematics

fig10

Figure 10

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