Distributed construction of a fault-tolerant network from a tree

We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (an expander graph) among themselves in a distributed and scalable way. The tree overlayed with this logical expander is a useful structure for distributed applications that require the intrinsic "treeness" from the topology but cannot afford any obstruction in communication due to failures. At the core of our construction is a novel distributed mechanism that samples nodes uniformly at random from the tree. In the event of node joins, node departures or node failures, the expander maintains its own fault tolerance and permits the reformation of the tree. We present simulation results to quantify the convergence of our algorithm to a fault tolerant network having both good vertex connectivity and expansion properties.

[1]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.

[2]  David A. Patterson,et al.  X-Tree: A tree structured multi-processor computer architecture , 1978, ISCA '78.

[3]  Kurt Rothermel,et al.  A robust and efficient mechanism for constructing multicast acknowledgement trees , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[4]  Christian Scheideler,et al.  The Effect of Faults on Network Expansion , 2004, SPAA '04.

[5]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[6]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[7]  Guillaume Urvoy-Keller,et al.  Hierarchical Peer-To-Peer Systems , 2003, Parallel Process. Lett..

[8]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[9]  Peter Druschel,et al.  Topology-aware routing in structured peer-to-peer overlay networks , 2003 .

[10]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[11]  Miguel Castro,et al.  Dynamic Lookup Networks , 2003, Future Directions in Distributed Computing.

[12]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[13]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[14]  Kai-Yeung Siu,et al.  Distributed construction of random expander networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[16]  Michael K. Reiter,et al.  Delegation of cryptographic servers for capture-resilient devices , 2001, CCS '01.

[17]  Jon Crowcroft,et al.  Highways: proximity clustering for scalable peer-to-peer network , 2004 .

[18]  Niko Kotilainen,et al.  Mobile Chedar - a peer-to-peer middleware for mobile devices , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[19]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[20]  Daniel J. Kleitman,et al.  Methods for investigating the connectivity of large graphs , 1969 .

[21]  Oliver Vornberger,et al.  The Complexity of Testing Whether a Graph is a Superconcentrator , 1981, Inf. Process. Lett..

[22]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[23]  Eli Upfal,et al.  Building low-diameter P2P networks , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[24]  Michael K. Reiter,et al.  Networked cryptographic devices resilient to capture , 2003, International Journal of Information Security.

[25]  Dahlia Malkhi,et al.  Estimating network size from local information , 2003, Information Processing Letters.

[26]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[27]  Geng Lin,et al.  Fault-tolerant circuit-switching networks , 1992, SPAA '92.

[28]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[29]  Richard E. Ladner,et al.  Algorithms for dynamic multicast key distribution trees , 2003, PODC '03.

[30]  Haibin Lu,et al.  A novel high-order tree for secure multicast key management , 2005, IEEE Transactions on Computers.

[31]  Jon Crowcroft,et al.  Highways: proximity clustering for scalable peer-to-peer network , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[32]  Paul V. Mockapetris,et al.  Domain names: Concepts and facilities , 1983, RFC.

[33]  B. Lampson,et al.  Authentication in distributed systems: theory and practice , 1991, TOCS.

[34]  Andreas Goerdt.  Random Regular Graphs with Edge Faults: Expansion through Cores , 1998, ISAAC.

[35]  Maurice Herlihy,et al.  The Arrow Distributed Directory Protocol , 1998, DISC.

[36]  David Reeves Boggs.  Internet broadcasting , 1982 .

[37]  A. Grama,et al.  Distributed Uniform Sampling in Real- World Networks , 2004 .

[38]  Michael K. Reiter,et al.  The design and implementation of a JCA-compliant capture protection infrastructure , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[39]  Joel Friedman,et al.  On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..

[40]  Carlo H. Séquin,et al.  Hypertree: A Multiprocessor Interconnection Topology , 1981, IEEE Transactions on Computers.

[41]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[42]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[43]  Mukesh Singhal,et al.  A fault tolerant algorithm for distributed mutual exclusion , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.

[44]  Li Xiao,et al.  Location-aware topology matching in P2P systems , 2004, IEEE INFOCOM 2004.

[45]  Van H. Vu,et al.  Generating Random Regular Graphs , 2003, STOC '03.

[46]  S. Wang,et al.  A tree-based distributed algorithm for the K-entry critical section problem , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[47]  Mohamed Naimi,et al.  A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal , 1996, J. Parallel Distributed Comput..

[48]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[49]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[50]  Richard D. Schlichting,et al.  Fail-stop processors: an approach to designing fault-tolerant computing systems , 1983, TOCS.

[51]  Ben Y. Zhao,et al.  An architecture for a secure service discovery service , 1999, MobiCom.

[52]  Guillaume Urvoy-Keller,et al.  Hierarchical Peer-To-Peer Systems , 2003, Parallel Process. Lett..

[53]  Andreas Goerdt,et al.  Random regular graphs with edge faults: Expansion through cores , 1998, Theor. Comput. Sci..

[54]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[55]  Achour Mostéfaoui,et al.  A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms , 1994, IEEE Trans. Parallel Distributed Syst..