On the Accurate Identification of Network Paths Having a Common Bottleneck

Abstract EN

We present a new mechanism for detecting shared bottlenecks between end-to-end paths in a network.

Our mechanism, which only needs one-way delays from endpoints as an input, is based on the well-known linear algebraic approach: singular value decomposition (SVD).

Clusters of flows which share a bottleneck are extracted from SVD results by applying an outlier detection method.

Simulations with varying topologies and different network conditions show the high accuracy of our technique.