1-2pm Tue June 7 talk on network optimization in CS 302
Speaker: Sanjay Rao, Purdue University Title: Robust Guarantees for Networks with Flexible Routing Date/time: 1-2pm Tuesday June 7 Location: CS 302 Abstract: A key challenge confronting network designers is verifying that their networks can properly cope with a wide range of traffic conditions and failure scenarios. Since many design choices (e.g., topology design, middlebox placement) are made over longer time-scales and cannot be easily adapted, it is important to ensure that a given design choice can perform well across traffic demands and failures. In this paper, we develop an optimization-theoretic framework to provide guaranteed bounds on link utilization across traffic patterns and failure scenarios of interest, while considering flexible routing strategies optimized for the specific scenario. Considering flexible routing strategies is important since oblivious strategies can be unduly conservative, but poses theoretical challenges that we address. We apply our framework to multiple case studies including design of MPLS tunnels, and routing in the presence of middleboxes. Evaluations over real network topologies and traffic data show the promise of the approach.
Reminder: talk today at 1pm in CS 302
Speaker: Sanjay Rao, Purdue University Title: Robust Guarantees for Networks with Flexible Routing Date/time: 1-2pm Tuesday June 7 Location: CS 302
Abstract:
A key challenge confronting network designers is verifying that their networks can properly cope with a wide range of traffic conditions and failure scenarios. Since many design choices (e.g., topology design, middlebox placement) are made over longer time-scales and cannot be easily adapted, it is important to ensure that a given design choice can perform well across traffic demands and failures. In this paper, we develop an optimization-theoretic framework to provide guaranteed bounds on link utilization across traffic patterns and failure scenarios of interest, while considering flexible routing strategies optimized for the specific scenario. Considering flexible routing strategies is important since oblivious strategies can be unduly conservative, but poses theoretical challenges that we address. We apply our framework to multiple case studies including design of MPLS tunnels, and routing in the presence of middleboxes. Evaluations over real network topologies and traffic data show the promise of the approach.
participants (1)
-
Jennifer Rexford