Reconfiguring Self-stabilizing Publish/Subscribe Systems

  • Michael A. Jaeger
  • Gero Mühl
  • Matthias Werner
  • Helge Parzyjegla
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4269)


Recent work on self-stabilizing routing in publish/subscribe systems showed that it is feasible to automate reconfigurations in case of faults by enabling the system to recover from arbitrary transient faults. In this paper, we discuss how to incorporate planned reconfigurations of the broker topology into self-stabilizing publish/subscribe systems without service interruption. We present an algorithm that uses a coloring mechanism to enable the system to be automatically switched from one system configuration to another. The colors thereby synchronize the broker overlay and the publish/subscribe routing layer.


Overlay Network Control Message Service Interruption Overlay Topology Rout Table Entry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)CrossRefzbMATHGoogle Scholar
  2. 2.
    Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  3. 3.
    Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science 4 (Special Issue on Self-Stabilization) (December 1997)Google Scholar
  4. 4.
    Dolev, S., Kat, R.I.: Hypertree for self-stabilizing peer-to-peer systems. In: Network Computing and Applications (NCA 2004). Proceedings. Third IEEE International Symposium on, Washington, DC, USA, pp. 25–32. IEEE, Los Alamitos (2004)Google Scholar
  5. 5.
    Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.: Fault-containing self-stabilizing algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium of Distributed Computing (PODC 1996), pp. 45–54. ACM, New York (1996)CrossRefGoogle Scholar
  6. 6.
    Jaeger, M.A., Mühl, G.: Stochastic analysis and comparison of self-stabilizing routing algorithms for publish/subscribe systems. In: Riley, G.F., Fujimoto, R., Karatza, H. (eds.) The 13th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2005), Atlanta, Georgia, USA, pp. 471–479. IEEE Press, Los Alamitos (2005)Google Scholar
  7. 7.
    Mühl, G.: Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology (September 2002)Google Scholar
  8. 8.
    Mühl, G., Jaeger, M.A., Herrmann, K., Weis, T., Fiege, L., Ulbrich, A.: Self-stabilizing publish/Subscribe systems: Algorithms and evaluation. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 664–674. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Nelson, V.P.: Fault-tolerant computing: Fundamental concepts. Computer 23(7), 19–25 (1990)CrossRefGoogle Scholar
  10. 10.
    Shen, Z., Tirthapura, S.: Self-stabilizing routing in publish-subscribe systems. In: 3rd International Workshop on Distributed Event-Based Systems (DEBS 2004), Edinburgh, Scotland, UK, pp. 92–97. IEE (May 2004)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Michael A. Jaeger
    • 1
  • Gero Mühl
    • 1
  • Matthias Werner
    • 1
  • Helge Parzyjegla
    • 1
  1. 1.Communication and Operating Systems GroupBerlin University of TechnologyBerlinGermany

Personalised recommendations