r3: Resilient Random Regular Graphs
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.
- 1.Harary, F.: Graph Theory. Addison-Wesley Publishing Company, Inc, Reading (1969)Google Scholar
- 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
- 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.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.Gaertler, M., Wagner, D.: A hybrid model for drawing dynamic and evolving graphs. In: Algorithmic Aspects of Large and Complex Networks (2006)Google Scholar
- 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
- 14.Wormald, N.: Models of random regular graphs. Surveys in Combinatorics, 239–298 (1999)Google Scholar
- 16.Boykov, Y., Kolmogorov, V.: Maxflow - software for computing mincut/maxflow in a graph, http://www.adastral.ucl.ac.uk/~vladkolm/software.html
- 17.Meringer, M.: Regular graphs (website), http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html
- 18.Mallows, C., Shepp, L.: The necklace process. Journal of Applied Probabilty 45 (to appear, 2008)Google Scholar