HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Electronic and Computer Engineering  >
ECE Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/2471
Title: Stochastic relay routing in peer-to-peer networks
Authors: Hei, Xiaojun
Song, Haiqing
Keywords: Network Address Translation (NAT)
Peer-to-peer networks
Relay routing algorithm
Stochastic programming
Issue Date: 2006
Citation: To be published in Proceedings 41st IEEE International Conference on Communications (ICC 2006), Istanbul, Turkey, 11-15 June, 2006
Abstract: Network Address Translation (NAT) commonly prevents nodes without globally valid IP addresses from establishing direct Internet paths. In peer-to-peer networks, peers may utilize intermediate nodes as relays for this NAT traversal. We develop a stochastic relay routing algorithm for selecting appropriate relay nodes. The proposed relay routing algorithm is constructed in a stochastic programming framework by leveraging the actual delay of local links and the statistical delay distributions of non-local overlay links. Single or multiple paths are established via relays between two peers for achieving packet delivery with low delay and small loss. The simulation results showed that the proposed stochastic single/multi-path routing algorithm achieved a much lower packet delay than deterministic shortest path algorithms, which utilize average link delays. We demonstrated the effectiveness of the path diversity provided by our algorithm in reducing packet loss significantly via simulations. Our algorithm is fully distributed and requires only accurate local information. The employment of our algorithm is beneficial for provisioning real-time streaming applications in peer-to-peer networks.
Rights: © 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
URI: http://hdl.handle.net/1783.1/2471
Appears in Collections:ECE Conference Papers

Files in This Item:

File Description SizeFormat
icc2006.pdfpre-published version249KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.