Sciweavers

44 search results - page 1 / 9
» Network distance estimation with dynamic landmark triangles
Sort
View
SIGMETRICS
2008
ACM
13 years 4 months ago
Network distance estimation with dynamic landmark triangles
This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-di...
Zhihua Wen, Michael Rabinovich
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 7 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
INFOCOM
2009
IEEE
13 years 11 months ago
Estimating Hop Distance Between Arbitrary Host Pairs
—Establishing a clear and timely picture of Internet topology is complicated by many factors including the vast size and dynamic nature of the infrastructure. In this paper, we d...
Brian Eriksson, Paul Barford, Robert D. Nowak
CIKM
2009
Springer
13 years 11 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
BROADNETS
2007
IEEE
13 years 11 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun