661 search results - page 20 / 133 » On Distributed Computation in Noisy Random Planar Networks |
ISPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
EUROPAR
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
FTDCS
2004
IEEE
13 years 11 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
ICDCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
IPTPS
2003
Springer
14 years 18 days ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...