Multi-space distributed hash tables for multiple transport domains

IEEE International Conference on Networks, ICON

Volumn , Issue , 2003, Pages 283-287

  Harwood, Aaron ^a   Truong, Minh ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Distributed hash table; Overlay networks; Peer to peer networking

Indexed keywords

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; INTERNET PROTOCOLS; PEER TO PEER NETWORKS; PROBLEM SOLVING;

COMPUTING COMMUNITY; CONSISTENT HASHING; DISTRIBUTED HASH TABLE; P2P TECHNOLOGIES; PEER TO PEER (P2P); PEER-TO-PEER NETWORKING; SIMPLE++; SPACE BETWEEN; TABLE SPACE;

OVERLAY NETWORKS;

EID: 33744906350     PISSN: 15566463     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icon.2003.1266204     Document Type: Conference Paper

References (12)

1. P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In HotOS VIII, pages 75-80, Schloss Elmau, Germany, May 2001.
2. David Karger, Eric Lehman, Tom Leighton, Mathhew Levine, Daniel Lewin, and Rina Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing, pages 654-663, May 1997.
3. John Kubiatowicz, David Bindel, Yan Chen, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westly Weimer, Christopher Wells, and Ben Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS. ACM, November 2000.
4. R. Panigrahy. Relieving hot spots on the world wide web. Technical Report MIT/LCS/TR-716, 1997.
5. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM 2001, 2001.
6. Sylvia Ratnasamy, Mark Handley, Richard Karp, and Scott Shenker. Application-level multicast using content-addressable networks. Lecture Notes in Computer Science, 2233:14-, 2001.
7. Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-, 2001.
8. Antony I. T. Rowstron, Anne-Marie Kermarrec, Miguel Castro, and Peter Druschel. SCRIBE: The design of a large-scale event notification infrastructure. In Networked Group Communication, pages 30-43, 2001.
9. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
10. Minh Truong and Aaron Harwood. Distributed shell over peer-to-peer networks. In The 2003 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 269-275. CSREA, 2003.
11. Marcel Waldvogel and Roberto Rinaldi. Efficient topology-aware overlay network. ACM Computer Communication Review, 33(1), January 2003.
12. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.