The Community for Technology Leaders
11th IEEE International Conference on Network Protocols, 2003. Proceedings. (2003)
Atlanta, Georgia
Nov. 4, 2003 to Nov. 7, 2003
ISSN: 1092-1648
ISBN: 0-7695-2024-3
pp: 258
Abhishek Kumar , Georgia Institute of Technology
Shashidhar Merugu , Georgia Institute of Technology
Jun (Jim) Xu , Georgia Institute of Technology
Xingxing Yu , Gergia Institute of Technology
ABSTRACT
A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-to-peer networks. In this paper, we present Ulysses, a peer-to-peer network based on the butterfly topology that achieves the theoretical lower bound of \frac{{\log n}}{{\log \log n}} on network diameter when the average routing table size at nodes is no more than log n. Compared to existing DHT-based schemes with similar raouting table size, Ulysses reduces the network diameter by a factor of log log n, which is 2-4 for typical configurations. This translates into the same amount of reduction on query latency and average traffic per link/node. In addition, Ulysses maintains the same level of robustness in terms of routing in the face of faults and recovering from graceful/ungraceful joins and departures, as provided by existing DHT-based schemes. The performance of the protocol has been evaluated using both analysis and simulation.
INDEX TERMS
null
CITATION

X. Yu, A. Kumar, S. Merugu and J. (. Xu, "Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network," 11th IEEE International Conference on Network Protocols, 2003. Proceedings.(ICNP), Atlanta, Georgia, 2003, pp. 258.
doi:10.1109/ICNP.2003.1249776
94 ms
(Ver 3.3 (11022016))