On the Accurate Identification of Network Paths Having a Common Bottleneck
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 bott...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2013/890578 |
id |
doaj-19599c76d4a24139a84601414fa4dc2b |
---|---|
record_format |
Article |
spelling |
doaj-19599c76d4a24139a84601414fa4dc2b2020-11-24T22:09:23ZengHindawi LimitedThe Scientific World Journal1537-744X2013-01-01201310.1155/2013/890578890578On the Accurate Identification of Network Paths Having a Common BottleneckMuhammad Murtaza Yousaf0Michael Welzl1Punjab University College of Information Technology (PUCIT), University of the Punjab, Allama Iqbal (old) Campus, Lahore, PakistanNetworks and Distributed Systems Group, Department of Informatics, University of Oslo, NorwayWe 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.http://dx.doi.org/10.1155/2013/890578 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Muhammad Murtaza Yousaf Michael Welzl |
spellingShingle |
Muhammad Murtaza Yousaf Michael Welzl On the Accurate Identification of Network Paths Having a Common Bottleneck The Scientific World Journal |
author_facet |
Muhammad Murtaza Yousaf Michael Welzl |
author_sort |
Muhammad Murtaza Yousaf |
title |
On the Accurate Identification of Network Paths Having a Common Bottleneck |
title_short |
On the Accurate Identification of Network Paths Having a Common Bottleneck |
title_full |
On the Accurate Identification of Network Paths Having a Common Bottleneck |
title_fullStr |
On the Accurate Identification of Network Paths Having a Common Bottleneck |
title_full_unstemmed |
On the Accurate Identification of Network Paths Having a Common Bottleneck |
title_sort |
on the accurate identification of network paths having a common bottleneck |
publisher |
Hindawi Limited |
series |
The Scientific World Journal |
issn |
1537-744X |
publishDate |
2013-01-01 |
description |
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. |
url |
http://dx.doi.org/10.1155/2013/890578 |
work_keys_str_mv |
AT muhammadmurtazayousaf ontheaccurateidentificationofnetworkpathshavingacommonbottleneck AT michaelwelzl ontheaccurateidentificationofnetworkpathshavingacommonbottleneck |
_version_ |
1725812190688051200 |