TY - GEN

T1 - Resource discovery in networks under bandwidth limitations

AU - Konwar, Kishori M.

AU - Shvartsman, Alex A.

PY - 2006

Y1 - 2006

N2 - The Resource Discovery Problem [4], where cooperating machines need to find one another in a network, was introduced by Harchol-Balter, Leighton, and Lewin in the context of Akamai Technologies with the goal of building an Internet-wide content-distribution system. In the solutions for the synchronous setting proposed so far [4, 11, 12] there is a possibility that during some time step many machines may contact a single machine, and this is not a realistic assumption. This work assumes a synchronous model, however at each step a machine can send and receive only a constant number of messages. It is shown that the conjectured poly-logarithmic upper bound [4] for such a setting is not possible. This is done by proving a lower bound on time of Ω(n), where n is the number of participating nodes. For this model a randomized algorithm is presented that solves the resource discovery problem in O(n log2 n) time, i.e., within a poly-logarithmic factor of the corresponding lower bound. The algorithm has a O(n2 log2 n) message complexity and O(n3 log3 n) communication complexity. Simulation results for the algorithm illustrate the lower and upper bounds, and lead to interesting observations.

AB - The Resource Discovery Problem [4], where cooperating machines need to find one another in a network, was introduced by Harchol-Balter, Leighton, and Lewin in the context of Akamai Technologies with the goal of building an Internet-wide content-distribution system. In the solutions for the synchronous setting proposed so far [4, 11, 12] there is a possibility that during some time step many machines may contact a single machine, and this is not a realistic assumption. This work assumes a synchronous model, however at each step a machine can send and receive only a constant number of messages. It is shown that the conjectured poly-logarithmic upper bound [4] for such a setting is not possible. This is done by proving a lower bound on time of Ω(n), where n is the number of participating nodes. For this model a randomized algorithm is presented that solves the resource discovery problem in O(n log2 n) time, i.e., within a poly-logarithmic factor of the corresponding lower bound. The algorithm has a O(n2 log2 n) message complexity and O(n3 log3 n) communication complexity. Simulation results for the algorithm illustrate the lower and upper bounds, and lead to interesting observations.

UR - http://www.scopus.com/inward/record.url?scp=34547551539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547551539&partnerID=8YFLogxK

U2 - 10.1109/ISPDC.2006.40

DO - 10.1109/ISPDC.2006.40

M3 - Conference contribution

AN - SCOPUS:34547551539

SN - 0769526381

SN - 9780769526386

T3 - Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006

SP - 42

EP - 49

BT - Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006

T2 - 5th International Symposium on Parallel and Distributed Computing, ISPDC 2006

Y2 - 6 July 2006 through 9 July 2006

ER -