How can multi-topology routing be used for intradomain traffic engineering?

Multi-Topology routing allows each router in a network to maintain several valid routes to each destination. This increases the possibilities to spread traffic towards a destination over multiple paths with connectionless routing protocols like OSPF or IS-IS. In this paper, we report early ideas on how this can be utilized as a Traffic Engineering tool. We look at both offline and online approaches, and argue that a Multi-Topology based solution has advantages over previous solutions in both paradigms.

[1]  Albert G. Greenberg,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM.

[2]  Stein Gjessing,et al.  Fast IP Network Recovery Using Multiple Routing Configurations , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  Anees Shaikh,et al.  A measurement-based analysis of multihoming , 2003, SIGCOMM '03.

[4]  Renata Teixeira,et al.  Network sensitivity to hot-potato disruptions , 2004, SIGCOMM '04.

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

[6]  Srikanth Kandula,et al.  Dynamic load balancing without packet reordering , 2007, CCRV.

[7]  Jon G. Riecke,et al.  Stability issues in OSPF routing , 2001, SIGCOMM.

[8]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[9]  Steve Uhlig,et al.  Providing public intradomain traffic matrices to the research community , 2006, CCRV.

[10]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[11]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[12]  Stein Gjessing,et al.  Fast recovery from link failures using resilient routing layers , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[13]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Roch Guérin,et al.  Making IGP Routing Robust to Link Failures , 2005, NETWORKING.

[15]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

[16]  Debasis Mitra,et al.  A case study of multiservice, multipriority traffic engineering design for data networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[17]  Peter Psenak.  MT-OSPF: Multi Topology (MT) Routing in OSPF , 2004 .

[18]  Mikkel Thorup,et al.  Robust optimization of OSPF/IS-IS weights , 2003 .

[19]  Xiaowei Yang,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM.

[20]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

[21]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Konstantina Papagiannaki,et al.  Traffic matrices: balancing measurements, inference and modeling , 2005, SIGMETRICS '05.

[23]  Bianca Schroeder,et al.  IGP link weight assignment for transient link failures , 2003 .