Vivaldi

Dabek, Frank; Cox, Russ; Kaashoek, Frans; Morris, Robert

doi:10.1145/1015467.1015471

Cited by 744 publications

(15 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is inspired by the Vivaldi system design [8]. The basic algorithm in Vivaldi is a distributed optimisation, based on modelling the network as a spring-connected system, and letting the system evolve to a minimum energy state.…”

Section: B Algorithms For Setting Network Coordinatesmentioning

confidence: 99%

“…[2]) Vivaldi [8] proposed a variant of Euclidean coordinates to better model Internet latencies, and introduced the notion of "height" parameters, namely the coordinate x i decomposes into y i , h i where y i is d − 1-dimensional, and h i is a nonnegative height. The scheme then uses the prediction…”

Section: B Algorithms For Setting Network Coordinatesmentioning

confidence: 99%

“…[8]- [10]) have been proposed for predicting Internet latencies. These typically use metric, or more specifically Euclidean coordinates.…”

Section: Introductionmentioning

confidence: 99%

“…Thus these coordinates are obtained in one shot, from d measurements per node. In contrast the metric coordinates used in [8]- [10] are continuously updated on the basis of new measurements, and thus potentially more finely tuned than in a one-shot approach.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Non-Metric Coordinates for Predicting Network Proximity

Key

Massoulié

Tomozei

2008

2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-We consider the problem of determining the "closest", or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metric, or more specifically Euclidean coordinates to infer network proximity. This is problematic, given that network distances such as latency are known to violate the triangle inequality. This leads us to consider non-metric coordinate systems. We perform an empirical comparison between the "min-plus" non-metric coordinates and two metric coordinates, namely L-infinity and Euclidean. We observe that, when sufficiently many dimensions are used, min-plus outperforms metric coordinates for predicting Internet latencies.We also consider the prediction of "widest path capacity" between nodes. In this framework, we propose a generalization of min-plus coordinates. These results apply when node coordinates consist in measured network proximity to a random subset of landmark nodes. We perform empirical validation of these results on widest path bandwidth between PlanetLab nodes.We conclude that appropriate non-metric coordinates such as generalized min-plus systems are better suited than metric systems for representing the underlying structure of Internet distances, measured either via latencies or bandwidth.

show abstract

Section: B Algorithms For Setting Network Coordinatesmentioning

confidence: 99%

Section: B Algorithms For Setting Network Coordinatesmentioning

confidence: 99%

“…[8]- [10]) have been proposed for predicting Internet latencies. These typically use metric, or more specifically Euclidean coordinates.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Non-Metric Coordinates for Predicting Network Proximity

Key

Massoulié

Tomozei

2008

2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…This idea has led to the design of Network Coordinate Systems (NCS), which embed the nodes of the platform in a metric space. Donnet et al have published a survey on this topic [5], showing that appropriate metric spaces and efficient algorithms have been proposed for estimating latency over the Internet (Vivaldi [6] is a good example). However, they also concluded that similar algorithms for available bandwidth have yet to be explored.…”

Section: Introductionmentioning

confidence: 99%

Point-to-Point and Congestion Bandwidth Estimation: Experimental Evaluation on PlanetLab Data

Eyraud-Dubois

Uznański

2014

2014 IEEE International Parallel &Amp; Distributed Processing Symposium Workshops

View full text Add to dashboard Cite

In large scale Internet platforms, measuring the available bandwidth between nodes of the platform is difficult and costly. However, resource optimization for large-scale Internet applications (like broadcasting a message or organizing master/slave computations) requires to have predictions about the performance of the platform, and especially about available bandwidth.In this paper, we analyze the feasibility to provide estimations, based on a limited number of pairwise measurements, for the point-to-point available bandwidth values, and for the congestion which happens when several communications take place at the same time. We present a dataset containing both types of measurements performed on a set of nodes from the PlanetLab platform. We study two estimation methods, namely matrix factorization and the LastMile model. We show that matrix factorization techniques are quite efficient at predicting point-to-point available bandwidth, but are not adapted for congestion analysis. However, a LastMile modeling of the platform allows to perform congestion predictions with a reasonable level of accuracy, even with a small amount of information, despite the variability of the measured platform.

show abstract

SGMR: A spatial geometry–based multipath routing method on overlay networks

Guan

Lei

Zhang

et al. 2019

Int J Communication

View full text Add to dashboard Cite

Multipath transmission (MT) promotes transmission quality effectively. Path diversity (PD) impacts MT quality by aggregating capabilities of paths with little correlation. Enough PD contributes to improving concurrent link utilization and weakening negative impacts from a single path so that abilities of congestion and failure tolerance are enhanced. However, PD is hard to guarantee on overlay networks due to little awareness of underlay networks and few evaluation methods.In this paper, we propose the spatial geometry-based multipath routing (SGMR) method to improve PD for MT on overlay networks. Considering that paths are composed of overlay nodes and network coordinates effectively characterize node diversity (ND), we employ some geometric mechanisms on the spatial coordinate-based view to convert ND to PD. Firstly, coordinates are generated to match the overlay and underlay networks and meanwhile to characterize ND.Then, for generating multiple paths, transmission direction facilitates the path convergence, transmission surface constrains intermediate nodes, and deviation angle guarantees link diversity. Simulation and real-world evaluations demonstrate that SGMR guarantees PD better, and the multipath transmission quality is improved thanks to enough PD.

show abstract

Vivaldi

Cited by 744 publications

References 15 publications

Non-Metric Coordinates for Predicting Network Proximity

Non-Metric Coordinates for Predicting Network Proximity

Point-to-Point and Congestion Bandwidth Estimation: Experimental Evaluation on PlanetLab Data

SGMR: A spatial geometry–based multipath routing method on overlay networks

Contact Info

Product

Resources

About