2009 17th IEEE International Conference on Network Protocols (2009)
Princeton, NJ USA
Oct. 13, 2009 to Oct. 16, 2009
Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Pre-configuring 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 shared backup path restoration. We view this as important progress towards 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.
telecommunication traffic, approximation theory, combinatorial mathematics, communication complexity, Internet, linear programming, telecommunication network reliability, telecommunication network routing, Rocketfuel project, variable traffic, two-phase routing, shared backup path restoration, carrier-class reliability, Internet service provider networks, optimization problem, NP-hard, disjoint paths problem, SBPR-DISJOINT-PATHS, path indexed linear programming formulation, combinatorial algorithm, approximating solutions, Routing, Telecommunication traffic, Throughput, Robustness, Web and internet services, Bandwidth, Linear programming, Algorithm design and analysis, Approximation algorithms, Topology
"Resilient routing of variable traffic with performance guarantees," 2009 17th IEEE International Conference on Network Protocols(ICNP), Princeton, NJ USA, 2009, pp. 213-222.