Network Working Group                                        S. Krishnan
Internet-Draft                                                  Ericsson
Intended status: Standards Track                                G. Daley
Expires: August 18, 2010                                NetStar Networks
                                                       February 14, 2010


       Simple procedures for Detecting Network Attachment in IPv6
                        draft-ietf-dna-simple-14

Abstract

   Detecting Network Attachment allows hosts to assess if its existing
   addressing or routing configuration is valid for a newly connected
   network.  This document provides simple procedures for detecting
   network attachment in IPv6 hosts, and procedures for routers to
   support such services.

Status of this Memo

   This Internet-Draft is submitted to IETF in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF), its areas, and its working groups.  Note that
   other groups may also distribute working documents as Internet-
   Drafts.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   The list of current Internet-Drafts can be accessed at
   http://www.ietf.org/ietf/1id-abstracts.txt.

   The list of Internet-Draft Shadow Directories can be accessed at
   http://www.ietf.org/shadow.html.

   This Internet-Draft will expire on August 18, 2010.

Copyright Notice

   Copyright (c) 2010 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents



Krishnan & Daley         Expires August 18, 2010                [Page 1]


Internet-Draft                 Simple DNA                  February 2010


   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the BSD License.


Table of Contents

   1.  Requirements notation  . . . . . . . . . . . . . . . . . . . .  3
   2.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .  3
     2.1.  Goals  . . . . . . . . . . . . . . . . . . . . . . . . . .  3
     2.2.  Applicability  . . . . . . . . . . . . . . . . . . . . . .  4
     2.3.  Link Identification model  . . . . . . . . . . . . . . . .  4
     2.4.  DNA Overview . . . . . . . . . . . . . . . . . . . . . . .  4
     2.5.  Working Assumptions  . . . . . . . . . . . . . . . . . . .  5
   3.  Terminology  . . . . . . . . . . . . . . . . . . . . . . . . .  5
   4.  Host Operations  . . . . . . . . . . . . . . . . . . . . . . .  6
     4.1.  Host data structures . . . . . . . . . . . . . . . . . . .  6
       4.1.1.  SDAT Maintenance . . . . . . . . . . . . . . . . . . .  6
     4.2.  Steps involved in detecting link change  . . . . . . . . .  7
     4.3.  Link-Layer Indication  . . . . . . . . . . . . . . . . . .  7
     4.4.  Sending Neighbor Discovery probes  . . . . . . . . . . . .  7
     4.5.  Contents of the Neighbor Discovery messages  . . . . . . .  9
       4.5.1.  Neighbor Solicitation messages . . . . . . . . . . . .  9
       4.5.2.  Router Solicitation messages . . . . . . . . . . . . .  9
     4.6.  DHCPv6 operation . . . . . . . . . . . . . . . . . . . . . 10
     4.7.  Response Gathering . . . . . . . . . . . . . . . . . . . . 10
       4.7.1.  Conflicting results  . . . . . . . . . . . . . . . . . 11
     4.8.  Further Host Operations  . . . . . . . . . . . . . . . . . 11
     4.9.  Recommended retransmission behavior  . . . . . . . . . . . 12
   5.  Pseudocode for Simple DNA  . . . . . . . . . . . . . . . . . . 13
   6.  Constants  . . . . . . . . . . . . . . . . . . . . . . . . . . 15
   7.  Relationship to DNAv4  . . . . . . . . . . . . . . . . . . . . 15
   8.  IANA Considerations  . . . . . . . . . . . . . . . . . . . . . 15
   9.  Security Considerations  . . . . . . . . . . . . . . . . . . . 15
   10. Acknowledgments  . . . . . . . . . . . . . . . . . . . . . . . 16
   11. References . . . . . . . . . . . . . . . . . . . . . . . . . . 16
     11.1. Normative References . . . . . . . . . . . . . . . . . . . 16
     11.2. Informative References . . . . . . . . . . . . . . . . . . 17
   Appendix A.  Issues with confirming manually assigned addresses  . 17
   Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 18







