Results 1 - 10
of
96
Meridian: A Lightweight Network Location Service without Virtual Coordinates
- In SIGCOMM
, 2005
"... This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overlay network structured around multi-resolution rings, query routing with direct measurements, and gossip protocols for diss ..."
Abstract
-
Cited by 190 (8 self)
- Add to MetaCart
(Show Context)
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overlay network structured around multi-resolution rings, query routing with direct measurements, and gossip protocols for dissemination. We show how this framework can be used to address three commonly encountered problems, namely, closest node discovery, central leader election, and locating nodes that satisfy target latency constraints in large-scale distributed systems without having to compute absolute coordinates. We show analytically that the framework is scalable with logarithmic convergence when Internet latencies are modeled as a growthconstrained metric, a low-dimensional Euclidean metric, or a metric of low doubling dimension. Large scale simulations, based on latency measurements from 6.25 million node-pairs as well as an implementation deployed on PlanetLab show that the framework is accurate and effective.
Distance Estimation and Object Location via Rings of Neighbors
- In 24 th Annual ACM Symposium on Principles of Distributed Computing (PODC
, 2005
"... We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routing schemes [47], distance labeling [24], searchable small worlds [30], and triangulation-based distance estimation [33]. Fo ..."
Abstract
-
Cited by 77 (7 self)
- Add to MetaCart
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routing schemes [47], distance labeling [24], searchable small worlds [30], and triangulation-based distance estimation [33]. Focusing on metrics of low doubling dimension, we approach these problems with a common technique called rings of neighbors, which refers to a sparse distributed data structure that underlies all our constructions. Apart from improving the previously known bounds for these problems, our contributions include extending Kleinberg’s small world model to doubling metrics, and a short proof of the main result in Chan et al. [14]. Doubling dimension is a notion of dimensionality for general metrics that has recently become a useful algorithmic concept in the theoretical computer science literature. 1
Computing Point-to-Point Shortest Paths from External Memory
"... We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of road networks. We suggest improvements to the algorithm itself and to its preprocessing stage. We also develop a memory-efficient implementation of the algorithm that runs on a Pocket PC. It stores graph d ..."
Abstract
-
Cited by 54 (6 self)
- Add to MetaCart
We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of road networks. We suggest improvements to the algorithm itself and to its preprocessing stage. We also develop a memory-efficient implementation of the algorithm that runs on a Pocket PC. It stores graph data in a flash memory card and uses RAM to store information only for the part of the graph visited by the current shortest path computation. The implementation works even on very large graphs, including that of the North America road network, with almost 30 million vertices.
Towards Network Triangle Inequality Violation Aware Distributed Systems
, 2007
"... Many distributed systems rely on neighbor selection mechanisms to create overlay structures that have good network performance. These neighbor selection mechanisms often assume the triangle inequality holds for Internet delays. However, the reality is that the triangle inequality is violated by Inte ..."
Abstract
-
Cited by 49 (3 self)
- Add to MetaCart
Many distributed systems rely on neighbor selection mechanisms to create overlay structures that have good network performance. These neighbor selection mechanisms often assume the triangle inequality holds for Internet delays. However, the reality is that the triangle inequality is violated by Internet delays. This phenomenon creates a strange environment that confuses neighbor selection mechanisms. This paper investigates the properties of triangle inequality violation (TIV) in Internet delays, the impacts of TIV on representative neighbor selection mechanisms, specifically Vivaldi and Meridian, and avenues to reduce these impacts. We propose a TIV alert mechanism that can inform neighbor selection mechanisms to avoid the pitfalls caused by TIVs and improve their effectiveness.
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
- In Proc. of the 19th International Symposium on Distributed Computing (DISC
, 2005
"... Abstract. The distributed complexity of computing a maximal inde-pendent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs [20], no deterministic polylogarithmic algorithm is known. In this paper, we st ..."
Abstract
-
Cited by 48 (10 self)
- Add to MetaCart
(Show Context)
Abstract. The distributed complexity of computing a maximal inde-pendent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs [20], no deterministic polylogarithmic algorithm is known. In this paper, we study the problem in graphs with bounded growth, an important family of graphs which includes the well-known unit disk graph and many variants thereof. Particularly, we propose a deterministic algo-rithm that computes a maximal independent set in time O(log ∆ · log∗n) in graphs with bounded growth, where n and ∆ denote the number of nodes and the maximal degree in G, respectively. 1
On the Establishment of Distinct Identities in Overlay Networks
, 2006
"... We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it is possible to remotely issue certificates that can be used to test the distinctness of identities. Our certification protocols are based on ..."
Abstract
-
Cited by 39 (1 self)
- Add to MetaCart
We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it is possible to remotely issue certificates that can be used to test the distinctness of identities. Our certification protocols are based on geometric techniques that establish location information in a fault-tolerant and distributed fashion. They do not rely on a centralized certifying authority or infrastructure that has direct knowledge of entities in the system, and work in Euclidean or spherical geometry of arbitrary dimension. They tolerate corrupt entities, including corrupt certifiers, collusion by either certification applicants or certifiers, and either a broadcast or point-to-point message model.
Advances in metric embedding theory
- IN STOC ’06: PROCEEDINGS OF THE THIRTY-EIGHTH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 2006
"... Metric Embedding plays an important role in a vast range of application areas such as computer vision, computational biology, machine learning, networking, statistics, and mathematical psychology, to name a few. The theory of metric embedding received much attention in recent years by mathematicians ..."
Abstract
-
Cited by 36 (13 self)
- Add to MetaCart
Metric Embedding plays an important role in a vast range of application areas such as computer vision, computational biology, machine learning, networking, statistics, and mathematical psychology, to name a few. The theory of metric embedding received much attention in recent years by mathematicians as well as computer scientists and has been applied in many algorithmic applications. A cornerstone of the field is a celebrated theorem of Bourgain which states that every finite metric space on n points embeds in Euclidean space with O(log n) distortion. Bourgain’s result is best possible when considering the worst case distortion over all pairs of points in the metric space. Yet, it is possible that an embedding can do much better in terms of the average distortion. Indeed, in most practical applications of metric embedding the main criteria for the quality of an embedding is its average distortion over all pairs. In this paper we provide an embedding with constant average distortion for arbitrary metric spaces, while maintaining the same worst case bound provided by Bourgain’s theorem. In fact, our embedding possesses a much stronger property. We define the ℓq-distortion of a uniformly distributed pair of points. Our embedding achieves the best possible ℓq-distortion for all 1 ≤ q ≤ ∞ simultaneously. These results have several algorithmic implications, e.g. an O(1) approximation for the unweighted uncapacitated quadratic assignment problem. The results are based on novel embedding methods which improve on previous methods in another important aspect: the dimension. The dimension of an embedding is of very high importance in particular in applications and much effort has been invested in analyzing it. However, no previous result im-
Supporting network coordinates on PlanetLab
- In WORLDS
, 2005
"... Large-scale distributed applications need latency information to make network-aware routing decisions. Collecting these measurements, however, can impose a high burden. Network coordinates are a scalable and efficient way to supply nodes with up-to-date latency estimates. We present our experience o ..."
Abstract
-
Cited by 30 (2 self)
- Add to MetaCart
(Show Context)
Large-scale distributed applications need latency information to make network-aware routing decisions. Collecting these measurements, however, can impose a high burden. Network coordinates are a scalable and efficient way to supply nodes with up-to-date latency estimates. We present our experience of maintaining network coordinates on PlanetLab. We present two different APIs for accessing coordinates: a per-application library, which takes advantage of application-level traffic, and a stand-alone service, which is shared across applications. Our results show that statistical filtering of latency samples improves accuracy and stability and that a small number of neighbors is sufficient when updating coordinates. 1
Distributed approaches to triangulation and embedding
- Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2005
"... A number of recent papers in the networking community study the distance matrix defined by the node-to-node la-tencies in the Internet and, in particular, provide a number of quite successful distributed approaches that embed this distance into a low-dimensional Euclidean space. In such algorithms i ..."
Abstract
-
Cited by 29 (9 self)
- Add to MetaCart
(Show Context)
A number of recent papers in the networking community study the distance matrix defined by the node-to-node la-tencies in the Internet and, in particular, provide a number of quite successful distributed approaches that embed this distance into a low-dimensional Euclidean space. In such algorithms it is feasible to measure distances among only a linear or near-linear number of node pairs; the rest of the dis-tances are simply not available. Moreover, for applications it is desirable to spread the load evenly among the partici-pating nodes. Indeed, several recent studies use this 'fully distributed ' approach and achieve, empirically, a low distor-tion for all but a small fraction of node pairs. This is concurrent with the large body of theoretical work on metric embeddings, but there is a fundamental dis-tinction: in the theoretical pproaches tometric embeddings, full and centralized access to the distance matrix is assumed and heavily used. In this paper we present the first fully dis-tributed embedding algorithm with provable distortion guar-antees for doubling metrics (which have been proposed as a reasonable abstraction of Internet latencies), thus providing some insight into the empirical success of the recent VivaMi algorithm [5]. The main ingredient of our embedding algo-rithm is an improved fully distributed algorithm for a more basic problem of triangulation, where the triangle inequality is used to infer the distances that have not been measured; this problem received a considerable attention in the net-working community, and has also been studied theoretically in [19]. We use our techniques to extend e-relaxed embeddings and triangulations toinfinite metrics and arbitrary measures, and to improve on the approximate distance labeling scheme of Talwar [33]. I
