Local computations on static and dynamic graphs

The purpose of this paper is a study of computation that can be done locally in a distributed network. By locally we mean within time (or distance) independent of the size of the network. In particular we are interested in algorithms that ore robust, i.e., perform well even if the underlying graph is not stable and links continuously fail and come-up. We introduce and study the happy coloring and orientation problem and show that it yields a robust local solution to the (d,m)-dining philosophers problem of Naor and Stockmeyer [17]. This problem is similar to the usual dining philosophers problem, except that each philosopher has access to d forks but needs only m of them to eat. We give a robust local solution if m/spl les/[d/2] (necessity of this inequality for any local solution was known previously). Two other problems we investigate are: (1) the amount of initial symmetry-breaking needed to solve certain problems locally (for example, our algorithms need considerably less symmetry-breaking than having a unique ID on each node), and (2) the single-step color reduction problem: given a coloring with c colors of the nodes of a graph, what is the smallest number of colors c' such that every node can recolor itself with one of c' colors as a function of its immediate neighborhood only.<<ETX>>

[1]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[2]  Shay Kutten,et al.  Tight fault locality , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[4]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5]  Michael E. Saks,et al.  Sphere packing and local majorities in graphs , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[6]  Andrew V. Goldberg,et al.  Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs , 1987, Inf. Process. Lett..

[7]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[8]  Moti Yung,et al.  Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.

[9]  Baruch Awerbuch,et al.  A quantitative approach to dynamic networks , 1990, PODC '90.

[10]  Shlomo Moran,et al.  Applications of Ramsey's theorem to decision tree complexity , 1985, JACM.

[11]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[12]  Moni Naor,et al.  A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring , 1991, SIAM J. Discret. Math..

[13]  Judit Bar-Ilan,et al.  Distributed Resource Allocation Algorithms (Extended Abstract) , 1992, WDAG.

[14]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[15]  Joel H. Spencer,et al.  Families of k-independent sets , 1973, Discret. Math..

[16]  Baruch Awerbuch,et al.  Reliable broadcast protocols in unreliable networks , 1986, Networks.

[17]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[18]  Nathan Linial.  Local-Global Phenomena in Graphs , 1993, Comb. Probab. Comput..

[19]  Nancy A. Lynch,et al.  Electing a leader in a synchronous ring , 1987, JACM.

[20]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[21]  Baruch Awerbuch,et al.  Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[22]  Moni Naor,et al.  What can be computed locally? , 1993, STOC.

[23]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[24]  Lenore Cowen,et al.  Efficient asynchronous distributed symmetry breaking , 1994, STOC '94.

[25]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[26]  Manhoi Choy,et al.  Efficient fault tolerant algorithms for resource allocation in distributed systems , 1992, STOC '92.

[27]  Yehuda Afek,et al.  End-to-end communication in unreliable networks , 1988, PODC '88.

[28]  Sundar Vishwanathan,et al.  Locality based graph coloring , 1993, STOC.

[29]  Nancy A. Lynch,et al.  Upper Bounds for Static Resource Allocation in a Distributed System , 1981, J. Comput. Syst. Sci..

[30]  Eugene Styer,et al.  Improved algorithms for distributed resource allocation , 1988, PODC '88.

[31]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.