Virtual Direction Routing for Overlay Networks
Name
Cheng-2009-Virtual Direction Routing for Overlay Networks.pdf
Size
559.34 KB
Format
Adobe PDF
Checksum (MD5)
0736beea04df7a84067f6344a13efc56
Author(s)
Cheng, Bow-Nan
Yuksel, Murat
Kalyanaraman, Shivkumar
Date Issued
October 2009
Journal
Proceedings of the IEEE Ninth International Conference on Peer-to-Peer Computing, 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Bow-Nan Cheng, M. Yuksel, and S. Kalyanaraman. “Virtual Direction Routing for overlay networks.” Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International Conference on. 2009. 61-70. © Copyright 2009 IEEE
Version
Final published version
Abstract
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay networks. Routing and search in these overlay networks have ranged from flooding-based unstructured techniques to structured ones mainly for popular and rate items respectively. In this paper, we propose a new method of establishing a virtual structure and introduce a technique to scalably route packets through an unstructured overlay network. We introduce virtual direction routing (VDR). VDR is a lightweight and scalable overlay network routing protocol that uses the concept of virtual directions to efficiently perform node information seeding and lookup. State information is replicated at nodes along virtual orthogonal lines originating from each node and periodically updated. When a path lookup is initiated, instead of flooding the network, query packets are also forwarded along virtual orthogonal lines until an intersection with the seeded state occurs. We show that VDR achieves high reachability with relatively low seed and search packet TTL even under high network churn. We also show that VDR scales well without imposing DHT-like graph structures (e.g., trees, rings, torus, coordinate-space) and the path stretch compared to random-walk protocols is very good. The tradeoff is added latency by choosing suboptimal paths.
MIT Department
Lincoln Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/P2P.2009.5284516
