Scaling the Internet routing table with Locator/ID Separation Protocol (LISP)

Posted in Conferences, Companies, Frameworks, Science on July 06, 2007

Scaling the Internet routing table with Locator/ID Separation Protocol (LISP)
Google Tech Talks
June 12, 2007


This talk introduces a routing protocol approach (Locator/ID Separation Protocol) to solving the scaling problem of the global Internet routing table.

The Problem:
At the October '06 IAB meeting in Amsterdam the highest priority takeaway was the need to devise a scalable routing and addressing system for the Internet. The key points were:
  1. Main driving forces behind the rapid growth of the Internet's DFZ (default-free zone) are multihoming, traffic engineering, non-aggregatable address allocations, and business events such as mergers and acquisitions.
  2. Moore's Law does not apply to building high-end routers as far as cost is concerned. Low-volume, customized silicon used in core routing is well off Moore's Law's cost curve. In short, there are concerns regarding the industry's ability to scale core routing systems in the face of growing RIB (routing information base) sizes.
  3. So-called "locator/identifier overload" of the IP address semantics is one of the causes of the routing scalability problem.

About LISP:
LISP is a simple, incremental, network-based protocol to implement separation of the Internet address into Endpoint IDs and Routing Locators. This mechanism requires no changes to host stacks and no major changes to existing database infrastructures.

Watch Video

Tags: Techtalks, Google, Conferences, Frameworks, Symfony, Science, Lectures, XNA, Computer Science, Broadcasting, Companies