Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Deterministic resource discovery in distributed networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Asynchronous Resource Discovery in Peer to Peer Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
New models and algorithms for future networks
IEEE Transactions on Information Theory
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Asynchronous resource discovery in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Self-Organized Grouping (SOG) Method for Efficient Grid Resource Discovery
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Bootstrapping large-scale DHT networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Confidence-based grid service discovery
International Journal of Web and Grid Services
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 0.00 |
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP address) are known to them. One of the basic building blocks of such a distributed system is resource discovery - efficiently discovering the ids of the nodes that currently exist in the system. We present both upper and lower bounds for the resource discovery problem. For the original problem raised by Harchol-Balter, Leighton, and Lewin [3] we present an Ω2(n log n) message complexity lower bound for asynchronous networks whose size is unknown. For this model, we give an asymptotically message optimal algorithm that improves the bit complexity of Kutten and Peleg [4]. When each node knows the size of its connected component, we provide a novel and highly efficient algorithm with near linear O(nα(n, n)) message complexity (where α is the inverse of Ackerman's function). In addition, we define and study the Ad-hoc Resource Discovery Problem, which is a practical relaxation of the original problem. Our algorithm for ad-hoc resource discovery has near linear O(nα(n, n)) message complexity. The algorithm efficiently deals with dynamic node additions to the system, thus addressing an open question of [3]. We present a Ω(nα(n, n)) lower bound for the Ad-hoc Resource Discovery Problem, showing that our algorithm is asymptotically message optimal.