Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the interaction of multiple overlay routing
Performance Evaluation - Performance 2005
On the complexity of greedy routing in ring-based peer-to-peer networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
NBDT: an efficient P2P indexing scheme for web service discovery
International Journal of Web Engineering and Technology
Dynamic Web Service discovery architecture based on a novel peer based overlay network
Journal of Systems and Software
Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
Designs, Codes and Cryptography
Tight lower bounds for greedy routing in uniform small world rings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Brief announcement: tight lower bounds for greedy routing in uniform small world rings
Proceedings of the 28th ACM symposium on Principles of distributed computing
Multicasting in the hypercube, chord and binomial graphs
Information Processing Letters
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
A loopless gray code for minimal signed-binary representations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A prefix-based approach for managing hybrid specifications in complex packet filtering
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with edges connecting pairs of nodes that are 2k positions apart for any k ≥ 0. The standard Chord routing algorithm uses edges in only one direction. Our algorithms exploit the bidirectionality of edges for optimality. At the heart of the new protocols lie algorithms for writing a positive integer d as the difference of two non-negative integers d′ and d″ such that the total number of 1-bits in the binary representation of d′ and d″ is minimized. Given that Chord is a variant of the hypercube, the optimal routes possess a surprising combinatorial structure.