wdiff rfc9131.original rfc9131.txt

IPv6 Maintenance

Internet Engineering Task Force (IETF) J. Linkova
Internet-Draft
Request for Comments: 9131 Google
Updates: 4861 (if approved) July 5, September 2021
Intended status:
Category: Standards Track
Expires: January 6, 2022
ISSN: 2070-1721

Gratuitous Neighbor Discovery: Creating Neighbor Cache Entries on First-
Hop
First-Hop Routers
draft-ietf-6man-grand-07

Abstract

Neighbor Discovery (RFC4861) (RFC 4861) is used by IPv6 nodes to determine the
link-layer addresses of neighboring nodes as well as to discover and
maintain reachability information. This document updates RFC4861 RFC 4861 to
allow routers to proactively create a Neighbor Cache entry when a new
IPv6 address is assigned to a node. It also updates RFC4861 RFC 4861 and
recommends that nodes to send unsolicited Neighbor Advertisements upon
assigning a new IPv6 address. The proposed change These changes will minimize the delay
and packet loss when a node initiates connections to an off-
link off-link
destination from a new IPv6 address.

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 an Internet Standards Track document.

This document is a product of the Internet Engineering Task Force
(IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list It represents the consensus of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.

Internet-Drafts are draft documents valid the IETF community. It has
received public review and has been approved for a maximum publication by the
Internet Engineering Steering Group (IESG). Further information on
Internet Standards is available in Section 2 of RFC 7841.

Information about the current status of six months this document, any errata,
and how to provide feedback on it may be updated, replaced, or obsoleted by other documents obtained 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 January 6, 2022.
https://www.rfc-editor.org/info/rfc9131.

This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://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.

Table of Contents

1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1. Requirements Language . . . . . . . . . . . . . . . . . . 3
1.2. Terminology . . . . . . . . . . . . . . . . . . . . . . . 4
2. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 4
3. Solution Requirements . . . . . . . . . . . . . . . . . . . . 6
4. Changes to Neighbor Discovery . . . . . . . . . . . . . . . . 6
4.1. Nodes Sending Gratuitous Neighbor Advertisements . . . . 7
4.2. Routers Creating Cache Entries Upon upon Receiving Unsolicited
Neighbor Advertisements . . . . . . . . . . . . . . . . . 7
5. Avoiding Disruption . . . . . . . . . . . . . . . . . . . . . 8
5.1. Neighbor Cache Entry Exists in Any State Other Than
INCOMPLETE . . . . . . . . . . . . . . . . . . . . . . . 9
5.2. Neighbor Cache Entry is Is in INCOMPLETE state . . . . . . . 9 State
5.3. Neighbor Cache Entry Does Not Exist . . . . . . . . . . . 10
5.3.1. The Rightful Owner Is Not Sending Packets From The from the
Address . . . . . . . . . . . . . . . . . . . . . . . 11
5.3.2. The Rightful Owner Has Started Sending Packets From
The from the
Address . . . . . . . . . . . . . . . . . . . . . 12
6. Modifications to RFC-Mandated Behavior . . . . . . . . . . . 13
6.1. Modification to RFC4861 Neighbor RFC 4861 (Neighbor Discovery for IP version
6 (IPv6) . . . . . . . . . . . . . . . . . . . . . . . . 13 (IPv6))
6.1.1. Modification to the section Section 7.2.5 . . . . . . . . . . 13 of RFC 4861
6.1.2. Modification to the section Section 7.2.6 . . . . . . . . . . 14 of RFC 4861
7. Solution Limitations . . . . . . . . . . . . . . . . . . . . 15
8. Solutions Considered but Discarded . . . . . . . . . . . . . 16
8.1. Do Nothing . . . . . . . . . . . . . . . . . . . . . . . 16
8.2. Change to the Registration-Based Neighbor Discovery . . . 16
8.3. Host Sending NS to the Router Address from Its GUA . . . 17
8.4. Host Sending Router Solicitation from its Its GUA . . . . . . 17
8.5. Routers Populating Their Caches by Gleaning From from Neighbor
Discovery Packets . . . . . . . . . . . . . . . . . . . . 18
8.6. Initiating Hosts-to-Routers Host-to-Router Communication . . . . . . . . 18
8.7. Making the Probing Logic on Hosts More Robust . . . . . . 19
8.8. Increasing the Buffer Size on Routers . . . . . . . . . . 20
8.9. Transit Dataplane Data Plane Traffic From from a New Address Triggering to Trigger
Address Resolution . . . . . . . . . . . . . . . . . . . 20
9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 20
10. Security Considerations . . . . . . . . . . . . . . . . . . . 21
11. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 22
12. References . . . . . . . . . . . . . . . . . . . . . . . . . 22
12.1.
11.1. Normative References . . . . . . . . . . . . . . . . . . 22
12.2.
11.2. Informative References . . . . . . . . . . . . . . . . . 23
Acknowledgements
Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 24

1. Introduction

The Neighbor Discovery state machine defined in [RFC4861] assumes
that communications between IPv6 nodes are are, in most cases bi-
directional cases,
bidirectional and if a node A is trying to communicate to its
neighbor, node B, the return traffic flows could be expected. So So,
when the node A starts the address resolution process, the target node B
would also create an entry containing A's IPv6 and link-layer
addresses in its
neighbor cache. Neighbor Cache. That entry will be used for sending
the return traffic to A.

In particular, section Section 7.2.5 of [RFC4861] states: "When

| When a valid Neighbor Advertisement is received (either solicited
| or unsolicited), the Neighbor Cache is searched for the target's
| entry. If no entry exists, the advertisement SHOULD be silently
| discarded. There is no need to create an entry if none exists,
| since the recipient has apparently not initiated any communication
| with the target." target.

While this approach is perfectly suitable for host-to-host on-link
communications, it does not work so well when a host sends traffic to
off-link destinations. After joining the network and receiving a
Router Advertisement Advertisement, the host populates its neighbor cache Neighbor Cache with the
default router IPv6 and link-layer addresses and is able to send
traffic to off-link destinations. At the same time time, the router does
not have any cache entries for the host global addresses yet and only
starts address resolution upon receiving the first packet of the
return traffic flow. While waiting for the resolution to complete complete,
routers only keep a very small number of packets in the queue, as
recommended in Section 7.2.2 of [RFC4861]. Any additional packets
arriving before the resolution > process finishes are likely to result
in dropped packets packets. It can cause packet loss and performance
degradation that can be user-visible. visible to users.

This document updates the Neighbor Discovery protocol [RFC4861] to
avoid packet loss in the scenario described above. Section 4
discusses the changes and analyses analyzes the potential impact, while
normative changes to [RFC4861] are specified in Section 6.

1.1. Requirements Language

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
"OPTIONAL" in this document are to be interpreted as described in
BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all
capitals, as shown here.

1.2. Terminology

Node: a A device that implements IP, IP [RFC4861].

Host: any Any node that is not a router, router [RFC4861].

ND: Neighbor Discovery, Discovery [RFC4861].

NC: Neighbor Cache, Cache [RFC4861]. The Neighbor Cache entry can be in
one of five states, as described in section Section 7.3.2 of [RFC4861]:
INCOMPLETE, REACHABLE, STALE, DELAY, or PROBE.

SLAAC: IPv6 Stateless Address Autoconfiguration, Autoconfiguration [RFC4862].

NS: Neighbor Solicitation, Solicitation [RFC4861].

NA: Neighbor Advertisement, Advertisement [RFC4861].

RS: Router Solicitation, Solicitation [RFC4861].

RA: Router Advertisement, Advertisement [RFC4861].

SLLAO: Source link-layer Link-Layer Address Option, an Option. An option in the ND
packets containing the link-layer address of the sender of the
packet [RFC4861].

TLLAO: Target link-layer Link-Layer Address Option, an Option. An option in the ND
packets containing the link-layer address of the target [RFC4861].

GUA: Global Unicast Address [RFC4291].

DAD: Duplicate Address Detection, Detection [RFC4862].

Preferred Address: an An address assigned to an interface whose
uniqueness has been verified using DAD and whose use by upper-layer upper-
layer protocols is unrestricted, unrestricted [RFC4862]. Preferred addresses
may be used as the source address of packets sent from the
interface.

Optimistic DAD: a A modification of DAD, DAD [RFC4429].

2. Problem Statement

The most typical scenario when the problem described in this document
may arise is a host joining the network, forming a new address address, and
using that address for accessing the Internet:

1. A host joins the network and receives a Router Advertisement (RA)
packet from the first-hop router (either a periodic unsolicited
RA or a response to a Router Solicitation sent by the host). The
RA contains information the host needs to perform SLAAC and to
configure its network stack. The RA is sent from the router's
link-local address to a link-local destination address and may
contain the link-layer address of the router. As a result result, the
host can populate its Neighbor Cache with the router's link-local
and link-layer addresses.

2. The host starts opening connections to off-link destinations. A
very common use case is a mobile device sending probes to detect
the
Internet connectivity and/or the presence of a captive portal on
the network. To speed up that process process, many implementations use
Optimistic DAD DAD, which allows them to send probes before the DAD
process is completed. At that moment moment, the device neighbor
cache device's Neighbor
Cache contains all information required to send those probes
(such as the default router link-local and link-layer addresses).
The router neighbor cache, router's Neighbor Cache, however, might contain an entry for
the device device's link-local address (if the device has been
performing
the address resolution for the router router's link-local
address), but there are no entries for any of the device's global
addresses.

