Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic

We consider the realization of traffic-oblivious routing in IP-over-optical networks where routers are interconnected over a switched optical backbone. The traffic-oblivious routing we consider is a scheme where incoming traffic is first distributed in a preset manner to a set of intermediate nodes. The traffic is then routed from the intermediate nodes to the final destination. This splitting of the routing into two phases simplifies network configuration significantly. In implementing this scheme, the first and second phase paths are realized at the optical layer with router packet grooming at a single intermediate node only. Given this unreliability of routers, we consider how two-phase routing in IP-over-optical networks can be made resilient against router node failures. We propose two different schemes for provisioning the optical layer to handle router node failures-one that is failure node independent and static, and the other that is failure node dependent and dynamic We develop linear programming formulations for both schemes and a fast combinatorial algorithm for the second scheme so as to maximize network throughput. In each case, we determine (i) the optimal distribution of traffic to various intermediate routers for both normal (no-failure) and failure conditions, and (ii) provisioning of optical layer circuits to provide the needed inter-router links. We evaluate the performance of the two router failure protection schemes and compare it with that of unprotected routing

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

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

[3]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

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

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

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

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

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

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

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

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

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

[14]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

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

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

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

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

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

[20]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

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

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