r3: Resilient Random Regular Graphs

  • Authors:

  • Stanko Dimitrov;P. Krishnan;Colin Mallows;Jean Meloche;Shalini Yajnik

  • Affiliations:

  • Dept. of Ind. and Op. Eng., Univ. of Michigan, Ann Arbor, MI 48109;Avaya Labs, Basking Ridge, NJ 07920;Avaya Labs, Basking Ridge, NJ 07920;Avaya Labs, Basking Ridge, NJ 07920;Avaya Labs, Basking Ridge, NJ 07920

  • Venue:
  • DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Efficiently building and maintaining resilient regular graphs is important for many applications. Such graphs must be easy to build and maintain in the presence of node additions and deletions. They must also have high resilience (connectivity). Typically, algorithms use offline techniques to build regular graphs with strict bounds on resilience and such techniques are not designed to maintain these properties in the presence of online additions, deletions and failures. On the other hand, random regular graphs are easy to construct and maintain, and provide good properties with high probability, but without strict guarantees. In this paper, we introduce a new class of graphs that we call r3(resilient random regular) graphs and present a technique to create and maintain r3graphs. The r3graphs meld the desirable properties of random regular graphs and regular graphs with strict structural properties: they are efficient to create and maintain, and additionally, are highly connected (i.e., 1 + d/2-node and d-edge connected in the worst case). We present the graph building and maintenance techniques, present proofs for graph connectedness, and various properties of r3graphs. We believe that r3graphs will be useful in many communication applications.