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...

Descripción completa

Detalles Bibliográficos
Autores principales: Yousaf, Muhammad Murtaza, Welzl, Michael
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2013
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3845514/
https://www.ncbi.nlm.nih.gov/pubmed/24327807
http://dx.doi.org/10.1155/2013/890578
_version_ 1782293317922324480
author Yousaf, Muhammad Murtaza
Welzl, Michael
author_facet Yousaf, Muhammad Murtaza
Welzl, Michael
author_sort Yousaf, Muhammad Murtaza
collection PubMed
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.
format Online
Article
Text
id pubmed-3845514
institution National Center for Biotechnology Information
language English
publishDate 2013
publisher Hindawi Publishing Corporation
record_format MEDLINE/PubMed
spelling pubmed-38455142013-12-10 On the Accurate Identification of Network Paths Having a Common Bottleneck Yousaf, Muhammad Murtaza Welzl, Michael ScientificWorldJournal Research Article 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. Hindawi Publishing Corporation 2013-11-12 /pmc/articles/PMC3845514/ /pubmed/24327807 http://dx.doi.org/10.1155/2013/890578 Text en Copyright © 2013 M. M. Yousaf and M. Welzl. https://creativecommons.org/licenses/by/3.0/ 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.
spellingShingle Research Article
Yousaf, Muhammad Murtaza
Welzl, Michael
On the Accurate Identification of Network Paths Having a Common Bottleneck
title 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_short On the Accurate Identification of Network Paths Having a Common Bottleneck
title_sort on the accurate identification of network paths having a common bottleneck
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3845514/
https://www.ncbi.nlm.nih.gov/pubmed/24327807
http://dx.doi.org/10.1155/2013/890578
work_keys_str_mv AT yousafmuhammadmurtaza ontheaccurateidentificationofnetworkpathshavingacommonbottleneck
AT welzlmichael ontheaccurateidentificationofnetworkpathshavingacommonbottleneck

Ejemplares similares