Krishnan & Daley         Expires August 18, 2010                [Page 2]


Internet-Draft                 Simple DNA                  February 2010


1.  Requirements notation

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in [RFC2119].


2.  Introduction

   Hosts require procedures to simply and reliably identify if they have
   moved to a network to which they had been recently connected.  In
   order to detect reconnection to a previously visited network, router
   and neighbor discovery messages are used to collect reachability and
   configuration information.  This information is used to detect if the
   host has attached to a link for which it may still have valid address
   and other configuration information, and which it can use until it
   receives confirmation through either through the Neighbor Discovery
   protocol or DHCPv6.

   This document incorporates feedback from host and router operating
   systems implementors, which seeks to make implementation and adoption
   of IPv6 change detection procedures simple for general use.

2.1.  Goals

   The goal of this document is to specify a simple procedure for
   detecting network attachment (Simple DNA) that has the following
   characteristics.

   o  Routers do not have to be modified to support this scheme.

   o  The most common use cases are optimized.

   o  In the worst case, detection latency is equal to that of standard
      neighbor discovery so that performance is never degraded.

   o  False positives are not acceptable.  A host MUST NOT wrongly
      conclude that it has reattached to a previouly visited network.

   o  False negatives are acceptable.  A host MAY fail to identify a
      previously visited link correctly and attempt to acquire fresh
      addressing and configuration information.









Krishnan & Daley         Expires August 18, 2010                [Page 3]


Internet-Draft                 Simple DNA                  February 2010


2.2.  Applicability

   The Simple DNA protocol provides substantial benefits over standard
   neighbor discovery procedures [RFC4861] in some scenarios and does
   not provide any benefit at all in certain other scenarios.  This is
   intentional as Simple DNA was designed for simplicity rather than
   completeness.  In particular, the Simple DNA protocol provides
   maximum benefits when a host moves between a small set of known
   links.  When a host moves to a completely new link that is previously
   unknown, the performance of the Simple DNA protocol will be identical
   to that using standard neighbor discovery procedures [RFC4861].  In
   this case the main benefit of the Simple DNA protocol is to
   immediately flush out the inoperable addresses and configuration
   instead of timing them out.  The Simple DNA procedure provides
   support for addresses configured using either IPv6 Stateless Address
   Autoconfiguration [RFC4862] or DHCPv6 [RFC3315].  It does not support
   manually configured addresses since they are not widely used and can
   cause unpredictable results and/or aggressive probing behavior
   [Appendix A].

2.3.  Link Identification model

   Earlier methods of detecting network attachment, e.g. the procedure
   defined in [I-D.ietf-dna-protocol], relied on detecting whether the
   host was still connected to the same link.  If the host was attached
   to the same link, all information related to the link such as the
   routers, prefixes and configuration parameters was considered to be
   valid.  The Simple DNA protocol follows an alternate approach where
   it relies on probing each previously known router to determine
   whether to use information learnt from THAT router.  This allows
   simple DNA to probe routers learnt from multiple earlier attachments
   to optimize movement between a known set of links.

2.4.  DNA Overview

   Detecting Network Attachment is performed by hosts after detecting a
   link-layer "up" indication.  The host simultaneously sends multicast
   Router Solicitations (RSs) and unicast Neighbor Solicitations (NSs)
   in order to determine whether previously encountered routers are
   present on the link.

   Hosts implementing simple DNA may also send DHCPv6 packets, as
   described in Section 4.6.  Since simple DNA does not modify the
   DHCPv6 protocol or state machine, the operation of DHCPv6 is
   unchanged.

   Routers that follow the standard neighbor discovery procedure
   described in [RFC4861] will delay the router advertisement by a



Krishnan & Daley         Expires August 18, 2010                [Page 4]


