Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013, Article ID 890578, 15 pages
Research Article

On the Accurate Identification of Network Paths Having a Common Bottleneck

1Punjab University College of Information Technology (PUCIT), University of the Punjab, Allama Iqbal (old) Campus, Lahore, Pakistan
2Networks and Distributed Systems Group, Department of Informatics, University of Oslo, Norway

Received 29 August 2013; Accepted 19 September 2013

Academic Editors: L. Jacob and L. W. Wong

Copyright © 2013 Muhammad Murtaza Yousaf and Michael Welzl. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.