draft-ietf-lisp-ddt-02.txt   draft-ietf-lisp-ddt-03.txt 
Network Working Group V. Fuller Network Working Group V. Fuller
Internet-Draft Internet-Draft
Intended status: Experimental D. Lewis Intended status: Experimental D. Lewis
Expires: April 16, 2015 V. Ermagan Expires: October 17, 2015 V. Ermagan
Cisco Systems Cisco Systems
A. Jain A. Jain
Juniper Networks Juniper Networks
October 13, 2014 April 15, 2015
LISP Delegated Database Tree LISP Delegated Database Tree
draft-ietf-lisp-ddt-02.txt draft-ietf-lisp-ddt-03.txt
Abstract Abstract
This draft describes the LISP Delegated Database Tree (LISP-DDT), a This draft describes the LISP Delegated Database Tree (LISP-DDT), a
hierarchical, distributed database which embodies the delegation of hierarchical, distributed database which embodies the delegation of
authority to provide mappings from LISP Endpoint Identifiers (EIDs) authority to provide mappings from LISP Endpoint Identifiers (EIDs)
to Routing Locators (RLOCs). It is a statically-defined distribution to Routing Locators (RLOCs). It is a statically-defined distribution
of the EID namespace among a set of LISP-speaking servers, called DDT of the EID namespace among a set of LISP-speaking servers, called DDT
nodes. Each DDT node is configured as "authoritative" for one or nodes. Each DDT node is configured as "authoritative" for one or
more EID-prefixes, along with the set of RLOCs for Map Servers 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. "child" DDT nodes to which more-specific EID-prefixes are delegated.
Status of This Memo Status of this Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on April 16, 2015. This Internet-Draft will expire on October 17, 2015.
Copyright Notice Copyright Notice
Copyright (c) 2014 IETF Trust and the persons identified as the Copyright (c) 2015 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
2. Definition of Terms . . . . . . . . . . . . . . . . . . . . . 4 2. Definition of Terms . . . . . . . . . . . . . . . . . . . . . 6
3. Database organization . . . . . . . . . . . . . . . . . . . . 6 3. Database organization . . . . . . . . . . . . . . . . . . . . 8
3.1. EID-prefix tree structure and instance IDs . . . . . . . 6 3.1. EID-prefix tree structure and instance IDs . . . . . . . . 8
3.2. Configuring prefix delegation . . . . . . . . . . . . . . 7 3.2. Configuring prefix delegation . . . . . . . . . . . . . . 8
3.2.1. The root DDT node . . . . . . . . . . . . . . . . . . 7 3.2.1. The root DDT node . . . . . . . . . . . . . . . . . . 8
4. The Map-Referral message . . . . . . . . . . . . . . . . . . 7 4. The Map-Referral message . . . . . . . . . . . . . . . . . . . 10
4.1. Action codes . . . . . . . . . . . . . . . . . . . . . . 8 4.1. Action codes . . . . . . . . . . . . . . . . . . . . . . . 10
4.2. Referral set . . . . . . . . . . . . . . . . . . . . . . 8 4.2. Referral set . . . . . . . . . . . . . . . . . . . . . . . 11
4.3. Incomplete flag . . . . . . . . . . . . . . . . . . . . . 9 4.3. Incomplete flag . . . . . . . . . . . . . . . . . . . . . 11
5. DDT network elements and their operation . . . . . . . . . . 9 5. DDT network elements and their operation . . . . . . . . . . . 12
5.1. DDT node . . . . . . . . . . . . . . . . . . . . . . . . 9 5.1. DDT node . . . . . . . . . . . . . . . . . . . . . . . . . 12
5.1.1. Match of a delegated prefix (or sub-prefix) . . . . . 9 5.1.1. Match of a delegated prefix (or sub-prefix) . . . . . 12
5.1.2. Missing delegation from an authoritative prefix . . . 10 5.1.2. Missing delegation from an authoritative prefix . . . 12
5.2. DDT Map Server . . . . . . . . . . . . . . . . . . . . . 10 5.2. DDT Map Server . . . . . . . . . . . . . . . . . . . . . . 13
5.3. DDT Map Resolver . . . . . . . . . . . . . . . . . . . . 10 5.3. DDT Map Resolver . . . . . . . . . . . . . . . . . . . . . 13
5.3.1. Queuing and sending DDT Map-Requests . . . . . . . . 10 5.3.1. Queuing and sending DDT Map-Requests . . . . . . . . . 13
5.3.2. Receiving and following referrals . . . . . . . . . . 11 5.3.2. Receiving and following referrals . . . . . . . . . . 14
5.3.3. Handling referral errors . . . . . . . . . . . . . . 13 5.3.3. Handling referral errors . . . . . . . . . . . . . . . 15
5.3.4. Referral loop detection . . . . . . . . . . . . . . . 13 5.3.4. Referral loop detection . . . . . . . . . . . . . . . 16
6. Pseudo Code and Decision Tree diagrams . . . . . . . . . . . 14 6. Pseudo Code and Decision Tree diagrams . . . . . . . . . . . . 17
6.1. Map Resolver processing of ITR Map-Request . . . . . . . 14 6.1. Map Resolver processing of ITR Map-Request . . . . . . . . 17
6.1.1. Pseudo-code summary . . . . . . . . . . . . . . . . . 14 6.1.1. Pseudo-code summary . . . . . . . . . . . . . . . . . 17
6.1.2. Decision tree diagram . . . . . . . . . . . . . . . . 14 6.1.2. Decision tree diagram . . . . . . . . . . . . . . . . 17
6.2. Map Resolver processing of Map-Referral message . . . . . 15 6.2. Map Resolver processing of Map-Referral message . . . . . 18
6.2.1. Pseudo-code summary . . . . . . . . . . . . . . . . . 15 6.2.1. Pseudo-code summary . . . . . . . . . . . . . . . . . 18
6.2.2. Decision tree diagram . . . . . . . . . . . . . . . . 17 6.2.2. Decision tree diagram . . . . . . . . . . . . . . . . 20
6.3. DDT Node processing of DDT Map-Request message . . . . . 19 6.3. DDT Node processing of DDT Map-Request message . . . . . . 22
6.3.1. Pseudo-code summary . . . . . . . . . . . . . . . . . 19 6.3.1. Pseudo-code summary . . . . . . . . . . . . . . . . . 22
6.3.2. Decision tree diagram . . . . . . . . . . . . . . . . 19 6.3.2. Decision tree diagram . . . . . . . . . . . . . . . . 22
7. Example topology and request/referral following . . . . . . . 20 7. Example topology and request/referral following . . . . . . . 24
7.1. Lookup of 10.1.1.1/32 by ITR1 . . . . . . . . . . . . . . 22 7.1. Lookup of 10.1.1.1/32 by ITR1 . . . . . . . . . . . . . . 25
7.2. Lookup of 10.17.8.1/32 by ITR2 . . . . . . . . . . . . . 23 7.2. Lookup of 10.17.8.1/32 by ITR2 . . . . . . . . . . . . . . 26
7.3. Lookup of 10.2.2.2/32 by ITR1 . . . . . . . . . . . . . . 24 7.3. Lookup of 10.2.2.2/32 by ITR1 . . . . . . . . . . . . . . 27
7.4. Lookup of 10.16.2.1/32 by ITR2 . . . . . . . . . . . . . 24 7.4. Lookup of 10.16.2.1/32 by ITR2 . . . . . . . . . . . . . . 27
7.5. Lookup of 10.16.0.1/32 (non-existant EID) by ITR2 . . . . 25 7.5. Lookup of 10.16.0.1/32 (non-existant EID) by ITR2 . . . . 28
8. Securing the database and message exchanges . . . . . . . . . 25 8. Securing the database and message exchanges . . . . . . . . . 29
8.1. XEID-prefix Delegation . . . . . . . . . . . . . . . . . 26 8.1. XEID-prefix Delegation . . . . . . . . . . . . . . . . . . 29
8.2. DDT node operation . . . . . . . . . . . . . . . . . . . 26 8.2. DDT node operation . . . . . . . . . . . . . . . . . . . . 30
8.2.1. DDT public key revocation . . . . . . . . . . . . . . 27 8.2.1. DDT public key revocation . . . . . . . . . . . . . . 30
8.3. Map Server operation . . . . . . . . . . . . . . . . . . 27 8.3. Map Server operation . . . . . . . . . . . . . . . . . . . 30
8.4. Map Resolver operation . . . . . . . . . . . . . . . . . 27 8.4. Map Resolver operation . . . . . . . . . . . . . . . . . . 31
9. Open Issues and Considerations . . . . . . . . . . . . . . . 28 9. Open Issues and Considerations . . . . . . . . . . . . . . . . 32
10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 29 10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 33
11. Security Considerations . . . . . . . . . . . . . . . . . . . 29 11. Security Considerations . . . . . . . . . . . . . . . . . . . 34
12. References . . . . . . . . . . . . . . . . . . . . . . . . . 29 12. References . . . . . . . . . . . . . . . . . . . . . . . . . . 35
12.1. Normative References . . . . . . . . . . . . . . . . . . 29 12.1. Normative References . . . . . . . . . . . . . . . . . . . 35
12.2. Informative References . . . . . . . . . . . . . . . . . 30 12.2. Informative References . . . . . . . . . . . . . . . . . . 35
Appendix A. Acknowledgments . . . . . . . . . . . . . . . . . . 30 Appendix A. Acknowledgments . . . . . . . . . . . . . . . . . . . 37
Appendix B. Map-Referral Message Format . . . . . . . . . . . . 31 Appendix B. Map-Referral Message Format . . . . . . . . . . . . . 38
B.1. SIG section . . . . . . . . . . . . . . . . . . . . . . . 33 B.1. SIG section . . . . . . . . . . . . . . . . . . . . . . . 40
Appendix C. Encapsulated Control Message Format . . . . . . . . 34 Appendix C. Encapsulated Control Message Format . . . . . . . . . 42
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 35 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 43
1. Introduction 1. Introduction
LISP [RFC6830] specifies an architecture and mechanism for replacing LISP [RFC6830] specifies an architecture and mechanism for replacing
the addresses currently used by IP with two separate name spaces: the addresses currently used by IP with two separate name spaces:
relatively static Endpoint Identifiers (EIDs), used end-to-end for relatively static Endpoint Identifiers (EIDs), used end-to-end for
terminating transport-layer associations, and Routing Locators terminating transport-layer associations, and Routing Locators
(RLOCs), which are more dynamic, are bound to topological location, (RLOCs), which are more dynamic, are bound to topological location,
and are used for routing and forwarding through the Internet and are used for routing and forwarding through the Internet
infrastructure. infrastructure.
skipping to change at page 30, line 6 skipping to change at page 35, line 17
12.1. Normative References 12.1. Normative References
[LCAF] Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical [LCAF] Farinacci, D., Meyer, D., and J. Snijders, "LISP Canonical
Address Format", Address Format",
<http://www.ietf.org/id/draft-ietf-lisp-lcaf>. <http://www.ietf.org/id/draft-ietf-lisp-lcaf>.
[RFC1035] Mockapetris, P., "Domain names - implementation and [RFC1035] Mockapetris, P., "Domain names - implementation and
specification", STD 13, RFC 1035, November 1987. specification", STD 13, RFC 1035, November 1987.
[RFC2104] Krawczyk, H., Bellare, M., and R. Canetti, "HMAC: Keyed- [RFC2104] Krawczyk, H., Bellare, M., and R. Canetti, "HMAC: Keyed-
Hashing for Message Authentication", RFC 2104, February Hashing for Message Authentication", RFC 2104,
1997. February 1997.
[RFC4634] Eastlake, D. and T. Hansen, "US Secure Hash Algorithms [RFC4634] Eastlake, D. and T. Hansen, "US Secure Hash Algorithms
(SHA and HMAC-SHA)", RFC 4634, July 2006. (SHA and HMAC-SHA)", RFC 4634, July 2006.
[RFC5011] StJohns, M., "Automated Updates of DNS Security (DNSSEC) [RFC5011] StJohns, M., "Automated Updates of DNS Security (DNSSEC)
Trust Anchors", STD 74, RFC 5011, September 2007. Trust Anchors", STD 74, RFC 5011, September 2007.
[RFC6830] Farinacci, D., Fuller, V., Meyer, D., and D. Lewis, "The [RFC6830] Farinacci, D., Fuller, V., Meyer, D., and D. Lewis, "The
Locator/ID Separation Protocol (LISP)", RFC 6830, January Locator/ID Separation Protocol (LISP)", RFC 6830,
2013. January 2013.
[RFC6833] Fuller, V. and D. Farinacci, "Locator/ID Separation [RFC6833] Fuller, V. and D. Farinacci, "Locator/ID Separation
Protocol (LISP) Map-Server Interface", RFC 6833, January Protocol (LISP) Map-Server Interface", RFC 6833,
2013. January 2013.
12.2. Informative References 12.2. Informative References
[LISP-SEC] [LISP-SEC]
Maino, F., Ermagan, V., Cabellos, A., and D. Sanchez, Maino, F., Ermagan, V., Cabellos, A., and D. Sanchez,
"LISP-Security", "LISP-Security",
<http://www.ietf.org/id/draft-ietf-lisp-sec>. <http://www.ietf.org/id/draft-ietf-lisp-sec>.
[LISP-TREE] [LISP-TREE]
Jakab, L., Cabellos, A., Coras, F., and D. Sauceez, "LISP- Jakab, L., Cabellos, A., Coras, F., and D. Sauceez, "LISP-
TREE", 10 2010, TREE", 10 2010,
<http://dl.acm.org/citation.cfm?id=1878181>. <http://dl.acm.org/citation.cfm?id=1878181>.
[RFC1918] Rekhter, Y., Moskowitz, R., Karrenberg, D., Groot, G., and [RFC1918] Rekhter, Y., Moskowitz, R., Karrenberg, D., Groot, G., and
E. Lear, "Address Allocation for Private Internets", BCP E. Lear, "Address Allocation for Private Internets",
5, RFC 1918, February 1996. BCP 5, RFC 1918, February 1996.
[RFC6480] Lepinski, M. and S. Kent, "An Infrastructure to Support [RFC6480] Lepinski, M. and S. Kent, "An Infrastructure to Support
Secure Internet Routing", RFC 6480, February 2012. Secure Internet Routing", RFC 6480, February 2012.
[RFC6836] Fuller, V., Farinacci, D., Meyer, D., and D. Lewis, [RFC6836] Fuller, V., Farinacci, D., Meyer, D., and D. Lewis,
"Locator/ID Separation Protocol Alternative Logical "Locator/ID Separation Protocol Alternative Logical
Topology (LISP+ALT)", RFC 6836, January 2013. Topology (LISP+ALT)", RFC 6836, January 2013.
Appendix A. Acknowledgments Appendix A. Acknowledgments
 End of changes. 11 change blocks. 
67 lines changed or deleted 67 lines changed or added

This html diff was produced by rfcdiff 1.42. The latest version is available from http://tools.ietf.org/tools/rfcdiff/