Routing algorithms for DHTs: Some open questions

DOI10.1007/3-540-45748-8_4MaRDI QIDQ4709125zbMATH OpenFDO

Authors Sylvia Ratnasamy, Ion Lucretiu Stoica, Scott Shenker

Publication date 20 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2429/24290045.htm

Mathematics Subject Classification ID

Distributed systems (68M14) Computing methodologies and applications (68U99)

Cited in

(9)

• MAAN: A multi-attribute addressable network for grid information services
• Decentralized grid resource discovery based on resource information community
• Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
• Using bidirectional links to improve peer-to-peer lookup performance
• Survey of DHT topology construction techniques in virtual computing environments
• Partially ordered knowledge sharing and fractionated systems in the context of other models for distributed computing
• SCDN: stable content distribution network based on demands
• On the price of heterogeneity in parallel systems
• Degree-optimal routing for P2P systems

Describes a project that uses

Uses Software

• Pastry

This page was built for publication: Routing algorithms for DHTs: Some open questions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709125)