End-to-End Restorable Oblivious Routing of Hose Model Traffic

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 end-to-end shared backup path restoration. 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. In shared backup path restoration, each connection consists of a link-disjoint primary and backup path pair; two backup paths can share bandwidth on their common links if their primary paths are link-disjoint. We show that the optimization problem for maximum throughput two-phase routing with shared backup path restoration is NP-hard. Assuming an approximation oracle for a certain disjoint paths problem (called SBPR-DISJOINT-PATHS, which is also NP-hard) involving the dual variables of a path indexed linear programming formulation for the problem, we design a combinatorial algorithm with provable guarantees. We also provide heuristics for finding approximating solutions to the SBPR-DISJOINT-PATHS problem. We evaluate the throughput performance and number of intermediate nodes in two-phase routing for the above and other restoration mechanisms for two-phase routing on actual ISP topologies collected for the Rocketfuel project and three research network topologies.

[1]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[2]  Murali S. Kodialam,et al.  Resilient routing of variable traffic with performance guarantees , 2009, 2009 17th IEEE International Conference on Network Protocols.

[3]  Thomas Erlebach,et al.  Optimal bandwidth reservation in hose-model VPNs with multi-path routing , 2004, IEEE INFOCOM 2004.

[4]  Scott Shenker,et al.  Internet indirection infrastructure , 2004, IEEE/ACM Transactions on Networking.

[5]  Edith Cohen,et al.  Coping with network failures: routing strategies for optimal demand oblivious restoration , 2004, SIGMETRICS '04/Performance '04.

[6]  Sudipta Sengupta,et al.  Efficient and robust routing of highly variable traffic , 2005 .

[7]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[9]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.

[10]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[11]  Chung-Lun Li,et al.  Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.

[12]  Murali S. Kodialam,et al.  A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Murali S. Kodialam,et al.  Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  N. McKeown,et al.  Designing a Predictable Internet Backbone Network , 2004 .

[15]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[16]  Murali S. Kodialam,et al.  Throughput Guaranteed Restorable Routing Without Traffic Prediction , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[17]  Yufei Wang,et al.  Optical network design and restoration , 1999, Bell Labs Technical Journal.

[18]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[19]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

[20]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .