LISP Delegated Database Tree
draft-fuller-lisp-ddt-02

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2012-07-16
Replaced by rfc8111, draft-ietf-lisp-ddt
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Network Working Group                                          V. Fuller
Internet-Draft                                                  D. Lewis
Intended status: Experimental                                 V. Ermagan
Expires: January 14, 2013                                        A. Jain
                                                           cisco Systems
                                                           July 13, 2012

                      LISP Delegated Database Tree
                      draft-fuller-lisp-ddt-02.txt

Abstract

   This draft describes the LISP Delegated Database Tree (LISP-DDT), a
   hierarchical, distributed database which embodies the delegation of
   authority to provide mappings from LISP Endpoint Identifiers (EIDs)
   to Routing Locators (RLOCs).  It is a statically-defined distribution
   of the EID namespace among a set of LISP-speaking servers, called DDT
   nodes.  Each DDT node is configured as "authoritative" for one or
   more EID-prefixes, along with the set of RLOCs for Map Servers or
   "child" DDT nodes to which more-specific EID-prefixes are delegated.

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 January 14, 2013.

Copyright Notice

   Copyright (c) 2012 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

Fuller, et al.          Expires January 14, 2013                [Page 1]
Internet-Draft        LISP Delegated Database Tree             July 2012

   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 . . . . . . . . . . . . . . . . . . . . . . . . .  4
   2.  Definition of Terms  . . . . . . . . . . . . . . . . . . . . .  6
   3.  Database organization  . . . . . . . . . . . . . . . . . . . .  8
     3.1.  EID-prefix tree structure and instance IDs . . . . . . . .  8
     3.2.  Configuring prefix delegation  . . . . . . . . . . . . . .  8
       3.2.1.  The root DDT node  . . . . . . . . . . . . . . . . . .  8
   4.  The Map-Referral message . . . . . . . . . . . . . . . . . . . 10
     4.1.  Action codes . . . . . . . . . . . . . . . . . . . . . . . 10
     4.2.  Referral Set . . . . . . . . . . . . . . . . . . . . . . . 11
     4.3.  Incomplete flag  . . . . . . . . . . . . . . . . . . . . . 11
   5.  DDT network elements and their operation . . . . . . . . . . . 12
     5.1.  DDT node . . . . . . . . . . . . . . . . . . . . . . . . . 12
       5.1.1.  Match of a delegated prefix (or sub-prefix)  . . . . . 12
       5.1.2.  Missing delegation from an authoritative prefix  . . . 12
     5.2.  DDT Map Server . . . . . . . . . . . . . . . . . . . . . . 13
     5.3.  DDT Map Resolver . . . . . . . . . . . . . . . . . . . . . 13
       5.3.1.  Queuing and sending DDT Map-Requests . . . . . . . . . 13
       5.3.2.  Receiving and following referrals  . . . . . . . . . . 14
       5.3.3.  Handling referral errors . . . . . . . . . . . . . . . 15
       5.3.4.  Referral loop detection  . . . . . . . . . . . . . . . 16
   6.  Psuedo Code and Decision Tree diagrams . . . . . . . . . . . . 17
     6.1.  Map Resolver processing of ITR Map-Request . . . . . . . . 17
       6.1.1.  Pseudo-code summary  . . . . . . . . . . . . . . . . . 17
       6.1.2.  Decision tree diagram  . . . . . . . . . . . . . . . . 18
     6.2.  Map Resolver processing of Map-Referral message  . . . . . 19
       6.2.1.  Pseudo-code summary  . . . . . . . . . . . . . . . . . 19
       6.2.2.  Decision tree diagram  . . . . . . . . . . . . . . . . 21
     6.3.  DDT Node processing of DDT Map-Request message . . . . . . 22
       6.3.1.  Pseudo-code summary  . . . . . . . . . . . . . . . . . 22
       6.3.2.  Decision tree diagram  . . . . . . . . . . . . . . . . 23
   7.  Example topology and request/referral following  . . . . . . . 24
     7.1.  Lookup of 10.1.1.1/32 by ITR1  . . . . . . . . . . . . . . 25
Show full document text