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.001a" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.001a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Projection values</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="890578.fig.001b" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.001b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Sorted projection values</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="890578.fig.001c" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.001c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>Rate of change</td></tr></table></td></tr></table>

<table>Results in intermediate and final form.</table>

The Scientific World Journal

fig1

Figure 1

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