Browse Prior Art Database

Distributed Prefix Assignment Algorithm (RFC7695)

IP.com Disclosure Number: IPCOM000245050D
Original Publication Date: 2015-Nov-01
Included in the Prior Art Database: 2016-Feb-07
Document File: 40 page(s) / 46K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

P. Pfister: AUTHOR [+3]

Abstract

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 prefix and address assignment. Although it does not have 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 configured networks. This document focuses on the algorithm itself and therefore context-specific considerations (such as the process of selecting a prefix value and length when making a new assignment) are out of scope.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 6% of the total text.

Internet Engineering Task Force (IETF)                        P. Pfister Request for Comments: 7695                                   B. Paterson Category: Standards Track                                  Cisco Systems ISSN: 2070-1721                                                 J. Arkko                                                                 Ericsson                                                            November 2015

                 Distributed Prefix Assignment Algorithm

Abstract

   This document specifies a distributed algorithm for dividing a set of    prefixes in a manner that allows for automatic assignment of sub-    prefixes that are unique and non-overlapping.  Used in conjunction    with a protocol that provides flooding of information among a set of    participating nodes, prefix configuration within a network may be    automated.

Status of This Memo

   This is an Internet Standards Track document.

   This document is a product of the Internet Engineering Task Force    (IETF).  It represents the consensus of the IETF community.  It has    received public review and has been approved for publication by the    Internet Engineering Steering Group (IESG).  Further information on    Internet Standards is available in Section 2 of RFC 5741.

   Information about the current status of this document, any errata,    and how to provide feedback on it may be obtained at    http://www.rfc-editor.org/info/rfc7695.

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    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.

 Pfister, et al.              Standards Track                    [Page 1]
 RFC 7695               Prefix Assignment Algorithm         November 2015

 Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2

   2.  Definitions . . . . . . . . . . . . . . . . . . . . . . . . .   3

     2.1.  Subroutine-Specific Terminology . . . . . . . . . . . . .   6

   3.  Applicability Statement . ....