Neighbor Management Policy for 6LoWPAN
draft-ietf-lwig-nbr-mgmt-policy-01
The information below is for an old version of the document |
Document |
Type |
|
Active Internet-Draft (lwig WG)
|
|
Last updated |
|
2018-02-22
(latest revision 2017-08-28)
|
|
Replaces |
|
draft-jadhav-lwig-nbr-mgmt-policy
|
|
Stream |
|
IETF
|
|
Intended RFC status |
|
(None)
|
|
Formats |
|
plain text
pdf
html
bibtex
|
Stream |
WG state
|
|
WG Document
|
|
Document shepherd |
|
No shepherd assigned
|
IESG |
IESG state |
|
I-D Exists
|
|
Consensus Boilerplate |
|
Unknown
|
|
Telechat date |
|
|
|
Responsible AD |
|
(None)
|
|
Send notices to |
|
(None)
|
LWIG R. Jadhav, Ed.
Internet-Draft R. Sahoo
Intended status: Informational Huawei
Expires: August 26, 2018 S. Duquennoy
Inria
J. Eriksson
Yanzi Networks
February 22, 2018
Neighbor Management Policy for 6LoWPAN
draft-ietf-lwig-nbr-mgmt-policy-01
Abstract
This document describes the problems associated with neighbor cache
management in constrained multihop networks and a sample neighbor
management policy to deal with it.
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 of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.
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."
This Internet-Draft will expire on August 26, 2018.
Copyright Notice
Copyright (c) 2018 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
(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
Jadhav, et al. Expires August 26, 2018 [Page 1]
Internet-Draft Neighbor Management Policy for 6LoWPAN February 2018
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Requirements Language and Terminology . . . . . . . . . . 4
2. Neighbor Management . . . . . . . . . . . . . . . . . . . . . 5
2.1. Significance of Neighbor management policy . . . . . . . 5
2.2. Trivial neighbor management policies . . . . . . . . . . 6
2.3. Lifecycle of a NCE . . . . . . . . . . . . . . . . . . . 7
2.3.1. NCE Insertion . . . . . . . . . . . . . . . . . . . . 7
2.3.2. NCE Deletion . . . . . . . . . . . . . . . . . . . . 10
2.3.3. NCE Eviction . . . . . . . . . . . . . . . . . . . . 11
2.3.3.1. Eviction for directly connected routing entries . 11
2.3.4. NCE Reinforcement . . . . . . . . . . . . . . . . . . 12
2.4. Requirements of a good neighbor management policy . . . . 12
2.5. Approaches to neighbor management policy . . . . . . . . 13
2.5.1. Reactive Approach . . . . . . . . . . . . . . . . . . 13
2.5.2. Proactive Approach . . . . . . . . . . . . . . . . . 13
3. Reservation based Neighbor Management Policy . . . . . . . . 14
3.1. Limitations of such a policy . . . . . . . . . . . . . . 15
4. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 16
5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 16
6. Security Considerations . . . . . . . . . . . . . . . . . . . 16
7. References . . . . . . . . . . . . . . . . . . . . . . . . . 16
7.1. Normative References . . . . . . . . . . . . . . . . . . 16
7.2. Informative References . . . . . . . . . . . . . . . . . 17
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 17
1. Introduction
In a wireless multihop network, the node densities (maximum number of
devices connected on a single hop) may vary significantly depending
upon deployments/scenarios. While there is some policy control
possible with regards to the network size in terms of maximum number
of devices connected, it is especially difficult to set a figure on
what will be the maximum node density given a deployment. For e.g.
A network can put an upper limit on max 1000 devices but it is
impossible to state what the node density will be in this 1000 node
network.
A neighbor cache is used for populating neighboring one-hop connected
nodes information such as MAC address, link local IP address and
other reachability state information. Node density has direct
Show full document text