Internet Engineering Task Force F. Brockners
Internet-Draft S. Bhandari
Intended status: Standards Track F. Maino
Expires: August 17, 2014 D. Lewis
Cisco
February 13, 2014
LISP Extensions for Segment Routing
draft-brockners-lisp-sr-01
Abstract
Segment Routing (SR) combines source routing and tunneling to steer
traffic through the transit network. The Locator/ID Separation
Protocol (LISP) separates IP addresses into Endpoint Identifiers
(EIDs) and Routing Locators (RLOCs) and also leverages tunneling
mechanisms. Mapping between EIDs and RLOCs is facilitated by the
LISP mapping system. Combining LISP and SR enables the LISP mapping
system to provide SR information to encapsulating routers so that
traffic can be steered in the transit network or the list of segments
a particular packet traverses is recorded in the packet header.
This document describes extensions required to the Locator/ID
Separation Protocol (LISP) to enable a LISP mapping system to
communicate list of segment identifiers or the request to record the
list of segments a particular packet traverses to the encapsulating
router.
Status of this Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on August 17, 2014.
Copyright NoticeBrockners, et al. Expires August 17, 2014 [Page 1]Internet-Draft LISP and SR integration February 2014
Copyright (c) 2014 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Conventions . . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Use cases that combine LISP and SR . . . . . . . . . . . . . . 4
3.1. Traffic steering/traffic engineering . . . . . . . . . . . 4
3.2. Traffic tracing . . . . . . . . . . . . . . . . . . . . . 5
4. LISP extensions to support SR . . . . . . . . . . . . . . . . 5
4.1. Deployment Scenario . . . . . . . . . . . . . . . . . . . 7
4.2. Example ELPs . . . . . . . . . . . . . . . . . . . . . . . 7
4.2.1. Example: ELP with only SR used . . . . . . . . . . . . 7
4.2.2. Example: ELP with SR and reencapsulating routers
combined . . . . . . . . . . . . . . . . . . . . . . . 8
5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 9
6. Manageability Considerations . . . . . . . . . . . . . . . . . 9
7. Security Considerations . . . . . . . . . . . . . . . . . . . 9
8. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . 10
9. Change log . . . . . . . . . . . . . . . . . . . . . . . . . . 10
10. References . . . . . . . . . . . . . . . . . . . . . . . . . . 10
10.1. Normative References . . . . . . . . . . . . . . . . . . . 10
10.2. Informative References . . . . . . . . . . . . . . . . . . 10
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 11
Brockners, et al. Expires August 17, 2014 [Page 2]Internet-Draft LISP and SR integration February 20141. Introduction
Segment Routing (SR) allows for a flexible definition of end-to-end
paths within network topologies by encoding paths as sequences of