Internet-Draft                 Simple DNA                  February 2010


   random period between 0 and MAX_RA_DELAY_TIME (defined to be 500ms)
   as described in Section 6.2.6 of [RFC4861].  Hosts implementing
   simple DNA can detect the presence of a previously encountered router
   using unicast Neighbor Solicitations.  As a result, where the host
   with a valid configuration is returning to a previously encountered
   link, delays in the sending of a Router Advertisement (RA) will not
   delay configuration as long as NS probing is successful.  However in
   situations where the host is attaching to a link for the first time,
   or where it does not have a valid IP address on the link, it will be
   dependent on the receipt of an RA for stateless auto-configuration.
   In these situations delays in the receipt of an RA can be significant
   and may result in service disruption.

2.5.  Working Assumptions

   There are a series of assumptions about the network environment which
   underpin these procedures.

   o  The combination of the link layer address and the link local IPv6
      address of a router is unique across links.

   o  Hosts receive indications when a link-layer comes up.  Without
      this, they would not know when to commence the DNA procedure.

   If these assumptions do not hold, host change detection systems will
   not function optimally.  In that case, they may occasionally detect
   change spuriously, or experience some delay in detecting network
   attachment.  The delays so experienced will be no longer than those
   caused by following the standard neighbor discovery procedure
   described in [RFC4861].


3.  Terminology

   +---------------------+---------------------------------------------+
   |         Term        |                  Definition                 |
   +---------------------+---------------------------------------------+
   |  Valid IPv6 address | An IPv6 address configured on the node that |
   |                     |   has a valid lifetime greater than zero.   |
   |                     |                                             |
   |    Operable IPv6    | An IPv6 address configured on the node that |
   |       address       |   can be used safely on the current link.   |
   +---------------------+---------------------------------------------+

                      Table 1: Simple DNA Terminology






Krishnan & Daley         Expires August 18, 2010                [Page 5]


Internet-Draft                 Simple DNA                  February 2010


4.  Host Operations

   On connecting to a new point of attachment, the host performs the
   detecting network attachment procedure in order to determine whether
   the existing addressing and configuration information are still
   valid.

4.1.  Host data structures

   In order to correctly perform the procedure described in this
   document the host needs to maintain a data structure called the
   Simple DNA address table (SDAT).  The host needs to maintain this
   data structure for each interface on which it performs Simple DNA.
   Each entry in the SDAT table consists of at least the following
   parameters.

   o  IPv6 address and its related parameters like valid lifetime,
      preferred lifetime etc.

   o  Prefix from which the address was formed.

   o  Link-local IPv6 address(es) of the router(s) that advertised the
      prefix.

   o  Link-layer (MAC) address(es) of the router(s) that advertised the
      prefix.

   o  Flag indicating whether the address was obtained using SLAAC or
      DHCPv6.

   o  DHCP specific information in case DHCPv6 [RFC3315] was used to
      acquire the address.  This information includes DUID, IA_ID, a
      flag indicating IA_NA/IA_TA, configuration information such as DNS
      server address, NTP server address etc.

4.1.1.  SDAT Maintenance

   The host SHOULD maintain the SDAT table by periodically cleaning out
   entries whose valid lifetimes have expired.  The host MAY also
   maintain the table by allowing SDAT entries from "n" previously
   visited links.  When the host attaches to a previously unknown link
   and the SDAT already contains entries from the previous "n" attached
   links,it will discard all the SDAT entries corrsponding to the least
   recently attached link.







Krishnan & Daley         Expires August 18, 2010                [Page 6]


Internet-Draft                 Simple DNA                  February 2010


4.2.  Steps involved in detecting link change

   The steps involved in basic detection of network attachment are:

   o  Link-Layer Indication

   o  Sending of neighbor discovery and/or DHCPv6 probes

   o  Response gathering and assessment

   These steps are described below.

