2009 | OriginalPaper | Buchkapitel
Exploiting Network Distance Based Euclidean Coordinates for the One Hop Relay Selection
verfasst von : Sanghwan Lee
Erschienen in: Management Enabling the Future Internet for Changing Business and New Computing Services
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 find the optimal relay node requires a large amount of measurement traffic. Thus, a more scalable way to find 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.