An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches
IEEE Transactions on Computers
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Expanders might be practical: fast algorithms for routing around faults on multibutterflies
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
ACM Transactions on Algorithms (TALG)
C2: a new overlay network based on CAN and Chord
International Journal of High Performance Computing and Networking
Anonymity and Censorship Resistance in Unstructured Overlay Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Research in Peer-to-peer systems has focussed on building efficient Content Addressable Networks (CANs), which are essentially distributed hash tables (DHT) that support location of resources based on unique keys. While most proposed schemes are robust to a large number of random faults, there are very few schemes that are robust to a large number of adversarial faults. In a recent paper ([2]) Fiat and Saia have proposed such a solution that is robust to adversarial faults.We propose a new solution based on multi-butterflies that improves upon the previous solution by Fiat and Saia. Our new network, multihypercube, is a fault tolerant version of the hypercube, and may find applications to other problems as well. We also demonstrate how this network can be maintained dynamically. This addresses the first open problem in the paper ([2]) by Fiat and Saia.