Related Experiment Video
Updated: May 4, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
On the accurate identification of network paths having a common bottleneck
Muhammad Murtaza Yousaf1, Michael Welzl
1Punjab University College of Information Technology (PUCIT), University of the Punjab, Allama Iqbal (old) Campus, Lahore, Pakistan.
This study introduces a novel network bottleneck detection method using singular value decomposition (SVD) and one-way delays. The technique accurately identifies shared bottlenecks among network paths, improving network performance analysis.
Area of Science:
- Computer Science
- Network Engineering
- Data Analysis
Background:
- Identifying network bottlenecks is crucial for optimizing performance.
- Existing methods may require complex measurements or lack accuracy.
- Shared bottlenecks across multiple network paths pose a significant challenge.
Purpose of the Study:
- To develop a novel mechanism for detecting shared bottlenecks between end-to-end network paths.
- To leverage one-way delay measurements for bottleneck identification.
- To validate the proposed mechanism's accuracy and efficiency.
Main Methods:
- Utilized singular value decomposition (SVD), a linear algebraic technique.
- Employed one-way delays from network endpoints as primary input.
- Applied outlier detection methods to SVD results for cluster extraction.
Main Results:
- Successfully extracted clusters of network flows sharing common bottlenecks.
- Demonstrated high accuracy in bottleneck detection across various network topologies.
- Validated the mechanism's effectiveness under diverse network conditions.
Conclusions:
- The proposed SVD-based mechanism offers an accurate and efficient approach to detecting shared network bottlenecks.
- One-way delay measurements are sufficient for effective bottleneck identification.
- This technique enhances network performance monitoring and troubleshooting capabilities.
Related Concept Videos
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The Power Flow Problem and Solution
Thevinin's Theorem
Plotting and Calibrating the Root Locus
The maximum gain occurs at the breakaway points between open-loop poles on the real axis, while the minimum gain is...
Bus Impedance Matrix
In the first circuit, all machine voltage sources are short-circuited, leaving only the prefault voltage source at the fault location. The positive-sequence bus impedance matrix can be determined by solving the nodal equations,...

