Abstract
This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(logn) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: Proc. of the 17th Intl. Parallel and Distributed Processing Symposium (IPDPS), p. 40 (2003)
Berns, A., Ghosh, S., Pemmaraju, S.V.: Brief announcement: a framework for building self-stabilizing overlay networks. In: Proc. of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pp. 398–399 (2010)
Caron, E., Desprez, F., Petit, F., Tedeschi, C.: Snap-stabilizing prefix tree for peer-to-peer systems. Parallel Processing Letters 20(1), 15–30 (2010)
Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: A self-stabilizing deterministic skip list. In: Kulkarni, S., Schiper, A. (eds.) SSS 2008. LNCS, vol. 5340, pp. 124–140. Springer, Heidelberg (2008)
Cramer, C., Fuhrmann, T.: Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, System Architecture Group, University of Karlsruhe (2005)
De Bruijn, N.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758–764 (1946)
Fraigniaud, P., Gauron, P.: D2B: A De Bruijn based content-addressable network. Theoretical Computer Science 355(1), 65–79 (2006)
Gall, D., Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: Time complexity of distributed topological self-stabilization: The case of graph linearization. In: Proc. of the 9th Latin American Theoretical Informatics Symposium, pp. 294–305 (2010)
Jacob, R., Richa, A., Scheideler, C., Schmid, S., Taeubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proc. of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 131–140 (2009)
Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: A Self-stabilizing and Local Delaunay Graph Construction. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 771–780. Springer, Heidelberg (2009)
Kaashoek, M., Karger, D.: Koorde: A Simple Degree-Optimal Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. of the 29th ACM Symposium on Theory of Computing, STOC (1997)
Kniesburges, S., Koutsopoulos, A., Scheideler, C.: Re-Chord: A self-stabilizing Chord overlay network. To appear in Proc. of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2011)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In: Proc. of the 2003 ACM SIGCOMM Conference, pp. 395–406 (2003)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of the 21st ACM Symposium on Principles of Distributed Computing, PODC (2002)
Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approch. In: Proc. of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 50–59 (2003)
Onus, M., Richa, A., Scheideler, C.: Linearization: Locally Self-Stabilizing Sorting in Graphs. In: Proc. of the 9th Workshop on Algorithm Engineering and Experiments, ALENEX (2007)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. of the ACM SIGCOMM Data Communication Festival (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Scheideler, C., Schmid, S.: A distributed and oblivious heap. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 571–582. Springer, Heidelberg (2009)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer look-up protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Richa, A., Scheideler, C., Stevens, P. (2011). Self-Stabilizing De Bruijn Networks. In: DĂ©fago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-24550-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24549-7
Online ISBN: 978-3-642-24550-3
eBook Packages: Computer ScienceComputer Science (R0)