Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td align="left">Parameter</td><td align="center">Value</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td align="left"><span style="width: 7.3000002px;"><svg height="7.9499998" id="M186" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 7.3000002 7.9499998" width="7.3000002" 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="M393 379q-9 -16 -28 -29q-15 -10 -23 -2q-19 19 -36 19q-21 0 -52 -38q-57 -72 -82 -126l-40 -197q-23 -3 -75 -18l-7 7q49 196 74 335q7 43 -2 43q-7 0 -30 -14.5t-47 -37.5l-16 23q37 42 82 73t67 31q41 0 15 -113l-11 -50h4q41 71 85 117t77 46q29 0 45 -26
q13 -21 0 -43z" id="x1D45F"></path></g>
</svg></span></td><td align="center">12</td></tr><tr><td align="left"><span style="width: 15.8875px;"><svg height="16.450001" id="M187" style="vertical-align:-3.25793pt" version="1.1" viewbox="0 0 15.8875 16.450001" width="15.8875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.162)"><path d="M530 686q-79 -330 -126 -595q-5 -24 4 -24q22 0 77 53l16 -24q-42 -49 -88 -78.5t-72 -29.5q-37 0 -19 83l21 99h-2q-62 -83 -153 -141q-65 -41 -97 -41q-28 0 -48 31.5t-20 91.5q0 71 32.5 144t88.5 118q36 30 94 52.5t94 22.5q38 0 68 -13l29 158q7 40 2 47.5t-38 7.5
h-35l1 26q39 4 76 13.5t58.5 17t27.5 7.5q16 0 9 -26zM387 375q-11 11 -38.5 20t-51.5 9q-45 0 -79 -23q-46 -32 -77.5 -107.5t-31.5 -143.5q0 -40 9.5 -58.5t23.5 -18.5q40 0 113.5 70t99.5 118z" id="x1D451"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.5,16.25)"><path d="M241 635q53 0 94 -28.5t63.5 -76t33.5 -102.5t11 -116q0 -58 -11 -112.5t-34 -103.5t-63.5 -78.5t-94.5 -29.5t-95 28t-64.5 75t-34.5 102.5t-11 118.5q0 58 11.5 112.5t34.5 103t64.5 78t95.5 29.5zM238 602q-32 0 -55.5 -25t-35.5 -68t-17.5 -91t-5.5 -105
q0 -76 10 -138.5t37 -107.5t69 -45q32 0 55.5 25t35.5 68.5t17.5 91.5t5.5 105t-5.5 105.5t-18 92t-36 68t-56.5 24.5z" id="x30"></path></g>
</svg></span></td><td align="center">6</td></tr><tr><td align="left"><span style="width: 4.6999998px;"><svg height="12.4375" id="M188" style="vertical-align:-0.1254pt" version="1.1" viewbox="0 0 4.6999998 12.4375" width="4.6999998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.162)"><path d="M238 681l-124 -585q-7 -31 4 -31q10 0 37.5 18.5t49.5 41.5l16 -22q-40 -48 -89.5 -81.5t-76.5 -33.5q-42 0 -16 122l105 488q7 32 0 41t-39 9h-35l5 26q35 3 71 13t58 17.5t26 7.5q14 0 8 -31z" id="x1D459"></path></g>
</svg></span></td><td align="center">100</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Journal of Applied Mathematics

tab3

Table 3

Table 3: Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing 