Scaling Internet Routing with Legacy Protocols

Add to your list(s) Download to your calendar using vCal

• Paul Francis (Cornell University)
• Friday 11 January 2008, 16:30-17:30
• Lecture Theatre 2, Computer Laboratory, William Gates Builiding.

If you have a question about this talk, please contact Eiko Yoneki.

The large and constantly growing Internet routing table size is a longstanding problem that leads to increased convergence time, increased boot time, and costly equipment upgrades. The problem exists for both VPN and global routing tables, and there is concern that IPv4 address space exhaustion over the next few years may lead to an increasingly fragmented address space, poor aggregation, and therefore a increase in the rate of routing table size. To address these issues, the IETF is working hard on new protocols that will shrink routing tables. In this talk, we present a way to shrink routing tables, easily by an order of magnitude or more, without any new protocols. The idea behind our approach, called Virtual Aggregation, is to partition the address space into large Virtual Prefixes, each of which is delegated to a tunneled virtual network composed of a fraction of ISP routers. Virtual Aggregation can be used independently by a single ISP , or cooperatively among a group of ISPs. This talk describes how Virtual Aggregation can be configured and deployed, and gives performance results based on measurements made at a Tier-I ISP .

Bio: Paul has been a researcher in computer networking for going on 20 years now, in such organizations as MITRE , Bellcore, NTT Software Labs, and ACIRI . Within computer networking, Paul’s work has centered on routing and addressing, with a particular liking for problems having to do with large and self-configuring networks. Work in this vein extends from Landmark Routing, done in the late 80’s, through Yoid end-system (overlay) multicast (late 90’s), to recent work on unstructured P2P networks and more scalable end-system multicast. Notoriously, Paul is the inventor of NAT (demonstrating originality, if not prognosticative ability, judging from his bank account). Other innovations of Paul’s include shared-tree multicast, IDMaps host proximity service, shortcut routing (through large non-broadcast subnetworks), and the multiple-addresses approach to site multi-homing, which is the basis for scalable routing in IPv6. Paul joined Cornell University in 2002, where he has worked on IP anycast services, new network management architectures, BGP scalability, overlay multicast, random node selection in P2P networks, new transport protocols, E2E approaches to DoS and worm prevention, and new naming and addressing architectures for the Internet.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• CL's SRG seminar
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Computer Laboratory Systems Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Lecture Theatre 2, Computer Laboratory, William Gates Builiding
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.