Efficient and robust routing of highly variable traffic

This thesis proposes two-phase routing as a capacity efficient and robust strategy for handling highly variable traffic. The scheme allows preconfiguration of the network such that all traffic patterns permissible within the network's natural ingress-egress capacity constraints can be routed with bandwidth guarantees without requiring detection of traffic changes in real-time or reconfiguring the network in response to it. The scheme routes traffic in two phases---traffic entering the network 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 scheme has the desirable properties of supporting static optical layer provisioning in IP-over-Optical networks and indirection in specialized service overlay models unlike previous approaches---like direct source-destination path routing---for handling variable traffic. This thesis represents the first comprehensive study, problem formulation, and algorithm design for many aspects of two-phase routing. Our contributions can be grouped into three broad parts. First, we consider the problems of minimum cost network design and maximum throughput network routing for the scheme. We give a simple solution for minimum cost network design. For maximum throughput network routing, we design linear programming based and combinatorial algorithms. We show how the algorithms can handle a, total cost constraint for maximum throughput two-phase routing. This can be used to solve the link capacitated version of minimum cost two-phase routing. We establish theoretical bounds on the resource requirements of two-phase routing under throughput and cost models with respect to the optimal scheme that is allowed to make the routing dynamically dependent on the current traffic matrix. We also generalize the traffic split ratios to depend not only on the intermediate nodes but also on source and destination of traffic and solve the corresponding optimization problems. Second, we consider making two-phase routing resilient to network failures. Two-phase routing in IP-over-Optical networks can be protected against router node failures through redistribution of traffic split ratio for the failed router node to other intermediate nodes. We propose two different schemes for provisioning the optical layer to handle router node failures. We develop linear programming formulations for both schemes and a fast combinatorial algorithm for the second scheme so as to maximize network throughput. Third, we consider the application of two-phase routing to multi-hop Wireless Mesh Networks (WMNs). These networks have recently been of much research interest due to their lowered need for wired infrastructure support and due to envisaged new applications like community wireless networks. We extend our optimization framework for maximum throughput two-phase routing in wired networks to handle routing and scheduling constraints that are peculiar to WMNs and arise from the requirement to handle radio transmit/receive diversity and the phenomenon of wireless link interference. We evaluate various aspects of two-phase routing on actual ISP topologies using the developed algorithms. For the WMN application, we use randomly generated WMN topologies for the evaluations. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.) (Abstract shortened by UMI.)

[1]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[2]  Ashish Goel,et al.  Efficient computation of delay-sensitive routes from one source to all destinations , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

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

[5]  L. Lovász A Characterization of Perfect Graphs , 1972 .

[6]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  G. Ziegler Lectures on Polytopes , 1994 .

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

[11]  W. Norton,et al.  Internet Service Providers and Peering , 2001 .

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

[13]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[14]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..

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

[16]  Renata Teixeira,et al.  Dynamics of hot-potato routing in IP networks , 2004, SIGMETRICS '04/Performance '04.

[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]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

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

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

[22]  Carsten Lund,et al.  An information-theoretic approach to traffic matrix estimation , 2003, SIGCOMM '03.

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

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

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

[26]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.

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

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

[29]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

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

[31]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering , 2002, Computer Communications.

[32]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.