By Topic

Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yin Chen ; Dept. of Autom., Tsinghua Univ., Beijing ; Li Tang ; Jun Li

This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic relay node selection algorithm for overlay routing is proposed. The algorithm can find effective relay nodes for end-to-end links in an overlay network, and is scalable and robust due to its decentralization and randomization. Based on the simulation results, the algorithm is able to maintain a good performance when 40% end nodes in an overlay network encounter failures.

Published in:

Distributed Computing Systems Workshops, 2008. ICDCS '08. 28th International Conference on

Date of Conference:

17-20 June 2008