Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing

—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.

• Type: Conference
• Year: 2008
• Where: ICDCSW
• Authors: Yin Chen, Li Tang, Jun Li
• Keywords: Distributed And Parallel Computing, Effective Relay Nodes, ICDCSW 2008, Overlay Network, Relay Nodes