Pop-level and access-link-level traffic dynamics in a tier-1 POP
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The impact of BGP dynamics on intra-domain traffic
Proceedings of the joint international conference on Measurement and modeling of computer systems
Network sensitivity to hot-potato disruptions
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The problem of synthetically generating IP traffic matrices: initial recommendations
ACM SIGCOMM Computer Communication Review
Planning Algorithms
IGP link weight assignment for operational Tier-1 backbones
IEEE/ACM Transactions on Networking (TON)
Mitigating transient loops through interface-specific forwarding
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Managing routing disruptions in Internet service provider networks
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
BGP routing policies in ISP networks
IEEE Network: The Magazine of Global Internetworking
Route shepherd: stability hints for the control plane
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Abstractions for network update
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Route shepherd: stability hints for the control plane
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Abstractions for network update
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Lossless migrations of link-state IGPs
IEEE/ACM Transactions on Networking (TON)
zUpdate: updating data center networks with zero loss
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Improving network agility with seamless BGP reconfigurations
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.