RFC 4862
IPv6 Stateless Address Autoconfiguration
Part 1 of 7 π
IPv6 Stateless Address Autoconfiguration β¨
Okay bestie, let's start with the vitals π This is RFC 4862, called "IPv6 Stateless Address Autoconfiguration." It came out in September 2007 from the Network Working Group. The authors are S. Thomson (Cisco), T. Narten (IBM), and T. Jinmei (Toshiba) π It's a Standards Track document, and it obsoletes RFC 2462 π
Status of This Memo π
So this one is an Internet standards track protocol for the whole Internet community π It's also asking for discussion and suggestions to make it better π¬ If you want the current standardization state and status of this protocol, go check the "Internet Official Protocol Standards" (STD 1) listing π₯ Distribution of this memo is unlimited, so share away π¦
Abstract πΈ
Here's the tea β This document lays out the steps a host takes to decide how to autoconfigure its interfaces in IP version 6. The whole process includes generating a link-local address, generating global addresses through stateless address autoconfiguration, and running the Duplicate Address Detection procedure to make sure the addresses on a link are actually unique π«Ά
Table of Contents ποΈ
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.1. Requirements . . . . . . . . . . . . . . . . . . . . . . . 7
3. Design Goals . . . . . . . . . . . . . . . . . . . . . . . . . 7
4. Protocol Overview . . . . . . . . . . . . . . . . . . . . . . 8
4.1. Site Renumbering . . . . . . . . . . . . . . . . . . . . . 9
5. Protocol Specification . . . . . . . . . . . . . . . . . . . . 10
5.1. Node Configuration Variables . . . . . . . . . . . . . . . 10
5.2. Autoconfiguration-Related Structures . . . . . . . . . . . 11
5.3. Creation of Link-Local Addresses . . . . . . . . . . . . . 11
5.4. Duplicate Address Detection . . . . . . . . . . . . . . . 12
5.4.1. Message Validation . . . . . . . . . . . . . . . . . . 14
5.4.2. Sending Neighbor Solicitation Messages . . . . . . . . 14
5.4.3. Receiving Neighbor Solicitation Messages . . . . . . . 15
5.4.4. Receiving Neighbor Advertisement Messages . . . . . . 16
5.4.5. When Duplicate Address Detection Fails . . . . . . . . 17
5.5. Creation of Global Addresses . . . . . . . . . . . . . . . 17
5.5.1. Soliciting Router Advertisements . . . . . . . . . . . 18
5.5.2. Absence of Router Advertisements . . . . . . . . . . . 18
5.5.3. Router Advertisement Processing . . . . . . . . . . . 18
5.5.4. Address Lifetime Expiry . . . . . . . . . . . . . . . 20
5.6. Configuration Consistency . . . . . . . . . . . . . . . . 21
5.7. Retaining Configured Addresses for Stability . . . . . . . 22
6. Security Considerations . . . . . . . . . . . . . . . . . . . 22
7. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . 23
8. References . . . . . . . . . . . . . . . . . . . . . . . . . . 23
8.1. Normative References . . . . . . . . . . . . . . . . . . . 23
8.2. Informative References . . . . . . . . . . . . . . . . . . 23
Appendix A. Loopback Suppression and Duplicate Address
Detection . . . . . . . . . . . . . . . . . . . . . . 25
Appendix B. Changes since RFC 1971 . . . . . . . . . . . . . . . 26
Appendix C. Changes since RFC 2462 . . . . . . . . . . . . . . . 27
1. Introduction β¨
This doc spells out the steps a host takes to figure out how to autoconfigure its interfaces in IP version 6 (IPv6) π The process includes generating a link-local address, generating global addresses through stateless address autoconfiguration, and running the Duplicate Address Detection procedure to verify that addresses on a link are unique π₯
Okay, the vibe of stateless autoconfiguration is no manual setup for hosts, minimal (if any) setup for routers, and no extra servers π§ The host makes its own addresses from a mix of stuff it already knows locally and info that routers advertise π‘ Routers advertise prefixes that identify the subnet(s) on a link, while hosts generate an "interface identifier" that uniquely names an interface on a subnet. Combine the two and boom, you get an address π Without any routers, a host can only make link-local addresses. Still, link-local addresses are enough for nodes on the same link to talk to each other π«Ά
Stateless is the move when a site doesn't care much about the exact addresses hosts end up with, as long as they're unique and properly routable π But when a site needs tighter control over exactly which addresses get handed out, that's where Dynamic Host Configuration Protocol for IPv6 (DHCPv6) [RFC3315] comes in π Stateless address autoconfiguration and DHCPv6 are allowed to be used at the same time, too π
Now, addresses are leased to an interface for a fixed length of time (which could be infinite, lol) π Every address has a lifetime that says how long it stays bound to an interface. When that lifetime runs out, the binding (and the address) becomes invalid, and the address might get reassigned to another interface somewhere else on the Internet π To handle expiring bindings gracefully, an address goes through two separate phases while it's assigned to an interface π¦ At first it's "preferred," which means it can be used for any communication, no restrictions π Later it becomes "deprecated," because its interface binding is about to go invalid. A deprecated address is discouraged, but it's not strictly forbidden π New communication, like opening a new TCP connection, should use a preferred address whenever that's possible. A deprecated address should only be used by applications that were already using it and would have trouble switching to another address without a service disruption π₯Ί
Next up, to make sure every configured address is likely unique on a given link, nodes run a "duplicate address detection" algorithm on addresses before they're assigned to an interface π΅οΈββοΈ This Duplicate Address Detection algorithm runs on all addresses, no matter whether they came from stateless autoconfiguration or DHCPv6. This document is the one that defines it β¨
This autoconfiguration process only applies to hosts, not routers π€ Hosts use info that routers advertise, so routers have to be configured some other way. That said, routers are expected to generate link-local addresses with the mechanism in this document. Also, routers are expected to successfully pass the Duplicate Address Detection procedure described here on all addresses before assigning them to an interface π
Section 2 gives definitions for the terminology used all through the doc. Section 3 covers the design goals behind the current autoconfiguration procedure π Section 4 gives an overview of the protocol, and Section 5 goes into the full details β¨
2. Terminology β¨
okay so this section is basically the glossary bestie, and we NEED these definitions locked in π Every term here has a super specific meaning in IPv6 land, so no vibes-based guessing π«Ά
- IP π - Internet Protocol Version 6. The terms IPv4 and IPv6 are used only in contexts where necessary to avoid ambiguity.
- node πΈ - a device that implements IP.
- router π¦ - a node that forwards IP packets not explicitly addressed to itself.
- host π - any node that is not a router.
- upper layer π - a protocol layer immediately above IP. Examples are transport protocols such as TCP and UDP, control protocols such as ICMP, routing protocols such as OSPF, and Internet or lower-layer protocols being "tunneled" over (i.e., encapsulated in) IP such as IPX, AppleTalk, or IP itself.
- link π - a communication facility or medium over which nodes can communicate at the link layer, i.e., the layer immediately below IP. Examples are Ethernets (simple or bridged); PPP links; X.25, Frame Relay, or ATM networks; and Internet (or higher) layer "tunnels", such as tunnels over IPv4 or IPv6 itself. The protocol described in this document will be used on all types of links unless specified otherwise in the link-type-specific document describing how to operate IP on the link in line with [RFC4861].
- interface π§ - a node's attachment to a link.
- packet π¦ - an IP header plus payload.
- address πͺ - an IP-layer identifier for an interface or a set of interfaces.
- unicast address π - an identifier for a single interface. A packet sent to a unicast address is delivered to the interface identified by that address.
- multicast address π£ - an identifier for a set of interfaces (typically belonging to different nodes). A packet sent to a multicast address is delivered to all interfaces identified by that address.
- anycast address π― - an identifier for a set of interfaces (typically belonging to different nodes). A packet sent to an anycast address is delivered to one of the interfaces identified by that address (the "nearest" one, according to the routing protocol's measure of distance). See [RFC4291].
- solicited-node multicast address π - a multicast address to which Neighbor Solicitation messages are sent. The algorithm for computing the address is given in [RFC4291].
- link-layer address π - a link-layer identifier for an interface. Examples include IEEE 802 addresses for Ethernet links and E.164 addresses for Integrated Services Digital Network (ISDN) links.
- link-local address π - an address having link-only scope that can be used to reach neighboring nodes attached to the same link. All interfaces have a link-local unicast address.
- global address π - an address with unlimited scope.
- communication π€ - any packet exchange among nodes that requires that the address of each node used in the exchange remain the same for the duration of the packet exchange. Examples are a TCP connection or a UDP request-response.
- tentative address π«£ - an address whose uniqueness on a link is being verified, prior to its assignment to an interface. A tentative address is not considered assigned to an interface in the usual sense. An interface discards received packets addressed to a tentative address, but accepts Neighbor Discovery packets related to Duplicate Address Detection for the tentative address.
- preferred address β - an address assigned to an interface whose use by upper-layer protocols is unrestricted. Preferred addresses may be used as the source (or destination) address of packets sent from (or to) the interface.
- deprecated address π₯ - An address assigned to an interface whose use is discouraged, but not forbidden. A deprecated address should no longer be used as a source address in new communications, but packets sent from or to deprecated addresses are delivered as expected. A deprecated address may continue to be used as a source address in communications where switching to a preferred address causes hardship to a specific upper-layer activity (e.g., an existing TCP connection).
- valid address β - a preferred or deprecated address. A valid address may appear as the source or destination address of a packet, and the Internet routing system is expected to deliver packets sent to a valid address to their intended recipients.
- invalid address π - an address that is not assigned to any interface. A valid address becomes invalid when its valid lifetime expires. Invalid addresses should not appear as the destination or source address of a packet. In the former case, the Internet routing system will be unable to deliver the packet; in the latter case, the recipient of the packet will be unable to respond to it.
- preferred lifetime β³ - the length of time that a valid address is preferred (i.e., the time until deprecation). When the preferred lifetime expires, the address becomes deprecated.
- valid lifetime β - the length of time an address remains in the valid state (i.e., the time until invalidation). The valid lifetime must be greater than or equal to the preferred lifetime. When the valid lifetime expires, the address becomes invalid.
- interface identifier πͺͺ - a link-dependent identifier for an interface that is (at least) unique per link [RFC4291]. Stateless address autoconfiguration combines an interface identifier with a prefix to form an address. From address autoconfiguration's perspective, an interface identifier is a bit string of known length. The exact length of an interface identifier and the way it is created is defined in a separate link-type specific document that covers issues related to the transmission of IP over a particular link type (e.g., [RFC2464]). Note that the address architecture [RFC4291] also defines the length of the interface identifiers for some set of addresses, but the two sets of definitions must be consistent. In many cases, the identifier will be derived from the interface's link-layer address.
2.1. Requirements
okay bestie, this is the important bit π The requirement keywords work like a contract, so read them carefully π«Ά
The keywords MUST, MUST NOT, REQUIRED, SHALL, SHALL NOT, SHOULD, SHOULD NOT, RECOMMENDED, MAY, and OPTIONAL, when they appear in this document, are to be interpreted as described in [RFC2119].
Note that this document intentionally limits the use of the keywords to the protocol specification (Section 5). π
3. Design Goals
the vibe here is "why does stateless autoconfiguration even exist?" π§ It was designed with the following goals in mind β¨
- Manual configuration π οΈ - Manual configuration of individual machines before connecting them to the network should not be required. Consequently, a mechanism is needed that allows a host to obtain or create unique addresses for each of its interfaces. Address autoconfiguration assumes that each interface can provide a unique identifier for that interface (i.e., an "interface identifier"). In the simplest case, an interface identifier consists of the interface's link-layer address. An interface identifier can be combined with a prefix to form an address.
- Small sites π‘ - Small sites consisting of a set of machines attached to a single link should not require the presence of a DHCPv6 server or router as a prerequisite for communicating. Plug-and-play communication is achieved through the use of link-local addresses. Link-local addresses have a well-known prefix that identifies the (single) shared link to which a set of nodes attach. A host forms a link-local address by appending an interface identifier to the link-local prefix.
- Large sites ποΈ - A large site with multiple networks and routers should not require the presence of a DHCPv6 server for address configuration. In order to generate global addresses, hosts must determine the prefixes that identify the subnets to which they attach. Routers generate periodic Router Advertisements that include options listing the set of active prefixes on a link.
- Graceful renumbering π - Address configuration should facilitate the graceful renumbering of a site's machines. For example, a site may wish to renumber all of its nodes when it switches to a new network service provider. Renumbering is achieved through the leasing of addresses to interfaces and the assignment of multiple addresses to the same interface. Lease lifetimes provide the mechanism through which a site phases out old prefixes. The assignment of multiple addresses to an interface provides for a transition period during which both a new address and the one being phased out work simultaneously. π¦
4. Protocol Overview β¨
okay so this section is basically the step-by-step tour of what happens when an interface autoconfigures itself π§. autoconfig only happens on multicast-capable links, and it kicks off when a multicast-capable interface gets enabled, like during system startup πΈ. nodes (hosts AND routers) start by generating a link-local address for the interface. a link-local address is made by tacking an interface identifier onto the well-known link-local prefix [RFC4291] π
before that link-local address can actually be assigned and used, a node has to check that its "tentative" address isn't already taken by someone else on the link π. so it sends a Neighbor Solicitation with the tentative address as the target. if another node is already using that address, it sends back a Neighbor Advertisement saying so π. if another node is trying to grab the same address at the same time, it'll send a Neighbor Solicitation for the target too. the exact number of times the Neighbor Solicitation is (re)transmitted, and the delay between consecutive solicitations, is link-specific and can be set by system management β¨
if a node figures out its tentative link-local address is NOT unique, autoconfiguration stops and manual configuration of the interface is required π. to make recovery easier in that case, it should be possible for an administrator to supply an alternate interface identifier. that identifier overrides the default one, so autoconfiguration can run again using the new (presumably unique) interface identifier π. otherwise, link-local and other addresses will need to be configured manually.
once a node confirms its tentative link-local address is unique, it assigns the address to the interface π. at this point the node has IP-level connectivity with its neighbors. the remaining autoconfiguration steps are only performed by hosts. the (auto)configuration of routers is beyond the scope of this document, so we're not going there today π ββοΈ
the next phase involves getting a Router Advertisement, or figuring out that no routers are present π. if routers ARE around, they'll send Router Advertisements that specify what sort of autoconfiguration a host can do. also, the DHCPv6 service for address configuration may still be available even when no routers are present π¦
routers send Router Advertisements periodically, but the gap between advertisements is usually longer than a host doing autoconfiguration will want to wait [RFC4861]. so to get an advertisement quickly, a host sends one or more Router Solicitations to the all-routers multicast group πββοΈπ¨
Router Advertisements also contain zero or more Prefix Information options. those are used by stateless address autoconfiguration to generate global addresses π. it's worth noting that a host may use both stateless address autoconfiguration and DHCPv6 at the same time π«Ά. one Prefix Information option field, the "autonomous address-configuration flag", tells you whether or not the option even applies to stateless autoconfiguration π©. if it does apply, the additional option fields hold a subnet prefix, plus lifetime values that say how long addresses made from that prefix stay preferred and valid β³
because routers keep sending Router Advertisements periodically, hosts will keep getting new ones. hosts process the info in each advertisement as described above, adding to and refreshing the info from earlier advertisements π
by default, all addresses should be tested for uniqueness before they get assigned to an interface, for safety π‘οΈ. the test should be done individually for all addresses obtained manually, via stateless address autoconfiguration, or via DHCPv6. some sites think the overhead of Duplicate Address Detection outweighs its benefits, so for them, it can be disabled through the administrative setting of a per-interface configuration flag π
to speed things up, a host may generate its link-local address (and verify its uniqueness) in parallel with waiting for a Router Advertisement β‘. this matters because a router may delay responding to a Router Solicitation for a few seconds. so if the two steps happen one after the other, the total time to finish autoconfiguration can be a lot longer π’
4.1. Site Renumbering
okay this one is the drama π. address leasing makes site renumbering way easier, because it gives you a mechanism to time out addresses assigned to interfaces in hosts β°. right now, upper-layer protocols like TCP don't support changing endpoint addresses while a connection is open π. if an endpoint address becomes invalid, existing connections break and all communication to that invalid address fails. even when applications use UDP, addresses generally need to stay the same during a packet exchange π¬
so valid addresses get split into preferred and deprecated categories ποΈ. this tells upper layers that a valid address may become invalid soon, and that future communication using it will fail if its valid lifetime expires before the communication ends β οΈ. to avoid that, higher layers should use a preferred address (assuming one of sufficient scope exists), which makes it more likely the address stays valid for the whole communication π§ . it's up to system administrators to set appropriate prefix lifetimes so the damage from failed communication is as small as possible when renumbering happens π οΈ. the deprecation period should be long enough that most, if not all, communications are using the new address by the time an address becomes invalid π«
the IP layer is expected to give upper layers (including applications) a way to pick the most appropriate source address for a given destination, and maybe other constraints too π―. an application can choose the source address itself before starting a new communication, or it can leave the address unspecified. in that case, the upper networking layers use the IP layer's mechanism to pick a suitable address on the application's behalf π€
detailed address selection rules are beyond the scope of this document and are described in [RFC3484] π
5. Protocol Specification π
this is the part where the rules get real, bestie π₯Ή. autoconfiguration is done per-interface, on multicast-capable interfaces π. for multihomed hosts, autoconfiguration runs independently on each interface π . autoconfiguration mostly applies to hosts, with two exceptions. routers are expected to generate a link-local address using the procedure outlined below π£οΈ. and routers also perform Duplicate Address Detection on all addresses before assigning them to an interface π
5.1. Node Configuration Variables
a node MUST allow the following autoconfiguration-related variable to be configured by system management for each multicast-capable interface. this part is non-negotiable, periodt π
DupAddrDetectTransmits β the number of consecutive Neighbor Solicitation messages sent while performing Duplicate Address Detection on a tentative address. a value of zero means Duplicate Address Detection is not performed on tentative addresses π
. a value of one means a single transmission with no follow-up retransmissions 1οΈβ£
Default: 1, but it may be overridden by a link-type specific value in the document that covers issues related to transmitting IP over a particular link type (e.g., [RFC2464]) π
autoconfiguration also assumes the presence of the variable RetransTimer as defined in [RFC4861] β±οΈ. for autoconfiguration purposes, RetransTimer specifies the delay between consecutive Neighbor Solicitation transmissions during Duplicate Address Detection (if DupAddrDetectTransmits is greater than 1). it also specifies how long a node waits after sending the last Neighbor Solicitation before ending the Duplicate Address Detection process π
5.2. Autoconfiguration-Related Structures
beyond forming a link-local address and using Duplicate Address Detection, how routers (auto)configure their interfaces is beyond the scope of this document πββοΈ
a host keeps a list of addresses together with their corresponding lifetimes π. the address list includes both autoconfigured addresses and manually configured ones π
5.3. Creation of Link-Local Addresses
a node forms a link-local address whenever an interface becomes enabled π±. an interface may become enabled after any of these events:
- the interface is initialized at system startup time π
- the interface is reinitialized after a temporary interface failure, or after being temporarily disabled by system management π
- the interface attaches to a link for the first time. this includes the case where the attached link is dynamically changed due to a change of the access point of wireless networks πΆ
- the interface becomes enabled by system management after having been administratively disabled β
a link-local address is formed by combining the well-known link-local prefix FE80::0 [RFC4291] (of appropriate length) with an interface identifier, like this:
- the left-most 'prefix length' bits of the address are those of the link-local prefix π§©
- the bits in the address to the right of the link-local prefix are set to all zeroes 0οΈβ£
- if the length of the interface identifier is N bits, the right-most N bits of the address are replaced by the interface identifier π
if the sum of the link-local prefix length and N is larger than 128, autoconfiguration fails and manual configuration is required π₯. the length of the interface identifier is defined in a separate link-type-specific document, which should also be consistent with the address architecture [RFC4291] (see Section 2). those documents will carefully define the length so that link-local addresses can be autoconfigured on the link π§
a link-local address has an infinite preferred and valid lifetime. it is never timed out βΎοΈπ
5.4. Duplicate Address Detection β¨
okay so bestie, Duplicate Address Detection MUST be performed on all unicast addresses before they get assigned to an interface π it doesn't matter how the address showed up, whether it came from stateless autoconfiguration, DHCPv6, or someone typing it in by hand π«Ά there are three exceptions though, so let's get into them:
- An interface whose
DupAddrDetectTransmitsvariable is set to zero does not perform Duplicate Address Detection. π - Duplicate Address Detection MUST NOT be performed on anycast addresses (note that anycast addresses cannot syntactically be distinguished from unicast addresses). π§
- Each individual unicast address SHOULD be tested for uniqueness. Note that there are implementations deployed that only perform Duplicate Address Detection for the link-local address and skip the test for the global address that uses the same interface identifier as that of the link-local address. Whereas this document does not invalidate such implementations, this kind of "optimization" is NOT RECOMMENDED, and new implementations MUST NOT do that optimization. This optimization came from the assumption that all of an interface's addresses are generated from the same identifier. However, the assumption does actually not stand π new types of addresses have been introduced where the interface identifiers are not necessarily the same for all unicast addresses on a single interface [RFC4941] [RFC3972]. Requiring that Duplicate Address Detection be performed for all unicast addresses will make the algorithm robust for the current and future special interface identifiers. π
The procedure for detecting duplicate addresses uses Neighbor Solicitation and Advertisement messages, as described below. If a duplicate address is discovered during the procedure, the address cannot be assigned to the interface. If the address is derived from an interface identifier, a new identifier will need to be assigned to the interface, or all IP addresses for the interface will need to be manually configured. Note that the method for detecting duplicates is not completely reliable, and it is possible that duplicate addresses will still exist (e.g., if the link was partitioned while Duplicate Address Detection was performed). it's giving "trust but verify" energy π¦
An address on which the Duplicate Address Detection procedure is applied is said to be tentative until the procedure has completed successfully. A tentative address is not considered "assigned to an interface" in the traditional sense. That means the interface must accept Neighbor Solicitation and Advertisement messages containing the tentative address in the Target Address field, but it processes those packets differently from the ones whose Target Address matches an address assigned to the interface. Other packets addressed to the tentative address should be silently discarded. Note that the "other packets" include Neighbor Solicitation and Advertisement messages that have the tentative (i.e., unicast) address as the IP destination address and contain the tentative address in the Target Address field. Such a case should not happen in normal operation, though, since these messages are multicasted in the Duplicate Address Detection procedure. πΈ
It should also be noted that Duplicate Address Detection must be performed prior to assigning an address to an interface, so that multiple nodes don't end up using the same address simultaneously. If a node begins using an address in parallel with Duplicate Address Detection, and another node is already using that address, the node performing Duplicate Address Detection will erroneously process traffic intended for the other node. The result can include negative consequences like resetting open TCP connections. π not the vibe, babe
The following subsections describe specific tests a node performs to verify an address's uniqueness. An address is considered unique if none of the tests indicate the presence of a duplicate address within RetransTimer milliseconds after having sent DupAddrDetectTransmits Neighbor Solicitations. Once an address is determined to be unique, it may be assigned to an interface. β¨
5.4.1. Message Validation
A node MUST silently discard any Neighbor Solicitation or Advertisement message that does not pass the validity checks specified in [RFC4861]. A Neighbor Solicitation or Advertisement message that passes these validity checks is called a valid solicitation or valid advertisement, respectively. π
5.4.2. Sending Neighbor Solicitation Messages
Before sending a Neighbor Solicitation, an interface MUST join the all-nodes multicast address and the solicited-node multicast address of the tentative address. The former makes sure the node receives Neighbor Advertisements from other nodes already using the address, and the latter makes sure two nodes trying to use the same address at the same time should detect each other's presence. π
To check an address, a node sends DupAddrDetectTransmits Neighbor Solicitations, each separated by RetransTimer milliseconds. The solicitation's Target Address is set to the address being checked, the IP source is set to the unspecified address, and the IP destination is set to the solicited-node multicast address of the target address. π¦
If the Neighbor Solicitation is going to be the first message sent from an interface after interface (re)initialization, the node SHOULD delay joining the solicited-node multicast address by a random delay between 0 and MAX_RTR_SOLICITATION_DELAY, as specified in [RFC4861]. This helps ease congestion when many nodes start up on the link at the same time, such as after a power failure, and may help avoid race conditions when more than one node is trying to solicit for the same address at the same time. β
Even if the Neighbor Solicitation is not going to be the first message sent, the node SHOULD delay joining the solicited-node multicast address by a random delay between 0 and MAX_RTR_SOLICITATION_DELAY if the address being checked is configured by a router advertisement message sent to a multicast address. The delay avoids similar congestion when multiple nodes are going to configure addresses by receiving the same single multicast router advertisement. π
Note that when a node joins a multicast address, it typically sends a Multicast Listener Discovery (MLD) report message [RFC2710] [RFC3810] for that multicast address. In the case of Duplicate Address Detection, the MLD report message is required in order to inform MLD-snooping switches, rather than routers, to forward multicast packets. In the description above, delaying the join for the multicast address thus means delaying transmission of the corresponding MLD report message. Since the MLD specifications do not request a random delay to avoid race conditions, just delaying Neighbor Solicitation would cause congestion from the MLD report messages. That congestion would then stop the MLD-snooping switches from working correctly and, as a result, stop Duplicate Address Detection from working. The requirement to include the delay for the MLD report in this case avoids that whole scenario. [RFC3590] also talks about some interaction issues between Duplicate Address Detection and MLD, and specifies which source address should be used for the MLD report in this case. π§
In order to improve the robustness of the Duplicate Address Detection algorithm, an interface MUST receive and process datagrams sent to the all-nodes multicast address or solicited-node multicast address of the tentative address during the delay period. This does not necessarily conflict with the requirement that joining the multicast group be delayed. In fact, in some cases it is possible for a node to start listening to the group during the delay period, before the MLD report is transmitted. It should be noted, however, that in some link-layer environments, particularly with MLD-snooping switches, no multicast reception will be available until the MLD report is sent. π
5.4.3. Receiving Neighbor Solicitation Messages
On receipt of a valid Neighbor Solicitation message on an interface, node behavior depends on whether or not the target address is tentative. If the target address is not tentative (i.e., it is assigned to the receiving interface), the solicitation is processed as described in [RFC4861]. If the target address is tentative, and the source address is a unicast address, the solicitation's sender is performing address resolution on the target, so the solicitation should be silently ignored. Otherwise, processing takes place as described below. In all cases, a node MUST NOT respond to a Neighbor Solicitation for a tentative address. π«Ά
If the source address of the Neighbor Solicitation is the unspecified address, the solicitation is from a node performing Duplicate Address Detection. If the solicitation is from another node, the tentative address is a duplicate and should not be used (by either node). If the solicitation is from the node itself (because the node loops back multicast packets), the solicitation does not indicate the presence of a duplicate address. π₯
Implementer's Note: many interfaces provide a way for upper layers to selectively enable and disable the looping back of multicast packets. The details of how such a facility is implemented may prevent Duplicate Address Detection from working correctly. See Appendix A for further discussion. π
The following tests identify conditions under which a tentative address is not unique:
- If a Neighbor Solicitation for a tentative address is received before one is sent, the tentative address is a duplicate. This condition occurs when two nodes run Duplicate Address Detection simultaneously, but transmit initial solicitations at different times (e.g., by selecting different random delay values before joining the solicited-node multicast address and transmitting an initial solicitation). π
- If the actual number of Neighbor Solicitations received exceeds the number expected based on the loopback semantics (e.g., the interface does not loop back the packet, yet one or more solicitations was received), the tentative address is a duplicate. This condition occurs when two nodes run Duplicate Address Detection simultaneously and transmit solicitations at roughly the same time. π
5.4.4. Receiving Neighbor Advertisement Messages
On receipt of a valid Neighbor Advertisement message on an interface, node behavior depends on whether the target address is tentative or matches a unicast or anycast address assigned to the interface:
- If the target address is tentative, the tentative address is not unique. π«
- If the target address matches a unicast address assigned to the receiving interface, it would possibly indicate that the address is a duplicate, but it has not been detected by the Duplicate Address Detection procedure (recall that Duplicate Address Detection is not completely reliable). How to handle such a case is beyond the scope of this document. π€·
- Otherwise, the advertisement is processed as described in [RFC4861]. πΈ
5.4.5. When Duplicate Address Detection Fails π
okay so if a tentative address gets flagged as a duplicate (see above π), it MUST NOT be assigned to an interface, and the node SHOULD log a system management error π
if the address is a link-local address built from an interface identifier based on the hardware address (the kind that's supposed to be uniquely assigned, like EUI-64 for an Ethernet interface), IP operation on the interface SHOULD be disabled β disabling IP operation means the node will:
- not send any IP packets from the interface,
- silently drop any IP packets received on the interface, and
- not forward any IP packets to the interface (when acting as a router or processing a packet with a Routing header).
ngl this one is so important π the IP address duplication probably means duplicate hardware addresses are in use, and trying to fix it by configuring another IP address won't give you a usable network. it probably makes things worse by creating problems that are way harder to diagnose than just turning off network operation on the interface. the user would see a partially working network where some things work and other things don't, and that's the messiest vibe ever π
on the other hand, if the duplicate link-local address is not formed from an interface identifier based on the hardware address (which is supposed to be uniquely assigned), IP operation on the interface MAY be continued β¨
Note: as specified in Section 2, "IP" means "IPv6" in the above description. While the background rationale about hardware address is independent of particular network protocols, its effect on other protocols is beyond the scope of this document. π§
5.5. Creation of Global Addresses π
global addresses are formed by appending an interface identifier to a prefix of appropriate length π the prefixes come from Prefix Information options inside Router Advertisements. creation of global addresses as described in this section SHOULD be locally configurable, but the processing described below MUST be enabled by default π₯
5.5.1. Soliciting Router Advertisements π‘
Router Advertisements get sent periodically to the all-nodes multicast address. if you want one fast, a host sends out Router Solicitations as described in [RFC4861] π¦
5.5.2. Absence of Router Advertisements π«₯
even if a link has no routers, the DHCPv6 service to get addresses might still be available, and hosts may want to use it π from the autoconfiguration point of view, a link has no routers if no Router Advertisements are received after sending a small number of Router Solicitations as described in [RFC4861] π
bestie, it's possible there's no router on the link in this sense, but there's still a node that can forward packets π in that case, the forwarding node's address must be manually configured in hosts so they can send packets off-link, because the only mechanism that configures the default router's address automatically is the one using Router Advertisements π
5.5.3. Router Advertisement Processing π§
for each Prefix-Information option in the Router Advertisement:
- a) If the Autonomous flag is not set, silently ignore the Prefix Information option.
- b) If the prefix is the link-local prefix, silently ignore the Prefix Information option.
- c) If the preferred lifetime is greater than the valid lifetime, silently ignore the Prefix Information option. A node MAY wish to log a system management error in this case.
- d) If the prefix advertised is not equal to the prefix of an address configured by stateless autoconfiguration already in the list of addresses associated with the interface (where "equal" means the two prefix lengths are the same and the first prefix-length bits of the prefixes are identical), and if the Valid Lifetime is not 0, form an address (and add it to the list) by combining the advertised prefix with an interface identifier of the link as follows:
| 128 - N bits | N bits |
+---------------------------------------+------------------------+
| link prefix | interface identifier |
+----------------------------------------------------------------+
If the sum of the prefix length and interface identifier length does not equal 128 bits, the Prefix Information option MUST be ignored. An implementation MAY wish to log a system management error in this case. The length of the interface identifier is defined in a separate link-type specific document, which should also be consistent with the address architecture [RFC4291] (see Section 2).
It is the responsibility of the system administrator to ensure that the lengths of prefixes contained in Router Advertisements are consistent with the length of interface identifiers for that link type. It should be noted, however, that this does not mean the advertised prefix length is meaningless. In fact, the advertised length has non-trivial meaning for on-link determination in [RFC4861], where the sum of the prefix length and the interface identifier length may not be equal to 128. Thus, it should be safe to validate the advertised prefix length here, in order to detect and avoid a configuration error specifying an invalid prefix length in the context of address autoconfiguration.
Note that a future revision of the address architecture [RFC4291] and a future link-type-specific document, which will still be consistent with each other, could potentially allow for an interface identifier of a length other than the value defined in the current documents. Thus, an implementation should not assume a particular constant. Rather, it should expect any lengths of interface identifiers.
If an address is formed successfully and the address is not yet in the list, the host adds it to the list of addresses assigned to the interface, initializing its preferred and valid lifetime values from the Prefix Information option. Note that the check against the prefix performed at the beginning of this step cannot always detect the address conflict in the list. It could be possible that an address already in the list, configured either manually or by DHCPv6, happens to be identical to the newly created address, whereas such a case should be atypical.
- e) If the advertised prefix is equal to the prefix of an address configured by stateless autoconfiguration in the list, the preferred lifetime of the address is reset to the Preferred Lifetime in the received advertisement. The specific action to perform for the valid lifetime of the address depends on the Valid Lifetime in the received advertisement and the remaining time to the valid lifetime expiration of the previously autoconfigured address. We call the remaining time "RemainingLifetime" in the following discussion:
- If the received Valid Lifetime is greater than 2 hours or greater than RemainingLifetime, set the valid lifetime of the corresponding address to the advertised Valid Lifetime.
- If RemainingLifetime is less than or equal to 2 hours, ignore the Prefix Information option with regards to the valid lifetime, unless the Router Advertisement from which this option was obtained has been authenticated (e.g., via Secure Neighbor Discovery [RFC3971]). If the Router Advertisement was authenticated, the valid lifetime of the corresponding address should be set to the Valid Lifetime in the received option.
- Otherwise, reset the valid lifetime of the corresponding address to 2 hours.
The above rules address a specific denial-of-service attack in which a bogus advertisement could contain prefixes with very small Valid Lifetimes. Without the above rules, a single unauthenticated advertisement containing bogus Prefix Information options with short Valid Lifetimes could cause all of a node's addresses to expire prematurely. The above rules ensure that legitimate advertisements (which are sent periodically) will "cancel" the short Valid Lifetimes before they actually take effect. π‘οΈ
Note that the preferred lifetime of the corresponding address is always reset to the Preferred Lifetime in the received Prefix Information option, regardless of whether the valid lifetime is also reset or ignored. The difference comes from the fact that the possible attack for the preferred lifetime is relatively minor. Additionally, it is even undesirable to ignore the preferred lifetime when a valid administrator wants to deprecate a particular address by sending a short preferred lifetime (and the valid lifetime is ignored by accident). π
5.5.4. Address Lifetime Expiry β³
a preferred address becomes deprecated when its preferred lifetime expires. a deprecated address SHOULD continue to be used as a source address in existing communications, but SHOULD NOT be used to initiate new communications if an alternate (non-deprecated) address of sufficient scope can easily be used instead πΈ
whether starting new communication with a non-deprecated address is feasible may be an application-specific decision, since only the application knows whether the (now) deprecated address was (or still is) in use by the application π§ for example, if an application explicitly specifies that the protocol stack use a deprecated address as a source address, the protocol stack must accept that. the application might ask for it because that IP address is used in higher-level communication, and there might be a requirement that the multiple connections in such a grouping use the same pair of IP addresses π«Ά
IP and higher layers (e.g., TCP, UDP) MUST continue to accept and process datagrams destined to a deprecated address as normal, since a deprecated address is still a valid address for the interface β in the case of TCP, this means TCP SYN segments sent to a deprecated address are responded to using the deprecated address as a source address in the corresponding SYN-ACK (if the connection would otherwise be allowed) π¦’
An implementation MAY prevent any new communication from using a deprecated address, but system management MUST have the ability to disable such a facility, and the facility MUST be disabled by default βοΈ
other subtle cases should also be noted about source address selection π for example, the above description doesn't clarify which address should be used between a deprecated, smaller-scope address and a non-deprecated, sufficient-scope address. the details of address selection, including this case, are described in [RFC3484] and are beyond the scope of this document π
an address (and its association with an interface) becomes invalid when its valid lifetime expires. an invalid address MUST NOT be used as a source address in outgoing communications and MUST NOT be recognized as a destination on a receiving interface π«π
5.6. Configuration Consistency β¨
okay so hosts can end up getting address info from BOTH stateless autoconfiguration and DHCPv6, because both can be turned on at the same time π«Ά. other config stuff like MTU size and hop limit can also come from both Router Advertisements and DHCPv6 πΈ. if several sources give the same config info, the value should be consistent. but it's not a fatal error if the info from different sources doesn't match π. hosts just accept the union of everything they learned via Neighbor Discovery and DHCPv6 π
if the info clashes between sources, an implementation may want to give securely learned info precedence over info learned without protection π. for example, Section 8 of [RFC3971] talks about handling info learned through Secure Neighbor Discovery that conflicts with info from plain Neighbor Discovery. the same thinking can apply to plain Neighbor Discovery vs. secured DHCPv6, and so on π
anyway, if there's no security difference, the most recently obtained values SHOULD have precedence over info learned earlier π
5.7. Retaining Configured Addresses for Stability π§Έ
an implementation with stable storage may want to keep addresses in that storage when they were acquired through stateless address autoconfiguration πΎ. assuming the lifetimes are reasonable, a temporary router outage (shorter than the valid lifetime) will never make a node lose its global address, even if the node reboots π¦. when you do this, it's also worth noting that the expiration times of the preferred and valid lifetimes must be retained, so an address doesn't get used after it's already deprecated or invalid β°
more details on this kind of extension are out of scope for this document, so that's a story for another day π
6. Security Considerations π¨
this section is SERIOUS, bestie. stateless address autoconfiguration lets a host plug into a network, configure an address, and start talking to other nodes without ever registering or authenticating itself with the local site π³. yes, this lets unauthorized users connect to and use a network, but the threat is inherently present in the Internet architecture. any node with a physical attachment to a network can generate an address (using a variety of ad hoc techniques) that provides connectivity π«
the use of stateless address autoconfiguration and Duplicate Address Detection opens the door to several denial-of-service attacks π. for example, any node can respond to Neighbor Solicitations for a tentative address, which makes the other node reject the address as a duplicate. a separate document [RFC3756] digs into the details of these attacks. they can be addressed with the Secure Neighbor Discovery protocol [RFC3971]. also, [RFC3756] points out that using IP security isn't always feasible, depending on the network environment π
7. Acknowledgements π«Ά
Thomas Narten and Susan Thompson were the authors of RFCs 1971 and 2462. for this revision of the RFC, Tatuya Jinmei was the sole editor π
the authors of RFC 2461 wanted to thank the members of both the IPNG (which is now IPV6) and ADDRCONF working groups for their input. special thanks to Jim Bound, Steve Deering, Richard Draves, and Erik Nordmark π. thanks also to John Gilmore for alerting the WG to the "0 Lifetime Prefix Advertisement" denial-of-service attack vulnerability. this document incorporates changes that address this vulnerability β¨
a bunch of people helped identify issues with RFC 2461 and propose resolutions that are reflected in this version of the document π§. in addition to those listed above, the contributors include Jari Arkko, James Carlson, Brian E. Carpenter, Gregory Daley, Elwyn Davies, Ralph Droms, Jun-ichiro Itojun Hagino, Christian Huitema, Suresh Krishnan, Soohong Daniel Park, Markku Savela, Pekka Savola, Hemant Singh, Bernie Volz, Margaret Wasserman, and Vlad Yasevich π
8. References π
8.1. Normative References
[RFC2464] Crawford, M., "Transmission of IPv6 Packets over
Ethernet Networks", RFC 2464, December 1998.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC4291] Hinden, R. and S. Deering, "IP Version 6 Addressing
Architecture", RFC 4291, February 2006.
[RFC4861] Narten, T., Nordmark, E., Simpson, W., and H. Soliman,
"Neighbor Discovery for IP version 6 (IPv6)", RFC 4861,
September 2007.
8.2. Informative References
[RFC3315] Droms, R., Bound, J., Volz, B., Lemon, T., Perkins, C.,
and M. Carney, "Dynamic Host Configuration Protocol for
IPv6 (DHCPv6)", RFC 3315, July 2003.
[RFC3484] Draves, R., "Default Address Selection for Internet
Protocol version 6 (IPv6)", RFC 3484, February 2003.
[RFC4941] Narten, T., Draves, R., and S. Krishnan, "Privacy
Extensions for Stateless Address Autoconfiguration in
IPv6", RFC 4941, September 2007.
[RFC3972] Aura, T., "Cryptographically Generated Addresses
(CGA)", RFC 3972, March 2005.
[RFC2710] Deering, S., Fenner, W., and B. Haberman, "Multicast
Listener Discovery (MLD) for IPv6", RFC 2710,
October 1999.
[RFC3810] Vida, R. and L. Costa, "Multicast Listener Discovery
Version 2 (MLDv2) for IPv6", RFC 3810, June 2004.
[RFC3590] Haberman, B., "Source Address Selection for the
Multicast Listener Discovery (MLD) Protocol", RFC 3590,
September 2003.
[RFC3971] Arkko, J., Kempf, J., Zill, B., and P. Nikander,
"SEcure Neighbor Discovery (SEND)", RFC 3971,
March 2005.
[RFC3756] Nikander, P., Kempf, J., and E. Nordmark, "IPv6
Neighbor Discovery (ND) Trust Models and Threats",
RFC 3756, May 2004.
[RFC1112] Deering, S., "Host extensions for IP multicasting",
STD 5, RFC 1112, August 1989.
[IEEE802.11] IEEE, "Wireless LAN Medium Access Control (MAC) and
Physical Layer (PHY) Specifications", ANSI/IEEE
STd 802.11, August 1999.
Appendix A. Loopback Suppression and Duplicate Address Detection π
figuring out whether a received multicast solicitation got looped back to the sender or actually came from another node is implementation-dependent π€. things get messy when two interfaces on the same link happen to have the same identifier and link-layer address, and both send packets with identical contents at roughly the same time (e.g., Neighbor Solicitations for a tentative address as part of Duplicate Address Detection messages). the receiver gets both packets, but it can't tell which one was looped back and which one came from the other node just by comparing contents, since they're identical π΅. in this particular case, you don't need to know exactly which packet was looped back. if one receives more solicitations than were sent, the tentative address is a duplicate. however, the situation may not always be this straightforward π
the IPv4 multicast specification [RFC1112] recommends that the service interface provide a way for an upper-layer protocol to inhibit local delivery of packets sent to a multicast group that the sending host is a member of. some applications know there won't be any other group members on the same host, and suppressing loopback saves them from having to receive (and discard) the packets they sent themselves π. a straightforward way to do this is to disable loopback at the hardware level (if the hardware supports it), with packets looped back (if requested) by software. on interfaces where the hardware itself suppresses loopbacks, a node running Duplicate Address Detection simply counts the Neighbor Solicitations received for a tentative address and compares that count with the number expected. if there's a mismatch, the tentative address is a duplicate β¨
when the hardware can't suppress loopbacks, one possible software heuristic to filter out unwanted loopbacks is to discard any received packet whose link-layer source address is the same as the receiving interface's. there's even a link-layer specification that requires any such packets to be discarded [IEEE802.11]. unfortunately, using that criterion also means discarding all packets sent by another node that uses the same link-layer address π. Duplicate Address Detection will fail on interfaces that filter received packets this way:
- If a node performing Duplicate Address Detection discards received packets that have the same source link-layer address as the receiving interface, it will also discard packets from other nodes that use the same link-layer address. that includes Neighbor Advertisement and Neighbor Solicitation messages required to make Duplicate Address Detection work correctly. this particular problem can be avoided by temporarily disabling the software suppression of loopbacks while a node performs Duplicate Address Detection, if it's possible to disable the suppression.
- If a node that is already using a particular IP address discards received packets that have the same link-layer source address as the interface, it will also discard Duplicate Address Detection-related Neighbor Solicitation messages sent by another node that uses the same link-layer address. consequently, Duplicate Address Detection will fail, and the other node will configure a non-unique address. since it's generally impossible to know when another node is performing Duplicate Address Detection, this scenario can only be avoided if software suppression of loopback is permanently disabled π
so, to perform Duplicate Address Detection correctly when two interfaces use the same link-layer address, an implementation must have a good understanding of the interface's multicast loopback semantics. and the interface cannot discard received packets simply because the source link-layer address is the same as the interface's π. it's also worth noting that a link-layer specification can conflict with the condition necessary to make Duplicate Address Detection work π«
Appendix B. Changes since RFC 1971 π¦
- Changed document to use term "interface identifier" rather than "interface token" for consistency with other IPv6 documents.
- Clarified definition of deprecated address to make clear it is OK to continue sending to or from deprecated addresses.
- Added rules to Section 5.5.3 Router Advertisement processing to address potential denial-of-service attack when prefixes are advertised with very short Lifetimes.
- Clarified wording in Section 5.5.4 to make clear that all upper layer protocols must process (i.e., send and receive) packets sent to deprecated addresses.
Appendix C. Changes since RFC 2462 β¨
Major changes that can affect existing implementations: π
- Specified that a node performing Duplicate Address Detection delay joining the solicited-node multicast group, not just delay sending Neighbor Solicitations, explaining the detailed reason. π§
- Added a requirement for a random delay before sending Neighbor Solicitations for Duplicate Address Detection if the address being checked is configured by a multicasted Router Advertisements. π¦
- Clarified that on failure of Duplicate Address Detection, IP network operation should be disabled and that the rule should apply when the hardware address is supposed to be unique. π₯
Major clarifications: πΈ
- Clarified how the length of interface identifiers should be determined, described the relationship with the prefix length advertised in Router Advertisements, and avoided using a particular length hard-coded in this document. π
- Clarified the processing of received neighbor advertisements while performing Duplicate Address Detection. π
- Removed the text regarding the M and O flags, considering the maturity of implementations and operational experiences.
ManagedFlagandOtherConfigFlagwere removed accordingly. (Note that this change does not mean the use of these flags is deprecated.) π - Avoided the wording of "stateful configuration", which is known to be quite confusing, and simply used "DHCPv6" wherever appropriate. π
- Recommended to perform Duplicate Address Detection for all unicast addresses more strongly, considering a variety of different interface identifiers, while keeping care of existing implementations. β
- Clarified wording in Section 5.5.4 to make clear that a deprecated address specified by an application can be used for any communication. π«Ά
- Clarified the prefix check described in Section 5.5.3 using more appropriate terms and that the check is done against the prefixes of addresses configured by stateless autoconfiguration. π
- Changed the references to the IP security Authentication Header to references to RFC 3971 (Secure Neighbor Discovery). Also revised the Security Considerations section with a reference to RFC 3756. π
- Added a note when an implementation uses stable storage for autoconfigured addresses. π
- Added consideration about preference between inconsistent information sets, one from a secured source and the other learned without protection. π
Other miscellaneous clarifications: β¨
- Removed references to site-local and revised wording around the keyword. π§ββοΈ
- Removed redundant code in denial-of-service protection in Section 5.5.3. π
- Clarified that a unicasted Neighbor Solicitation or Advertisement should be discarded while performing Duplicate Address Detection. π ββοΈ
- Noted in Section 5.3 that an interface can be considered as becoming enabled when a wireless access point changes. πΆ
Authors' Addresses π
Susan Thomson
Cisco Systems
EMail: sethomso@cisco.com
Thomas Narten
IBM Corporation
P.O. Box 12195
Research Triangle Park, NC 27709-2195
USA
Phone: +1 919-254-7798
EMail: narten@us.ibm.com
Tatuya Jinmei
Corporate Research & Development Center, Toshiba Corporation
1 Komukai Toshiba-cho, Saiwai-ku
Kawasaki-shi, Kanagawa 212-8582
Japan
Phone: +81 44-549-2230
EMail: jinmei@isl.rdc.toshiba.co.jp
Full Copyright Statement π
Copyright (C) The IETF Trust (2007).
This document is subject to the rights, licenses and restrictions contained in BCP 78, and except as set forth therein, the authors retain all their rights.
This document and the information contained herein are provided on an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Intellectual Property π§
The IETF takes no position regarding the validity or scope of any Intellectual Property Rights or other rights that might be claimed to pertain to the implementation or use of the technology described in this document or the extent to which any license under such rights might or might not be available; nor does it represent that it has made any independent effort to identify any such rights. Information on the procedures with respect to rights in RFC documents can be found in BCP 78 and BCP 79.
Copies of IPR disclosures made to the IETF Secretariat and any assurances of licenses to be made available, or the result of an attempt made to obtain a general license or permission for the use of such proprietary rights by implementers or users of this specification can be obtained from the IETF on-line IPR repository at http://www.ietf.org/ipr.
The IETF invites any interested party to bring to its attention any copyrights, patents or patent applications, or other proprietary rights that may cover technology that may be required to implement this standard. Please address the information to the IETF at ietf-ipr@ietf.org.
π¦ where this page comes from
- ietf: rfc4862 2007-09
- π girlified by claude-haiku-5-5 on : a language model's rewrite of the original, under its terms