Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Can you hear me now?!: it must be BGP
ACM SIGCOMM Computer Communication Review
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Ethane: taking control of the enterprise
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
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
NOX: towards an operating system for networks
ACM SIGCOMM Computer Communication Review
Consensus routing: the internet as a distributed system
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
The resource pooling principle
ACM SIGCOMM Computer Communication Review
Characterization of failures in an operational IP backbone network
IEEE/ACM Transactions on Networking (TON)
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Virtual routers as a service: the RouteFlow approach leveraging software-defined networks
Proceedings of the 6th International Conference on Future Internet Technologies
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Taming uncertainties in real-time routing for wireless networked sensing and control
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
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
Tradeoffs in CDN designs for throughput oriented traffic
Proceedings of the 8th international conference on Emerging networking experiments and technologies
A case for stateful forwarding plane
Computer Communications
Optimal multipath forwarding in planned Wireless Mesh Networks
Computer Communications
Hi-index | 0.01 |
This paper advocates a different approach to reduce routing convergence--side-stepping the problem by avoiding it in the first place! Rather than recomputing paths after temporary topology changes, we argue for a separation of timescale between offline computation of multiple diverse paths and online spreading of load over these paths. We believe decoupling failure recovery from path computation leads to networks that are inherently more efficient, more scalable, and easier to manage.