Dynamically fault-tolerant content addressable networks

DOI10.1007/3-540-45748-8_26MaRDI QIDQ4709172zbMATH OpenFDO

Authors Jared Saia, Steven D. Gribble, Anna R. Karlin, Stefan Saroiu, Amos Fiat

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/24290270.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1947402
• The forgiving tree, a self-healing distributed data structure
• scientific article; zbMATH DE number 2119648
• Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks
• Towards a scalable and robust DHT

Cited in

(14)

• Robust random number generation for peer-to-peer systems
• Distributed agreement in dynamic peer-to-peer networks
• D2B: A de Bruijn based content-addressable network
• Towards worst-case churn resistant peer-to-peer systems
• Censorship resistant peer-to-peer networks
• Reliable resource searching in P2P networks
• Study of self-adaptable fault tolerance in storage network
• scientific article; zbMATH DE number 4058841 (Why is no real title available?)
• scientific article; zbMATH DE number 1947402 (Why is no real title available?)
• scientific article; zbMATH DE number 1950680 (Why is no real title available?)
• Automata, Languages and Programming
• Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks
• Robust overlays meet blockchains: on handling high churn and catastrophic failures
• Towards a scalable and robust DHT

This page was built for publication: Dynamically fault-tolerant content addressable networks

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