4.3.  Link-Layer Indication

   In order to start Detection of network attachment procedures, a host
   typically requires a link-layer indication that the medium has become
   available [RFC4957].

   After the indication is received, the host considers all currently
   configured (non-tentative) IP addresses to be deprecated until the
   change detection process completes.  It MUST also set all Neighbor
   Cache entries for the routers on its Default Router List to STALE.
   This is done to speed up the acquisition of a new default router when
   link change has occurred.

4.4.  Sending Neighbor Discovery probes

   When a host receives a link-layer "up" indication, it SHOULD
   immediately send both a Router Solicitation (as specified in as
   specified in section 6.3.7 of [RFC4861]) and if it retains at least
   one valid IPv6 address, one or more unicast Neighbor Solicitations.
   The Router Solicitation is sent to the All-routers multicast address
   using a link-local address as the source address [RFC4861].  Even if
   the host is in possession of more than one valid IPv6 address, it
   MUST send only one router solicitation using a valid link-local
   address as the source address.

   For each of the addresses in the SDAT, the host looks up the SDAT to
   find out the link-local and MAC addresses of the router(s) that
   advertised the prefix used to form the address.  It then sends an
   unicast Neighbor Solicitations to each router's link-local address it
   obtained from the lookup on the SDAT.  The host MUST NOT send unicast
   Neighbor Solicitations to a test node corresponding to an IPv6
   address that is no longer valid.

   Please note that the Neighbor Solicitations SHOULD be sent in
   parallel with the Router Solicitation.  Since sending NSs is just an
   optimization, doing the NSs and the RS in parallel ensures that the



Krishnan & Daley         Expires August 18, 2010                [Page 7]


Internet-Draft                 Simple DNA                  February 2010


   procedure does not run slower than it would if it only used an RS.

   NOTE: A Simple DNA implementation SHOULD limit its probing to at most
   six previously seen routers















































Krishnan & Daley         Expires August 18, 2010                [Page 8]


Internet-Draft                 Simple DNA                  February 2010


4.5.  Contents of the Neighbor Discovery messages

4.5.1.  Neighbor Solicitation messages

   This section describes the contents of the neighbor solicitation
   probe messages sent during the probing procedure.

   Source Address:           A link-local address assigned to the
                             probing host.

   Destination Address:      The link-local address of the router being
                             probed as learnt from the SDAT.

   Hop Limit:                255

   ND Options:

   Target Address:           The link-local address of the router being
                             probed as learnt from the SDAT.

   Link Layer Header:

   Destination Address:      The link-layer (MAC) address of the router
                             being probed as learnt from the SDAT.

   The probing node SHOULD include the Source link-layer address option
   in the probe messages.

4.5.2.  Router Solicitation messages

   This section describes the contents of the router solicitation probe
   message sent during the probing procedure.

   Source Address:           A link-local address assigned to the
                             probing host.

   Destination Address:      The all-routers multicast address.

   Hop Limit:                255

   The probing node SHOULD NOT include the Source link-layer address
   option in the probe messages.









Krishnan & Daley         Expires August 18, 2010                [Page 9]


Internet-Draft                 Simple DNA                  February 2010


4.6.  DHCPv6 operation

   Simple DNA does not require a host to implement DHCPv6, nor does it
   imply any changes to the DHCPv6 protocol or state machine.  Hosts MAY
   attempt to obtain IPv6 configuration via DHCPv6 in parallel with
   simple DNA probing.  This ensures that the simple DNA procedure will
   not result in additional delay in the case where reachability tests
   fail, or where a DHCPv6 exchange completes more quickly than the
   reachability tests.

   In situations where both simple DNA and DHCPv6 are used on the same
   link, it is possible that simple DNA probing will complete
   successfully, and then DHCPv6 will complete later with a different
   result.  If this happens, the procedure described in Section 4.7.1
   are utilized.

   The host attempts to verify its DHCPv6-obtained information in
   parallel with simple DNA.  On receiving a link-layer "up" indication,
   it will initiate a DHCPv6 exchange when and as specified in [RFC3315]
   in order to verify whether the addresses and configuration obtained
   using DHCPv6 are still usable on the link.

