Traffic-Oblivious Routing for Guaranteed Bandwidth Performance

A virtual private network provides network connectivity among the different sites of an enterprise. The bandwidth requirement of a VPN is typically specified by peak ingress-egress traffic volumes for each site. The actual distribution of traffic from each site to other sites in the VPN is not known a priori and could vary over time (e.g., at an intra-day or daily level or due to special activities). This is captured by the hose traffic model. It is the responsibility of the Internet service provider to provision the VPN so that variable traffic subject to aggregate ingress-egress constraints can be transported with bandwidth guarantees. We describe a capacity-efficient, robust, and traffic-oblivious routing strategy, called two-phase routing, that allows preconfiguration of the VPN such that all traffic patterns permissible within the network's natural ingress-egress capacity constraints can be routed with bandwidth guarantees. The scheme routes traffic in two phases: traffic entering the VPN is sent from the source to a set of intermediate nodes in predetermined split ratios that depend on the intermediate nodes, and then from the intermediate nodes to the final destination. (The traffic split ratios can also be generalized to depend on the source and/or destination of traffic.) A significant benefit of the described schemes is that the network can be configured for completely static operation while providing service-level guarantees to widely varying VPN traffic. This is unlike previous approaches based on direct source-destination routing, which need dynamic adaptation to changing traffic conditions in order to provide service-level guarantees

[1]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[2]  Christophe Diot,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.

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

[4]  P.J. Winzer Randomized load balancing and T-WDM ring networks (Abstract only) , 2005 .

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

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

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  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.

[9]  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.

[10]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[11]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..

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

[13]  Scott Shenker,et al.  Internet indirection infrastructure , 2004, TNET.