The Inframetric Model for the Internet

@article{Fraigniaud2008TheIM,
  title={The Inframetric Model for the Internet},
  author={Pierre Fraigniaud and Emmanuelle Lebhar and Laurent Viennot},
  journal={IEEE INFOCOM 2008 - The 27th Conference on Computer Communications},
  year={2008}
}
A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, many of these algorithms (e.g., overlay network construction, routing scheme design, sparse spanner construction) rely on the assumption that the metric has bounded ball growth or bounded doubling dimension. This paper analyzes the validity of these assumptions and proposes a tractable model matching experimental… Expand
HybridNN: An accurate and scalable network location service based on the inframetric model
TLDR
This work develops a new scheme whose theoretical foundation is based on the inframetric model, which has weaker assumptions than the metric model and proposes HybridNN (Hybrid Nearest Service Node Location), which finds the closest service node accurately thanks to the infametric model and scalably by combining delay predictions with direct probes to a pruned set of neighbors. Expand
Oblivious buy-at-bulk network design algorithms
TLDR
This dissertation studies the computation of efficient paths from the demand sources to their respective destination(s) under two assumptions: the demand set is unknown and the number of source nodes that has demand to send is unknown, and the aggregation cost function at intermediate edges is also unknown. Expand
Use of Internet Embedding Tools for Heterogeneous Resources Aggregation
TLDR
A comparison of these algorithms based on actual latency measures, that enables to decide which algorithm/embedding tool pair offers in practice for realistic datasets the best balancing between distance prediction and approximation ratios for the resource clustering problem. Expand
Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks
TLDR
A comparison of the quality of results for BPDC in the context of several Internet latency embedding tools such as Sequoia and Vivaldi is presented, using datasets based on Planet Lab latency measurements. Expand
On the internet delay space dimensionality
TLDR
The dimensionality properties of the Internet delay space, i.e., the matrix of measured round-trip latencies between Internet hosts, are investigated and it is observed that fractal measures, due to their sensitivity to non-linear structures, display higher precision for measuring the influence of subtle features of the delay space geometry. Expand
On the internet delay space dimensionality
We investigate the dimensionality properties of the Internet delay space, i.e., the matrix of measured round-trip latencies between Internet hosts. Previous work on network coordinates has indicatedExpand
Treewidth and Hyperbolicity of the Internet
TLDR
The tree width of the Internet appears to be quite large and being far from a tree with that respect, reflecting some high degree of connectivity, which proves the existence of a well linked core in the Internet. Expand
Sparse spanners vs. compact routing
TLDR
It is proved that any routing scheme using routing tables of size μ bits per node and addresses of poly-logarithmic length has additive stretch Ω(√ <i>n</i>/μ) for general graphs, and Ω (√<i*n/ μ) for planar graphs, which provides the first separation of sparse spanner problems and compact routing problems. Expand
Polylogarithmic network navigability using compact metrics with small stretch
TLDR
It is proved that, using semimetrics of small stretch results in a huge positive impact, in both encoding space and efficiency of greedy routing. Expand
An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs
TLDR
This is the first paper to propose a single spanning tree solution to the single-sink buy-at-bulk network design problem (as opposed to multiple overlay trees), and provides a Ω(log n) lower bound for any oblivious tree in low doubling-dimension graphs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 47 REFERENCES
Distributed approaches to triangulation and embedding
TLDR
This paper presents the first fully distributed embedding algorithm with provable distortion guarantees 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 Vivaldi algorithm. Expand
Triangulation and embedding using small sets of beacons
TLDR
A beacon-based embedding algorithm is given that achieves constant distortion on a 1 - /spl epsiv/ fraction of distances; this provides some theoretical justification for the success of the recent global network positioning algorithm of Ng and Zhang. Expand
On compact routing for the internet
TLDR
It is demonstrated that in view of recent results in compact routing research, logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent (flat) addressing, and a fundamental re-examination of assumptions behind routing models and abstractions is needed. Expand
Vivaldi: a decentralized network coordinate system
TLDR
Vivaldi is a simple, light-weight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts. Expand
Predicting Internet network distance with coordinates-based approaches
  • T. Ng, Hui Zhang
  • Computer Science
  • Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
  • 2002
TLDR
This work proposes using coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay), and proposes the GNP approach, based on absolute coordinates computed from modeling the Internet as a geometric space. Expand
Compact routing on Internet-like graphs
TLDR
The Thorup-Zwick (TZ) compact routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal per-node memory upper bound and the stretch distribution is derived, finding a unique critical point of the average TZ stretch as a function of d~ and /spl sigma/. Expand
Small Hop-diameter Sparse Spanners for Doubling Metrics
TLDR
It is shown that given any metric with constant doubling dimension k and any 0<ε<1, one can find (1+ε)-spanner for the metric with nearly linear number of edges and constant hop diameter; and it is proved that such tradeoffs between the number of edge and the hop diameter are asymptotically optimal. Expand
Meridian: a lightweight network location service without virtual coordinates
TLDR
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location, which is scalable with logarithmic convergence when Internet latencies are modeled as a growth-constrained metric, a low-dimensional Euclidean metric, or a metric of low doubling dimension. Expand
Optimal-stretch name-independent compact routing in doubling metrics
TLDR
The algorithm basically achieves optimal stretch for name-independent routing in doubling metrics with packet header size and routing information at each node both bounded by a polylogarithmic function of <i>n</i. Expand
Novel architectures for P2P applications: the continuous-discrete approach
TLDR
It is shown that, using the proposed approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worst parameters, and it is expected that more distributed data structures could be designed and implemented in aynamic environment. Expand
...
1
2
3
4
5
...