RFC 7695: Distributed Prefix Assignment Algorithm
In plain English — editorial summary, not part of the RFC
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.
Document record
- Document ID
- RFC7695
- Published
- November 2015
- Authors
- P. Pfister; B. Paterson; J. Arkko
- Status
- PROPOSED STANDARD
- Stream
- IETF
- Area
- int
- Pages
- 20
- Also known as
- —
Topics
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 6052IPv6 Addressing of IPv4/IPv6 TranslatorsCurrent
October 2010
- RFC 1971IPv6 Stateless Address AutoconfigurationObsoleted
August 1996
- RFC 7787Distributed Node Consensus ProtocolCurrent
April 2016
- RFC 7788Home Networking Control ProtocolUpdated
April 2016
- RFC 8168DHCPv6 Prefix-Length Hint IssuesCurrent
May 2017
- RFC 8375Special-Use Domain 'home.arpa.'Current
May 2018
- RFC 9526Simple Provisioning of Public Names for Residential NetworksCurrent
January 2024
- RFC 2928Initial IPv6 Sub-TLA ID AssignmentsCurrent
September 2000
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?