Planning the Transformation of Distributed Messaging Middlewares

Refining a topology of a distributed messaging middleware (DMM) is an important management technique to provide a better service to the end-users. Nevertheless, determining the appropriate steps to transform a DMM from one topology to another, in a way that minimizes service disruptions, has received little attention. This is a critical problem since service disruptions can be particularly harmful and costly for DMMs hosting mission-critical services. In this paper, we introduce the incremental topology transformation (ITT) problem. To address it, we draw parallels to automated plan automated planning techniques for solving the ITT problem. While state-of-the-art domain-independent planning techniques were effective for solving small problem instances, we found that they did not scale to the level necessary to solve large ITT problem instances. To address this shortcoming, we developed a suite of planners that use novel domainspecific heuristics to guide the search for a solution. We empirically evaluated our planners on a wide range of topologies. Our results illustrate that automated planning offers a viable solution to a diversity of ITT problems. We envision that our approach could eventually provide a compelling addition to the arsenal of techniques currently employed by the administrators of DMM to support its runtime refinement with minimal disruption to services.

[1]  Reza Sherafat Kazemzadeh,et al.  The PADRES Publish/Subscribe System , 2010, Principles and Applications of Distributed Event-Based Systems.

[2]  Helge Parzyjegla,et al.  Self-organizing broker topologies for publish/subscribe systems , 2007, SAC '07.

[3]  Patrik Haslum,et al.  Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..

[4]  Olivier Bonaventure,et al.  Disruption Free Topology Reconfiguration in OSPF Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Armin Biere Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010 , 2010 .

[6]  Amy L. Murphy,et al.  Minimizing the reconfiguration overhead in content-based publish-subscribe , 2004, SAC '04.

[7]  Hans-Arno Jacobsen,et al.  Foundations for Highly Available Content-Based Publish/Subscribe Overlays , 2011, 2011 31st International Conference on Distributed Computing Systems.

[8]  Matteo Migliavacca,et al.  Adapting publish-subscribe routing to traffic demands , 2007, DEBS '07.

[9]  Alexander L. Wolf,et al.  Forwarding in a content-based network , 2003, SIGCOMM '03.

[10]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[11]  Subscription-driven self-organization in content-based publish/subscribe , 2004, International Conference on Autonomic Computing, 2004. Proceedings..

[12]  Hans-Arno Jacobsen,et al.  Scaling Construction of Low Fan-out Overlays for Topic-Based Publish/Subscribe Systems , 2011, 2011 31st International Conference on Distributed Computing Systems.

[13]  Andréa W. Richa,et al.  Minimum Maximum Degree Publish-Subscribe Overlay Network Design , 2009, IEEE INFOCOM 2009.

[14]  Hector Geffner,et al.  Searching for Plans with Carefully Designed Probes , 2011, ICAPS.

[15]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[16]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[17]  Silvia Richter,et al.  The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..

[18]  Hans-Arno Jacobsen,et al.  Adaptive Content-Based Routing in General Overlay Topologies , 2008, Middleware.