1. LISP Traffic Engineering
draft-farinacci-lisp-te-01
Dino Farinacci
Cisco Systems
Parantap Lahiri
Microsoft Corporation
Michael Kowal

2. Problem Statement LISP provides data-path stretch = 1
When encapsulating from ITR to ETR
What if stretch = 1 path is congested?
Could we hair-pin as a feature?
To find a better performing data path

3. Re-Encapsulation Points
RTR ‘Y’ decaps packet and performs lookup on dest EID for ELP (if not cached)
RTR ‘Y’ encaps packet to ETR
RTR ‘X’ decaps packet and performs lookup on dest EID for ELP (if not cached)
EID-prefix: 2001:db8:2::/48
Locator-set: (x,y,ETR): priority 1, weight 100
EID-prefix: 2001:db8:2::/48
Locator-set: (x,y,ETR): priority 1, weight 100
EID RLOC a.a.a.0/24 w.x.y.1
c.c.c.0/24 z.q.r.5
b.b.b.0/24 x.y.w.2
d.d.0.0/16 z.q.r.5
MS/MR
EID-prefix: 2001:db8:2::/48
Locator-set: (x,y,ETR): priority 1, weight 100
ELPs provisioned via Programmable Interface
ITR encapsulates to RLOC ‘X’
RTR
RTR X Y A B C D
ITR
ETR
LISP encapsulation

4. Recursion § EID-prefix: ETR
EID-prefix: RTR-Y
Locator-set: (e,f,y): priority 1, weight 100
(y) : priority 2, weight 100
EID-prefix: ETR
Locator-set: (x,e,f,y,ETR): priority 1, weight 100
(x,y,ETR): priority 2, weight 100
RTR ‘X’ performs lookup on ETR ‘ETR’
L-bit setting for ‘Y’ determines: re-encap or lookup
RTR
RTR E F
RTR
RTR X Y A B C D
ITR
ETR
LISP encapsulation

5. Service Chaining ITR ETR RTR RTR Scrubber Honey-pot
sEID
ITR
ETR
dEID
RTR
RTR
Service Chain described by ELP
Scrubber
Service described by EID in mapping database
Honey-pot
Deep Packet Inspection