Theory of linear and integer programming
Theory of linear and integer programming
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Designing least-cost nonblocking broadband networks
Journal of Algorithms
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Internet indirection infrastructure
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
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Coping with network failures: routing strategies for optimal demand oblivious restoration
Proceedings of the joint international conference on Measurement and modeling of computer systems
Efficient and robust routing of highly variable traffic
Efficient and robust routing of highly variable traffic
Oblivious routing of highly variable traffic in service overlays and IP backbones
IEEE/ACM Transactions on Networking (TON)
Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been recently proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Preconfiguring the network in a traffic-independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend this routing scheme by providing resiliency against link failures through fast path restoration along disjoint end-to-end backup paths. We view this as important progress toward adding carrier-class reliability to the robustness of the scheme so as to facilitate its future deployment in Internet service provider (ISP) networks. On the theoretical side, the main contribution of the paper is the development of linear-programming-based and fast combinatorial algorithms for two-phase routing with fast path restoration so as to minimize the maximum utilization of any link in the network, or equivalently, maximize the throughput. The algorithms developed are fully polynomial time approximation schemes (FPTAS)-for any given ε 0, an FPTAS guarantees a solution that is within a (1 + ε)-factor of the optimum and runs in time polynomial in the input size and 1/ε. To the best of our knowledge, this is the first work in the literature that considers making the scheme resilient to link failures through preprovisioned fast restoration mechanisms. We evaluate the performance of fast path restoration (in terms of throughput) and compare it to that of unprotected routing. For our experiments, we use actual ISP network topologies collected for the Rocketfuel project and three research network topologies.