title: On the accurate identification of network paths having a common bottleneck.
abstract: 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.
authors: Punjab University College of Information Technology (PUCIT), University of the Punjab, Allama Iqbal (old) Campus, Lahore, Pakistan.
authors: Muhammad Murtaza
authors: MM
authors: Yousaf
authors: Michael
authors: M
authors: Welzl
mesh_terms: D006801:Humans; D008962:Models, Theoretical; D015999:Multivariate Analysis; D009415:Nerve Net; D060388:Support Vector Machine