3. Return traffic is received by the first-hop router. As the
router does not have any cache entry for the host host's global
address yet, the router starts the neighbor discovery Neighbor Discovery process by
creating an INCOMPLETE cache entry and then sending a Neighbor
Solicitation to the Solicited Node Multicast Address solicited-node multicast address
(Section 7.3.2 of [RFC4861]). As per Section 7.2.2 of [RFC4861]
Routers [RFC4861],
routers MUST buffer at least one data packet and MAY buffer more,
while resolving the packet destination address. However, most
router implementations limit the buffer size to a few packets
only, and some implementations are known to buffer just one
packet. So So, any subsequent packets arriving before the address
resolution process is completed are causing cause packet loss by replacing
older packets in the buffer.

4. If the host sends multiple probes in parallel, in the worst case,
it would consider all but one of them failed. That leads to
user-visible delay in connecting to the network, especially if
the host implements some form of backoff mechanism and does not
retransmit the probes as soon as possible.

This scenario illustrates the problem occurring when the device
connects to the network for the first time or after an inactivity
period long enough for the device device's address to be removed from the
router's neighbor cache. Neighbor Cache. However, the same sequence of events happen
happens when the host starts using a new global address previously
unseen by the router, such as a new privacy address [RFC8981] or if
the router's Neighbor Cache has been flushed.

While in dual-stack networks this problem might be hidden by Happy
Eyeballs [RFC8305] [RFC8305], it manifests quite clearly in IPv6-only
environments, especially wireless ones, environments, leading to poor user
experience and contributing to a negative perception of IPv6-only
solutions as unstable and non-deployable.

3. Solution Requirements

It would be highly desirable to improve the Neighbor Discovery
mechanics so routers have a usable cache entry for a host address by
the time the router receives the first packet for that address. In
particular:

* If the router does not have a Neighbor Cache entry for the
address, a STALE entry needs to be created proactively, prior to
arrival of the first packet intended for that address.

* The solution needs to work for Optimistic addresses Addresses as well.
Devices implementing the Optimistic DAD usually attempt to minimize
the delay in connecting to the network and therefore are more
likely to be affected by the problem described in this document.

* In the case of duplicate addresses present in the network, the
proposed
solution should not override the existing entry.

