Graceful Network Operations
Authors:
- 1 April 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 289-297
Abstract
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 operation (GNO) 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 GNO problems: (a) 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 (b) 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 GNO solution framework is generic and applies to similar problems with different operational contexts, underlying network protocols or mechanisms, and performance metrics.Keywords
This publication has 17 references indexed in Scilit:
- IGP Link Weight Assignment for Operational Tier-1 BackbonesIEEE/ACM Transactions on Networking, 2007
- Disruption Free Topology Reconfiguration in OSPF Networks2007
- Managing routing disruptions in Internet service provider networksIEEE Communications Magazine, 2006
- Failure Inferencing Based Fast Rerouting for Handling Transient Link and Node Failures2006
- BPG routing policies in ISP networksIEEE Network, 2005
- The problem of synthetically generating IP traffic matricesACM SIGCOMM Computer Communication Review, 2005
- Traffic matrix estimation2002
- OSPF Version 21998
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Fast Algorithms for Geometric Traveling Salesman ProblemsINFORMS Journal on Computing, 1992