Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing

<table>If for node <svg height="7.9499998" id="M103" style="vertical-align:-0.13794pt" version="1.1" viewbox="0 0 6.5 7.9499998" width="6.5" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M352 391q0 -31 -27 -44q-14 -7 -24 6q-39 48 -84 48q-23 0 -39.5 -15t-16.5 -40q0 -43 73 -90q49 -32 70 -58t21 -57q0 -58 -62 -105.5t-129 -47.5q-40 0 -75.5 25t-35.5 52q0 28 32 46q7 4 15 3t11 -6q19 -31 48.5 -50.5t54.5 -19.5q34 0 54 19.5t20 42.5q0 43 -65 81
q-97 56 -97 123q0 50 51 96q19 17 58 32.5t62 15.5q37 0 61 -18t24 -39z" id="x1D460"></path></g>
</svg>, paths<i> s-a-b-t</i> (red solid) and<i> s-b-a-t</i> (green dotted) are given, then these paths will not both be included due to the conflict in the used direction of edge<i> ab.</i></table>

Journal of Applied Mathematics

fig6

Figure 6

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