Neighbor Management Policy for 6LoWPAN
draft-ietf-lwig-nbr-mgmt-policy-02
LWIG R. Jadhav, Ed.
Internet-Draft R. Sahoo
Intended status: Informational Huawei
Expires: February 25, 2019 S. Duquennoy
Inria
J. Eriksson
Yanzi Networks
August 24, 2018
Neighbor Management Policy for 6LoWPAN
draft-ietf-lwig-nbr-mgmt-policy-02
Abstract
This document describes the problems associated with neighbor cache
management in multihop networks involving resource-constrained
devices. Thereafter, it also presents a sample neighbor management
policy that allows efficient cache management in multihop LLNs (low-
power and lossy networks such as LoWPAN) with resource-constrained
devices.
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 February 25, 2019.
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
Jadhav, et al. Expires February 25, 2019 [Page 1]
Internet-Draft Neighbor Management Policy for 6LoWPAN August 2018
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 . . . . . . . . . . . . . . . . . . . . . . . . 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 . . . . . . . . . . . . . . . . . . . . . . . . . 17
7.1. Normative References . . . . . . . . . . . . . . . . . . 17
7.2. Informative References . . . . . . . . . . . . . . . . . 17
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 18
1. Introduction
In a wireless multihop LLN, the node densities (maximum nodes
reachable on the same hop) may vary significantly depending upon
deployments and scenarios. Examples of such networks is LoWPAN [REF]
networks. 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.
Show full document text