PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
S3: a scalable sensing service for monitoring large networked systems
Proceedings of the 2006 SIGCOMM workshop on Internet network management
Exploiting internet route sharing for large scale available bandwidth estimation
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Characterizing residential broadband networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Performance bounds for peer-assisted live streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Epidemic live streaming: optimal performance trade-offs
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Predicting available bandwidth of internet path with ultra metric space-based approaches
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
End-to-end available bandwidth estimation tools, an experimental comparison
TMA'10 Proceedings of the Second international conference on Traffic Monitoring and Analysis
Network distance prediction based on decentralized matrix factorization
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
IDES: An Internet Distance Estimation Service for Large Networks
IEEE Journal on Selected Areas in Communications
Push-to-Peer Video-on-Demand System: Design and Evaluation
IEEE Journal on Selected Areas in Communications
Scalable Multi-purpose Network Representation for Large Scale Distributed System Simulation
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Future Generation Computer Systems
| Hi-index | 0.00 |
Several Network Coordinate Systems have been proposed to predict unknown network distances between a large number of Internet nodes by using only a small number of measurements. These systems focus on predicting latency, and they are not adapted to the prediction of available bandwidth. But end-to-end path available bandwidth is an important metric for the performance optimisation in many high throughput distributed applications, such as video streaming and file sharing networks. In this paper, we propose to perform available bandwidth prediction with the last-mile model, in which each node is characterised by its incoming and outgoing capacities. This model has been used in several theoretical works for distributed applications. We design decentralised heuristics to compute the capacities of each node so as to minimise the prediction error. We show that our algorithms can achieve a competitive accuracy even with asymmetric and erroneous end-to-end measurement datasets. A comparison with existing models (Vivaldi, Sequoia, PathGuru, DMF) is provided. Simulation results also show that our heuristics can provide good quality predictions even when using a very small number of measurements.