Cart (Loading....) | Create Account
Close category search window
 

Resource Discovery in Networks under Bandwidth Limitations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Konwar, K.M. ; Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT ; Shvartsman, A.A.

The resource discovery problem, where cooperating machines need to find one another in a network, was introduced by Harchol-Balter, Leighton, and Lewin (1999) 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 in the papers by Harchol-Bartel et al. (1999), Kutten et al. (2001) and Law and Siu (2000), 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 (Harchol-Bartel et al., 1999) for such a setting is not possible. This is done by proving a lower bound on time of Omega(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

Published in:

Parallel and Distributed Computing, 2006. ISPDC '06. The Fifth International Symposium on

Date of Conference:

6-9 July 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.