r3: Resilient Random Regular Graphs

  • Stanko Dimitrov
  • P. Krishnan
  • Colin Mallows
  • Jean Meloche
  • Shalini Yajnik
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)


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 r 3 (resilient random regular) graphs and present a technique to create and maintain r 3 graphs. The r 3 graphs 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 r 3 graphs. We believe that r 3 graphs will be useful in many communication applications.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Harary, F.: Graph Theory. Addison-Wesley Publishing Company, Inc, Reading (1969)Google Scholar
  2. 2.
    Melamed, R., Keidar, I.: Araneola: A scalable reliable multicast system for dynamic environment. In: 3rd IEEE International Symposium on Network Computing and Applications (IEEE NCA), pp. 5–14 (September 2004)Google Scholar
  3. 3.
    Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications 21(6), 995–1002 (2003)CrossRefGoogle Scholar
  4. 4.
    Haque, A., Aneja, Y.P., Bandyopadhyay, S., Jaekel, A., Sengupta, A.: Some studies on the logical topology design of large multi-hop optical networks. In: Proc. of OptiComm 2001: Optical Networking and Comm, pp. 227–241 (August 2001)Google Scholar
  5. 5.
    Bui-Xuan, B., Ferreira, A., Jarry, A.: Evolving graphs and least cost journeys in dynamic networks. In: Proc. of WiOpt 2003 – Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, Sophia Antipolis, pp. 141–150 (March 2003)Google Scholar
  6. 6.
    Gaertler, M., Wagner, D.: A hybrid model for drawing dynamic and evolving graphs. In: Algorithmic Aspects of Large and Complex Networks (2006)Google Scholar
  7. 7.
    Harary, F.: The maximum connectivity of a graph. Proc Natl Acad Sci U S A. 48(7), 1142–1146 (1962)zbMATHCrossRefGoogle Scholar
  8. 8.
    Doty, L.L.: A large class of maximally tough graphs. OR Spectrum 13(3), 147–151 (1991)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Hou, X., Wang, T.: An algorithm to construct k-regular k connected graphs with maximum k-diameter. Graphs and Combinatorics 19, 111–119 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Hou, X., Wang, T.: On generalized k-diameter of k-regular k-connected graphs. Taiwanese Journal of Mathematics 8(4), 739–745 (2004)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Angskun, T., Bosilca, G., Dongarra, J.: Binomial graph: A scalable and fault-tolerant logical network topology. In: The Fifth International Symposium on Parallel and Distributed Processing and Applications, pp. 471–482 (2007)Google Scholar
  12. 12.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)zbMATHGoogle Scholar
  13. 13.
    Mahlmann, P., Schindelhauer, C.: Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: SPAA 2005: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures, pp. 155–164. ACM Press, New York (2005)CrossRefGoogle Scholar
  14. 14.
    Wormald, N.: Models of random regular graphs. Surveys in Combinatorics, 239–298 (1999)Google Scholar
  15. 15.
    Cochran, W.: Sampling Techniques. Wiley, Chichester (1977)zbMATHGoogle Scholar
  16. 16.
    Boykov, Y., Kolmogorov, V.: Maxflow - software for computing mincut/maxflow in a graph,
  17. 17.
    Meringer, M.: Regular graphs (website),
  18. 18.
    Mallows, C., Shepp, L.: The necklace process. Journal of Applied Probabilty 45 (to appear, 2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Stanko Dimitrov
    • 1
  • P. Krishnan
    • 2
  • Colin Mallows
    • 2
  • Jean Meloche
    • 2
  • Shalini Yajnik
    • 2
  1. 1.Dept. of Ind. and Op. Eng.Univ. of MichiganAnn Arbor 
  2. 2.Avaya LabsBasking Ridge 

Personalised recommendations