4.7.  Response Gathering

   When a responding Neighbor Advertisement is received from a test
   node, the host MUST verify that both the IPv6 and link layer (MAC)
   addresses of the test node match the expected values before utilizing
   the configuration associated with the detected network (prefixes, MTU
   etc.).

   On reception of a Router Advertisement that contains prefixes that
   intersect with those previously advertised by a known router, the
   host utilizes the addresses in the SDAT associated with the detected
   network.

   If the host receives a router advertisement from a router containing
   only prefixes that are disjoint from the prefixes associated with the
   same router in the SDAT, then the host MUST conclude that the IPv6
   addresses corresponding to that router are no longer valid.  Since
   any NS probes to that router will no longer provide useful
   information, further probing of that router MUST be aborted.
   Furthermore, the host MUST remove all the SDAT entries corresponding
   to this router.

   Where the conclusions obtained from the Neighbor Solicitation/
   Advertisement from a given router and the RS/RA exchange with the
   same router differ, the results obtained from the RS/RA will be
   considered definitive.  In case the Neighbor Advertisement was



Krishnan & Daley         Expires August 18, 2010               [Page 10]


Internet-Draft                 Simple DNA                  February 2010


   secured using SEND and the Router Advertisement was not, the host
   MUST wait for SEND_NA_GRACE_TIME to see if a SEND-secured RA is
   received.  If a SEND-secured RA is not received, the conclusions
   obtained from the NS/NA exchange will be considered definitive.

   When the host receives a Router Advertisement from a given router,
   the host MUST look for a Neighbor Cache entry for the sending router
   and MUST mark that router's Neighbor Cache Entry as REACHABLE if one
   was found.  The host MUST add a new Neighbor Cache Entry in the
   REACHABLE state for the sending router if one does not currently
   exist.

4.7.1.  Conflicting results

   In situations where Neighbor Solicitation probes and Router
   Solicitation probes are used on the same link, it is possible that
   the NS probe will complete successfully, and then the RS probe will
   complete later with a different result.  If this happens, the
   implementation SHOULD abandon the results obtained from the NS probe
   of the router that responded to the RS and the implementation SHOULD
   behave as if the NS probe did not successfully complete.

4.8.  Further Host Operations

   Operations subsequent to detecting network attachment depend upon
   whether or not the host has reconnected to a previously visited
   network.

   After confirming the reachability of the associated router using an
   NS/NA pair, the host performs the following steps.

   o  The host SHOULD rejoin any solicited nodes' multicast groups for
      addresses it continues to use.

   o  The host SHOULD select a default router as described in Section
      6.3.6 of [RFC4861].

   If the host has determined that it has reattached to a previously
   visited link, it SHOULD NOT perform duplicate address detection on
   the addresses that have been confirmed to be operable.

   If the NS based probe with a router did not complete or if the RS
   based probe on the same router completed with different prefixes than
   the ones in the SDAT the host MUST begin address configuration
   techniques, as indicated in a received Router Advertisement
   [RFC4861][RFC4862].





Krishnan & Daley         Expires August 18, 2010               [Page 11]


Internet-Draft                 Simple DNA                  February 2010


4.9.  Recommended retransmission behavior

   Where the NS probe does not complete successfully, it usually implies
   that the host is not attached to the network whose configuration is
   being tested.  In such circumstances, there is typically little value
   in aggressively retransmitting unicast neighbor solicitations that do
   not elicit a response.

   Where unicast Neighbor Solicitations and Router Solicitations are
   sent in parallel, one strategy is to forsake retransmission of
   Neighbor Solicitations and to allow retransmission only of Router
   Solicitations or DHCPv6.  In order to reduce competition between
   unicast Neighbor Solicitations and Router Solicitations and DHCPv6
   retransmissions, a DNAv6 implementation that retransmits may utilize
   the retransmission strategy described in the DHCPv6 specification
   [RFC3315], scheduling DNAv6 retransmissions between Router
   Solicitations or DHCPv6 retransmissions.

   If a response is received to any unicast Neighbor Solicitation or
   Router Solicitation message, pending retransmissions MUST be
   canceled.  A Simple DNA implementation SHOULD NOT retransmit a
   Neighbor Solicitation more than twice.  To provide damping in the
   case of spurious Link Up indications, the host SHOULD NOT perform the
   Simple DNA procedure more than once a second.



























