Exploiting Network Distance Based Euclidean Coordinates for the One Hop Relay Selection

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.