Polar: an efficient finding nearest neighbor algorithm for overlay network

Authors:
Tan Chen;Xiangzhi Sheng;Baosong Shan
Affiliations:
Beijing University of Aeronautics and Astronautics, Beijing, China;Beijing University of Aeronautics and Astronautics, Beijing, China;Beijing University of Aeronautics and Astronautics, Beijing, China
Venue:
Proceedings of the 2nd international conference on Scalable information systems
Year:
2007

Citing 4
Cited 0

Efficient topology-aware overlay network

ACM SIGCOMM Computer Communication Review
Meridian: a lightweight network location service without virtual coordinates

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Network-Aware Overlays with Network Coordinates

ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Obviously, network proximity is an essential characteristic for overlay network construction. By selecting the nearest neighbor for the target node, large-scale distributed applications can decrease the communication cost and improve the performance significantly. Nevertheless, existing mechanisms for exploiting network proximity information are either inaccurate or low efficiency. In this paper, we present a novel and practical algorithm to find the nearest neighbor in overlay network, called Polar. Performing direct measurement based on the result of distance prediction using network coordinate, Polar achieves accuracy as while as it has low overhead. Meanwhile, our proposal does not rely on the static landmark so it has strong scalability and high robustness. Polar is a generic architecture that can be used for a variety of overlay network with different requirement.