Krishnan & Daley         Expires August 18, 2010               [Page 12]


Internet-Draft                 Simple DNA                  February 2010


5.  Pseudocode for Simple DNA

       /* Link up indication received on INTERFACE */
       /* Start Simple DNA process */

       /* Mark All Addresses as deprecated */
       Configured_Address_List=Get_Address_List(INTERFACE);
       foreach Configured_Address in Configured_Address_List
       {
         if (Get_Address_State(Configured_Address)!=AS_TENTATIVE)
         {
           Set_Address_State(Configured_Address,AS_DEPRECATED);
         }
       }

       /* Mark all routers' NC entries as STALE to speed up */
       /* acquisition of new router if link change has occurred */
       foreach Router_Address in DEFAULT_ROUTER_LIST
       {
         NCEntry=Get_Neighbor_Cache_Entry(Router_Address);
         Set_Neighbor_Cache_Entry_State(NCEntry,NCS_STALE);
       }

       /* Thread A : Send Router Solicitation */
       RS_Target_Address=FF02::2;
       RS_Source_Address=Get_Any_Link_Local_Address(INTERFACE);
       Send_Router_Solicitation(RS_Source_Address,RS_Target_Address);

       /* Thread B : Send Neighbor Solicitation(s) */
       Previously_Known_Router_List=Get_Router_List_from_SDAT();
       NS_Source_Address=Get_Any_Link_Local_Address(INTERFACE);

       foreach Router_Address in Previously_Known_Router_List
       {
         if (Get_Any_Valid_Address_from_SDAT(Router_Address))
         {
           Send_Neighbor_Solicitation(NS_Source_Address,Router_Address);
         }
       }

       /* Thread C : Response collection */

       /* Received Router Advertisement processing */
       /* Only for RAs received as response to DNA RSs */

       L3_Source=Get_L3_Source(RECEIVED_MESSAGE);
       L2_Source=Get_L2_Source(RECEIVED_MESSAGE);
       SDAT_Entry_List=Get_Entries_from_SDAT_L2L3(L3_Source,L2_Source));



Krishnan & Daley         Expires August 18, 2010               [Page 13]


Internet-Draft                 Simple DNA                  February 2010


       foreach SDAT_Entry in SDAT_Entry_List
       {
         if (Exists_PIO(RECEIVED_MESSAGE,Get_Prefix(SDAT_Entry)))
         {
           /* Address is operable. Configure on Interface */
           /* Rejoin solicited-node multicast group for address */
         }
         else
         {
           /* If address is configured on interface, remove it */
           /* This could be because of a NA arriving before RA */
         }
       }

       /* Mark router as reachable */
       NCEntry=Get_Neighbor_Cache_Entry(L3_Source);
       if (NCEntry is not NULL)
       {
         Set_Neighbor_Cache_Entry_State(NCEntry,NCS_REACHABLE);
       }
       else
       {
         Create_Neighbor_Cache_Entry(L3_Source,NCS_REACHABLE);
       }

       /* Ignore further NAs from this router */
       Add_Router_to_NA_Ignore_List(L3_Source);


       /* Received Neighbor Advertisement processing */
       /* Only for NAs received as response to DNA NSs */

       L3_Source=Get_L3_Source(RECEIVED_MESSAGE);
       L2_Source=Get_L2_Source(RECEIVED_MESSAGE);

       if (Is_Router_on_NA_Ignore_List(L3_Source)) {
         /* Ignore message and wait for next message */
         continue;
       }

       SDAT_Entry_List=Get_Entries_from_SDAT_L2L3(L3_Source,L2_Source));

       foreach SDAT_Entry in SDAT_Entry_List
       {
           /* Address is operable. Configure on Interface */
       }

                    Figure 1: Pseudocode for Simple DNA



