Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing

<table>Node <svg height="7.9499998" id="M182" style="vertical-align:-0.1254pt" version="1.1" viewbox="0 0 8.7250004 7.9499998" width="8.7250004" 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="M483 97q-42 -50 -88.5 -79.5t-68.5 -29.5q-37 0 -17 93l22 102h-2q-54 -79 -144 -149q-59 -46 -100 -46q-24 0 -43 29t-19 86q0 78 34.5 153t94.5 120q41 31 94 51.5t98 20.5q29 0 72 -9q26 -6 39 -6l2 -4q-30 -117 -67 -323q-8 -41 2 -41q16 0 79 58zM374 387
q-32 15 -73 15q-52 0 -83 -23q-48 -36 -78 -108.5t-30 -152.5q0 -33 8.5 -50.5t20.5 -17.5q31 0 107 79t99 132q15 40 29 126z" id="x1D44E"></path></g>
</svg> has now two paths to the root, but node <svg height="12.4375" id="M183" style="vertical-align:-0.13794pt" version="1.1" viewbox="0 0 8.1000004 12.4375" width="8.1000004" 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="M452 333q0 -82 -46 -164t-116 -128q-81 -53 -158 -53q-26 0 -51 13t-37 32q-26 41 -6 134l91 431q7 40 2.5 47t-34.5 7h-33l2 25q36 4 72.5 13t58.5 15.5t28 6.5q10 0 4 -29l-91 -391h2q65 77 130 116.5t105 39.5q36 0 56.5 -32t20.5 -83zM365 316q0 76 -35 76
q-31 0 -93.5 -49t-107.5 -110q-12 -37 -17 -70q-9 -65 12 -96.5t59 -31.5q31 0 56 14q53 29 89.5 105t36.5 162z" id="x1D44F"></path></g>
</svg> has just one. Creating a second path for node <svg height="12.4375" id="M184" style="vertical-align:-0.13794pt" version="1.1" viewbox="0 0 8.1000004 12.4375" width="8.1000004" 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="M452 333q0 -82 -46 -164t-116 -128q-81 -53 -158 -53q-26 0 -51 13t-37 32q-26 41 -6 134l91 431q7 40 2.5 47t-34.5 7h-33l2 25q36 4 72.5 13t58.5 15.5t28 6.5q10 0 4 -29l-91 -391h2q65 77 130 116.5t105 39.5q36 0 56.5 -32t20.5 -83zM365 316q0 76 -35 76
q-31 0 -93.5 -49t-107.5 -110q-12 -37 -17 -70q-9 -65 12 -96.5t59 -31.5q31 0 56 14q53 29 89.5 105t36.5 162z" id="x1D44F"></path></g>
</svg> by adding an edge directed to node <svg height="7.9499998" id="M185" style="vertical-align:-0.1254pt" version="1.1" viewbox="0 0 8.7250004 7.9499998" width="8.7250004" 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="M483 97q-42 -50 -88.5 -79.5t-68.5 -29.5q-37 0 -17 93l22 102h-2q-54 -79 -144 -149q-59 -46 -100 -46q-24 0 -43 29t-19 86q0 78 34.5 153t94.5 120q41 31 94 51.5t98 20.5q29 0 72 -9q26 -6 39 -6l2 -4q-30 -117 -67 -323q-8 -41 2 -41q16 0 79 58zM374 387
q-32 15 -73 15q-52 0 -83 -23q-48 -36 -78 -108.5t-30 -152.5q0 -33 8.5 -50.5t20.5 -17.5q31 0 107 79t99 132q15 40 29 126z" id="x1D44E"></path></g>
</svg> will create a cycle.</table>

Journal of Applied Mathematics

fig13

Figure 13

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