Sciweavers

44 search results - page 3 / 9
» Network distance estimation with dynamic landmark triangles
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Non-Metric Coordinates for Predicting Network Proximity
—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 metr...
Peter B. Key, Laurent Massoulié, Dan-Cristi...
IMC
2004
ACM
14 years 27 days ago
Constraint-based geolocation of internet hosts
— Geolocation of Internet hosts enables a diverse and interesting new class of location-aware applications. Previous measurement-based approaches use reference hosts, called land...
Bamba Gueye, Artur Ziviani, Mark Crovella, Serge F...
SIGMETRICS
2002
ACM
133views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
On the stability of network distance estimation
Estimating end-to-end Internet distance can benefit many applications and services, such as efficient overlay construction, overlay routing and location, and peer-topeer systems. ...
Yan Chen, Khian Hao Lim, Randy H. Katz, Chris Over...
JCO
1998
102views more  JCO 1998»
13 years 7 months ago
Facility Location with Dynamic Distance Functions
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
JCST
2008
203views more  JCST 2008»
13 years 7 months ago
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor sca...
Xue Zhang, Jue Hong, Sanglu Lu, Li Xie, Jiannong C...