Krishnan & Daley         Expires August 18, 2010               [Page 14]


Internet-Draft                 Simple DNA                  February 2010


   NOTE: This section does not include any pseudo-code for sending of
   the DHCPv6 packets since the DHCPv6 exchange is orthogonal to the
   simple DNA process.


6.  Constants

      SEND_NA_GRACE_TIME

         Definition: An optional period to wait after Neighbor
         Solicitation before adopting a non-SEND RA's link change
         information.

         Value: 40 milliseconds


7.  Relationship to DNAv4

   DNAv4 [RFC4436] specifies a set of steps that optimize the (common)
   case of re-attachment to an IPv4 network that one has been connected
   to previously by attempting to re-use a previous (but still valid)
   configuration.  This document shares the same goal as DNAv4 (that of
   minimizing the handover latency in moving between points of
   attachment) but differs in the steps it performs to achieve this
   goal.  Another difference is that this document also supports
   stateless autoconfiguration of addresses in addition to addresses
   configured using DHCPv6.


8.  IANA Considerations

   There are no changes to IANA registries required in this document.


9.  Security Considerations

   A host may receive Router Advertisements from non-SEND devices, after
   receiving a link-layer indications.  While it is necessary to assess
   quickly whether a host has moved to another network, it is important
   that the host's current secured SEND [RFC3971] router information is
   not replaced by an attacker which spoofs an RA and purports to change
   the link.

   As such, the host SHOULD send a Neighbor Solicitation to the existing
   SEND router upon link-up indication as described above in
   Section 4.3.  The host SHOULD then ensure that unsecured router
   information does not cause deletion of existing SEND state, within
   MIN_DELAY_BETWEEN_RAS, in order to allow for a present SEND router to



Krishnan & Daley         Expires August 18, 2010               [Page 15]


Internet-Draft                 Simple DNA                  February 2010


   respond.

   If the current default router is a SEND-secured router, the host
   SHOULD wait SEND_NA_GRACE_TIME after transmission before adopting a
   new default router.

   Even if SEND signatures on RAs are used, it may not be immediately
   clear if the router is authorized to make such advertisements.  As
   such, a host SHOULD NOT treat such devices as secure until and unless
   authorization delegation discovery is successful.

   Unless SEND or other form of secure address configuration is used,
   the DNA procedure does not in itself provide positive, secure
   authentication of the router(s) on the network, or authentication of
   the network itself, as e.g. would be provided by mutual
   authentication at the link layer.  Therefore when such assurance is
   not available, the host MUST NOT make any security-sensitive
   decisions based on the DNA procedure alone.  In particular, it MUST
   NOT decide that it has moved from an untrusted to a trusted network,
   and MUST NOT make any security decisions that depend on the
   determination that such a transition has occurred.


10.  Acknowledgments

   This document is the product of a discussion the authors had with
   Bernard Aboba, Thomas Narten, Erik Nordmark and Dave Thaler at IETF
   69.  The authors would like to thank them for clearly detailing the
   requirements of the solution and the goals it needed to meet and for
   helping to explore the solution space.  The authors would like to
   thank the authors and editors of the complete DNA specification for
   detailing the overall problem space and solutions.  The authors would
   like to thank Jari Arkko for driving the evolution of a simple and
   probabilistic DNA solution.  The authors would like to thank Bernard
   Aboba, Thomas Narten, Jari Arkko, Sathya Narayan, Julien Laganier,
   Domagoj Premec, Jin Hyeock-Choi, Alfred Hoenes, Frederic Rossi, Ralph
   Droms, Ted Lemon, Erik Nordmark, Lars Eggert, Brian Carpenter and
   Yaron Sheffer for performing reviews on the document and providing
   valuable comments to drive the document forward.


