Graceful Network State Migrations

A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational tasks. This paper introduces a general class of Graceful Network State Migration (GNSM) problems, where the goal is to discover the optimal sequence of operations that progressively transition the network from its initial to a desired final state while minimizing the overall performance disruption. We investigate two specific GNSM problems: 1) Link Weight Reassignment Scheduling (LWRS) studies the optimal ordering of link weight updates to migrate from an existing to a new link weight assignment; and 2) Link Maintenance Scheduling (LMS) looks at how to schedule link deactivations and subsequent reactivations for maintenance purposes. LWRS and LMS are both combinatorial optimization problems. We use dynamic programming to find the optimal solutions when the problem size is small, and leverage ant colony optimization to get near-optimal solutions for large problem sizes. Our simulation study reveals that judiciously ordering network operations can achieve significant performance gains. Our GNSM solution framework is generic and applies to similar problems with different operational contexts, underlying network protocols or mechanisms, and performance metrics.

[1]  Faisal Aslam,et al.  NPP: A Facility Based Computation Framework for Restoration Routing Using Aggregate Link Usage Information , 2005, QoS-IP.

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

[3]  Chen-Nee Chuah,et al.  Service availability: a new approach to characterize IP backbone topologies , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[4]  Antonio Nucci,et al.  The problem of synthetically generating IP traffic matrices: initial recommendations , 2005, CCRV.

[5]  Chen-Nee Chuah,et al.  Failure Inferencing Based Fast Rerouting for Handling Transient Link and Node Failures , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[7]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[8]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[9]  Jennifer Rexford,et al.  BGP routing policies in ISP networks , 2005, IEEE Network.

[10]  Christophe Diot,et al.  Pop-level and access-link-level traffic dynamics in a tier-1 POP , 2001, IMW '01.

[11]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[12]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[13]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[14]  Renata Teixeira,et al.  Network sensitivity to hot-potato disruptions , 2004, SIGCOMM '04.

[15]  Stewart Bryant,et al.  A Framework for Loop-Free Convergence , 2010, RFC.

[16]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[17]  Bianca Schroeder,et al.  IGP link weight assignment for transient link failures , 2003 .

[18]  Chen-Nee Chuah,et al.  A case for using service availability to characterize IP backbone topologies , 2006, Journal of Communications and Networks.

[19]  Olivier Bonaventure,et al.  Avoiding transient loops during IGP convergence in IP networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Chen-Nee Chuah,et al.  Proactive vs reactive approaches to failure resilient routing , 2004, IEEE INFOCOM 2004.

[21]  E. Chaput,et al.  IP/MPLS satellite network convergence in ULISS project , 2008, 2008 10th International Workshop on Signal Processing for Space Communications.

[22]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[23]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[24]  Antonio Nucci,et al.  IGP Link Weight Assignment for Operational Tier-1 Backbones , 2007, IEEE/ACM Transactions on Networking.

[25]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[26]  Chen-Nee Chuah,et al.  Mitigating transient loops through interface-specific forwarding , 2008, Comput. Networks.

[27]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[28]  Chen-Nee Chuah,et al.  The impact of BGP dynamics on intra-domain traffic , 2004, SIGMETRICS '04/Performance '04.

[29]  Renata Teixeira,et al.  Managing routing disruptions in Internet service provider networks , 2006, IEEE Communications Magazine.

[30]  Christophe Diot,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.

[31]  Faisal Aslam,et al.  Online routing of bandwidth guaranteed paths with local restoration using optimized aggregate usage information , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[32]  Chen-Nee Chuah,et al.  Graceful Network Operations , 2009, IEEE INFOCOM 2009.