On the Accurate Identification of Network Paths Having a Common Bottleneck

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="890578.fig.008a" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.008a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>12 Flows with corresponding sources and destinations</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="890578.fig.008b" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.008b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>12 Flows with random sources and destinations</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="890578.fig.008c" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.008c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>36 Flows with each sender sending 3 flows to random destinations in each bottlenecked branch</td></tr></table></td></tr></table>

<table>Results of experiments without common endpoints.</table>

The Scientific World Journal

fig8

Figure 8

Figure 8: On the Accurate Identification of Network Paths Having a Common Bottleneck 