Overlay-based IP Routing Richard Hartmann Chair for Network - - PowerPoint PPT Presentation

overlay based ip routing
SMART_READER_LITE
LIVE PREVIEW

Overlay-based IP Routing Richard Hartmann Chair for Network - - PowerPoint PPT Presentation

Overlay-based IP Routing Richard Hartmann Chair for Network Architectures and Services Department for Computer Science Technische Universit at M unchen November 10, 2010 Richard Hartmann: Overlay-based IP Routing 1 Outline Motivation


slide-1
SLIDE 1

Overlay-based IP Routing

Richard Hartmann

Chair for Network Architectures and Services Department for Computer Science Technische Universit¨ at M¨ unchen

November 10, 2010

Richard Hartmann: Overlay-based IP Routing 1

slide-2
SLIDE 2

Outline

1

Motivation for Overlay-based IP Routing

2

Considerations

3

Preliminary results

4

Tasks

5

Timeline

Richard Hartmann: Overlay-based IP Routing 2

slide-3
SLIDE 3

Outline

1

Motivation for Overlay-based IP Routing

2

Considerations

3

Preliminary results

4

Tasks

5

Timeline

Richard Hartmann: Overlay-based IP Routing 3

slide-4
SLIDE 4

Motivation

Route around failure conditions

New prefixes/AS numbers Stale routes Routing loops Defective routers in the backbone Deliberate null routing

Avoid saturated links Load-balancing Test-bed for routing mechanisms

On demand & event-driven DHT-based with cached results

Secondary considerations

Firewalls NAT Censorship

Richard Hartmann: Overlay-based IP Routing 4

slide-5
SLIDE 5

Routing scenarios

Simple case: routing between participants

h i rn r 1

Richard Hartmann: Overlay-based IP Routing 5

slide-6
SLIDE 6

Routing scenarios

Slightly more complicated: routing to non-participant

h rn r 1

1

h x

Richard Hartmann: Overlay-based IP Routing 6

slide-7
SLIDE 7

Routing scenarios

Advanced: routing between participating networks

h i rn r 1

1

h i 1

Richard Hartmann: Overlay-based IP Routing 7

slide-8
SLIDE 8

Outline

1

Motivation for Overlay-based IP Routing

2

Considerations

3

Preliminary results

4

Tasks

5

Timeline

Richard Hartmann: Overlay-based IP Routing 8

slide-9
SLIDE 9

Considerations

Scalability

Routing database must scale Routing decisions need to be fast

Efficiency

Low system overhead Good bandwidth utilization

Resilience

Self-regulating Constant self-monitoring Dynamic creation & destruction of tunnels

Usability

Easy to use Transparent to programs High bandwidth Low round trip times Low jitter Routing to nodes within and without the overlay network

Richard Hartmann: Overlay-based IP Routing 9

slide-10
SLIDE 10

Outline

1

Motivation for Overlay-based IP Routing

2

Considerations

3

Preliminary results

4

Tasks

5

Timeline

Richard Hartmann: Overlay-based IP Routing 10

slide-11
SLIDE 11

Preliminary results

Confirmed decision split into separate overlays for routing decision and data transmission Use Pastry for routing decisions Use IP GRE for data transmission

Richard Hartmann: Overlay-based IP Routing 11

slide-12
SLIDE 12

Preliminary results

Why Pastry? Suggestion by Ralph to Nils Full framework with modular structure for DHT, file storage, chat, web cache, content distribution, others Built-in simulator with reliable results Allows tweaking of internal routing metrics Discarded alternative: Kademlia

DHT only Simulated results are different from real-world tests (Ali)

Richard Hartmann: Overlay-based IP Routing 12

slide-13
SLIDE 13

Preliminary results

What is GRE? Generic Routing Encapsulation We are using it for IPv4 Creates a tunnel interface for routing purposes Sending/receiving through tunnel interface will add/strip extra header:

IP header of encapsulation GRE header

Version Encapsulated protocol Sequence number Checksum

Encapsulated paket/datagram

Richard Hartmann: Overlay-based IP Routing 13

slide-14
SLIDE 14

Preliminary results

Why IP GRE? Extremely efficient implementation in Linux Kernel (1-10 Gbit/s full duplex on commodity hardware) Well-established technology Low overhead on nodes No scaling issues

Richard Hartmann: Overlay-based IP Routing 14

slide-15
SLIDE 15

Outline

1

Motivation for Overlay-based IP Routing

2

Considerations

3

Preliminary results

4

Tasks

5

Timeline

Richard Hartmann: Overlay-based IP Routing 15

slide-16
SLIDE 16

Tasks

Implement IP GRE routing policies and templates Enhance Pastry

Code cleanup IPv6 support? Implement event-driven routing Implement DHT-based routing

Test Kammenhuber’s ideas Perform tests & measurements Summarize findings in paper

Richard Hartmann: Overlay-based IP Routing 16

slide-17
SLIDE 17

Outline

1

Motivation for Overlay-based IP Routing

2

Considerations

3

Preliminary results

4

Tasks

5

Timeline

Richard Hartmann: Overlay-based IP Routing 17

slide-18
SLIDE 18

Timeline

September: orientation October: design decisions & proof of concept November – December: proper implementation December – January: writing the DA

Richard Hartmann: Overlay-based IP Routing 18

slide-19
SLIDE 19

The end

Questions?

Richard Hartmann: Overlay-based IP Routing 19