Connectionless Building Blocks For Intra and Inter-Domain Traffic Engineering

We propose new building blocks for connectionless intra-domain and inter-domain traffic engineering (TE) in the Internet. The key idea is to capture an intradomain path, AS-path or an exit route as a 32-bit hash in the packet header. This hash allows explicit “source” directed routing without signaling or high per-packet overhead, while enabling an incremental upgrade strategy for OSPF and BGP. This paper overviews the building blocks and focuses on the inter-domain case, where we consider the problems of a) explicit border router choice and b) an explicit AS path choice. The latter problem in general requires a tradeoff in terms of increased inter-AS control traffic, whereas the former problem can be solved within an AS with partial upgrades. Such explicit routing has the potential to allow a more direct, finer-grained policy control of how traffic is mapped to routes. Simulation and implementation/experimental results illustrate the operation of these building blocks.

[1]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

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

[3]  Devika Subramanian,et al.  An efficient multipath forwarding method , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[4]  Geoff Huston,et al.  Commentary on Inter-Domain Routing in the Internet , 2001, RFC.

[5]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[6]  Kai-Yeung Siu,et al.  Efficient Algorithms for Multi-Path Link-State Routing , 1999 .

[7]  J. Noel Chiappa,et al.  The Nimrod Routing Architecture , 1996, RFC.

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

[9]  EDDIE KOHLER,et al.  The click modular router , 2000, TOCS.

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

[11]  Nick Feamster,et al.  Controlling the impact of bgp policy changes on ip traffic , 2001 .

[12]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.