Planning the Transformation of Network Topologies

Refining a network topology is an important network management technique. Nevertheless, determining the appropriate steps to transform a network 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 networks hosting mission-critical services. In this paper, we introduce the incremental network transformation (INT) problem and explore this problem in the context of automated planning. We define two metrics to measure the quality of generated transformation plans, one of which is amenable to classical propositional planning. We find that while state-of-the-art domainindependent planning techniques are effective at finding highquality solutions for small problem instances, they cannot scale to solve realistically sized INT instances. To address the shortcomings of existing approaches, we developed a number of domain-dependent planners that use novel domain-specific heuristics. We empirically evaluated our planners on a wide range of synthetic network topologies. Our results illustrate that our automated planning inspired techniques are effective on realistically sized INT problems. We envision that our approach could eventually provide a compelling addition to the arsenal of techniques employed by network practitioners to support network refinement with minimal disruption to running services.

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

[2]  Jorge A. Baier,et al.  Planning with Preferences , 2008, AI Mag..

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

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

[5]  Fabrizio Grandoni,et al.  Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation , 2007, ESA.

[6]  Yoav Tock,et al.  Constructing scalable overlays for pub-sub with many topics , 2007, PODC '07.

[7]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

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

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

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

[11]  Mohit Singh,et al.  Survivable network design with degree or order constraints , 2007, STOC '07.

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

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

[14]  Hans-Arno Jacobsen,et al.  PNUTS: Yahoo!'s hosted data serving platform , 2008, Proc. VLDB Endow..

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

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

[17]  Andréa W. Richa,et al.  Minimum Maximum-Degree Publish-Subscribe Overlay Network Design , 2011, IEEE/ACM Trans. Netw..