.png){kind=icon}
.png){kind=icon}
Return
DSP-based bottleneck bandwidth estimation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.simpat.2008.09.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new passive technique for estimating the bottleneck bandwidth based on transferring the Gaussian kernel density estimation of the packets inter-arrival times to the frequency domain. The resulting spectrum contains information about the transmission time of the bottleneck link and can reveal information about multiple bottlenecks if they exist along the end-to-end path. The advantage of the technique is that it provides a model that can be manipulated by the digital signal processing methods and, unlike prior work in the area, it relies less on statistical methods. The proposed technique was validated using the ns2 network Simulator [1] on several topologies and traffic sources. Further experiments were conducted to test the strength of the patterns between flows that share a bottleneck by applying K-means algorithm to cluster the average packet inter-arrival times of these flows. The paper also presents a set of results from real traffic experiments conducted in order to infer both the bottleneck bandwidth and the capacity of the path using a passive approach. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Bottleneck bandwidth estimation
Non-intrusive approach
Kernel density
DSP-based technique
Frequency analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
2.6K
Citations:
4.8K