Controlling Hot Potatoes in Intradomain Traffic Engineering

The growth in Internet connectivity at the Autonomous System (AS) level and the practice of ”hot potato” routing has increased the possibility of interaction between intradomain and interdomain traffic engineering (TE). Hot potato routing occurs when a router inside an AS knows of multiple exit points out of the AS towards a destination, and selects the one that is ”closest” to it. The closeness of exit points is determined by the intradomain routing policy of the AS. In this paper, we use routing, traffic and topology data from the Sprint network to study the interaction between hot potato routing and intradomain TE based on selecting link metrics for the IS-IS (or OSPF) protocol. We find that 60% of network prefixes and 70% of traffic can be potentially affected by hot potato routing. We show that when we do not account for this problem, the results from intradomain TE can be off by 10% of link utilization. We show that considering hot potato routing explicitly when selecting link metrics improves performance by as much as 20% in terms of the maximum link load. Detailed examples are used to provide insights into this performance gain. However, this improvement comes at the cost of an increased sensitivity to changes in link metric values or link failures.

[1]  Anja Feldmann,et al.  NetScope: traffic engineering for IP networks , 2000, IEEE Netw..

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

[3]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.

[4]  John W. Stewart,et al.  BGP4 : inter-domain routing in the Internet , 1998 .

[5]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[6]  Konstantina Papagiannaki,et al.  A pragmatic definition of elephants in internet backbone traffic , 2002, IMW '02.

[7]  Athina Markopoulou,et al.  Characterization of Failures in an IP Backbone Network , 2004, INFOCOM.

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

[9]  Randy H. Katz,et al.  OPCA: robust interdomain policy routing and traffic control , 2003, 2003 IEEE Conference onOpen Architectures and Network Programming..

[10]  Bassam Halabi,et al.  Internet Routing Architectures , 1997 .

[11]  Christophe Diot,et al.  Pop-level and access-link-level traffic dynamics in a tier-1 POP , 2001, IMW '01.

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

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

[14]  Nick Feamster,et al.  Network-wide BGP route prediction for traffic engineering , 2002, SPIE ITCom.

[15]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Geoff Huston,et al.  Analyzing the Internet's BGP Routing Table , 2001 .

[17]  M. Piórob,et al.  On OSPF Related Network Optimisation Problems , 2022 .

[18]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

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