Using the Last-mile Model as a Distributed Scheme for Available Bandwidth Prediction

Olivier Beaumont (1, 2) , Lionel Eyraud-Dubois (1, 2) , Young Joon Won (1, 2)

1 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Olivier Beaumont, Lionel Eyraud-Dubois, Young Joon Won. Using the Last-mile Model as a Distributed Scheme for Available Bandwidth Prediction. EuroPar 2011, Sep 2011, Bordeaux, France. ⟨inria-00588651⟩