Routing on Flat Labels - PowerPoint PPT Presentation

1 / 18
About This Presentation
Title:

Routing on Flat Labels

Description:

Hierarchical addressing allows excellent scaling properties ... Since topology is not static, addresses can't persistently identify hosts. ISP. 169.229.62.134 ... – PowerPoint PPT presentation

Number of Views:215
Avg rating:3.0/5.0
Slides: 19
Provided by: mcca3
Category:

less

Transcript and Presenter's Notes

Title: Routing on Flat Labels


1
Routing on Flat Labels
  • Matthew Caesar, Tyson Condie, Jayanthkumar
    Kannan,
  • Karthik Lakshminarayanan, Ion Stoica, Scott
    Shenker
  • UC Berkeley

2
Whats wrong with Internet addressing today?
ISP
169.229.62.0/24
  • Hierarchical addressing allows excellent scaling
    properties
  • But, forces addressing to conform to network
    topology
  • Since topology is not static, addresses cant
    persistently identify hosts

3
Whats wrong with Internet addressing today?
  • But most network applications today require
    persistent identity
  • Its hard to provide persistent identity in
    presence of hierarchical addressing
  • Need to decouple identity from addressing
  • Drastically complicates network configuration,
    mobility, address assignment
  • Is hierarchy the only way to scale routing?

4
Is there an alternative?
  • Why not route on flat host identifiers?
  • Assign addresses independently of network
    topology
  • Benefits
  • No separate name resolution system required
  • Simpler network config/allocation/mobility
  • Simpler network-layer access controls

5
Is it possible to route on flat identifiers?
  • Challenge flat identifiers break aggregation
  • Is it possible to scalably route without
    aggregation?
  • Cant use a DHT
  • Assumes point-to-point routing
  • Doesnt support routing policies

6
Basic idea behind ROFL
  • Scalable routing on flat identifiers
  • Goal 1 Scale to Internet topologies
  • Goal 2 Support for BGP policies
  • Highly challenging problem, but solution would
    give a number of benefits

7
Basic mechanisms behind ROFL
  • Goal 1 Scale to Internet topologies
  • Mechanism DHT-style routing, maintain
    source-routes to successors/fingers
  • Provides Scalable network routing without
    aggregation
  • Goal 2 Support for BGP policies
  • Mechanism Intelligently choose
    successors/fingers to conform to ISP
    relationships
  • Provides Support for policies, operational model
    of BGP

8
How ROFL works
1. hosts are assigned topology-independent flat
identifiers
9
Internet policies today
  • Economic relationships peer, provider/customer
  • Isolation routing contained within hierarchy
  • Economic relationships peer, provider/customer
  • Isolation routing contained within hierarchy

10
Isolation in ROFL (Canon)
? Traffic between two hosts traverses no higher
than their lowest common provider in the AS
hierarchy
11
Policy support in ROFL
A
B
C
Peering link
  • Peering
  • Provider-customer
  • Backup

? Traffic respects peering, backup, and
provider-customer relationships
12
Scalability in ROFL
  • Two extensions to improve locality
  • Maintain proximity-based fingers in a policy-safe
    fashion
  • Pointer caching strategies prefer nearby,
    popular pointers

13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
Conclusion
  • Routing On Flat Labels should not leave you
    Rolling On the Floor Laughing
  • Because performance is tolerable
  • Because it provides several benefits
  • ROFL is one point in the design space
  • ROFL as lookup
  • ROFL for content routing
Write a Comment
User Comments (0)
About PowerShow.com