Stable and scalable universal swarms

DOI10.1145/2484239.2484272MaRDI QIDQ5176103zbMATH OpenOpenAlexFDO

Authors Ji Zhu, Stratis Ioannidis, Nidhi Hegde, Laurent Massoulié

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2484239.2484272

zbMATH Keywords

stabilityP2Pmissing piece syndrome

Mathematics Subject Classification ID

Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Stable and scalable universal swarms
• On the stability of two-chunk file-sharing systems
• Balanced neighbor selection for BitTorrent-like networks
• The Missing Piece Syndrome in Peer-to-Peer Communication
• On swarm-level resource allocation in BitTorrent communities

Cited in

(4)

• On swarm-level resource allocation in BitTorrent communities
• Stable and scalable universal swarms
• Stability of a peer-to-peer communication system
• scientific article; zbMATH DE number 7156487 (Why is no real title available?)

This page was built for publication: Stable and scalable universal swarms

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