Interdomain Multipath Routing

While astonishingly successful, Internet is still less reliable than the phone system and supports very limited user choice and control. As many researchers observed, multipath routing is a promising paradigm to address these issues. In this thesis, we argue that multipath routing can indeed go a long way towards these goals as well as lead to a more scalable, extensible, and evolvable Internet. We begin by describing Yet Another Multipath Routing (YAMR) protocol that provably constructs a set of paths resilient to any one interdomain link failure. YAMR uses an efficient scheme to construct the paths and a novel failure hiding technique to further reduce the control plane overhead. Next, we describe Pathlet Routing, a protocol that departs from the path-vector paradigm. Pathlet routing allows ASes to advertise policy-compliant path segments called pathlets, and allows users to stitch them together, thus forming a complete path suitable for the user's particular needs. Pathlet routing greatly reduces the forwarding table size, can efficiently express a wide class of routing policies, and provide an exponential number of paths to the users. Finally, we investigate how pathlet routing can be a basis for an evolvable Internet architecture.

[1]  Lixin Gao,et al.  Stable Internet routing without global coordination , 2000, SIGMETRICS '00.

[2]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[3]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Joan Feigenbaum,et al.  Mechanism design for policy routing , 2004, PODC '04.

[5]  Mohamed G. Gouda Elements of network protocol design , 1998 .

[6]  Dawn Xiaodong Song,et al.  SIFF: a stateless Internet flow filter to mitigate DDoS flooding attacks , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.

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

[8]  Ankit Singla,et al.  Scalable routing on flat names , 2010, CoNEXT.

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

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

[11]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[12]  Lixin Gao On inferring autonomous system relationships in the internet , 2001, TNET.

[13]  Amin Vahdat,et al.  Graph annotations in modeling complex network topologies , 2007, TOMC.

[14]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[15]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM 2007.

[16]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[17]  Lixin Gao,et al.  A measurement study on the impact of routing events on end-to-end internet path performance , 2006, SIGCOMM.

[18]  Dmitri V. Krioukov,et al.  AS relationships: inference and validation , 2006, CCRV.

[19]  Ion Stoica,et al.  Rule-based Forwarding (RBF): Improving Internet's flexibility and security , 2009, HotNets.

[20]  Arun Venkataramani,et al.  Consensus Routing: The Internet as a Distributed System. (Best Paper) , 2008, NSDI.

[21]  Scott Shenker,et al.  Revisiting IP multicast , 2006, SIGCOMM 2006.

[22]  David D. Clark,et al.  Tussle in cyberspace: defining tomorrow's Internet , 2002, IEEE/ACM Transactions on Networking.

[23]  Michael Walfish,et al.  A layered naming architecture for the internet , 2004, SIGCOMM 2004.

[24]  Scott Shenker,et al.  Routing as a Service , 2006 .

[25]  Ruibing Hao,et al.  An approach to accelerate convergence for path vector protocol , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[26]  Michael J. Freedman,et al.  Service-Centric Networking with SCAFFOLD , 2010 .

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

[28]  Nick Feamster,et al.  Accountable internet protocol (aip) , 2008, SIGCOMM '08.

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

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

[31]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[32]  Tim Roughgarden,et al.  Clean-slate Design for the Internet , 2006 .

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

[34]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM '07.

[35]  Martín Casado,et al.  Ethane: taking control of the enterprise , 2007, SIGCOMM '07.

[36]  Daniel Massey,et al.  BGP-RCN: improving BGP convergence through root cause notification , 2005, Comput. Networks.

[37]  Farnam Jahanian,et al.  Experimental Study of Internet Stabil-ity and Wide-Area Backbone Failures , 1998 .

[38]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[39]  Brighten Godfrey,et al.  YAMR: yet another multipath routing protocol , 2010, CCRV.

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

[41]  Timothy G. Griffin,et al.  An experimental analysis of BGP convergence time , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[42]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[43]  Michael Walfish,et al.  A layered naming architecture for the internet , 2004, SIGCOMM '04.

[44]  Florent Parent,et al.  Routing Policy Specification Language next generation (RPSLng) , 2005, RFC.

[45]  Dino Farinacci,et al.  The Locator/ID Separation Protocol (LISP) , 2009, RFC.

[46]  Brighten Godfrey,et al.  Pathlet routing , 2009, SIGCOMM '09.

[47]  Jaideep Chandrashekar,et al.  Damping BGP route flaps , 2004, Journal of Communications and Networks.

[48]  Srikanth Kandula,et al.  Can you hear me now?!: it must be BGP , 2007, CCRV.

[49]  Lixia Zhang,et al.  Report from the IAB Workshop on Routing and Addressing , 2007, RFC.

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

[51]  X.. Yang,et al.  NIRA: A New Inter-Domain Routing Architecture , 2007, IEEE/ACM Transactions on Networking.

[52]  Jennifer Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM.

[53]  Nick Feamster,et al.  Implications of Autonomy for the Expressiveness of Policy Routing , 2005, IEEE/ACM Transactions on Networking.

[54]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[55]  Jennifer Rexford,et al.  Don't Secure Routing Protocols, Secure Data Delivery , 2006, HotNets.

[56]  Baruch Awerbuch,et al.  Provably competitive adaptive routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[57]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[58]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.

[59]  Matthew Roughan,et al.  BGP beacons , 2003, IMC '03.

[60]  Bruce M. Maggs,et al.  R-BGP: Staying Connected in a Connected World , 2007, NSDI.

[61]  Nick McKeown,et al.  Architecting for innovation , 2011, CCRV.