Optimization of IP Load-Balanced Routing for Hose Model

This paper presents an optimization of IP load-balanced routing for the hose model. We present an IP load-balanced routing scheme based on the two-phase routing over shortest paths. It is called a fine two-phase routing (F-TPR) scheme. In F-TPR, traffic is distributed from a source node to intermediate nodes more finely, compared to the original TPR. F-TPR introduces the distribution ratio to node $m$ that is determined for each source-destination pair of (p,q), k_{m}^{pq}. To determine an optimum set of k_{m}^{pq}, an linear programming (LP) formulation is first derived. However, the formulation is difficult to solve as a simple LP problem. This is because each element of the traffic matrix is not determined because of the hose model and there are too many possible parameters for us to consider. By introducing a duality theorem , we successfully formulate our problem a quadratic constraint programming (QCP) formulation that can be solved to determine the split ratios by using a mathematical programming solver. We compare F-TPR with TPR and the Multi-Protocol Label Switching (MPLS)-Traffic Engeering (TE). Numerical results show that F-TPR reduces the network congestion ratio compared to TPR. Numerical results show that F-TPR greatly reduces the network congestion ratio compared to TPR , and provides the network congestion ratio close to that of MPLS-TE within the difference of 6%.

[1]  M. Kodialam,et al.  Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones , 2009, IEEE/ACM Transactions on Networking.

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

[3]  Chin-Tau A. Lea,et al.  Optimal Link Weights for Maximizing QoS Traffic , 2007, 2007 IEEE International Conference on Communications.

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

[5]  Eiji Oki,et al.  Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model , 2010, IEEE Trans. Commun..

[6]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[7]  Eiji Oki,et al.  F-TPR: fine two-phase IP routing scheme over shortest paths for hose model , 2009, IEEE Communications Letters.

[8]  Eiji Oki,et al.  Fine Two-Phase Routing with Traffic Matrix , 2009, 2009 Proceedings of 18th International Conference on Computer Communications and Networks.

[9]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.

[10]  István Szabó,et al.  On bandwidth efficiency of the hose resource management model in virtual private networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Aditya Kumar Mishra,et al.  S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[12]  Edith Cohen,et al.  Making Routing Robust to Changing Traffic Demands: Algorithms and Evaluation , 2006, IEEE/ACM Transactions on Networking.

[13]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[14]  Hao Wang,et al.  Dynamics of load-sensitive adaptive routing , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[15]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[16]  Nick McKeown,et al.  Designing a Fault-Tolerant Network Using Valiant Load-Balancing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[17]  Aleksandra Smiljanic,et al.  Oblivious Routing Scheme Using Load Balancing Over Shortest Paths , 2008, 2008 IEEE International Conference on Communications.