Distributed Prefix Assignment Algorithm
draft-ietf-homenet-prefix-assignment-07

The information below is for an old version of the document
Document Type Active Internet-Draft (homenet WG)
Last updated 2015-07-09 (latest revision 2015-06-15)
Replaces draft-pfister-homenet-prefix-assignment
Stream IETF
Intended RFC status Proposed Standard
Formats pdf htmlized bibtex
Reviews
Stream WG state Submitted to IESG for Publication
Document shepherd Mark Townsley
Shepherd write-up Show (last changed 2015-04-21)
IESG IESG state IESG Evaluation::AD Followup
Consensus Boilerplate Yes
Telechat date
Needs a YES. Needs 6 more YES or NO OBJECTION positions to pass.
Responsible AD Terry Manderson
Send notices to "Mark Townsley" <mark@townsley.net>, ray@bellis.me.uk
IANA IANA review state IANA OK - No Actions Needed
Network Working Group                                         P. Pfister
Internet-Draft                                               B. Paterson
Intended status: Standards Track                           Cisco Systems
Expires: December 17, 2015                                      J. Arkko
                                                                Ericsson
                                                           June 15, 2015

                Distributed Prefix Assignment Algorithm
                draft-ietf-homenet-prefix-assignment-07

Abstract

   This document specifies a distributed algorithm for automatic prefix
   assignment.  Thus it provides an alternative to manual or centralized
   prefix and address assignment techniques.  Given a set of delegated
   prefixes, it ensures that at most one prefix is assigned from each
   delegated prefix to each link.  Nodes may assign available prefixes
   to the links they are directly connected to, or for other private
   purposes.  The algorithm eventually converges and ensures that all
   assigned prefixes do not overlap.

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 December 17, 2015.

Copyright Notice

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

Pfister, et al.         Expires December 17, 2015               [Page 1]
Internet-Draft         Prefix Assignment Algorithm             June 2015

   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  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   3
     2.1.  Subroutine Specific Terminology . . . . . . . . . . . . .   5
   3.  Applicability Statement . . . . . . . . . . . . . . . . . . .   6
   4.  Algorithm Specification . . . . . . . . . . . . . . . . . . .   8
     4.1.  Prefix Assignment Algorithm Subroutine  . . . . . . . . .   8
     4.2.  Overriding and Destroying Existing Assignments  . . . . .  10
     4.3.  Other Events  . . . . . . . . . . . . . . . . . . . . . .  12
   5.  Prefix Selection Considerations . . . . . . . . . . . . . . .  12
   6.  Implementation Capabilities and Node Behavior . . . . . . . .  14
   7.  Algorithm Parameters  . . . . . . . . . . . . . . . . . . . .  15
   8.  Security Considerations . . . . . . . . . . . . . . . . . . .  16
   9.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  17
   10. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . .  17
   11. References  . . . . . . . . . . . . . . . . . . . . . . . . .  17
     11.1.  Normative References . . . . . . . . . . . . . . . . . .  17
     11.2.  Informative References . . . . . . . . . . . . . . . . .  17
   Appendix A.  Static Configuration Example . . . . . . . . . . . .  17
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  18

1.  Introduction

   This document specifies a distributed algorithm for automatic prefix
   assignment.  The algorithm provides a generic alternative to
   centralized (human or software based) approaches for network prefixes
   and addresses assignment.  Although it does not require to be
   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
       link.

   2.  Assigned prefixes are non-overlapping (i.e., an assigned prefix
       never includes another assigned prefix).
Show full document text