Fault-tolerant routing in peer-to-peer systems
From MaRDI portal
Publication:5170882
DOI10.1145/571825.571862zbMath1292.68021arXivcs/0302022MaRDI QIDQ5170882
James Aspnes, Gauri Shah, Zoë Diamadi
Publication date: 25 July 2014
Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0302022
68M10: Network design and communication in computer systems
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68M12: Network protocols
Related Items
Asymptotically optimal solutions for small world graphs, Recovering the long-range links in augmented graphs, Universal augmentation schemes for network navigability, Greedy routing in small-world networks with power-law degrees, Resilience and reliability analysis of P2P network systems, Eclecticism shrinks even small worlds, Optimal routing in a small-world network, Close to optimal decentralized routing in long-range contact networks