IDMaps: a global Internet host distance estimation service

Francis, Paul; Jamin, Sugih; Jin, Cheng; Jin, Yixin; Raz, Danny; Shavitt, Yuval; Zhang, Lixia

doi:10.1109/90.958323

Cited by 359 publications

(262 citation statements)

References 22 publications

Supporting

Mentioning

258

Contrasting

Unclassified

Order By: Relevance

“…GNP [31] performs measurements from the dedicated vantage points to compute network coordinates. Alternative approaches for estimating network distance include [22,25,28].…”

Section: Related Workmentioning

confidence: 99%

The nearest replica can be farther than you think

Bogdanov

Peón-Quirós

Maguire

et al. 2015

Proceedings of the Sixth ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

Modern distributed systems are geo-distributed for reasons of increased performance, reliability, and survivability. At the heart of many such systems, e.g., the widely used Cassandra and MongoDB data stores, is an algorithm for choosing a closest set of replicas to service a client request. Suboptimal replica choices due to dynamically changing network conditions result in reduced performance as a result of increased response latency. We present GeoPerf, a tool that tries to automate the process of systematically testing the performance of replica selection algorithms for geodistributed storage systems. Our key idea is to combine symbolic execution and lightweight modeling to generate a set of inputs that can expose weaknesses in replica selection. As part of our evaluation, we analyzed network round trip times between geographically distributed Amazon EC2 regions, and showed a significant number of daily changes in nearest-K replica orders. We tested Cassandra and MongoDB using our tool, and found bugs in each of these systems. Finally, we use our collected Amazon EC2 latency traces to quantify the time lost due to these bugs. For example due to the bug in Cassandra, the median wasted time for 10% of all requests is above 50 ms.

show abstract

“…GNP [31] performs measurements from the dedicated vantage points to compute network coordinates. Alternative approaches for estimating network distance include [22,25,28].…”

Section: Related Workmentioning

confidence: 99%

The nearest replica can be farther than you think

Bogdanov

Peón-Quirós

Maguire

et al. 2015

Proceedings of the Sixth ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

show abstract

“…Landmark-based systems rely on infrastructure components (such as a set of landmark servers) to predict distance between any two hosts. The set of landmarks can be pre-determined [17,26,27] or randomly selected [28,35]. Decentralized virtual coordinate systems do not rely on explicitly designated infrastructure components, requiring any node in the system to act as a reference node.…”

Section: Virtual Coordinate Systemsmentioning

confidence: 99%

Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack

Becker

Seibert

Nita-Rotaru

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Peer-to-peer real-time communication and media streaming applications optimize their performance by using application-level topology estimation services such as virtual coordinate systems. Virtual coordinate systems allow nodes in a peer-to-peer network to accurately predict latency between arbitrary nodes without the need of performing extensive measurements. However, systems that leverage virtual coordinates as supporting building blocks, are prone to attacks conducted by compromised nodes that aim at disrupting, eavesdropping, or mangling with the underlying communications. Recent research proposed techniques to mitigate basic attacks (inflation, deflation, oscillation) considering a single attack strategy model where attackers perform only one type of attack. In this work we explore supervised machine learning techniques to mitigate more subtle yet highly effective attacks (frog-boiling, network-partition) that are able to bypass existing defenses. We evaluate our techniques on the Vivaldi system against a more complex attack strategy model, where attackers perform sequences of all known attacks against virtual coordinate systems, using both simulations and Internet deployments.

show abstract

“…As a matter of fact, in a Grid environment, even traceroute or ping-based tools (e.g., TopoMon [9], Lumeta [2], IDmaps [14], Global Network Positioning [21]) are getting less and less effective. Indeed, these tools rely on ICMP which is more and more often disabled by administrators, once again to avoid Deny Of Service attacks based on flooding.…”

Section: Related Workmentioning

confidence: 99%

A First Step Towards Automatically Building Network Representations

Eyraud-Dubois

Legrand

Quinson

et al. 2007

Euro-Par 2007 Parallel Processing

View full text Add to dashboard Cite

To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must uses tools which automatically build a topological network model through some measurements. In this article, we define a methodology to assess the quality of these network model building tools, and we apply this methodology to representatives of the main classes of model builders and to two new algorithms. We show that none of the main existing techniques build models that enable to accurately predict the running time of simple application kernels for actual platforms. However some of the new algorithms we propose give excellent results in a wide range of situations. Key-words: Network model, topology reconstruction, GridsThis text is also available as a research report of the Laboratoire de l'Informatique du Parallélisme http://www.ens-lyon.fr/LIP. Une premièreétape vers la construction automatique de modèles de réseau d'interconnexionRésumé : Afin de tirer le meilleur parti des grilles, les utilisateurs et les intergiciels doivent avoir connaissance de la topologie du réseau d'interconnexion de la plate-forme utilisée. Comme cette connaissance n'est généralement pas disponible a priori, on doit avoir recours a des outils construisant un modèle du réseau d'interconnexionà partir de mesures. Dans cet article nous définissons une méthodologie pourévaluer la qualité de ces outils de construction de modèles de réseau, et nous l'appliquonsà des représentants des principaux types de reconstructeurs de topologies, ainsi qu'à deux nouveaux algorithmes. Nous montrons qu'aucune des techniques existantes ne produit des modèles qui permettent de prédire avec précision le temps d'exécution sur les plates-formes actuelles de simples noyaux d'applications. Au contraire, un des nouveaux algorithmes obtient de très bons résultats dans des situations très variées.

show abstract

IDMaps: a global Internet host distance estimation service

Cited by 359 publications

References 22 publications

The nearest replica can be farther than you think

The nearest replica can be farther than you think

Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack

A First Step Towards Automatically Building Network Representations

Contact Info

Product

Resources

About