Reducing communication costs in robust peer-to-peer networks

DOI10.1016/J.IPL.2007.11.004zbMATH Open1186.68030OpenAlexW1971843894MaRDI QIDQ963355FDOQ963355

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

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

zbMATH Keywords

algorithmsdistributed computingfault-tolerancepeer-to-peeradaptive adversary

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms – ESA 2005
• Asynchronous secure computation
• The hyperring: a low-congestion deterministic data structure for distributed environments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks

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
• Algorithms – ESA 2005
• Sleeping on the job: energy-efficient and robust broadcast for radio networks

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)