draft-ietf-homenet-prefix-assignment-06.txt   draft-ietf-homenet-prefix-assignment-07.txt 
Network Working Group P. Pfister Network Working Group P. Pfister
Internet-Draft B. Paterson Internet-Draft B. Paterson
Intended status: Standards Track Cisco Systems Intended status: Standards Track Cisco Systems
Expires: November 29, 2015 J. Arkko Expires: December 17, 2015 J. Arkko
Ericsson Ericsson
May 28, 2015 June 15, 2015
Distributed Prefix Assignment Algorithm Distributed Prefix Assignment Algorithm
draft-ietf-homenet-prefix-assignment-06 draft-ietf-homenet-prefix-assignment-07
Abstract Abstract
This document specifies a distributed algorithm for automatic prefix This document specifies a distributed algorithm for automatic prefix
assignment. Given a set of delegated prefixes, it ensures that at assignment. Thus it provides an alternative to manual or centralized
most one prefix is assigned from each delegated prefix to each link. prefix and address assignment techniques. Given a set of delegated
Nodes may assign available prefixes to the links they are directly prefixes, it ensures that at most one prefix is assigned from each
connected to, or for other private purposes. The algorithm delegated prefix to each link. Nodes may assign available prefixes
eventually converges and ensures that all assigned prefixes do not to the links they are directly connected to, or for other private
overlap. purposes. The algorithm eventually converges and ensures that all
assigned prefixes do not overlap.
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 November 29, 2015. This Internet-Draft will expire on December 17, 2015.
Copyright Notice Copyright Notice
Copyright (c) 2015 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
skipping to change at page 2, line 15 skipping to change at page 2, line 16
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 . . . . . . . . . . . . . . . . . . . . . . . . 2 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.1. Subroutine Specific Terminology . . . . . . . . . . . . . 5 2.1. Subroutine Specific Terminology . . . . . . . . . . . . . 5
3. Applicability Statement . . . . . . . . . . . . . . . . . . . 6 3. Applicability Statement . . . . . . . . . . . . . . . . . . . 6
4. Algorithm Specification . . . . . . . . . . . . . . . . . . . 7 4. Algorithm Specification . . . . . . . . . . . . . . . . . . . 8
4.1. Prefix Assignment Algorithm Subroutine . . . . . . . . . 7 4.1. Prefix Assignment Algorithm Subroutine . . . . . . . . . 8
4.2. Overriding and Destroying Existing Assignments . . . . . 10 4.2. Overriding and Destroying Existing Assignments . . . . . 10
4.3. Other Events . . . . . . . . . . . . . . . . . . . . . . 12 4.3. Other Events . . . . . . . . . . . . . . . . . . . . . . 12
5. Prefix Selection Considerations . . . . . . . . . . . . . . . 12 5. Prefix Selection Considerations . . . . . . . . . . . . . . . 12
6. Implementation Capabilities and Node Behavior . . . . . . . . 14 6. Implementation Capabilities and Node Behavior . . . . . . . . 14
7. Algorithm Parameters . . . . . . . . . . . . . . . . . . . . 15 7. Algorithm Parameters . . . . . . . . . . . . . . . . . . . . 15
8. Security Considerations . . . . . . . . . . . . . . . . . . . 16 8. Security Considerations . . . . . . . . . . . . . . . . . . . 16
9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 16 9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 17
10. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 17 10. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 17
11. References . . . . . . . . . . . . . . . . . . . . . . . . . 17 11. References . . . . . . . . . . . . . . . . . . . . . . . . . 17
11.1. Normative References . . . . . . . . . . . . . . . . . . 17 11.1. Normative References . . . . . . . . . . . . . . . . . . 17
11.2. Informative References . . . . . . . . . . . . . . . . . 17 11.2. Informative References . . . . . . . . . . . . . . . . . 17
Appendix A. Static Configuration Example . . . . . . . . . . . . 17 Appendix A. Static Configuration Example . . . . . . . . . . . . 17
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 18 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 18
1. Introduction 1. Introduction
This document specifies a distributed algorithm for automatic prefix This document specifies a distributed algorithm for automatic prefix
assignment. Given a set of delegated prefixes, Nodes may assign assignment. The algorithm provides a generic alternative to
available prefixes to links they are directly connected to, or for centralized (human or software based) approaches for network prefixes
their private use. The algorithm ensures that the following and addresses assignment. Although it does not require to be
assertions are satisfied after a finite convergence period: configured to operate properly, it supports custom configuration by
means of variable priority assignments, and can therefore be used in
fully autonomic as well as professionally managed networks.
Given a set of delegated prefixes, Nodes may assign available
prefixes to links they are directly connected to, or for their
private use. The algorithm ensures that the following assertions are
satisfied after a finite convergence period:
1. At most one prefix from each delegated prefix is assigned to each 1. At most one prefix from each delegated prefix is assigned to each
link. link.
2. Assigned prefixes are non-overlapping (i.e., an assigned prefix 2. Assigned prefixes are non-overlapping (i.e., an assigned prefix
never includes another assigned prefix). never includes another assigned prefix).
3. Assigned prefixes do not change in the absence of topology or 3. Assigned prefixes do not change in the absence of topology or
configuration changes. configuration changes.
 End of changes. 8 change blocks. 
17 lines changed or deleted 25 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/