* In topologies with multiple first-hop routers routers, the cache needs to
be updated on all of them, as traffic might be asymmetric:
outgoing flows leaving the network via one router while the return
traffic enters the segment via another one.

In addition addition, the solution must not exacerbate issues described in
[RFC6583] and needs to be compatible with the recommendations
provided in [RFC6583].

4. Changes to Neighbor Discovery

The following changes are required to minimize the delay in creating
new entries in a router neighbor cache

o router's Neighbor Cache:

* A node sends unsolicited NAs upon assigning a new IPv6 address to
its interface.

* A router creates a new cache entry upon receiving an unsolicited
NA from a host.

The following sections discuss these changes in more detail.
Normative changes are specified in Section 6.

4.1. Nodes Sending Gratuitous Neighbor Advertisements

The section

Section 7.2.6 of [RFC4861] discusses using unsolicited Neighbor
Advertisements to inform node neighbors of the new link-layer address
quickly. The same mechanism could be used to notify the node
neighbors about the new network-layer address as well: the node can
send gratuitous unsolicited Neighbor Advertisements upon assigning a new IPv6
address to its interface.

To minimize the potential disruption in the case of duplicate addresses addresses,
the node should not set the Override flag for a preferred address and
must not set the Override flag if the address is in the Optimistic
[RFC4429] state.
state [RFC4429].

As the main purpose of sending unsolicited NAs upon configuring a new
address is to proactively create a Neighbor Cache entry on the first-
hop routers, the gratuitous NAs are sent to the all-routers multicast
address (ff02::2). Limiting the recipients to routers only would
help reduce the multicast noise level. If the link-layer devices are
performing MLD Multicast Listener Discovery (MLD) snooping [RFC4541],
then those unsolicited NAs will be only be sent to routers on the given
network segment/link, instead of being flooded to all nodes.

It should be noted that the proposed mechanism discussed here does not cause
any significant increase in multicast traffic. The additional
multicast unsolicited NA NAs would proactively create a STALE cache
entry on
routers the router, as discussed below. When the router receives
the return traffic flows flows, it does not need to send multicast NSes to
the
solicited node solicited-node multicast address but would be sending send unicast NSes
instead. Therefore Therefore, this procedure would only produce an increase in
the overall amount of multicast traffic if no return traffic arrives
for the address that sent the unsolicited NA or if the router does
not create a STALE entry upon receiving such an NA. The increase
would be negligible negligible, as that additional traffic is a few orders of
magnitude less than the usual level of Neighbor Discovery multicast
traffic.

4.2. Routers Creating Cache Entries Upon upon Receiving Unsolicited Neighbor
Advertisements

The section

Section 7.2.5 of [RFC4861] states: "When

