Source selectable path diversity via routing deflections

We present the design of a routing system in which end-systems set tags to select non-shortest path routes as an alternative to explicit source routes. Routers collectively generate these routes by using tags as hints to independently deflect packets to neighbors that lie off the shortest-path. We show how this can be done simply, by local extensions of the shortest path machinery, and safely, so that loops are provably not formed. The result is to provide end-systems with a high-level of path diversity that allows them to bypass unde-sirable locations within the network. Unlike explicit source routing, our scheme is inherently scalable and compatible with ISP policies because it derives from the deployed Internet routing. We also sug-gest an encoding that is compatible with common IP usage, making our scheme incrementally deployable at the granularity of individual routers.

[1]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[3]  Xiaowei Yang,et al.  NIRA: a new Internet routing architecture , 2003, FDNA '03.

[4]  Deborah Estrin,et al.  Scalable inter-domain routing architecture , 1992, SIGCOMM 1992.

[5]  Ibrahim Matta,et al.  BRITE: A Flexible Generator of Internet Topologies , 2000 .

[6]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[7]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[8]  Radia J. Perlman,et al.  Network layer protocols with Byzantine robustness , 1988 .

[9]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.

[10]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[11]  Jon Crowcroft,et al.  Shortest path first with emergency exits , 1990, SIGCOMM 1990.

[12]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  David R. Cheriton,et al.  Feedback based routing , 2003, CCRV.

[14]  Anna R. Karlin,et al.  Practical network support for IP traceback , 2000, SIGCOMM.

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

[16]  Shivkumar Kalyanaraman,et al.  BANANAS: an evolutionary framework for explicit and multipath routing in the internet , 2003, FDNA '03.

[17]  J. J. Garcia-Luna-Aceves,et al.  MPATH: a loop-free multipath routing algorithm , 2000, Microprocess. Microsystems.

[18]  Dawn Xiaodong Song,et al.  Pi: a path identification mechanism to defend against DDoS attacks , 2003, 2003 Symposium on Security and Privacy, 2003..

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

[20]  Radia J. Perlman,et al.  Routing with Byzantine robustness , 2005 .

[21]  David Thaler,et al.  Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.

[22]  Alex C. Snoeren,et al.  A system for authenticated policy-compliant routing , 2004, SIGCOMM 2004.

[23]  Paul Baran,et al.  On Distributed Communications , 1964 .

[24]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[25]  David Clark,et al.  Tussle in cyberspace: defining tomorrow's internet , 2002, SIGCOMM 2002.

[26]  John Jannotti,et al.  Network layer support for overlay networks , 2002, 2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571).

[27]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.