Asynchronous Resource Discovery

DMCA

Asynchronous Resource Discovery (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ittai Abraham , Danny Dolev

Venue:	IN PROCEEDINGS OF THE 22ND ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC
Citations:	18 - 2 self

BibTeX

@INPROCEEDINGS{Abraham03asynchronousresource,
    author = {Ittai Abraham and Danny Dolev},
    title = {Asynchronous Resource Discovery},
    booktitle = {IN PROCEEDINGS OF THE 22ND ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC},
    year = {2003},
    pages = {143--150},
    publisher = {ACM Press}
}

OpenURL

Abstract

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 # 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 e#cient 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 e#ciently 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.

Keyphrases

message complexity asynchronous resource discovery ad-hoc resource discovery problem original problem distributed system resource discovery problem practical relaxation connected component bit complexity large-scale communication infrastructure message optimal algorithm cient algorithm resource discovery open question dynamic node addition ip address message optimal basic building block asynchronous network near linear ad-hoc resource discovery

DMCA