The reasoning behind dropping unsolicited Neighbor Advertisements
("the recipient has apparently not initiated any communication with
the target") is valid for onlink on-link host-to-host communication but, as
discussed above, in Section 1, it does not really apply for to the scenario when
the host is announcing its address to routers. Therefore, it would
be beneficial to allow routers to create new entries upon receiving
an unsolicited Neighbor Advertisement.

This document updates [RFC4861] so that routers create a new Neighbor
Cache entry upon receiving an unsolicited Neighbor Advertisement for
an address that does not already have a Neighbor Cache entry. . The
proposed These
changes do not modify routers behaviour the router behavior specified in [RFC4861] for
the scenario when the corresponding Neighbor Cache entry already
exists.

The next section analyses analyzes various scenarios of duplicated duplicate addresses
and discusses the potential impact of creating a STALE entry for a
duplicated
duplicate IPv6 address.

5. Avoiding Disruption

If nodes following the recommendations in this document are using the
DAD mechanism defined in [RFC4862], they would send unsolicited NA NAs
as soon as the address changes the state from tentative to preferred
(after its uniqueness has been verified). However, nodes willing to
minimize network stack configuration delays might be using optimistic
addresses, Optimistic
Addresses, which means there is a possibility of the address not
being unique on the link. Section 2.2 of [RFC4429] discusses
measures to ensure that ND packets from the optimistic address Optimistic Address do not
override any existing neighbor cache entries Neighbor Cache entries, as it would cause
traffic
interruption of the rightful address owner owner's traffic in the case of
an address conflict. As nodes Nodes that are willing to speed up their
network stack configuration are most likely to be affected by the
problem outlined in this document document; therefore, it seems reasonable for
such hosts to advertise their optimistic addresses Optimistic Addresses by sending
unsolicited NAs. The main question to consider is the potential risk
of overriding the cache entry for the rightful address owner if the optimistic address
Optimistic Address happens to be duplicated. a duplicate.

The following sections discuss the address collision scenario when a
node sends an unsolicited NA for an address in the Optimistic state,
while another node (the rightful owner) already has the same address assigned
already.
assigned. This document uses the term "the rightful owner" owner", as the
same terminology is used in [RFC4429]. The analysis assumes that the
host performs Duplicate Address Detection, DAD, as section Section 5.4 of [RFC4862] requires that DAD MUST
be performed on all unicast addresses prior to assigning them to an
interface.

5.1. Neighbor Cache Entry Exists in Any State Other Than INCOMPLETE

If the router router's Neighbor Cache entry for the target address already
exists in any state other than INCOMPLETE, then as per section Section 7.2.5
of [RFC4861] [RFC4861], an unsolicited NA with the Override flag cleared would
change the entry state from REACHABLE to STALE but would not update
the entry in any other way. Therefore, even if the host sends an
unsolicited NA from its Optimistic address Address, the router router's cache entry
would not be updated with the new Link-Layer address link-layer address, and no impact to
on the traffic for the rightful address owner is expected.

The return traffic intended for the host with the Optimistic address Address
would be sent to the rightful owner. However, this is unavoidable
with or without the unsolicited NA mechanism.

5.2. Neighbor Cache Entry is Is in INCOMPLETE state State

Another corner case is the INCOMPLETE cache entry for the address.

1. The router receives a packet for the rightful owner of the
address.

2. The router starts the address resolution process by creating an
INCOMPLETE entry and sends the multicast NS.

3. More packets arrive at the router for the address in question.

4. The host configures an Optimistic address Address and sends an
unsolicited NA.

5. The router creates a STALE entry and sends the buffered packet(s)
to the host (while at least some of those packets are actually
intended for the rightful owner).

6. As the STALE entry was used to send packets, the router changes
the entry state to DELAY and waits up to DELAY_FIRST_PROBE_TIME
([RFC4861], 5 secs)
(5 seconds) [RFC4861] before sending a unicast NS.

7. The rightful owner responds to the multicast NS sent at Step 2
with a solicited NA with the Override flag set.

8. The router updates the entry with the TLLAO supplied (the
rightful owner owner's link-layer address) and sets the entry state to
REACHABLE (as the NA has the Solicited flag set).

As a result result, some packets (ones (packets in the buffer at Step 6 and all
packets arriving between Step 6 and Step 8) are delivered to the host
with the Optimisitc address, Optimistic Address, while some of them, if not all, are
intended for the rightful owner. Without the unsolicited NA, packet
which one or
more packets that are in the buffer at Step 8 (usually just one packet
packet, but some routers may buffer a few) would have been delivered
to the rightful owner and the rest of the packets would have been
dropped. However, the probability of such a scenario is rather low low,
as it would require the following things to happen almost
simultaneously (within tens of milliseconds in most cases):

* One host starts using a new IPv6 address and sending traffic
without sending an unsolicited NA first.

* Another host configures the same IPv6 address in Optimistic mode
before the router completes the address resolution process for the
rightful owner.

It should be noted that in this scenario the rigthful rightful owner does not
send any unsolicited NAs before sending packets. If the rightful
owner implements the functionality described in this document and
sends unsolicited NAs upon configuring its address, then the router
creates a STALE entry for the address, causing all packets are to be
delivered to the rightful owner (see Section 5.1). The rightful
owner would experience no disruption but might receive some packets
intended for the host with an Optimistic address. Address.

This section focuses on the scenario when the solicited NA from the
rightful owner arrives after the unsolicited one sent from the
Optimistic address Address (Step 7 and Step 4 4, respectively). If the
solicited NA arrives first first, it changes the NC entry state from
INCOMPLETE to REACHABLE. As discussed in Section 5.1, there will be
no disruption for the rightful owner if the router already has a
REACHABLE entry for the address when an unsolicited NA is received.

5.3. Neighbor Cache Entry Does Not Exist

There are two distinct scenarios which that can lead to the situation when
the router does not have a an NC entry for the IPv6 address:

1. The rightful owner of the address has not been using it for off-
link communication recently or has never used it at all.

2. The rightful owner just started sending packets from that address
address, but the router has not received any return traffic yet.

The impact on the rightful owner's traffic flows would be different
in those cases.

5.3.1. The Rightful Owner Is Not Sending Packets From The from the Address

In this scenario scenario, the following events are expected to happen:

1. The host configures the address and sets its state to Optimistic.

2. The host sends an unsolicited NA with the Override flag set to
zero and starts sending traffic from the Optimistic address. Address.

3. The router creates a STALE entry for the address and the host
link-layer address.

4. The host starts DAD and detects the address duplication.

5. The router receives the return traffic for the duplicated duplicate address.
As the NC entry is STALE STALE, it sends traffic using that entry,
changes it to DELAY DELAY, and waits up to DELAY_FIRST_PROBE_TIME
([RFC4861]) seconds.
seconds [RFC4861].

6. The router changes the NC entry state to PROBE and sends up to
MAX_UNICAST_SOLICIT ([RFC4861]) unicast NSes [RFC4861] separated by
RetransTimer milliseconds ([RFC4861]) [RFC4861] to the host link-layer
address.

7. As the host has already detected the address conflict already conflict, it does
not respond to the unicast NSes. (It is unlikely that the host
has not completed the DAD process at this stage, as
DELAY_FIRST_PROBE_TIME (5 seconds) is much higher than the DAD
duration (DupAddrDetectTransmits*RetransTimer*1000 +
MAX_RTR_SOLICITATION_DELAY secs, section seconds) (Section 5.4 of [RFC4862]). [RFC4862]).)
The default value for the DAD process would be 1*1*1000 + 1 = 2 secs,
seconds [RFC4861]. If the host has completed DAD but did not
detect the address conflict conflict, then there are two hosts with the
same address in the Preferred preferred state and the disruption is inevitable
anyway.

8. As the router receives no response for the unicast NSes, it
deletes the NC entry.

9. If return packets for communication initiated at step Step 2 are still
arriving, the router buffers a small number of those packets and
starts the address resolution process again by sending a
multicast NS to the solicited node solicited-node multicast address. The
rightful owner
responds responds, and the router router's NC entry is updated
with the rightful
owner owner's link-local address. The buffered packet(s)
packet or packets are sent to that address. Any packets still
arriving after the address resolution still process has completed are
sent to the rightful address owner as well.

The rightful owner is not experiencing any disruption disruption, as it does not
send any traffic. It would only start receiving packets intended for
another host after Step 8 is completed and only if return packets for
the communication initiated at step Step 2 are still arriving.

However, the same behaviour behavior would be observed if the changes proposed specified
in this document are not implemented. If the host starts sending
packets from its Optimistic address Address but then changes detects that the address
state to Duplicated,
is a duplicate, the first return packet would trigger the address
resolution process and would be buffered until the resolution is
completed. The buffered packet(s) and any packets still arriving
after the address is resolved would be forwarded to the rightful
owner of the address. So So, the rightful owner might still receive one
or more packets from the flows intended for another host. Therefore,
it's safe to conclude that the proposed changes specified in this document do
not introduce any disruption for the rightful owner of the duplicated
address.

5.3.2. The Rightful Owner Has Started Sending Packets From The from the Address

In this scenario scenario, the following events are happening:

1. The rightful owner starts sending traffic from the address (e.g.
(e.g., the address has just been configured or has not been
recently used).

2. The host configures the address and sets its state to
Optimistic.

3. The host sends an unsolicited NA with the Override flag set to
zero and starts sending traffic from the Optimistic address. Address.

4. The router creates a STALE entry for the address and the host
link-layer address.

5. The host starts DAD and detects the address duplication.

6. The router receives the return traffic for the IPv6 address in
question. Some flows are intended for the rightful owner of the
duplicated
duplicate address, while some are for the new host. As the NC
entry is STALE STALE, it sends traffic using that entry, changes it to
DELAY
DELAY, and waits up to DELAY_FIRST_PROBE_TIME ([RFC4861])
seconds. seconds [RFC4861].

7. The router changes the NC entry state to PROBE and sends up to
MAX_UNICAST_SOLICIT ([RFC4861]) unicast NSes [RFC4861] separated by
RetransTimer milliseconds ([RFC4861]) [RFC4861] to the host link-layer
address.

8. As the host has already detected the address conflict already conflict, it does
not respond to the unicast NSes.

9. As the router receives no response for the unicast NSes, it
deletes the NC entry.

10. The next packet re-creates recreates the entry and triggers the resolution
process. The router buffers the packet and sends a multicast NS
to the solicited node solicited-node multicast address. The rightful owner
responds
responds, and the router router's NC entry is updated with the rightful
owner
owner's link-local address.

As a result result, the traffic for the address of the rightful owner would
be sent to the host with the duplicated duplicate address instead. The duration
of the disruption can be estimated as DELAY_FIRST_PROBE_TIME*1000 +
(MAX_UNICAST_SOLICIT - 1)*RetransTimer milliseconds. As per the
constants defined in Section 10 of [RFC4861] [RFC4861], this interval is equal
to 5*1000 + (3 - 1)*1000 = 7000ms 7000 milliseconds, or 7 seconds.

However, it should be noted that the probability of such a scenario
is rather low. Similary Similar to the scenario discussed in Section 5.2, it
would require the following things to happen almost simultaneously
(within tens of milliseconds in most cases):

* One host starts using a new IPv6 address and sending traffic
without sending an unsolicited NA first.

* Another host configures the same IPv6 address in Optimistic mode
before the router receives the return traffic for the first host.

As discussed in Section 5.2, the disruption to for the rightful owner
can easily be prevent prevented if that node implements the mechanism
described in
the this document. Sending unsolicited NAs before initiatining
initiating off-link communication would create a STALE entry in the router
router's NC and prevent any tarffic traffic to that address to be from being sent
to the host with the Optimistic address Address (see Section 5.1).

6. Modifications to RFC-Mandated Behavior

All normative text in this memo is contained in this section.

6.1. Modification to RFC4861 Neighbor RFC 4861 (Neighbor Discovery for IP version 6 (IPv6)
(IPv6))

6.1.1. Modification to the section Section 7.2.5 of RFC 4861

This document makes the following changes to the section Section 7.2.5 of
[RFC4861]:

------------------------------------------------------------------

OLD TEXT:

------------------------------------------------------------------

The text in RFC 4861 is as follows:

------------------------------------------------------------------

NEW TEXT:

------------------------------------------------------------------

This document updates the text as follows:

| When a valid Neighbor Advertisement is received (either solicited
| or unsolicited), the Neighbor Cache is searched for the target's
| entry. If no entry exists:

o
|
| * Hosts SHOULD silently discard the advertisement. There is no
| need to create an entry if none exists, since the recipient has
| apparently not initiated any communication with the target.

o
|
| * Routers SHOULD create a new entry for the target address with
| the link-layer address set to the Target link-layer address option Link-Layer Address
| Option (if supplied). The entry's reachability state MUST be
| set to STALE. If the received Neighbor Advertisement does not
| contain the Target
link-layer address option Link-Layer Address Option, the advertisement
| SHOULD be silently discarded.

------------------------------------------------------------------

6.1.2. Modification to the section Section 7.2.6 of RFC 4861

This document proposes makes the following changes to the section Section 7.2.6 of
[RFC4861]:

OLD TEXT:

------------------------------------------------------------------

The text in RFC 4861 is as follows:

| Also, a node belonging to an anycast address MAY multicast
| unsolicited Neighbor Advertisements for the anycast address when
| the node's link-layer address changes.

------------------------------------------------------------------

NEW TEXT:

------------------------------------------------------------------

This document updates the text as follows:

| Also, a node belonging to an anycast address MAY multicast
| unsolicited Neighbor Advertisements for the anycast address when
| the node's link-layer address changes.
|
| A node may also wish to notify its first-hop routers when it
| configures a new global IPv6 address so the routers can
| proactively populate their neighbor caches Neighbor Caches with the corresponding
| entries. In such cases cases, a node SHOULD send up to
| MAX_NEIGHBOR_ADVERTISEMENT Neighbor Advertisement messages. If
| the address is preferred preferred, then the Override flag SHOULD NOT be
| set. If the address is in the Optimistic state state, then the Override
| flag MUST NOT be set. The destination address SHOULD be set to
| the all-routers multicast address. These advertisements MUST be
| separated by at least RetransTimer seconds. The first
| advertisement SHOULD be sent as soon as one of the following
| events happens:

o if
| If Optimistic DAD [RFC4429] is used: a A new Optimistic address Address is
| assigned to the node interface.

o if
|
| If Optimistic DAD is not used: an An address changes the state from
| tentative to preferred.

------------------------------------------------------------------

7. Solution Limitations

The solution described in this document provides some improvement for
a node configuring a new IPv6 address and starting sending to send traffic
from it. However, that approach does not completely eliminate the
scenario when a router receives some transit traffic for an address
without the corresponding Neighbor Cache entry. For example:

* If the host starts using an already configured already-configured IPv6 address after
a long period of inactivity, the router might not have the NC
entry for that address anymore, as old/expired entries are
deleted.

* Clearing the router router's Neighbor Cache would trigger the packet loss for
all actively used addresses removed from the cache.

8. Solutions Considered but Discarded

There are other possible approaches to address the problem, for problem. For
example:

* Just do nothing.

o Migrating

* Migrate from the "reactive" Neighbor Discovery ([RFC4861]) [RFC4861] to the
registration-based mechanisms ([RFC8505]).

o Creating [RFC8505].

* Create new entries in routers the router's Neighbor Cache by gleaning from
Neighbor Discovery DAD messages.

o Initiates

* Initiate bidirectional communication from the host to the router
using the host GUA.

o Making

* Make the probing logic on hosts more robust.

o Increasing

* Increase the buffer size on routers.

* Transit dataplane data plane traffic from an unknown address (an address w/o
without the corresponding neighbor cache Neighbor Cache entry) triggers to trigger an
address resolution process on the router.

It should be noted that some of those options are already implemented
by some vendors. The following sections discuss those approaches and
the reasons they were discarded.

8.1. Do Nothing

One of the possible approaches might be to declare that everything is
working as intended and let the upper-layer protocols deal with
packet loss. The obvious drawbacks include:

* Unhappy users.

* Many support tickets.

* More resistance to deploy deploying IPv6 and IPv6-Only IPv6-only networks.

8.2. Change to the Registration-Based Neighbor Discovery

The most radical approach would be to move away from the reactive ND
as defined in [RFC4861] and expand the registration-based ND
([RFC6775], [RFC8505])
[RFC6775] [RFC8505] used in IPv6 over Low-Power Wireless Personal
Area Networks (6LoWPANs) to the rest of the IPv6 deployments. This
option requires some investigation and discussion. However,
significant changes to the existing IPv6 implementations would be
needed, so an unclear adoption timeline makes this approach less
preferable than
one proposed the approach specified in this document.

8.3. Host Sending NS to the Router Address from Its GUA

The host could force creating the creation of a STALE entry for its GUA in the router
ND cache
router's Neighbor Cache by sending the following Neighbor
Solicitation message:

* The NS source address is the host GUA.

* The destination address is the default router IPv6 address.

* The Source Link-Layer Address option Option contains the host link-layer
address.

* The target address is the host host's default router address (the
default router address the host received in the RA).

The main disadvantages of this approach are:

o Would are as follows:

* It would not work for Optimistic addresses Addresses, as section Section 2.2 of
[RFC4429] explicitly prohibits sending Neighbor Solicitations from
an Optimistic Address.

* If first-hop redundancy is deployed in the network, the NS would
reach the active router only, so all backup routers (or all active
routers except one) would not get their neighbor cache Neighbor Cache updated.

* Some wireless devices are known to alter ND packets and perform
various non-obvious nonobvious forms of ND proxy actions. In some cases,
unsolicited NAs might not even reach the routers.

8.4. Host Sending Router Solicitation from its Its GUA

The host could send a router solicitation Router Solicitation message to 'all routers' the all-routers
multicast address, using its GUA as a source. If the host link-layer
address is included in the Source Link-Layer Address option, Option, the
router would create a STALE entry for the host GUA as per the section
Section 6.2.6 of [RFC4861]. However, this approach cannot be used if
the GUA is in optimistic the Optimistic state: section Section 2.2 of [RFC4429]
explicitly prohibits using an Optimistic Address as the source
address of a Router Solicitation with a SLLAO SLLAO, as it might disrupt cause
disruption for the rightful owner of the address in the case of a
collision. So So, for the optimistic
addresses Optimistic Addresses, the host can send an RS
without a SLLAO included. In that
case case, the router may respond with
either a multicast or a unicast RA (only the latter would create a
cache entry).

This approach has the following drawbacks:

* If the address is in the Optimistic state state, the RS cannot contain a
SLLAO. As a result result, the router would only create a cache entry if
solicited RAs are sent as unicast. Routers sending solicited RAs
as multicast would not create a new cache entry entry, as they do not
need to send a unicast packet back to the host.

* There might be a random delay between receiving an RS and sending
a unicast RA back (and creating a cache entry) entry), which might
undermine the idea of creating the cache entry proactively.

* Some wireless devices are known to intercept ND packets and
perform various non-obvious nonobvious forms of ND proxy actions. In some
cases
cases, the RS might not even reach the routers.

8.5. Routers Populating Their Caches by Gleaning From from Neighbor
Discovery Packets

Routers may be able to learn about new addresses by gleaning from the
DAD Neighbor Solicitation messages. The router could listen to all
solicited node
solicited-node multicast address groups and and, upon receiving a
Neighbor Solicitation from the unspecified address address, search its
Neighbor Cache for the solicitation's Target Address. target address. If no entry
exists, the router may create an entry, set its reachability state to
'INCOMPLETE'
INCOMPLETE, and start the address resolution process for that entry.

The same solution was proposed in
[I-D.halpern-6man-nd-pre-resolve-addr]. [ND-ADDR-RES]. Some routing
vendors already support such optimization already. optimization. However, this approach
has a number of drawbacks and therefore should not be used as the
only solution:

* Routers need to receive all multicast Neighbor Discovery packets
which packets;
this might negatively impact the routers a router's CPU.

* If the router starts the address resolution process as soon as it
receives the DAD Neighbor Solicitation Solicitation, the host might be still be
performing DAD and the target address might be tentative. In that
case, the host SHOULD silently ignore the received Neighbor
Solicitation from the router as per the Section 5.4.3 of [RFC4862].
As a
result result, the router might not be able to complete the address
resolution process before the return traffic arrives.

8.6. Initiating Hosts-to-Routers Host-to-Router Communication

The host may force the router to start address resolution by sending
a data packet such as ping or traceroute to its default router link-
local address, using the GUA as a source address. As the RTT to the
default router is lower than the RTT to any off-link destinations destinations,
it's quite likely that the router would start the neighbor discovery Neighbor Discovery
process for the host GUA before the first packet of the returning
traffic arrives.

This approach has the following drawbacks:

* Data packets to the router router's link-local address could be blocked
by a security policy or control plane protection mechanism.

* It introduces an additional overhead for routers the router's control
plane (in addition to processing ND packets, the data packet needs
to be processed as well).

* Unless the data packet is sent to 'all routers' the all-routers ff02::2
multicast address, if the network provides a first-hop redundancy redundancy,
then only the active router would create a new cache entry.

8.7. Making the Probing Logic on Hosts More Robust

Theoretically

Theoretically, the probing logic on hosts might be modified to deal better
deal with initial packet loss. For example, only one probe can be
sent
sent, or probes probe retransmit intervals can be reduced. However, this
approach has a number of drawbacks:

* It would require updating all possible applications performing that perform
probing, while the proposed solution described in this document is
implemented on operating
systems at the operating-system level.

* Some implementations need to send multiple probes. Examples
include but are not limited to:

- Sending AAAA and A records record DNS probes in parallel.

- Detecting captive portals portals, which often require requires sending
multiple packets.

* While it would increase the probability of that the probing to will
complete successfully, there are multiple cases when packet loss
would still occur:

- The probe response consists of multiple packets, so all but the
first one are dropped.

- There are multiple applications on the same host sending
traffic
traffic, and return packets arrive simultaneously.

- There are multiple first-hop routers in the network. The first
probe packet creates the NC entry on one of them. The
subsequent return traffic flows might cross other routers and
still experience the issue.

* Reducing the probe retransmit interval unnecessary unnecessarily increases the
network utilization and might cause the network congestion.

8.8. Increasing the Buffer Size on Routers

Increasing the buffer size and buffering more packets would
exacerbate issues described in [RFC6583] and make the router more
vulnerable to ND-based denial of service denial-of-service attacks.

8.9. Transit Dataplane Data Plane Traffic From from a New Address Triggering to Trigger Address
Resolution

When a router receives a transit packet sourced by a an on-link
neighbor node, it might check for the presence of the neighbor cache a Neighbor Cache
entry for the packet source address and and, if the entry does not exist,
start the address resolution process. This approach does ensure that
a Neighbor Cache entry is proactively created every time a new,
previously unseen GUA is used for sending offlink off-link traffic. However,
this approach has a number of limitations, in limitations. In particular:

* If traffic flows are asymmetrical asymmetrical, the return traffic might not
transit the same router as the original traffic which that triggered the
address resolution. So resolution process. So, the neighbor cache Neighbor Cache entry is
created on the "wrong" router, not the one which that actually needs the neighbor
cache
Neighbor Cache entry for the host address.

* The functionality needs to be limited to explicitly configured
networks/interfaces, as the router needs to distinguish between
onlink
on-link addresses (ones (addresses for which the router needs to have
Neighbor Cache
entries for) entries) and the rest of the address space. The
proactive address resolution process must only be triggered by
packets from the prefixes known to be on-link. Otherwise, traffic
from spoofed source addresses or any transit traffic could lead to neighbor
cache
Neighbor Cache exhaustion.

* Implementing such functionality is much more complicated than all
other solutions solutions, as it would involve complex data-control planes
interaction. interactions between
the data plane and the control plane.

9. IANA Considerations

This memo asks the IANA for document has no new parameters. IANA actions.

10. Security Considerations

One of the potential attack vectors to consider is a cache spoofing
when spoofing,
where the attacker might try to install a cache entry for the
victim's IPv6 address and the attacker's Link-Layer link-layer address.
However, it should be noted that this document does not propose any
changes for the scenario when the ND cache Neighbor Cache for the a given IPv6
address already exists. Therefore, there are no new vectors for an
attacker to override an existing cache entry.

Section 5 describes some corner cases when a host with the duplicated a duplicate
Optimistic address Address might get some packets intended for the rightful
owner of the address. However However, such scenarios do not introduce any
new attack vectors: even without the proposed changes, changes discussed in this
document, an attacker can easily override the routers neighbor cache router's Neighbor Cache
and redirect the traffic by sending NAs with the Solicited flag set.
As discussed in Section 5.3.2 5.3.2, the worst case worst-case scenario might cause a
disruption for up to 7 seconds. This Because this scenario is highly
unlikely, this risk of disruption is considered acceptable due to very low
probability of that scenario. acceptable. More
importantly, for all cases described in Section 5 5, the rightful owner
can prevent disruption caused by an accidental address duplication
just by implementing the mechanism described in this document. If
the rightful owner sends unsolicited NAs before using the address,
the STALE entry would be created on the router NC router's NC, and any
subsequent unsolicited NAs sent from the host with an Optimistic address
Address would not override the NC entry.

A malicious host could attempt to exhaust the neighbor cache Neighbor Cache on the
router by creating a large number of STALE entries. However, this
attack vector is not new new, and the mechanism specified in this
document does not increase the risk of such an attack: the attacker
could do it, for example, by sending
a an NS or RS packet with a SLLAO
included. All recommendations from [RFC6583] still apply.

Announcing a new address to the all-routers multicast address may
inform an on-link attacker about IPv6 addresses assigned to the host.
However, hiding information about the specific IPv6 address should
not be considered a security measure measure, as such information is usually
disclosed via DAD to all nodes anyway if MLD snooping is not enabled.
Network administrators can also mitigate this issue by enabling MLD
snooping on the link-layer devices to prevent IPv6 link-local
multicast packets from being flooded to all onlink on-link nodes. If peer-to-peer
onlink peer-
to-peer on-link communications are not desirable for the a given network segment
segment, they should be prevented by proper layer-2 Layer 2 security
mechanisms. Therefore, the risk of allowing hosts to send
unsolicited Neighbor Advertisements to the all-routers multicast
address is low.

It should be noted that the proposed mechanism discussed in this document
allows hosts to proactively inform their routers about global IPv6
addresses existing on-link. Routers could use that information to
distinguish between used and unused addresses to mitigate ND cache Neighbor
Cache exhaustion DoS attacks as described in Section 4.3.2 of
[RFC3756] and in [RFC6583].

11. Acknowledgements

Thanks to the following people (in alphabetical order) for their
comments, review and feedback: Mikael Abrahamsson, Stewart Bryant,
Lorenzo Colitti, Roman Danyliw, Owen DeLong, Martin Duke, Igor
Gashinsky, Carles Gomez, Fernando Gont, Tatuya Jinmei, Benjamin
Kaduk, Scott Kelly, Erik Kline, Warren Kumari, Barry Leiba, Jordi
Palet Martinez, Erik Nordmark, Michael Richardson, Dan Romascanu,
Zaheduzzaman Sarker, Michael Scharf, John Scudder, Mark Smith, Dave
Thaler, Pascal Thubert, Loganaden Velvindron, Eric Vyncke.

12. References

12.1.

11.1. Normative References

[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997,
<https://www.rfc-editor.org/info/rfc2119>.

[RFC4291] Hinden, R. and S. Deering, "IP Version 6 Addressing
Architecture", RFC 4291, DOI 10.17487/RFC4291, February
2006, <https://www.rfc-editor.org/info/rfc4291>.

[RFC4429] Moore, N., "Optimistic Duplicate Address Detection (DAD)
for IPv6", RFC 4429, DOI 10.17487/RFC4429, April 2006,
<https://www.rfc-editor.org/info/rfc4429>.

[RFC4861] Narten, T., Nordmark, E., Simpson, W., and H. Soliman,
"Neighbor Discovery for IP version 6 (IPv6)", RFC 4861,
DOI 10.17487/RFC4861, September 2007,
<https://www.rfc-editor.org/info/rfc4861>.

[RFC4862] Thomson, S., Narten, T., and T. Jinmei, "IPv6 Stateless
Address Autoconfiguration", RFC 4862,
DOI 10.17487/RFC4862, September 2007,
<https://www.rfc-editor.org/info/rfc4862>.

[RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
May 2017, <https://www.rfc-editor.org/info/rfc8174>.

12.2.

11.2. Informative References

[I-D.halpern-6man-nd-pre-resolve-addr]

[ND-ADDR-RES]
Chen, I. and J. Halpern, "Triggering ND Address Resolution
on Receiving DAD-NS", draft-halpern-6man-nd-pre-resolve-
addr-00 (work Work in progress), Progress, Internet-Draft,
draft-halpern-6man-nd-pre-resolve-addr-00, 10 January 2014.
2014, <https://datatracker.ietf.org/doc/html/draft-
halpern-6man-nd-pre-resolve-addr-00>.

[RFC3756] Nikander, P., Ed., Kempf, J., and E. Nordmark, "IPv6
Neighbor Discovery (ND) Trust Models and Threats",
RFC 3756, DOI 10.17487/RFC3756, May 2004,
<https://www.rfc-editor.org/info/rfc3756>.

[RFC4541] Christensen, M., Kimball, K., and F. Solensky,
"Considerations for Internet Group Management Protocol
(IGMP) and Multicast Listener Discovery (MLD) Snooping
Switches", RFC 4541, DOI 10.17487/RFC4541, May 2006,
<https://www.rfc-editor.org/info/rfc4541>.

[RFC6583] Gashinsky, I., Jaeggli, J., and W. Kumari, "Operational
Neighbor Discovery Problems", RFC 6583,
DOI 10.17487/RFC6583, March 2012,
<https://www.rfc-editor.org/info/rfc6583>.

[RFC6775] Shelby, Z., Ed., Chakrabarti, S., Nordmark, E., and C.
Bormann, "Neighbor Discovery Optimization for IPv6 over
Low-Power Wireless Personal Area Networks (6LoWPANs)",
RFC 6775, DOI 10.17487/RFC6775, November 2012,
<https://www.rfc-editor.org/info/rfc6775>.

[RFC8305] Schinazi, D. and T. Pauly, "Happy Eyeballs Version 2:
Better Connectivity Using Concurrency", RFC 8305,
DOI 10.17487/RFC8305, December 2017,
<https://www.rfc-editor.org/info/rfc8305>.

[RFC8505] Thubert, P., Ed., Nordmark, E., Chakrabarti, S., and C.
Perkins, "Registration Extensions for IPv6 over Low-Power
Wireless Personal Area Network (6LoWPAN) Neighbor
Discovery", RFC 8505, DOI 10.17487/RFC8505, November 2018,
<https://www.rfc-editor.org/info/rfc8505>.

[RFC8981] Gont, F., Krishnan, S., Narten, T., and R. Draves,
"Temporary Address Extensions for Stateless Address
Autoconfiguration in IPv6", RFC 8981,
DOI 10.17487/RFC8981, February 2021,
<https://www.rfc-editor.org/info/rfc8981>.

Acknowledgements

Thanks to the following people (in alphabetical order) for their
comments, review, and feedback: Mikael Abrahamsson, Stewart Bryant,
Lorenzo Colitti, Roman Danyliw, Owen DeLong, Martin Duke, Igor
Gashinsky, Carles Gomez, Fernando Gont, Tatuya Jinmei, Benjamin
Kaduk, Scott Kelly, Erik Kline, Warren Kumari, Barry Leiba, Jordi
Palet Martinez, Erik Nordmark, Michael Richardson, Dan Romascanu,
Zaheduzzaman Sarker, Michael Scharf, John Scudder, Mark Smith, Dave
Thaler, Pascal Thubert, Loganaden Velvindron, and Éric Vyncke.

Author's Address

Jen Linkova
Google
1 Darling Island Rd
Pyrmont,
Pyrmont NSW 2009
AU
Australia

Email: furry@google.com