< draft-thubert-tree-discovery-04.txt   draft-thubert-tree-discovery-05.txt >
NEMO Working Group P. Thubert NEMO Working Group P. Thubert
Internet-Draft Cisco Internet-Draft Cisco
Expires: May 21, 2007 C. Bontoux Expires: October 7, 2007 C. Bontoux
Fortinet Fortinet
N. Montavont N. Montavont
LSIIT - ULP LSIIT - ULP
November 17, 2006 April 5, 2007
Nested Nemo Tree Discovery Nested Nemo Tree Discovery
draft-thubert-tree-discovery-04.txt draft-thubert-tree-discovery-05.txt
Status of this Memo Status of this Memo
By submitting this Internet-Draft, each author represents that any By submitting this Internet-Draft, each author represents that any
applicable patent or other IPR claims of which he or she is aware applicable patent or other IPR claims of which he or she is aware
have been or will be disclosed, and any of which he or she becomes have been or will be disclosed, and any of which he or she becomes
aware will be disclosed, in accordance with Section 6 of BCP 79. aware will be disclosed, in accordance with Section 6 of BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that Task Force (IETF), its areas, and its working groups. Note that
skipping to change at page 1, line 37 skipping to change at page 1, line 37
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt. http://www.ietf.org/ietf/1id-abstracts.txt.
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html. http://www.ietf.org/shadow.html.
This Internet-Draft will expire on May 21, 2007. This Internet-Draft will expire on October 7, 2007.
Copyright Notice Copyright Notice
Copyright (C) The Internet Society (2006). Copyright (C) The IETF Trust (2007).
Abstract Abstract
The purpose of this paper is to describe a minimum set of features This paper describes a simple distance vector protocol that exposes
that extends the Nemo basic support [4] in order to avoid loops in only a default route towards the infrastructure in a nested NEMO
the nested Nemo case. As a result, Mobile Routers assemble into a configuration. The draft extends the Neighbor Discovery Protocol [1]
tree that can be optimized based on various metrics. in order to carry information and metrics which will help a Mobile
Router select its Attachment Router(s) in an autonomous fashion and
provides generic rules which guarantee that the interaction of
different selection processes will not create loops.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
2. Terms and Abbreviations . . . . . . . . . . . . . . . . . . . 4 2. Terms and Abbreviations . . . . . . . . . . . . . . . . . . . 4
3. Motivations . . . . . . . . . . . . . . . . . . . . . . . . . 5 3. Motivations . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.1 Multi-Homed nested mobile network . . . . . . . . . . . . 5 3.1. Multi-Homed nested mobile network . . . . . . . . . . . . 5
3.2 Loops in nested Nemo . . . . . . . . . . . . . . . . . . . 6 3.2. Loops in nested Nemo . . . . . . . . . . . . . . . . . . . 6
4. Router Advertisement extensions . . . . . . . . . . . . . . . 8 4. Router Advertisement extensions . . . . . . . . . . . . . . . 8
4.1 Router Advertisement message . . . . . . . . . . . . . . . 8 4.1. Router Advertisement message . . . . . . . . . . . . . . . 8
4.2 Tree Information Option . . . . . . . . . . . . . . . . . 8 4.2. Tree Information Option . . . . . . . . . . . . . . . . . 8
4.3 TIO suboption . . . . . . . . . . . . . . . . . . . . . . 11 4.3. TIO suboption . . . . . . . . . . . . . . . . . . . . . . 11
4.3.1 Format . . . . . . . . . . . . . . . . . . . . . . . . 11 4.3.1. Format . . . . . . . . . . . . . . . . . . . . . . . . 11
4.3.2 Pad1 . . . . . . . . . . . . . . . . . . . . . . . . . 11 4.3.2. Pad1 . . . . . . . . . . . . . . . . . . . . . . . . . 12
4.3.3 PadN . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.3.3. PadN . . . . . . . . . . . . . . . . . . . . . . . . . 12
4.3.4 Bandwidth Suboption . . . . . . . . . . . . . . . . . 12 4.3.4. Bandwidth Suboption . . . . . . . . . . . . . . . . . 12
4.3.5 Stable time Suboption . . . . . . . . . . . . . . . . 13 4.3.5. Stable time Suboption . . . . . . . . . . . . . . . . 13
4.3.6 Tree Group ID Suboption . . . . . . . . . . . . . . . 14 4.3.6. Tree Group ID Suboption . . . . . . . . . . . . . . . 14
4.3.7 Path Free Medium Time Suboption . . . . . . . . . . . 14 4.3.7. Path Free Medium Time Suboption . . . . . . . . . . . 14
5. Tree Discovery . . . . . . . . . . . . . . . . . . . . . . . . 16 5. Tree Discovery . . . . . . . . . . . . . . . . . . . . . . . . 16
5.1 tree selection . . . . . . . . . . . . . . . . . . . . . . 17 5.1. tree selection . . . . . . . . . . . . . . . . . . . . . . 17
5.2 Sub-tree mobility . . . . . . . . . . . . . . . . . . . . 17 5.2. Sub-tree mobility . . . . . . . . . . . . . . . . . . . . 18
5.3 Administrative depth . . . . . . . . . . . . . . . . . . . 18 5.3. Administrative depth . . . . . . . . . . . . . . . . . . . 18
5.4 DRL entries states and stability . . . . . . . . . . . . . 18 5.4. DRL entries states and stability . . . . . . . . . . . . . 18
5.4.1 Held-Up . . . . . . . . . . . . . . . . . . . . . . . 19 5.4.1. Held-Up . . . . . . . . . . . . . . . . . . . . . . . 19
5.4.2 Held-Down . . . . . . . . . . . . . . . . . . . . . . 20 5.4.2. Held-Down . . . . . . . . . . . . . . . . . . . . . . 20
5.4.3 Collision . . . . . . . . . . . . . . . . . . . . . . 20 5.4.3. Collision . . . . . . . . . . . . . . . . . . . . . . 20
5.4.4 Instability . . . . . . . . . . . . . . . . . . . . . 21 5.4.4. Instability . . . . . . . . . . . . . . . . . . . . . 21
5.5 Legacy Routers . . . . . . . . . . . . . . . . . . . . . . 21 5.5. Legacy Routers . . . . . . . . . . . . . . . . . . . . . . 21
6. Directed Acyclic Graph Discovery . . . . . . . . . . . . . . . 21 6. Directed Acyclic Graph Discovery . . . . . . . . . . . . . . . 21
7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 21 7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 22
8. Security Considerations . . . . . . . . . . . . . . . . . . . 22 8. Security Considerations . . . . . . . . . . . . . . . . . . . 22
9. Changes . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 9. Changes . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
9.1 Changes from version 00 to 01 . . . . . . . . . . . . . . 22 9.1. Changes from version 00 to 01 . . . . . . . . . . . . . . 22
9.2 Changes from version 01 to 02 . . . . . . . . . . . . . . 22 9.2. Changes from version 01 to 02 . . . . . . . . . . . . . . 22
9.3 Changes from version 02 to 03 . . . . . . . . . . . . . . 22 9.3. Changes from version 02 to 03 . . . . . . . . . . . . . . 22
9.4 Changes from version 03 to 04 . . . . . . . . . . . . . . 22 9.4. Changes from version 03 to 04 . . . . . . . . . . . . . . 23
9.5. Changes from version 04 to 05 . . . . . . . . . . . . . . 23
10. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . 23
11. References . . . . . . . . . . . . . . . . . . . . . . . . . 24 10. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 23
11.1 Normative Reference . . . . . . . . . . . . . . . . . . . 24
11.2 Informative Reference . . . . . . . . . . . . . . . . . . 24
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . 25 11. References . . . . . . . . . . . . . . . . . . . . . . . . . . 24
11.1. Normative Reference . . . . . . . . . . . . . . . . . . . 24
11.2. Informative Reference . . . . . . . . . . . . . . . . . . 24
Intellectual Property and Copyright Statements . . . . . . . . 26 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 25
Intellectual Property and Copyright Statements . . . . . . . . . . 26
1. Introduction 1. Introduction
As per Nemo Basic support [4], a Mobile Router autoconfigures a As per Nemo Basic support [3], a Mobile Router autoconfigures a
single Care of Address (CoA) to register to its Home Agent and single Care of Address (CoA) to register to its Home Agent and
terminate its Mobile Router-Home Agent tunnel. That Care of Address terminate its Mobile Router-Home Agent tunnel. That Care of Address
is the Mobile Router point of attachment to the nested Nemo. is the Mobile Router point of attachment to the nested Nemo.
Consequently, if loops are avoided, the nested Nemo assumes the shape Consequently, if loops are avoided, the nested Nemo assumes the shape
of a tree. The nodes of the tree are Mobile Routers, the root is of a tree. The nodes of the tree are Mobile Routers, the root is
either a fixed or a Mobile Router, called in the latter case the root either a fixed or a Mobile Router, called in the latter case the root
Mobile Router in NEMO terminology [6]. The leaves are mobile or Mobile Router in NEMO terminology [4]. The leaves are mobile or
fixed hosts, called Local Fixed Nodes, Local Mobile Nodes and fixed hosts, called Local Fixed Nodes, Local Mobile Nodes and
Visiting Mobile Nodes in the NEMO terminology. Visiting Mobile Nodes in the NEMO terminology.
This paper provides (1) a minimum extension to IPv6 Neighbor This paper provides (1) a minimum extension to IPv6 Neighbor
Discovery Router Advertisements in order to ensure that Mobile Discovery Router Advertisements in order to ensure that Mobile
Routers attaching to one another actually avoid loops and end up Routers attaching to one another actually avoid loops and end up
forming a tree, and (2) the minimum common part of all Mobile Router forming a tree, and (2) the minimum common part of all Mobile Router
algorithms that is required to ensure that whatever their specific algorithms that is required to ensure that whatever their specific
decisions, loops between Mobile Routers will be avoided. decisions, loops between Mobile Routers will be avoided.
skipping to change at page 4, line 44 skipping to change at page 4, line 44
Option (TIO). The TIO allows Mobile Routers to advertise the tree Option (TIO). The TIO allows Mobile Routers to advertise the tree
they belong to, and to select and move to the best location within they belong to, and to select and move to the best location within
the available trees. Mobile Routers propagate the TIO in RA down the the available trees. Mobile Routers propagate the TIO in RA down the
tree, updating some metrics such as the tree depth, leaving alone tree, updating some metrics such as the tree depth, leaving alone
root information such as the tree identifier, and sending the result root information such as the tree identifier, and sending the result
in RAs over the ingress interfaces. in RAs over the ingress interfaces.
2. Terms and Abbreviations 2. Terms and Abbreviations
This document assumes that the reader is familiar with Mobile IPv6 as This document assumes that the reader is familiar with Mobile IPv6 as
defined in [3] and with the concept of Mobile Router defined in the defined in [2] and with the concept of Mobile Router defined in the
Nemo terminology document [6]. Nemo terminology document [4].
For the needs of this paper, the following new definitions are For the needs of this paper, the following new definitions are
introduced: introduced:
Nemo clusterhead: The root of a tree of mobile routers. When the Nemo clusterhead: The root of a tree of mobile routers. When the
tree of Mobile Routers is attached to the infrastructure, the tree of Mobile Routers is attached to the infrastructure, the
fixed Access Router may act as cluster head if it supports the fixed Access Router may act as cluster head if it supports the
Tree Information Option described in this document. If it does Tree Information Option described in this document. If it does
not, then the clusterhead coincides with the root Mobile Router in not, then the clusterhead coincides with the root Mobile Router in
NEMO terminology. A clusterhead is elected even when the tree is NEMO terminology. A clusterhead is elected even when the tree is
not attached to the infrastructure. A stand-alone Mobile Router not attached to the infrastructure. A stand-alone Mobile Router
is a clusterhead. is a clusterhead.
Floating Tree: A Nested Nemo which clusterhead is a Mobile Router Floating Tree: A Nested Nemo which clusterhead is a Mobile Router
that is not attached to an Access Router. that is not attached to an Access Router.
Grounded Tree: A Nested Nemo whose clusterhead is attached to the Grounded Tree: A Nested Nemo whose clusterhead is attached to the
infrastructure. In other words, the clusterhead is either a fixed infrastructure. In other words, the clusterhead is either a fixed
router that supports Router Advertisement - Tree Information router that supports Router Advertisement - Tree Information
Option or is a Mobile Router which attachment router is a fixed Option or is a Mobile Router which attachment router is a fixed
router that does not support Router Advertisement - Tree router that does not support Router Advertisement - Tree
Information Option. Information Option.
Mobile Access Router: A Mobile Router that provides Access Router Mobile Access Router: A Mobile Router that provides Access Router
services to other Mobile Routers. services to other Mobile Routers.
Attachment Router: The Router that is selected as Access Router by a Attachment Router: The Router that is selected as Access Router by a
Mobile Router, making it its parent in the nested NEMO tree. Mobile Router, making it its parent in the nested NEMO tree.
Propagation: The action by a Mobile Router that consists in receiving Propagation: The action by a Mobile Router that consists in
a Router Advertisement Tree Information Option from its Attachment receiving a Router Advertisement Tree Information Option from its
Router, recomputing a few specific fields, removing unknown Attachment Router, recomputing a few specific fields, removing
suboptions, and appending the resulting TIO to RAs sent over the unknown suboptions, and appending the resulting TIO to RAs sent
ingress interfaces. over the ingress interfaces.
3. Motivations 3. Motivations
3.1 Multi-Homed nested mobile network 3.1. Multi-Homed nested mobile network
A nested mobile network that is made of multiple Mobile Routers A nested mobile network that is made of multiple Mobile Routers
having a direct connection to the Internet is said to be multi-homed. having a direct connection to the Internet is said to be multi-homed.
Multihoming in Nemo offers useful properties to Mobile Network Nodes. Multihoming in Nemo offers useful properties to Mobile Network Nodes.
The NEMO multihoming issues [9] draft lists potential multi-homed The NEMO multihoming issues [7] draft lists potential multi-homed
configurations for Nemo and explains the different problems and configurations for Nemo and explains the different problems and
advantages that some configurations may introduce. Multihoming advantages that some configurations may introduce. Multihoming
offers three main abilities to the Nemo: it allows route recovery on offers three main abilities to the Nemo: it allows route recovery on
failure, redundancy and load-sharing between Mobile Routers (or failure, redundancy and load-sharing between Mobile Routers (or
between interfaces of a given Mobile Router). However, for the between interfaces of a given Mobile Router). However, for the
moment, there is no requirements nor protocol that would define in moment, there is no requirements nor protocol that would define in
interaction between several egress interfaces inside a Nemo. interaction between several egress interfaces inside a Nemo.
In a nested Nemo, the hierarchy of Mobile Routers increases the In a nested Nemo, the hierarchy of Mobile Routers increases the
complexity of the route and/or router selection for Mobile Network complexity of the route and/or router selection for Mobile Network
Nodes. Each level of a Nemo implies the usage of a new tunnel Nodes. Each level of a Nemo implies the usage of a new tunnel
between the Mobile Router and its home agent. Thus if a Mobile between the Mobile Router and its home agent. Thus if a Mobile
Network Node connects to a sub-Nemo which is also a sub-Nemo, packets Network Node connects to a sub-Nemo which is also a sub-Nemo, packets
from the Mobile Network Node will be encapsulated three times. from the Mobile Network Node will be encapsulated three times.
When the Nemo where the MN is connected to is multi-homed, the MN may When the Nemo where the MN is connected to is multi-homed, the MN may
have the choice between several Attachment Router to be its default have the choice between several Attachment Router to be its default
router. Reference [7] introduces new options in Router Advertisement router. Reference [5] introduces new options in Router Advertisement
to allow any node on a link to choose between several routers. This to allow any node on a link to choose between several routers. This
option mainly consists of a 2-bits flag that indicates the preference option mainly consists of a 2-bits flag that indicates the preference
of the router (low, medium or high). Furthermore, the same flag can of the router (low, medium or high). Furthermore, the same flag can
be set in the Route Information option indicating the preference of a be set in the Route Information option indicating the preference of a
specific prefix. Therefore, any node can determine its best default specific prefix. Therefore, any node can determine its best default
router(s) according to a given destination and its best router for router(s) according to a given destination and its best router for
default, which will be used by default. default, which will be used by default.
However this preference is only useful in a flat topology; It gives a However this preference is only useful in a flat topology; It gives a
way to the node to choose between different attachment routers way to the node to choose between different attachment routers
skipping to change at page 6, line 36 skipping to change at page 6, line 36
hierarchical topology the node can not learn the depth of each hierarchical topology the node can not learn the depth of each
attachment router, and might not select the most efficient path. attachment router, and might not select the most efficient path.
One of the usage of the new option introduced in this document is to One of the usage of the new option introduced in this document is to
distribute information on the hierarchy of Mobile Routers. This distribute information on the hierarchy of Mobile Routers. This
information can be distributed to Attachment Routers, Mobile Routers information can be distributed to Attachment Routers, Mobile Routers
and Mobile Network Nodes as well in order to allow better route and Mobile Network Nodes as well in order to allow better route
selection and to increase the knowledge of the Nemo topology on each selection and to increase the knowledge of the Nemo topology on each
node. node.
3.2 Loops in nested Nemo 3.2. Loops in nested Nemo
When several Mobile Routers attach to each other to form a nested When several Mobile Routers attach to each other to form a nested
Nemo, loops can be created if they are not explicitly avoided. In Nemo, loops can be created if they are not explicitly avoided. In
the simplest case, when egress and ingress interfaces of A Mobile the simplest case, when egress and ingress interfaces of A Mobile
Router are all wireless, a mobile router may be listening to Router Router are all wireless, a mobile router may be listening to Router
Advertisement from its own ingress interface, creating a confliction Advertisement from its own ingress interface, creating a confliction
problem. In the general case, arbitrary attachment of Mobile Routers problem. In the general case, arbitrary attachment of Mobile Routers
will form graphs that are not exempt of loops. For instance: Assume will form graphs that are not exempt of loops. For instance: Assume
a nested Nemo where Mobile Router1 is connected to the a nested Nemo where Mobile Router1 is connected to the
infrastructure, and Mobile Router3 is attached to Mobile Router2. infrastructure, and Mobile Router3 is attached to Mobile Router2.
skipping to change at page 8, line 15 skipping to change at page 8, line 15
4. Router Advertisement extensions 4. Router Advertisement extensions
New extensions of Router Advertisement are proposed to distribute the New extensions of Router Advertisement are proposed to distribute the
knowledge of the Mobile Router hierarchy inside a nested Nemo. These knowledge of the Mobile Router hierarchy inside a nested Nemo. These
extensions are defined in different options/sub-options: a flag bit extensions are defined in different options/sub-options: a flag bit
from the reserved flag field of Router Advertisement message is used from the reserved flag field of Router Advertisement message is used
to indicate whether the sending router is a Mobile Router or not; a to indicate whether the sending router is a Mobile Router or not; a
new option is defined to transport minimum information on the tree to new option is defined to transport minimum information on the tree to
avoid loops generation; avoid loops generation;
4.1 Router Advertisement message 4.1. Router Advertisement message
We propose to use a reserved flag of the Router Advertisement message We propose to use a reserved flag of the Router Advertisement message
to inform whether the sending router is a Mobile Router or not. to inform whether the sending router is a Mobile Router or not.
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Code | Checksum | | Type | Code | Checksum |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Cur Hop Limit |M|O|H|N|Reservd| Router Lifetime | | Cur Hop Limit |M|O|H|N|Reservd| Router Lifetime |
skipping to change at page 8, line 41 skipping to change at page 8, line 41
| Options ... | Options ...
+-+-+-+-+-+-+-+-+-+-+-+- +-+-+-+-+-+-+-+-+-+-+-+-
Figure 1: Router Advertisement Figure 1: Router Advertisement
Nemo enabled router (N) Nemo enabled router (N)
The Nemo enabled router (N) bit is set when the sending router is a The Nemo enabled router (N) bit is set when the sending router is a
Mobile Router. Mobile Router.
4.2 Tree Information Option 4.2. Tree Information Option
The Tree Information Option carries a number of metrics and other The Tree Information Option carries a number of metrics and other
information that allows a Mobile Router to discover a tree and select information that allows a Mobile Router to discover a tree and select
its point of attachment while avoiding loop generation. its point of attachment while avoiding loop generation.
The option is a container option, which might contain a number of The option is a container option, which might contain a number of
suboptions. The base option regroups the minimum information set suboptions. The base option regroups the minimum information set
that is mandatory in all cases. that is mandatory in all cases.
A TIO can also be used by Mobile Network Nodes to select their best A TIO can also be used by Mobile Network Nodes to select their best
default router. If the default router of a non-Mobile Router sends default router. If the default router of a non-Mobile Router sends
Router Advertisements with a Tree Information Option, the non-Mobile Router Advertisements with a Tree Information Option, the non-Mobile
Router MUST set the N flag of its own Router Advertisement to 0 and Router MUST set the N flag of its own Router Advertisement to 0 and
copy the Tree Discovery Option in its own Router Advertisement. copy the Tree Discovery Option in its own Router Advertisement.
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Length |G|H|B| Reserved | | Type | Length |G|H|B| Reserved| Sequence |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| TreePref. | BootTimeRandom | | TreePref. | BootTimeRandom |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| MR Preference | TreeDepth | TreeDelay | | MR Preference | TreeDepth | TreeDelay |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| PathDigest | | PathDigest |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| | | |
+ + + +
| TreeID | | TreeID |
+ + + +
| | | |
+ + + +
| | | |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| sub-option(s)... | sub-option(s)...
+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+
Figure 2: RA Tree Information Option Figure 2: RA Tree Information Option
Type: 8-bit unsigned integer set to 10 by the clusterhead. Value is Type: 8-bit unsigned integer set to 10 by the clusterhead. Value is
"TBD". "TBD".
Length: 8-bit unsigned integer set to 4 when there is no suboption. Length: 8-bit unsigned integer set to 4 when there is no suboption.
The length of the option (including the type and length fields and The length of the option (including the type and length fields and
the suboptions) in units of 8 octets. the suboptions) in units of 8 octets.
Grounded (G): The Grounded (G) flag is set when the clusterhead is Grounded (G): The Grounded (G) flag is set when the clusterhead is
attached to a fixed network infrastructure (such as the Internet). attached to a fixed network infrastructure (such as the Internet).
Home (H): The Home (H) flag is set when the clusterhead is attached Home (H): The Home (H) flag is set when the clusterhead is attached
to its home network. to its home network.
Battery (B): The Battery (B) flag is indicates that a parent in the Battery (B): The Battery (B) flag is indicates that a parent in the
tree operates on batteries, an indication of a costly operation. tree operates on batteries, an indication of a costly operation.
It is set by a mobile router which operates on battery and when It is set by a mobile router which operates on battery and when
set, it is left set as it is propagated down the tree. set, it is left set as it is propagated down the tree.
Reserved: 13-bit unsigned integer set to 0 by the clusterhead. Reserved: 13-bit unsigned integer set to 0 by the clusterhead.
TreePreference: 8-bit unsigned integer set by the clusterhead to its Sequence Number: 8-bit unsigned integer set by the clusterhead and
incremented with each new TIO it sends on a link and propagated
with no change down the tree.
TreePreference: 8-bit unsigned integer set by the clusterhead to its
preference and unchanged at propagation. Default is 0 (lowest preference and unchanged at propagation. Default is 0 (lowest
preference). The tree preference provides a mechanism to engineer preference). The tree preference provides a mechanism to engineer
the mesh of mobile routers, for instance indicating the most the mesh of mobile routers, for instance indicating the most
preferred home gateway or the communication ship in a fleet at preferred home gateway or the communication ship in a fleet at
sea. sea.
BootTimeRandom: A random value computed at boot time and recomputed BootTimeRandom: A random value computed at boot time and recomputed
in case of a duplication with another Attachment Router. The in case of a duplication with another Attachment Router. The
concatenation of the Preference and the BootTimeRandom is a 32-bit concatenation of the Preference and the BootTimeRandom is a 32-bit
extended preference that is used to resolve collisions. It is set extended preference that is used to resolve collisions. It is set
by each Mobile Router at propagation time. by each Mobile Router at propagation time.
Preference: The administrative preference of that (mobile) Access Preference: The administrative preference of that (mobile) Access
Router. Default is 0. 255 is the highest possible preference. Router. Default is 0. 255 is the highest possible preference.
Set by each Mobile Router at propagation time. Set by each Mobile Router at propagation time.
TreeDepth: 8-bit unsigned integer. The tree depth of the clusterhead TreeDepth: 8-bit unsigned integer. The tree depth of the
is 0 if it is a fixed router and 1 if it is a Mobile Router. The clusterhead is 0 if it is a fixed router and 1 if it is a Mobile
tree Depth of a tree Node is the depth of its attachment router as Router. The tree Depth of a tree Node is the depth of its
received in a TIO, incremented by at least one. All nodes in the attachment router as received in a TIO, incremented by at least
tree advertise their tree depth in the Tree Information Options one. All nodes in the tree advertise their tree depth in the Tree
that they append to the RA messages over their ingress interfaces Information Options that they append to the RA messages over their
as part of the propagation process. ingress interfaces as part of the propagation process.
TreeDelay: 16-bit unsigned integer set by the clusterhead indicating TreeDelay: 16-bit unsigned integer set by the clusterhead indicating
the delay before changing the tree configuration, in milliseconds. the delay before changing the tree configuration, in milliseconds.
A default value is 128ms. It is expected to be an order of A default value is 128ms. It is expected to be an order of
magnitude smaller than the RA-interval so if the clusterhead has a magnitude smaller than the RA-interval so if the clusterhead has a
sub-second RA-interval, the Tree delay may be shorter than 100ms. sub-second RA-interval, the Tree delay may be shorter than 100ms.
It is also expected to be an order of magnitude longer than the It is also expected to be an order of magnitude longer than the
typical propagation delay inside the nested Nemo. typical propagation delay inside the nested Nemo.
PathDigest: 32-bit unsigned integer CRC, updated by each Mobile PathDigest: 32-bit unsigned integer CRC, updated by each Mobile
Router. This is the result of a CRC-32c computation on a bit Router. This is the result of a CRC-32c computation on a bit
string obtained by appending the received value and the Mobile string obtained by appending the received value and the Mobile
Router Care of Address. clusterheads use a 'previous value' of Router Care of Address. clusterheads use a 'previous value' of
zeroes to initially set the PathDigest. zeroes to initially set the PathDigest.
TreeID: 128-bit unsigned integer which uniquely identify a tree. TreeID: 128-bit unsigned integer which uniquely identify a tree.
This value is set by the clusterhead. The global IPv6 home This value is set by the clusterhead. The global IPv6 home
address of the clusterhead can be used. address of the clusterhead can be used.
The following values MUST not change during the propagation of the The following values MUST not change during the propagation of the
TIO down the tree: Type, Length, G, H, TreePreference, TreeDelay and TIO down the tree: Type, Length, G, H, TreePreference, TreeDelay and
TreeID. All other fields of the TIO are updated at each hop of the TreeID. All other fields of the TIO are updated at each hop of the
propagation. propagation.
4.3 TIO suboption 4.3. TIO suboption
In addition to the minimum options presented in the base option, a In addition to the minimum options presented in the base option, a
number of suboptions are defined for the TIO: number of suboptions are defined for the TIO:
4.3.1 Format 4.3.1. Format
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Subopt. Type | Subopt Length | Suboption Data... | Subopt. Type | Subopt Length | Suboption Data...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Figure 3: TIO suboption generic format Figure 3: TIO suboption generic format
Suboption Type: 8-bit identifier of the type of mobility option. Suboption Type: 8-bit identifier of the type of mobility option.
When processing a TIO containing a suboption for which the When processing a TIO containing a suboption for which the
suboption Type value is not recognized by the receiver, the suboption Type value is not recognized by the receiver, the
receiver MUST silently ignore and skip over the suboption, receiver MUST silently ignore and skip over the suboption,
correctly handling any remaining options in the message. correctly handling any remaining options in the message.
Suboption Length: 8-bit unsigned integer, representing the length in Suboption Length: 8-bit unsigned integer, representing the length in
octets of the suboption, not including the suboption Type and octets of the suboption, not including the suboption Type and
Length fields. Length fields.
Suboption Data: A variable length field that contains data specific Suboption Data: A variable length field that contains data specific
to the option. to the option.
The following subsections specify the TIO suboptions which are The following subsections specify the TIO suboptions which are
currently defined for use in the Mobility Header. currently defined for use in the Mobility Header.
Implementations MUST silently ignore any TIO suboptions options that Implementations MUST silently ignore any TIO suboptions options that
they do not understand. they do not understand.
TIO suboptions may have alignment requirements. Following the TIO suboptions may have alignment requirements. Following the
convention in IPv6, these options are aligned in a packet so that convention in IPv6, these options are aligned in a packet so that
multi-octet values within the Option Data field of each option fall multi-octet values within the Option Data field of each option fall
on natural boundaries (i.e., fields of width n octets are placed at on natural boundaries (i.e., fields of width n octets are placed at
an integer multiple of n octets from the start of the header, for n = an integer multiple of n octets from the start of the header, for n =
1, 2, 4, or 8). 1, 2, 4, or 8).
4.3.2 Pad1 4.3.2. Pad1
The Pad1 suboption does not have any alignment requirements. Its The Pad1 suboption does not have any alignment requirements. Its
format is as follows: format is as follows:
0 0
0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7
+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+
| Type = 0 | | Type = 0 |
+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+
Figure 4: Pad 1 Figure 4: Pad 1
NOTE! the format of the Pad1 option is a special case - it has NOTE! the format of the Pad1 option is a special case - it has
neither Option Length nor Option Data fields. neither Option Length nor Option Data fields.
The Pad1 option is used to insert one octet of padding in the TIO to The Pad1 option is used to insert one octet of padding in the TIO to
enable suboptions alignment. If more than one octet of padding is enable suboptions alignment. If more than one octet of padding is
required, the PadN option, described next, should be used rather than required, the PadN option, described next, should be used rather than
multiple Pad1 options. multiple Pad1 options.
4.3.3 PadN 4.3.3. PadN
The PadN option does not have any alignment requirements. Its format The PadN option does not have any alignment requirements. Its format
is as follows: is as follows:
0 1 0 1
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- - - - - - - - - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- - - - - - - - -
| Type = 1 | Subopt Length | Subopt Data | Type = 1 | Subopt Length | Subopt Data
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- - - - - - - - - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- - - - - - - - -
Figure 5: Pad N Figure 5: Pad N
The PadN option is used to insert two or more octets of padding in The PadN option is used to insert two or more octets of padding in
the TIO to enable suboptions alignment. For N (N > 1) octets of the TIO to enable suboptions alignment. For N (N > 1) octets of
padding, the Option Length field contains the value N-2, and the padding, the Option Length field contains the value N-2, and the
Option Data consists of N-2 zero-valued octets. PadN Option data Option Data consists of N-2 zero-valued octets. PadN Option data
MUST be ignored by the receiver. MUST be ignored by the receiver.
4.3.4 Bandwidth Suboption 4.3.4. Bandwidth Suboption
This suboption carries the maximum bandwidth available up the tree This suboption carries the maximum bandwidth available up the tree
via a specific parent. It is the lowest speed of the links on the via a specific parent. It is the lowest speed of the links on the
way and does not reflect the actual use of those links in run time. way and does not reflect the actual use of those links in run time.
The value is expressed in the log base 2 of the speed, expressed in The value is expressed in the log base 2 of the speed, expressed in
bps. The Bandwidth suboption does not have any alignment bps. The Bandwidth suboption does not have any alignment
requirements. Its format is as follows: requirements. Its format is as follows:
0 1 2 0 1 2
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+
| Type = 2 | Length = 1 | Bandwidth | | Type = 2 | Length = 1 | Bandwidth |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+
Figure 6: Bandwidth Suboption Figure 6: Bandwidth Suboption
Type: Set to 2 for the Bandwidth suboption. Type: Set to 2 for the Bandwidth suboption.
Length: Set to 1 for the Bandwidth suboption. Length: Set to 1 for the Bandwidth suboption.
Bandwidth: 8-bit unsigned integer. The Log2 of the speed of the path Bandwidth: 8-bit unsigned integer. The Log2 of the speed of the
expressed in bps. The clusterhead initializes that field using path expressed in bps. The clusterhead initializes that field
the speed of the link to the Access Router to which it is attached using the speed of the link to the Access Router to which it is
or 0xFF if it is floating. An attached MR propagates it as the attached or 0xFF if it is floating. An attached MR propagates it
minimum of the Bandwidth as received in the TIO from the parent as the minimum of the Bandwidth as received in the TIO from the
and the access speed between the MR and the parent. As a result, parent and the access speed between the MR and the parent. As a
the value received from a candidate AR is that of the bottleneck result, the value received from a candidate AR is that of the
between that AR and the wire access. bottleneck between that AR and the wire access.
4.3.5 Stable time Suboption 4.3.5. Stable time Suboption
This suboption carries an indicator of the stability of a network. This suboption carries an indicator of the stability of a network.
This indicator is the time since the branch to which the MR is This indicator is the time since the branch to which the MR is
attached has remained unchanged. The value is expressed in the log attached has remained unchanged. The value is expressed in the log
base 2 of that duration, expressed in milliseconds. The Stable time base 2 of that duration, expressed in milliseconds. The Stable time
suboption does not have any alignment requirements. Its format is as suboption does not have any alignment requirements. Its format is as
follows: follows:
0 1 2 0 1 2
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+
| Type = 3 | Length = 1 | Stable time | | Type = 3 | Length = 1 | Stable time |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+---------------+
Figure 7: Stable time Figure 7: Stable time
Type: Set to 3 for the Stable time suboption. Type: Set to 3 for the Stable time suboption.
Length: Set to 1 for the Stable time suboption. Length: Set to 1 for the Stable time suboption.
Stable time: 8-bit unsigned integer. The Log2 of the time since the Stable time: 8-bit unsigned integer. The Log2 of the time since the
last change in the attachment branch, expressed in milliseconds. last change in the attachment branch, expressed in milliseconds.
This is set by the MR as it propagates the TIO down the tree, This is set by the MR as it propagates the TIO down the tree,
indicating for how long the PathDigest in the TIO from its parent indicating for how long the PathDigest in the TIO from its parent
has remained unchanged. has remained unchanged.
4.3.6 Tree Group ID Suboption 4.3.6. Tree Group ID Suboption
This suboption carries the Group ID for the tree. It is set by the This suboption carries the Group ID for the tree. It is set by the
clusterhead and is left unchanged by the MR that propagates the TIO clusterhead and is left unchanged by the MR that propagates the TIO
down the tree. The Tree Group ID Suboption has an alignment down the tree. The Tree Group ID Suboption has an alignment
requirement of 8n+6. Its format is as follows: requirement of 8n+6. Its format is as follows:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type = 4 | Length = 16 | | Type = 4 | Length = 16 |
skipping to change at page 14, line 28 skipping to change at page 14, line 34
+ + + +
| Tree | | Tree |
+ Group ID + + Group ID +
| | | |
+ + + +
| | | |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Figure 8: Tree Group ID Suboption Figure 8: Tree Group ID Suboption
Type: 8-bit unsigned integer. Its value is 4 for the Tree Group ID Type: 8-bit unsigned integer. Its value is 4 for the Tree Group ID
suboption. suboption.
Length: 8-bit unsigned integer. Its value is 16 for the Tree Group Length: 8-bit unsigned integer. Its value is 16 for the Tree Group
ID suboption. ID suboption.
Tree Group ID: 128-bit unsigned integer which identify a group for a Tree Group ID: 128-bit unsigned integer which identify a group for a
tree. This value is set by the clusterhead. It can be set tree. This value is set by the clusterhead. It can be set
administratively, for instance to an IPv6 multicast group. administratively, for instance to an IPv6 multicast group.
4.3.7 Path Free Medium Time Suboption 4.3.7. Path Free Medium Time Suboption
This suboption carries the Free Medium Time available up the tree via This suboption carries the Free Medium Time available up the tree via
a specific parent at a given point of time. It is an indication of a specific parent at a given point of time. It is an indication of
whether bandwidth is available to place VoIP calls for instance. As whether bandwidth is available to place VoIP calls for instance. As
defined by the Quality of Service (QoS) Task Group of the Wi-Fi defined by the Quality of Service (QoS) Task Group of the Wi-Fi
Alliance, the Medium Time describes the amount of time admitted to Alliance, the Medium Time describes the amount of time admitted to
access the medium, in units of 32 microsecond periods per second. access the medium, in units of 32 microsecond periods per second.
The Free Medium Time is the amount of time left the medium, in other The Free Medium Time is the amount of time left the medium, in other
words ((1000000/32) - SIGMA(MT)). The Path Free Medium Time is the words ((1000000/32) - SIGMA(MT)). The Path Free Medium Time is the
skipping to change at page 15, line 16 skipping to change at page 15, line 21
requirements. Its format is as follows: requirements. Its format is as follows:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type = 5 | Length = 2 | Path Free Medium Time | | Type = 5 | Length = 2 | Path Free Medium Time |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Figure 9: Path Free Medium Time Suboption Figure 9: Path Free Medium Time Suboption
Type: Set to 5 for the Path Free Medium Time Suboption. Type: Set to 5 for the Path Free Medium Time Suboption.
Length: Set to 2 for the Path Free Medium Time Suboption. Length: Set to 2 for the Path Free Medium Time Suboption.
Path Free MT: 16-bit unsigned integer. The amount of Medium Time Path Free MT: 16-bit unsigned integer. The amount of Medium Time
that is available along the path to the clusterhead in units of 32 that is available along the path to the clusterhead in units of 32
microsecond periods per second. The clusterhead initializes that microsecond periods per second. The clusterhead initializes that
field to the Free MT on the link where the TIO is issued. An field to the Free MT on the link where the TIO is issued. An
attached MR propagates it as the minimum of the Path Free MT as attached MR propagates it as the minimum of the Path Free MT as
received in the TIO from the parent and the Path Free MT on the received in the TIO from the parent and the Path Free MT on the
link on which the TIO is propagated. As a result, the value link on which the TIO is propagated. As a result, the value
received from a candidate AR is that of the bottleneck between received from a candidate AR is that of the bottleneck between
that AR and the clusterhead. that AR and the clusterhead.
5. Tree Discovery 5. Tree Discovery
Here follows a set of rules and definitions that MUST be followed by Here follows a set of rules and definitions that MUST be followed by
all Mobile Routers: all Mobile Routers:
1. A Mobile Router that is not attached to an Attachment Router is 1. A Mobile Router that is not attached to an Attachment Router is
the Nemo clusterhead of its own floating tree. It's depth is 1. the Nemo clusterhead of its own floating tree. It's depth is 1.
A Mobile Router will end up in that situation when it looses its
current parent and there is no alternate parent that it can
attach to. In that case, the MR remembers the treeID and the
sequence counter in the TIO of the lost parent for a period of
time which covers multiple TIO.
2. A Mobile Router that is attached to an Attachment Router that 2. A Mobile Router that is attached to an Attachment Router that
does not support TIO, is the clusterhead of its own grounded does not support TIO, is the clusterhead of its own grounded
tree. It's depth is 1. tree. It's depth is 1.
3. A router sending a RA without TIO is considered a grounded 3. A router sending a RA without TIO is considered a grounded
Attachment Router at depth 0. Attachment Router at depth 0.
4. The Nemo clusterhead of a tree exposes the tree in the Router 4. The Nemo clusterhead of a tree exposes the tree in the Router
Advertisement Tree Information Option and Mobile Routers Advertisement Tree Information Option and Mobile Routers
skipping to change at page 16, line 35 skipping to change at page 16, line 40
5. A Mobile Router that is already part of a tree MAY move at any 5. A Mobile Router that is already part of a tree MAY move at any
time and with no delay in order to get closer to the clusterhead time and with no delay in order to get closer to the clusterhead
of its current tree - i.e. in order to reduce its own tree depth. of its current tree - i.e. in order to reduce its own tree depth.
But A Mobile Router MUST NOT move down the tree that it is But A Mobile Router MUST NOT move down the tree that it is
attached to. Mobile Routers MUST ignore RAs that are received attached to. Mobile Routers MUST ignore RAs that are received
from other routers located deeper within the same tree. from other routers located deeper within the same tree.
6. A Mobile Router may move from its current tree into any different 6. A Mobile Router may move from its current tree into any different
tree at any time and whatever the depth it reaches in the new tree at any time and whatever the depth it reaches in the new
tree, but it may have to wait for a Tree Hop timer to elapse in tree, but it may have to wait for a Tree Hop timer to elapse in
order to do so. The Mobile Router will join that other tree if order to do so. If the MR was clusterhead of its own floating
it is more preferable for reasons of connectivity, configured tree, it may not join its previous identified by the last parent
preference, free Medium Time, size, security, bandwidth, tree treeID tree unless the sequence number is the TIO was
depth, or whatever metrics the Mobile Router cares to use. incrememented since the MR left that tree, indicating that the
candidate parent was not attached behind this MR and kept getting
subsequent TIOs from the same tree. The Mobile Router will join
that other tree if it is more preferable for reasons of
connectivity, configured preference, free Medium Time, size,
security, bandwidth, tree depth, or whatever metrics the Mobile
Router cares to use.
7. If a Mobile Router has selected a new attachment router but has 7. If a Mobile Router has selected a new attachment router but has
not moved yet (because it is waiting for Tree Hop timer to not moved yet (because it is waiting for Tree Hop timer to
elapse), the Mobile Router is unstable and refrains from sending elapse), the Mobile Router is unstable and refrains from sending
Router Advertisement - Tree Information Options. Router Advertisement - Tree Information Options.
8. When A Mobile Router joins a tree, moves within its tree, or when 8. When A Mobile Router joins a tree, moves within its tree, or when
it receives a modified TIO from its current attachment router, it receives a modified TIO from its current attachment router,
the Mobile Router sends an unsolicited Router Advertisement the Mobile Router sends an unsolicited Router Advertisement
message on all its mobile networks (i.e. all its ingress message on all its mobile networks (i.e. all its ingress
skipping to change at page 17, line 11 skipping to change at page 17, line 22
information. At the same time, the Mobile Router MAY send a information. At the same time, the Mobile Router MAY send a
Binding Update to its home agent or a local proxy of some sort, Binding Update to its home agent or a local proxy of some sort,
because the tree it is attached to has changed. If the Mobile because the tree it is attached to has changed. If the Mobile
Router fails to reach its Home Agent, it MAY attempt to roll back Router fails to reach its Home Agent, it MAY attempt to roll back
the movement or to retry the Home Agent discovery procedure. the movement or to retry the Home Agent discovery procedure.
9. This allows the new higher parts of the tree to take place first 9. This allows the new higher parts of the tree to take place first
eventually dragging their sub-tree with them, and allowing eventually dragging their sub-tree with them, and allowing
stepped sub-tree reconfigurations, limiting relative movements. stepped sub-tree reconfigurations, limiting relative movements.
5.1 tree selection 5.1. tree selection
The tree selection is implementation and algorithm dependent. In The tree selection is implementation and algorithm dependent. In
order to limit erratic movements, and all metrics being equal, Mobile order to limit erratic movements, and all metrics being equal, Mobile
Routers SHOULD stick to their previous selection. Also, Mobile Routers SHOULD stick to their previous selection. Also, Mobile
Routers SHOULD provide a mean to filter out candidate Attachment Routers SHOULD provide a mean to filter out candidate Attachment
Routers whose availability is detected as fluctuating, at least when Routers whose availability is detected as fluctuating, at least when
more stable choices are available. For instance, the Mobile Router more stable choices are available. For instance, the Mobile Router
MAY place the failed Attachment Router in a Hold Down mode that MAY place the failed Attachment Router in a Hold Down mode that
ensures that the Attachment Router will not be reused for a given ensures that the Attachment Router will not be reused for a given
period of time. period of time.
skipping to change at page 17, line 45 skipping to change at page 18, line 8
A Mobile Router SHOULD verify that bidirectional connectivity is A Mobile Router SHOULD verify that bidirectional connectivity is
available with a candidate Attachment Router before it attaches to available with a candidate Attachment Router before it attaches to
that candidate. Some layer 2 such as 802.11 infrastructure mode will that candidate. Some layer 2 such as 802.11 infrastructure mode will
provide for this, while others such as 802.11 adhoc mode will not. provide for this, while others such as 802.11 adhoc mode will not.
If the layer 2 does not guarantee the bidirectional connectivity, If the layer 2 does not guarantee the bidirectional connectivity,
then the MR needs to make sure that it can reach the AR. This can be then the MR needs to make sure that it can reach the AR. This can be
achieved using Neighbor Sollicitation and refraining from attaching achieved using Neighbor Sollicitation and refraining from attaching
to an AR for which no neighbor cache exists, or the state is still to an AR for which no neighbor cache exists, or the state is still
INCOMPLETE. INCOMPLETE.
5.2 Sub-tree mobility 5.2. Sub-tree mobility
It might be perceived as beneficial for a sub-tree to move as a It might be perceived as beneficial for a sub-tree to move as a
whole. The way it would work is for a Mobile Router to stay whole. The way it would work is for a Mobile Router to stay
clusterhead even if itself is attached into a parent tree. But the clusterhead even if itself is attached into a parent tree. But the
loop avoidance is based on the knowledge of the tree that the Mobile loop avoidance is based on the knowledge of the tree that the Mobile
Router visit, preventing a Mobile Router to move down a same tree. Router visit, preventing a Mobile Router to move down a same tree.
So without additional support, tree-level loops could form. So without additional support, tree-level loops could form.
To avoid this, it is possible to add a path vector suboption to the To avoid this, it is possible to add a path vector suboption to the
TIO that reflects the nesting of trees. If a root-Mobile Router TIO that reflects the nesting of trees. If a root-Mobile Router
joins a parent tree, then it needs to add its treeID to the path joins a parent tree, then it needs to add its treeID to the path
vector, but it can not join if the treeID is already listed. vector, but it can not join if the treeID is already listed.
A specific case is the root-Mobile Router of a tree that attaches to A specific case is the root-Mobile Router of a tree that attaches to
a fixed Access Router. That root-Mobile Router might omit to a fixed Access Router. That root-Mobile Router might omit to
consider a TIO that comes from the new Attachment Router and decide consider a TIO that comes from the new Attachment Router and decide
to stay root, in order to keep the tree consistency from the nested to stay root, in order to keep the tree consistency from the nested
Mobile Routers standpoint. This does not create loops, even if the Mobile Routers standpoint. This does not create loops, even if the
path vector is not present path vector is not present
5.3 Administrative depth 5.3. Administrative depth
When the tree is formed under a common administration, or when a When the tree is formed under a common administration, or when a
Mobile Router performs a certain role within a community, it might be Mobile Router performs a certain role within a community, it might be
beneficial to associate a range of acceptable depth with that MR. beneficial to associate a range of acceptable depth with that MR.
For instance, a MR that has limited battery should be a leaf unless For instance, a MR that has limited battery should be a leaf unless
there is no other choice, and thus expose an exagerated depth. On there is no other choice, and thus expose an exagerated depth. On
the other hane, a MR that is designed for backhaul should operate in the other hane, a MR that is designed for backhaul should operate in
a low range of depth. a low range of depth.
With Tree Discovery, a MR has to expose a depth that is incremented With Tree Discovery, a MR has to expose a depth that is incremented
from its parent's depth as receive in the TIO. In particular, a MR from its parent's depth as receive in the TIO. In particular, a MR
might expose a depth which is incremented by more than one from its might expose a depth which is incremented by more than one from its
parent's depth, in order to fit in its own administrative range. So parent's depth, in order to fit in its own administrative range. So
a depth of N does not mean that there is precisely N Mobile Routers a depth of N does not mean that there is precisely N Mobile Routers
on the way, but at most N. on the way, but at most N.
5.4 DRL entries states and stability 5.4. DRL entries states and stability
Attachment routers in the DRL may or may not be usable for roaming Attachment routers in the DRL may or may not be usable for roaming
depending on runtime conditions. The following states are defined: depending on runtime conditions. The following states are defined:
Current This Attachment Router is used for roaming Current This Attachment Router is used for roaming
Candidate This Attachment Router can be used for roaming. Candidate This Attachment Router can be used for roaming.
Held-Up This Attachment Router can not be used till tree hop timer Held-Up This Attachment Router can not be used till tree hop timer
elapses. This does not occur for a fixed Attachment Router that elapses. This does not occur for a fixed Attachment Router that
does not send a TIO since the tree delay is null in that case. does not send a TIO since the tree delay is null in that case.
Held-Down This Attachment Router can not be used till hold down timer Held-Down This Attachment Router can not be used till hold down
elapses. At the end of the hold-down period, the router is timer elapses. At the end of the hold-down period, the router is
removed from the DRL, and will be reinserted if it appears again removed from the DRL, and will be reinserted if it appears again
with a RA. with a RA.
Collision This Attachment Router can not be used till its next RA. Collision This Attachment Router can not be used till its next RA.
5.4.1 Held-Up 5.4.1. Held-Up
This state is managed by the tree Hop timer, it serves 2 purposes: This state is managed by the tree Hop timer, it serves 2 purposes:
Delay the reattachment of a sub-tree that has been forced to Delay the reattachment of a sub-tree that has been forced to
detach. This allows to make sure that when a sub-tree has detach. This allows to make sure that when a sub-tree has
detached, the Router Advertisement - Tree Information Option that detached, the Router Advertisement - Tree Information Option that
is initiated by the new clusterhead has spread down the sub-tree is initiated by the new clusterhead has spread down the sub-tree
so that two different trees have formed. so that two different trees have formed.
Limit Router Advertisement - Tree Information Option storms when Limit Router Advertisement - Tree Information Option storms when
skipping to change at page 20, line 5 skipping to change at page 20, line 12
that elapses for a given new tree clears them all for that tree, that elapses for a given new tree clears them all for that tree,
allowing the Mobile Router to jump to the highest position available allowing the Mobile Router to jump to the highest position available
in the new tree. in the new tree.
The duration of the Tree Hop timer depends on the tree delay of the The duration of the Tree Hop timer depends on the tree delay of the
new tree and on the depth of Attachment Router that triggers it: new tree and on the depth of Attachment Router that triggers it:
(AR's depth + random) * AR's tree_delay (where 0 <= random < 1). It (AR's depth + random) * AR's tree_delay (where 0 <= random < 1). It
is randomized in order to limit collisions and synchronizations. is randomized in order to limit collisions and synchronizations.
5.4.2 Held-Down 5.4.2. Held-Down
When a router is 'removed' from the Default Router List, it is When a router is 'removed' from the Default Router List, it is
actually held down for a hold down timer period, in order to prevent actually held down for a hold down timer period, in order to prevent
flapping. This happens when an Attachment Router disappears (upon flapping. This happens when an Attachment Router disappears (upon
expiration timer), and when an Attachment Router is tried but can not expiration timer), and when an Attachment Router is tried but can not
reach the Home Agent (upon expiration of another Attachment Router, reach the Home Agent (upon expiration of another Attachment Router,
or upon tree hop for that Attachment Router). or upon tree hop for that Attachment Router).
An Attachment Router that is held down is not considered for the An Attachment Router that is held down is not considered for the
purpose of roaming. When the hold down timer elapses, the Attachment purpose of roaming. When the hold down timer elapses, the Attachment
Router is removed from the DRL. Router is removed from the DRL.
5.4.3 Collision 5.4.3. Collision
A race condition occurs if 2 Mobile Routers send Router Advertisement A race condition occurs if 2 Mobile Routers send Router Advertisement
- Tree Information Option at the same time and wish to join each - Tree Information Option at the same time and wish to join each
other. In order to detect the situation, Mobile Routers time stamp other. This might happen between routers at a same depth, or routers
the sending of Router Advertisement - Tree Information Option. Any which act as clusterhead of their own tree. In order to detect the
Router Advertisement - Tree Information Option received within a situation, Mobile Routers time stamp the sending of Router
short media-dependant period introduces a risk. To divide the risk, Advertisement - Tree Information Option. Any Router Advertisement -
A 32bits extended preference is added in the TIO. The first byte is Tree Information Option received within a short media-dependant
the clusterhead preference, the remaining 24 bits is a boot time period introduces a risk. To divide the risk, A 32bits extended
computed random. preference is added in the TIO. The first byte is the clusterhead
(tree) preference, the remaining 24 bits is a boot time computed
random.
A Mobile Router that decides to join an Attachment Router will do so A Mobile Router that decides to join an Attachment Router will do so
between (Attachment Router depth) and (Attachment Router depth + 1) between (Attachment Router depth) and (Attachment Router depth + 1)
times the Attachment Router tree delay. But since a Mobile Router is times the Attachment Router tree delay. But since a Mobile Router is
unstable as soon as it receives the Router Advertisement - Tree unstable as soon as it receives the Router Advertisement - Tree
Information Option from the preferred Attachment Router, it will Information Option from the preferred Attachment Router, it will
restrain from sending a Router Advertisement - Tree Information restrain from sending a Router Advertisement - Tree Information
Option between the time it receives the RA and the time it actually Option between the time it receives the RA and the time it actually
jumps. So the crossing of RA may only happen during the propagation jumps. So the crossing of RA may only happen during the propagation
time between the Attachment Router and the Mobile Router, plus some time between the Attachment Router and the Mobile Router, plus some
skipping to change at page 21, line 5 skipping to change at page 21, line 15
There is risk of a collision when a Mobile Router receives an RA, for There is risk of a collision when a Mobile Router receives an RA, for
an other mobile router that is more preferable than the current an other mobile router that is more preferable than the current
Attachment Router, within the risk window. In the face of a Attachment Router, within the risk window. In the face of a
potential collision, the Mobile Router with the lowest extended potential collision, the Mobile Router with the lowest extended
preference processes the Router Advertisement - Tree Information preference processes the Router Advertisement - Tree Information
Option normally, while the router with the highest preference places Option normally, while the router with the highest preference places
the other in collision state, does not start the tree hop timer, and the other in collision state, does not start the tree hop timer, and
does not become instable. It is expected that next RAs between the does not become instable. It is expected that next RAs between the
two will not cross anyway. two will not cross anyway.
5.4.4 Instability 5.4.4. Instability
A Mobile Router is instable when it is prepared to move shortly to A Mobile Router is instable when it is prepared to move shortly to
another Attachment Router. This happens typically when the Mobile another Attachment Router. This happens typically when the Mobile
Router has selected a more preferred candidate Attachment Router and Router has selected a more preferred candidate Attachment Router and
has to wait for the tree hop timer to elapse before roaming. has to wait for the tree hop timer to elapse before roaming.
Instability may also occur when the current Attachment Router is lost Instability may also occur when the current Attachment Router is lost
and the next best is still held up. Instability is resolved when the and the next best is still held up. Instability is resolved when the
tree hop timer of all the Attachment Router (s) causing instability tree hop timer of all the Attachment Router (s) causing instability
elapse. Such Attachment Router is changes state to Current or Held- elapse. Such Attachment Router is changes state to Current or Held-
Down. Down.
Instability is transient (in the order of tree hop timers). When a Instability is transient (in the order of tree hop timers). When a
Mobile Router is unstable, it MUST NOT send RAs with TIO. This Mobile Router is unstable, it MUST NOT send RAs with TIO. This
avoids loops when Mobile Router A wishes to attach to Mobile Router B avoids loops when Mobile Router A wishes to attach to Mobile Router B
and Mobile Router B wishes to attach to Mobile Router A. Unless RA and Mobile Router B wishes to attach to Mobile Router A. Unless RA
cross (see Collision section), a Mobile Router receives TIO from cross (see Collision section), a Mobile Router receives TIO from
stable Attachment Routers, which do not plan to attach to itself, so stable Attachment Routers, which do not plan to attach to itself, so
the Mobile Router can safely attach to them. the Mobile Router can safely attach to them.
5.5 Legacy Routers 5.5. Legacy Routers
A legacy router sends its Router Advertisements without a TIO. A legacy router sends its Router Advertisements without a TIO.
Consequently, a legacy router can be mistaken for a fixed Access Consequently, a legacy router can be mistaken for a fixed Access
Router when it is placed within a nested NEMO structure, and defeat Router when it is placed within a nested NEMO structure, and defeat
the loop avoidance mechanism. Consequently, it is important for the the loop avoidance mechanism. Consequently, it is important for the
administrator to prevent address autoconfiguration by visiting Mobile administrator to prevent address autoconfiguration by visiting Mobile
Routers from such a legacy router. Routers from such a legacy router.
6. Directed Acyclic Graph Discovery 6. Directed Acyclic Graph Discovery
skipping to change at page 22, line 17 skipping to change at page 22, line 28
Neighbor Discovery Option Formats. Neighbor Discovery Option Formats.
8. Security Considerations 8. Security Considerations
At the current level of this draft, the TIO bears the security level At the current level of this draft, the TIO bears the security level
of the RA and the link. Nothing is added to it. A deeper threat of the RA and the link. Nothing is added to it. A deeper threat
analysis would be required to eventually propose additional security. analysis would be required to eventually propose additional security.
9. Changes 9. Changes
9.1 Changes from version 00 to 01 9.1. Changes from version 00 to 01
Added text on sub-tree mobility from the discussion with Marcelo. Added text on sub-tree mobility from the discussion with Marcelo.
Added text on nested legacy routers from the discussion with Added text on nested legacy routers from the discussion with
Marcelo. Marcelo.
9.2 Changes from version 01 to 02 9.2. Changes from version 01 to 02
Improved text on instability Improved text on instability
Changed the formula for the 4 bytes number used in collision Changed the formula for the 4 bytes number used in collision
avoidance avoidance
9.3 Changes from version 02 to 03 9.3. Changes from version 02 to 03
Added suboptions for tree group, stable time and bandwidth. Added suboptions for tree group, stable time and bandwidth.
Added administrative depth and increment by more than 1. Added administrative depth and increment by more than 1.
Added words on bidirectional check using ND. Added words on bidirectional check using ND.
Added DAG discovery. Added DAG discovery.
9.4 Changes from version 03 to 04 9.4. Changes from version 03 to 04
Added suboptions for Path Free Medium Time. Added suboptions for Path Free Medium Time.
9.5. Changes from version 04 to 05
Added a sequence counter which provides additional loop protection
based on a comment by Christipher Dearlove. For the sake of the
discussion, note that if a loop were to occur, the count to
infinity would actually cause the MR taht reaches the max depth to
detach and that would resolve the issue anyway.
10. Acknowledgments 10. Acknowledgments
The authors wish to thank Marco Molteni and Patrick Wetterwald The authors wish to thank Marco Molteni and Patrick Wetterwald
(cisco) for their participation to this design and the review of the (cisco) for their participation to this design and the review of the
document, and Massimo Villari (university of Messina), for his early document, Massimo Villari (university of Messina), for his early work
work on simulation and research on the subject. This work is also on simulation and research on the subject and Julien Abeille for his
based on prior publications, in particular HMRA [8] by Hosik Cho and advanced participation in simulation and real testing. Also the
Eun-Kyoung Paik from Seoul National University and other non IETF authors wish to thank Christopher Dearlove for his suggestion to add
publications coauthored with Thierry Ernst and Thomas Noel. Finally, a sequence counter which provides additional protection against loop
thanks to Marcelo Bagnulo Braun for his constructive review. formation. This work is also based on prior publications, in
particular HMRA [6] by Hosik Cho and Eun-Kyoung Paik from Seoul
National University and other non IETF publications coauthored with
Thierry Ernst and Thomas Noel. Finally, thanks to Marcelo Bagnulo
Braun for his constructive review.
11. References 11. References
11.1 Normative Reference 11.1. Normative Reference
[1] Narten, T., Nordmark, E., and W. Simpson, "Neighbor Discovery [1] Narten, T., Nordmark, E., and W. Simpson, "Neighbor Discovery
for IP Version 6 (IPv6)", RFC 2461, December 1998. for IP Version 6 (IPv6)", RFC 2461, December 1998.
[2] Thomson, S. and T. Narten, "IPv6 Stateless Address [2] Johnson, D., Perkins, C., and J. Arkko, "Mobility Support in
Autoconfiguration", RFC 2462, December 1998.
[3] Johnson, D., Perkins, C., and J. Arkko, "Mobility Support in
IPv6", RFC 3775, June 2004. IPv6", RFC 3775, June 2004.
[4] Devarapalli, V., Wakikawa, R., Petrescu, A., and P. Thubert, [3] Devarapalli, V., Wakikawa, R., Petrescu, A., and P. Thubert,
"Network Mobility (NEMO) Basic Support Protocol", RFC 3963, "Network Mobility (NEMO) Basic Support Protocol", RFC 3963,
January 2005. January 2005.
[5] Ernst, T., "Network Mobility Support Goals and Requirements", [4] Ernst, T. and H. Lach, "Network Mobility Support Terminology",
draft-ietf-nemo-requirements-06 (work in progress),
November 2006.
[6] Ernst, T. and H. Lach, "Network Mobility Support Terminology",
draft-ietf-nemo-terminology-06 (work in progress), draft-ietf-nemo-terminology-06 (work in progress),
November 2006. November 2006.
[7] Draves, R. and D. Thaler, "Default Router Preferences and More- [5] Draves, R. and D. Thaler, "Default Router Preferences and More-
Specific Routes", RFC 4191, November 2005. Specific Routes", RFC 4191, November 2005.
11.2 Informative Reference 11.2. Informative Reference
[8] Cho, H., "Hierarchical Mobile Router Advertisement for nested [6] Cho, H., "Hierarchical Mobile Router Advertisement for nested
mobile networks", draft-cho-nemo-hmra-00 (work in progress), mobile networks", draft-cho-nemo-hmra-00 (work in progress),
January 2004. January 2004.
[9] Ng, C., "Analysis of Multihoming in Network Mobility Support", [7] Ng, C., "Analysis of Multihoming in Network Mobility Support",
draft-ietf-nemo-multihoming-issues-06 (work in progress), draft-ietf-nemo-multihoming-issues-06 (work in progress),
June 2006. June 2006.
Authors' Addresses Authors' Addresses
Pascal Thubert Pascal Thubert
Cisco Systems Cisco Systems
Village d'Entreprises Green Side Village d'Entreprises Green Side
400, Avenue de Roumanille 400, Avenue de Roumanille
Batiment T3 Batiment T3
skipping to change at page 26, line 5 skipping to change at page 26, line 5
LSIIT - Univerity Louis Pasteur LSIIT - Univerity Louis Pasteur
Pole API, bureau C444 Pole API, bureau C444
Boulevard Sebastien Brant Boulevard Sebastien Brant
Illkirch 67400 Illkirch 67400
FRANCE FRANCE
Phone: (33) 3 90 24 45 87 Phone: (33) 3 90 24 45 87
Email: montavont@dpt-info.u-strasbg.fr Email: montavont@dpt-info.u-strasbg.fr
URI: http://www-r2.u-strasbg.fr/~montavont/ URI: http://www-r2.u-strasbg.fr/~montavont/
Intellectual Property Statement Full Copyright Statement
Copyright (C) The IETF Trust (2007).
This document is subject to the rights, licenses and restrictions
contained in BCP 78, and except as set forth therein, the authors
retain all their rights.
This document and the information contained herein are provided on an
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Intellectual Property
The IETF takes no position regarding the validity or scope of any The IETF takes no position regarding the validity or scope of any
Intellectual Property Rights or other rights that might be claimed to Intellectual Property Rights or other rights that might be claimed to
pertain to the implementation or use of the technology described in pertain to the implementation or use of the technology described in
this document or the extent to which any license under such rights this document or the extent to which any license under such rights
might or might not be available; nor does it represent that it has might or might not be available; nor does it represent that it has
made any independent effort to identify any such rights. Information made any independent effort to identify any such rights. Information
on the procedures with respect to rights in RFC documents can be on the procedures with respect to rights in RFC documents can be
found in BCP 78 and BCP 79. found in BCP 78 and BCP 79.
skipping to change at page 26, line 29 skipping to change at page 26, line 45
such proprietary rights by implementers or users of this such proprietary rights by implementers or users of this
specification can be obtained from the IETF on-line IPR repository at specification can be obtained from the IETF on-line IPR repository at
http://www.ietf.org/ipr. http://www.ietf.org/ipr.
The IETF invites any interested party to bring to its attention any The IETF invites any interested party to bring to its attention any
copyrights, patents or patent applications, or other proprietary copyrights, patents or patent applications, or other proprietary
rights that may cover technology that may be required to implement rights that may cover technology that may be required to implement
this standard. Please address the information to the IETF at this standard. Please address the information to the IETF at
ietf-ipr@ietf.org. ietf-ipr@ietf.org.
Disclaimer of Validity
This document and the information contained herein are provided on an
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND THE INTERNET
ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE
INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Copyright Statement
Copyright (C) The Internet Society (2006). This document is subject
to the rights, licenses and restrictions contained in BCP 78, and
except as set forth therein, the authors retain all their rights.
Acknowledgment Acknowledgment
Funding for the RFC Editor function is currently provided by the Funding for the RFC Editor function is provided by the IETF
Internet Society. Administrative Support Activity (IASA).
 End of changes. 101 change blocks. 
181 lines changed or deleted 206 lines changed or added

This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/