Relay node selection in large-scale VoIP overlay networks

Authors:
Quang Duc Bui;Andrew Jennings
Affiliations:
School of Electrical and Computer Engineering, RMIT University, Melbourne, Australia;School of Electrical and Computer Engineering, RMIT University, Melbourne, Australia
Venue:
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Year:
2009

Citing 6
Cited 0

The Stanford GraphBase: a platform for combinatorial computing

The Stanford GraphBase: a platform for combinatorial computing
Resilient overlay networks

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
On inferring autonomous system relationships in the internet

IEEE/ACM Transactions on Networking (TON)
ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Improving the reliability of internet paths with one-hop source routing

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Toward internet-wide multipath routing

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relay path selection is one of the critical components of VoIP overlay systems. This paper looks at the choice of relay nodes and its impact on the performance of VoIP overlay paths in interdomain environment. We model the network at the Autonomous System level and simulate different scenarios of relay path selection. For the optimal relay path performance, we recommand to select relay nodes whose distances are less than or equal to three hops away from the sources. Our analysis shows that the performance of relay paths in existing methods is influenced by the density of the relay nodes. There is a trade-off between delay and hop overlap performance objectives. We propose new algorithm for selecting relay nodes. Initial results shoe that the proposed method can improve performance.