Dimension Reduction of Network Bottleneck Bandwidth Data Space
2010 | conference paper
Jump to: Cite & Linked | Documents & Media | Details | Version history
Cite this publication
Sun, Peng, Yang Chen, Yibo Zhu, Xiaoming Fu, Beixing Deng, and Xing Li. "Dimension Reduction of Network Bottleneck Bandwidth Data Space." In INFOCOM IEEE Conference on Computer Communications Workshops, 1-2. IEEE, 2010. https://doi.org/10.1109/INFCOMW.2010.5466622.
Documents & Media
Details
- Authors
- Sun, Peng; Chen, Yang ; Zhu, Yibo; Fu, Xiaoming ; Deng, Beixing; Li, Xing
- Abstract
- The network proximity metrics, such as bottleneck bandwidth and round-trip time, are very useful in different network applications. The round-trip-time prediction has been studied extensively. However, the prediction of bottleneck bandwidth has received much less attention. Therefore, we attempt to design a new bottleneck bandwidth prediction system by matrix factorization. As a first step, we focus on the dimension reduction of network bottleneck bandwidth data space in this paper. Evaluation is carried out based on real-world bottleneck bandwidth datasets, which are collected in the past three months. The results show that a 250D data space can be compressed to 10D and the average median-relative-error is only 8.65%. Although preliminary, our work provides some insights into the design direction towards matrix factorization based distributed system to predict the bottleneck bandwidth.
- Issue Date
- 2010
- Publisher
- IEEE
- ISBN
- 978-1-4244-6739-6
- Conference Place
- San Diego, CA, USA
- Event start
- 2010-03-15
- Event end
- 2010-03-19
- Language
- English