Exploiting network distance based Euclidean coordinates for the one hop relay selection

Authors:
Sanghwan Lee
Affiliations:
Kookmin University, Seoul, Korea
Venue:
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Year:
2009

Citing 5
Cited 0

Resilient overlay networks

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
King: estimating latency between arbitrary internet end hosts

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Virtual landmarks for the internet

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Tomography-based overlay network monitoring

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Vivaldi: a decentralized network coordinate system

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The one hop relay selection problem is to find a node that can relay traffic from a source to a destination. The NAT traversal scheme in Skype VoIP networks is such an example. To fnd the optimal relay node requires a large amount of measurement traffc. Thus, a more scalable way to fnd a good relay node is crucial for the success of relaying. In this paper, we investigate the applicability of network distance based Euclidean coordinates for the one hop relay selection problem. Through a number of experiments with real measurement data sets, we show that the Euclidean coordinate system achieves close to the optimal performance in terms of delay.