[Roll] [Editorial Errata Reported] RFC6719 (7773)

[RFC Errata System <[e-mail]>]

The following errata report has been submitted for RFC6719,
"The Minimum Rank with Hysteresis Objective Function".

--------------------------------------
You may review the report below and at:
https://www.rfc-editor.org/errata/eid7773

--------------------------------------
Type: Editorial
Reported by: Dominique Barthel <[e-mail]>

Section: 2.2

Original Text
-------------
If the cost of the path through the preferred parent and the worst parent is too large, a node MAY keep a smaller parent set than PARENT_SET_SIZE.

Corrected Text
--------------
"If the difference in cost of the paths through the preferred parent and the worst parent is too large, a node MAY keep a smaller parent set than PARENT_SET_SIZE."
or better yet
"A node MAY keep a parent set smaller than PARENT_SET_SIZE, so that the difference in cost of the paths through the preferred parent and the worst parent is not too large."

Notes
-----
This sentence is meant to explain that there is no benefit in keeping in the parent set neighbors that have too high a path cost compared to that of the preferred parent.
The original text omits the notion of difference in cost. It also contains a circular reference: indeed, the worst parent is the neighbor within the parent set that has the highest cost.

Instructions:
-------------
This erratum is currently posted as "Reported". (If it is spam, it 
will be removed shortly by the RFC Production Center.) Please
use "Reply All" to discuss whether it should be verified or
rejected. When a decision is reached, the verifying party  
will log in to change the status and edit the report, if necessary.

--------------------------------------
RFC6719 (draft-ietf-roll-minrank-hysteresis-of-11)
--------------------------------------
Title               : The Minimum Rank with Hysteresis Objective Function
Publication Date    : September 2012
Author(s)           : O. Gnawali, P. Levis
Category            : PROPOSED STANDARD
Source              : Routing Over Low power and Lossy networks
Area                : Routing
Stream              : IETF
Verifying Party     : IESG