11.  References

11.1.  Normative References

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119, March 1997.




Krishnan & Daley         Expires August 18, 2010               [Page 16]


Internet-Draft                 Simple DNA                  February 2010


   [RFC3736]  Droms, R., "Stateless Dynamic Host Configuration Protocol
              (DHCP) Service for IPv6", RFC 3736, April 2004.

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

   [RFC3971]  Arkko, J., Kempf, J., Zill, B., and P. Nikander, "SEcure
              Neighbor Discovery (SEND)", RFC 3971, March 2005.

   [RFC4861]  Narten, T., Nordmark, E., Simpson, W., and H. Soliman,
              "Neighbor Discovery for IP version 6 (IPv6)", RFC 4861,
              September 2007.

11.2.  Informative References

   [I-D.ietf-dna-protocol]
              Narayanan, S., "Detecting Network Attachment in IPv6
              Networks (DNAv6)", draft-ietf-dna-protocol (work in
              progress), June 2007.

   [RFC4957]  Krishnan, S., Montavont, N., Njedjou, E., Veerepalli, S.,
              and A. Yegin, "Link-Layer Event Notifications for
              Detecting Network Attachments", RFC 4957, August 2007.

   [RFC4862]  Thomson, S., Narten, T., and T. Jinmei, "IPv6 Stateless
              Address Autoconfiguration", RFC 4862, September 2007.

   [RFC4436]  Aboba, B., Carlson, J., and S. Cheshire, "Detecting
              Network Attachment in IPv4 (DNAv4)", RFC 4436, March 2006.


Appendix A.  Issues with confirming manually assigned addresses

   Even though DNAv4 [RFC4436] supports verification of manually
   assigned addresses this feature of DNAv4 has not been widely
   implemented or used.  There are two major issues that come up with
   confirming manually assigned addresses using Simple DNA.

   o  When DHCPv6 or SLAAC addresses are used for probing, there is no
      need to aggressively retransmit lost probes.  This is because the
      address configuration falls back to vanilla DHCPv6 or SLAAC and
      the host will eventually obtain an address.  This is not the case
      with manually assigned addresses.  If the probes are lost, the
      host runs the risk of ending up with no addresses at all.  Hence
      agressive retransmissions are necessary.





Krishnan & Daley         Expires August 18, 2010               [Page 17]


Internet-Draft                 Simple DNA                  February 2010


   o  Another issue comes up when the host moves between two networks,
      one where manual addressing is being used (say NET1)and the other
      where dynamic addressing (stateless autoconfig or DHCPv6) is being
      used (say NET2).  Since the host can obtain a dynamic address in
      some situations, it will need to send simple DNA probes and may
      also engage in a DHCPv6 exchange.  In a situation where the host
      moves to NET1 and the NS probes are lost and in addition an RA is
      not received, the host will not be able to confirm that it
      attached to NET1, and therefore that it should use the manual
      configuration for that network.  As a result, if DHCPv6 is enabled
      on NET1, then the host could mistakenly obtain a dynamic address
      and configuration instead of using the manual configuration.  To
      prevent this problem, simple DNA probing needs to continue even
      after the DHCPv6 exchange has completed, and DNA probes need to
      take precedence over DHCPv6, contrary to the advice provided in
      Section 4.7.1

   Given these issues, it is NOT RECOMMENDED to use manual addressing
   with Simple DNA.


Authors' Addresses

   Suresh Krishnan
   Ericsson
   8400 Decarie Blvd.
   Town of Mount Royal, QC
   Canada

   Phone: +1 514 345 7900 x42871
   Email: suresh.krishnan@ericsson.com


   Greg Daley
   NetStar Networks
   Level 9/636 St Kilda Rd
   Melbourne, Victoria  3004
   Australia

   Phone: +61 3 8532 4042
   Email: gdaley@netstarnetworks.com










Krishnan & Daley         Expires August 18, 2010               [Page 18]