Reducing communication costs in robust peer-to-peer networks

DOI10.1016/J.IPL.2007.11.004MaRDI QIDQ963355zbMATH OpenOpenAlexFDO

Authors Jared Saia, Maxwell Young

Publication date 19 April 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.11.004

zbMATH Keywords

algorithmsdistributed computingfault-tolerancepeer-to-peeradaptive adversary

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Algorithms – ESA 2005
• Towards a scalable and robust DHT
• scientific article; zbMATH DE number 1947402
• Reliable resource searching in P2P networks
• A survey of DHT security techniques

Cites work

• scientific article; zbMATH DE number 1583939 (Why is no real title available?)
• scientific article; zbMATH DE number 1955785 (Why is no real title available?)
• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• scientific article; zbMATH DE number 1559530 (Why is no real title available?)
• scientific article; zbMATH DE number 2119648 (Why is no real title available?)
• Algorithms – ESA 2005
• Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks
• Asynchronous secure computation
• The hyperring: a low-congestion deterministic data structure for distributed environments

Cited in

(5)

• Robust random number generation for peer-to-peer systems
• Resource Burning for Permissionless Systems (Invited Paper)
• A Denial-of-Service Resistant DHT
• Sleeping on the job: energy-efficient and robust broadcast for radio networks
• Algorithms – ESA 2005

Describes a project that uses

Uses Software

• Chord

This page was built for publication: Reducing communication costs in robust peer-to-peer networks

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