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 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Harary, F.: Graph Theory. Addison-Wesley Publishing Company, Inc, Reading (1969)
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)
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)
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)
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)
Gaertler, M., Wagner, D.: A hybrid model for drawing dynamic and evolving graphs. In: Algorithmic Aspects of Large and Complex Networks (2006)
Harary, F.: The maximum connectivity of a graph. Proc Natl Acad Sci U S A. 48(7), 1142–1146 (1962)
Doty, L.L.: A large class of maximally tough graphs. OR Spectrum 13(3), 147–151 (1991)
Hou, X., Wang, T.: An algorithm to construct k-regular k connected graphs with maximum k-diameter. Graphs and Combinatorics 19, 111–119 (2003)
Hou, X., Wang, T.: On generalized k-diameter of k-regular k-connected graphs. Taiwanese Journal of Mathematics 8(4), 739–745 (2004)
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)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
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)
Wormald, N.: Models of random regular graphs. Surveys in Combinatorics, 239–298 (1999)
Cochran, W.: Sampling Techniques. Wiley, Chichester (1977)
Boykov, Y., Kolmogorov, V.: Maxflow - software for computing mincut/maxflow in a graph, http://www.adastral.ucl.ac.uk/~vladkolm/software.html
Meringer, M.: Regular graphs (website), http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html
Mallows, C., Shepp, L.: The necklace process. Journal of Applied Probabilty 45 (to appear, 2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimitrov, S., Krishnan, P., Mallows, C., Meloche, J., Yajnik, S. (2008). r3: Resilient Random Regular Graphs. In: Taubenfeld, G. (eds) Distributed Computing. DISC 2008. Lecture Notes in Computer Science, vol 5218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87779-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-87779-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87778-3
Online ISBN: 978-3-540-87779-0
eBook Packages: Computer ScienceComputer Science (R0)