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.005a" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.005a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Projection on 1st component</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="890578.fig.005b" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.005b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Projection on 2nd component</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="890578.fig.005c" src="https://static.hindawi.com/articles/tswj/volume-2013/890578/figures/890578.fig.005c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>Projection on 3rd component</td></tr></table></td></tr></table>

<table>Results of asymmetric topology with RED as drop policy and projecting on different components of diagonal matrix.</table>

The Scientific World Journal

fig5

Figure 5

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