Shrinking and Controlling Routing Table Size Xinyang (Joy) Zhang Paul Francis Jia Wang Kaoru Yoshida.

Slides:



Advertisements
Similar presentations
Multihoming and Multi-path Routing
Advertisements

MPLS VPN.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v MPLS VPN Technology Introducing the MPLS VPN Routing Model.
Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
Deployment of MPLS VPN in Large ISP Networks
Dynamic Routing Overview 1.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Best Practices for ISPs
1 Internet Path Inflation Xenofontas Dimitropoulos.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
DYNAMICS OF PREFIX USAGE AT AN EDGE ROUTER Kaustubh Gadkari, Dan Massey and Christos Papadopoulos 1.
An Operational Perspective on BGP Security Geoff Huston GROW WG IETF 63 August 2005.
1 BGP Security -- Zhen Wu. 2 Schedule Tuesday –BGP Background –" Detection of Invalid Routing Announcement in the Internet" –Open Discussions Thursday.
MPLS and Traffic Engineering
Anycast Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Routing of Outgoing Packets with MP-TCP draft-handley-mptcp-routing-00 Mark Handley Costin Raiciu Marcelo Bagnulo.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—4-1 MPLS VPN Technology Forwarding MPLS VPN Packets.
Network based IP VPN Architecture using Virtual Routers Jessica Yu CoSine Communications, Inc. Feb. 19 th, 2001.
Better by a HAIR: Hardware-Amenable Internet Routing Brent Mochizuki University of Illinois at Urbana-Champaign Joint work with: Firat Kiyak (Illinois)
Computer Networks Layering and Routing Dina Katabi
CRIO: Scaling IP Routing with the Core Router-Integrated Overlay Xinyang (Joy) Zhang Paul Francis Jia Wang Kaoru Yoshida.
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)
RRG Recommendation IETF77 March 26, 2010.
Autonomicity in Virtual Private Network provisioning for enterprises GLOBECOM Workshops (GC Wkshps), 2010 IEEE.
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
BGP ANYCAST Simulations Using GTNetS (work in progress) Talal Jaafar Georgia Tech & CAIDA.
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
RSC Part II: Network Layer 6. Routing in the Internet (2 nd Part) Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are,
DMAP : Global Name Resolution Services Through Direct Mapping Tam Vu, Akash Baid WINLAB, Rutgers University (Joint.
CS 3830 Day 29 Introduction 1-1. Announcements r Quiz 4 this Friday r Signup to demo prog4 (all group members must be present) r Written homework on chapter.
HAIR: Hierarchical Architecture for Internet Routing Anja Feldmann TU-Berlin / Deutsche Telekom Laboratories Randy Bush, Luca Cittadini, Olaf Maennel,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Chapter 9. Implementing Scalability Features in Your Internetwork.
LISP BOF, IETF Dublin, July, 2008 Vince Fuller (for the LISP crew) LISP+ALT Mapping System.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
Cisco Global Routing Summit, August, 2008 Vince Fuller (for the LISP crew) Introduction to LISP+ALT.
RIPE Berlin – May, 2008 Vince Fuller (for Dino, Dave, Darrel, et al) LISP: Intro and Update
More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.
On Understanding of Transient Interdomain Routing Failures Feng Wang, Lixin Gao, Jia Wang, and Jian Qiu Department of Electrical and Computer Engineering.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
Multimedia & Mobile Communications Lab.
1 Evolution Towards Global Routing Scalability draft-zhang-evolution-01 Varun Khare Beichuan Zhang
LISP Deployment Scenarios Darrel Lewis and Margaret Wasserman IETF 76, Hiroshima, Japan.
Internet Protocol: Routing IP Datagrams Chapter 8.
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
1 Agenda for Today’s Lecture The rationale for BGP’s design –What is interdomain routing and why do we need it? –Why does BGP look the way it does? How.
1 Auto-Detecting Hijacked Prefixes? Routing SIG 7 Sep 2005 APNIC20, Hanoi, Vietnam Geoff Huston.
Tracking the Internet’s BGP Table Geoff Huston Telstra December 2000.
RRG Nov 08 Mapped BGP Paul Francis, Cornell Xiaohu Xu, Huawei Hitesh Ballani, Cornell.
1 John Scudder, David Ward Emerging Routing Issues.
Inter-domain Routing Outline Border Gateway Protocol.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
IDR WG, IETF Dublin, August, 2008 Vince Fuller (for the LISP crew) LISP+ALT Mapping System.
Advanced Computer Networks
Working at a Small-to-Medium Business or ISP – Chapter 6
Connecting an Enterprise Network to an ISP Network
Evolution Towards Global Routing Scalability
Virtual Aggregation (VA)
2-Phased Mapping for Internet Core/Edge Split Scheme
Presenter: Jeffrey Zhang
IDR WG, IETF Dublin, July, 2008 Vince Fuller (for the LISP crew)
Routing Challenges and Proposals (IS-IS)
Working at a Small-to-Medium Business or ISP – Chapter 6
COS 461: Computer Networks
BGP Instability Jennifer Rexford
Presentation transcript:

Shrinking and Controlling Routing Table Size Xinyang (Joy) Zhang Paul Francis Jia Wang Kaoru Yoshida

Outline We have a trick for making routing tables very small  Global IP, VPNs  Called “CRIO” (Core-Router Integrated Overlay)

1977 Folks were looking at the basic trade-off between routing table size and path length

1977 Folks were looking at the basic trade-off between routing table size and path length

1977 Folks were looking at the basic trade-off between routing table size and path length

Path-length / Table size trade-off A nice trade-off to have This trade-off doesn’t exist today  Hierarchical nature of internet “forces” an ISP- centric address assignment model  Because of multi-homing, sites don’t fit neatly into a single “cloud”

CRIO has two parts Mapping/tunneling part  Can operate stand-alone Virtual prefix part  Requires mapping/tunneling

Mapping/tunneling part BGP keeps routes to major POPs only  1000 – 2000 of these  One prefix per POP Separate mapping table binds customer prefixes to POPs (ETR address in POP) Forwarding is two-step:  Map address to ETR  Tunnel packet to ETR address Not a new idea  Deering’s Map-N-Encap, Kim Claffy et. al.

Distributed route computation vs. Data distribution Shifts work from distributed route computation problem to data distribution problem  Easier to debug Mapping table is the same everywhere, BGP RIBs are not  Easier to secure Secure mapping only, not entire path Streamlined BGP can converge faster  A small number of very stable prefixes  Operators could crank down the timers

Mapping Distribution One possibility (in original CRIO)  Handling by mapping agents (boxes separate from routers)  OSPF-like flooding across agent overlay Alternatives  Handling by routers, using BGP (Atomized Routing)  Handling by routers, using ICMP-like notification (LISP)

Mapping Dynamics (using agents) ISP1 CE ETR1 ETR2 X ITR Agent prefix withdrawn (via IBGP) mapping invalid (via flooding) Selectively install ISP2

Other mapping characteristics Provides a new policy hook  For multi-homed nodes, mapping can indicate access preference Tunneling Mechanisms  One-ended: TE accepts tunnels packets regardless of where they came from. IP/IP Mapping Authentication

Mapping doesn’t shrink FIB per se Mapping appears as FIB entries FIB might become larger  fine-grained multi-homing Use Virtual Prefix to shrink the FIB size

Virtual Prefixes: an Illustration Mappings for a given virtual super-prefix are stored only at selected routers These routers advertise the virtual prefix into BGP Customer Site CE /24 ETR ITR1 ITR2 Prefix TE Source ETR ---- BGP ITR BGP /24 ETR Mapping Prefix TE Source ETR ---- BGP /24 ETR Mapping Virtual Prefix Adv / / BGP ETR

Virtual Prefixes Mapping tables and FIBs are smaller, paths might be longer  Few prefixes handle most traffic  Routers could shed most of their prefixes with very little path length penalty  Save routers from handling large amount of mapping updates Virtual Prefix vs. Caching

(RIB has around 2000 prefixes) Random across all ISPs Each ISP has all prefixes All intra-ISP routes are shortest path Path length versus FIB size (for global IP routing)

Path length versus FIB size for VPN routing

Really small FIBs Can shrink the “mapping” FIB component almost arbitrarily  By chaining tunnels (even within a single POP or router)

Chained tunnels

Conclusion CRIO gives us back the path-length / table- size trade-off  We have shown this for global IP and VPNs Interesting, but not clear how valuable this is  Faster and simpler BGP?  Better multi-homed traffic engineering?  Smaller FIB?