Traffic Dynamics on Complex Networks: A Survey

<table><svg height="15.4" id="M203" style="vertical-align:-3.39066pt" version="1.1" viewbox="0 0 16.525 15.4" width="16.525" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><use xlink:href="#x1D445"></use></g>
<g transform="matrix(.012,-0,0,-.012,11.013,15.187)"><use xlink:href="#x1D450"></use></g>
</svg> versus <svg height="15.4" id="M204" style="vertical-align:-3.39066pt" version="1.1" viewbox="0 0 15.2875 15.4" width="15.2875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M559 163q-23 -66 -68 -163h-474l6 26q62 4 79.5 19.5t28.5 75.5l78 409q7 35 8.5 49t-8 25t-24 13t-51.5 5l5 28h266l-6 -28q-65 -5 -79.5 -18t-25.5 -74l-76 -406q-10 -57 14 -75q12 -13 96 -13q93 0 126 29q41 40 76 109z" id="x1D43F"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.763,15.187)"><use xlink:href="#x1D450"></use></g>
</svg> under the shortest path routing strategy with the network size (a) <svg height="11.375" id="M205" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 67.037498 11.375" width="67.037498" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><use xlink:href="#x1D441"></use></g><g transform="matrix(.017,-0,0,-.017,19.628,11.112)"><use xlink:href="#x3D"></use></g><g transform="matrix(.017,-0,0,-.017,34.332,11.112)"><use xlink:href="#x31"></use></g><g transform="matrix(.017,-0,0,-.017,42.491,11.112)"><use xlink:href="#x30"></use></g><g transform="matrix(.017,-0,0,-.017,50.651,11.112)"><use xlink:href="#x30"></use></g><g transform="matrix(.017,-0,0,-.017,58.81,11.112)"><use xlink:href="#x30"></use></g>
</svg> and (b) <svg height="11.375" id="M206" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 67.037498 11.375" width="67.037498" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><use xlink:href="#x1D441"></use></g><g transform="matrix(.017,-0,0,-.017,19.628,11.112)"><use xlink:href="#x3D"></use></g><g transform="matrix(.017,-0,0,-.017,34.332,11.112)"><use xlink:href="#x35"></use></g><g transform="matrix(.017,-0,0,-.017,42.491,11.112)"><use xlink:href="#x30"></use></g><g transform="matrix(.017,-0,0,-.017,50.651,11.112)"><use xlink:href="#x30"></use></g><g transform="matrix(.017,-0,0,-.017,58.81,11.112)"><use xlink:href="#x30"></use></g>
</svg>. The data are obtained by averaging <svg height="15.4" id="M207" style="vertical-align:-3.39066pt" version="1.1" viewbox="0 0 16.525 15.4" width="16.525" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><use xlink:href="#x1D445"></use></g>
<g transform="matrix(.012,-0,0,-.012,11.013,15.187)"><use xlink:href="#x1D450"></use></g>
</svg> over ten network realizations [<a href="/journals/mpe/2012/732698/#B59">64</a>].</table>

Mathematical Problems in Engineering

Traffic Dynamics on Complex Networks: A Survey

Figure 10