Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones

The emergence of new applications on the Internet like voice-over-IP, peer-to-peer, and video-on-demand has created highly dynamic and changing traffic patterns. In order to route such traffic with quality-of-service (QoS) guarantees without requiring detection of traffic changes in real-time or reconfiguring the network in response to it, a routing and bandwidth allocation scheme has been recently proposed that allows preconfiguration of the network such that all traffic patterns permissible within the network's natural ingress-egress capacity constraints can be handled in a capacity efficient manner. The scheme routes traffic in two phases. In the first phase, incoming traffic is sent from the source to a set of intermediate nodes and then, in the second phase, from the intermediate nodes to the final destination. The traffic in the first phase is distributed to the intermediate nodes in predetermined proportions that depend on the intermediate nodes. In this paper, we develop linear programming formulations and a fast combinatorial algorithm for routing under the scheme so as to maximize throughput (or, minimize maximum link utilization). We compare the throughput performance of the scheme with that of the optimal scheme among the class of all schemes that are allowed to even make the routing dependent on the traffic matrix. For our evaluations, we use actual Internet Service Provider topologies collected for the Rocketfuel project. We also bring out the versatility of the scheme in not only handling widely fluctuating traffic but also accommodating applicability to several widely differing networking scenarios, including i) economical Virtual Private Networks (VPNs); ii) supporting indirection in specialized service overlay models like Internet Indirection Infrastructure (i3); iii) adding QoS guarantees to services that require routing through a network-based middlebox; and iv) reducing IP layer transit traffic and handling extreme traffic variability in IP-over-optical networks without dynamic reconfiguration of the optical layer. The two desirable properties of supporting indirection in specialized service overlay models and static optical layer provisioning in IP-over-optical networks are not present in other approaches for routing variable traffic, such as direct source-destination routing along fixed paths.

[1]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[2]  Walid Ben-Ameur,et al.  NEW ECONOMICAL VIRTUAL PRIVATE NETWORKS , 2003 .

[3]  Farnam Jahanian,et al.  Experimental study of Internet stability and backbone failures , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).

[4]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2002, TNET.

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

[6]  Walid Ben-Ameur,et al.  Networks new economical virtual private , 2003, CACM.

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

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

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

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

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

[12]  Vijay P. Kumar,et al.  Switched optical backbone for cost-effective scalable core IP networks , 2003, IEEE Commun. Mag..

[13]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[14]  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).

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

[16]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[17]  Murali S. Kodialam,et al.  Maximum Throughput Routing of Traffic in the Hose Model , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

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

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

[21]  Nick McKeown,et al.  Designing a Predictable Internet Backbone with Valiant Load-Balancing , 2005, IWQoS.

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

[23]  MedinaA.,et al.  Traffic matrix estimation , 2002 .

[24]  Kavé Salamatian,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.

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

[26]  David Thaler,et al.  Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.