On the locality of bounded growth

Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrarily when looking at neighborhoods of increasing size. Due to this bounded “volume growth,” one could expect that distributed algorithms are able to solve many problems more efficiently than on general graphs. The goal of this paper is to help understanding the distributed complexity of problems on “bounded growth” graphs. We show that on the widely used unit disk graph, covering and packing linear programs can be approximated by constant factors in constant time. For a more general network model which is based on the assumption that nodes are in a metric space of constant doubling dimension, we show that in O(log∗ n) rounds it is possible to construct a (O(1), O(1))-network decomposition. This results in asymptotically optimal O(log∗ n) time algorithms for many important problems. Categories and Su...

• Type: Conference
• Year: 2005
• Where: PODC
• Authors: Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
• Keywords: Distributed Algorithms, Distributed And Parallel Computing, Many Large-scale Networks, PODC 2005, Unit Disk Graphs