Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Efficient topology-aware overlay network
ACM SIGCOMM Computer Communication Review
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement-based deployment proposal for IP anycast
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Embedding, distance estimation and object location in networks
Embedding, distance estimation and object location in networks
Geographic locality of IP prefixes
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Democratizing content publication with coral
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Scriptroute: a public internet measurement facility
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
OASIS: anycast for any service
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
HybridNN: An accurate and scalable network location service based on the inframetric model
Future Generation Computer Systems
| Hi-index | 0.00 |
Finding the nearest peer, in terms of latency, is an important problem in many Internet applications. In this paper, we argue that existing solutions, which only examine inter-peer latencies as part of their operation will find it costly, in certain commonly occurring scenarios, to discover the nearest peer in P2P systems. The difficulty arises out of the way the PoP access networks are laid out in the Internet, where a single PoP (point of presence) belonging to an ISP provides connectivity to numerous client networks. This setup makes a group of peers all appear roughly the same distance from each other, leading to inefficiencies in the existing solutions. In this paper, we use large-scale measurements to show that the problematic topology does occur, use simulations of the Meridian closest-server algorithm to show that the condition does indeed lead to difficulty in finding the exact-closest peer, and propose solutions.