Traffic Engineering with MPLS
Traffic Engineering with AIMD in MPLS Networks
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
IEEE/ACM Transactions on Networking (TON)
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Adaptive control algorithms for decentralized optimal traffic engineering in the internet
IEEE/ACM Transactions on Networking (TON)
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stealth probing: efficient data-plane security for IP routing
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
IGP link weight assignment for operational Tier-1 backbones
IEEE/ACM Transactions on Networking (TON)
End-to-end optimal algorithms for integrated QoS, traffic engineering, and failure recovery
IEEE/ACM Transactions on Networking (TON)
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
Efficient distributed bandwidth management for MPLS fast reroute
IEEE/ACM Transactions on Networking (TON)
Path-quality monitoring in the presence of adversaries
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Characterization of failures in an operational IP backbone network
IEEE/ACM Transactions on Networking (TON)
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
VL2: a scalable and flexible data center network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Dynamic route recomputation considered harmful
ACM SIGCOMM Computer Communication Review
Reliable adaptive multipath provisioning with bandwidth and differential delay constraints
INFOCOM'10 Proceedings of the 29th conference on Information communications
R3: resilient routing reconfiguration
Proceedings of the ACM SIGCOMM 2010 conference
SPAIN: COTS data-center Ethernet for multipathing over arbitrary topologies
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
YAMR: yet another multipath routing protocol
ACM SIGCOMM Computer Communication Review
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Revisiting routing control platforms with the eyes and muscles of software-defined networking
Proceedings of the first workshop on Hot topics in software defined networks
Joint coverage and link utilization for fast IP local protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ensuring connectivity via data plane mechanisms
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
B4: experience with a globally-deployed software defined wan
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
FatTire: declarative fault tolerance for software-defined networks
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Today's networks typically handle traffic engineering (e.g., tuning the routing-protocol parameters to optimize the flow of traffic) and failure recovery (e.g., pre-installed backup paths) independently. In this paper, we propose a unified way to balance load efficiently under a wide range of failure scenarios. Our architecture supports flexible splitting of traffic over multiple precomputed paths, with efficient path-level failure detection and automatic load balancing over the remaining paths. We propose two candidate solutions that differ in how the routers rebalance the load after a failure, leading to a trade-off between router complexity and load-balancing performance. We present and solve the optimization problems that compute the configuration state for each router. Our experiments with traffic measurements and topology data (including shared risks in the underlying transport network) from a large ISP identify a "sweet spot" that achieves near-optimal load balancing under a variety of failure scenarios, with a relatively small amount of state in the routers. We believe that our solution for joint traffic engineering and failure recovery will appeal to Internet Service Providers as well as the operators of data-center networks.