draft-ietf-manet-olsrv2-13.txt   draft-ietf-manet-olsrv2-14.txt 
Mobile Ad hoc Networking (MANET) T. Clausen Mobile Ad hoc Networking (MANET) T. Clausen
Internet-Draft LIX, Ecole Polytechnique Internet-Draft LIX, Ecole Polytechnique
Intended status: Standards Track C. Dearlove Intended status: Standards Track C. Dearlove
Expires: April 16, 2012 BAE Systems ATC Expires: September 9, 2012 BAE Systems ATC
P. Jacquet P. Jacquet
Project Hipercom, INRIA Alcatel-Lucent Bell Labs
October 14, 2011 U. Herberg
Fujitsu Laboratories of America
March 8, 2012
The Optimized Link State Routing Protocol version 2 The Optimized Link State Routing Protocol version 2
draft-ietf-manet-olsrv2-13 draft-ietf-manet-olsrv2-14
Abstract Abstract
This document describes version 2 of the Optimized Link State Routing This specification describes version 2 of the Optimized Link State
(OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs). Routing (OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs).
Status of This Memo Status of This Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
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."
This Internet-Draft will expire on April 16, 2012. This Internet-Draft will expire on September 9, 2012.
Copyright Notice Copyright Notice
Copyright (c) 2011 IETF Trust and the persons identified as the Copyright (c) 2012 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
skipping to change at page 2, line 23 skipping to change at page 2, line 25
not be created outside the IETF Standards Process, except to format not be created outside the IETF Standards Process, except to format
it for publication as an RFC or to translate it into languages other it for publication as an RFC or to translate it into languages other
than English. than English.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 6 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 6
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 7 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 7
3. Applicability Statement . . . . . . . . . . . . . . . . . . . 9 3. Applicability Statement . . . . . . . . . . . . . . . . . . . 9
4. Protocol Overview and Functioning . . . . . . . . . . . . . . 10 4. Protocol Overview and Functioning . . . . . . . . . . . . . . 10
4.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 10 4.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 11
4.2. Routers and Interfaces . . . . . . . . . . . . . . . . . 13 4.2. Routers and Interfaces . . . . . . . . . . . . . . . . . 13
4.3. Information Base Overview . . . . . . . . . . . . . . . . 14 4.3. Information Base Overview . . . . . . . . . . . . . . . . 14
4.3.1. Local Information Base . . . . . . . . . . . . . . . 14 4.3.1. Local Information Base . . . . . . . . . . . . . . . 14
4.3.2. Interface Information Bases . . . . . . . . . . . . . 14 4.3.2. Interface Information Bases . . . . . . . . . . . . . 14
4.3.3. Neighbor Information Base . . . . . . . . . . . . . . 14 4.3.3. Neighbor Information Base . . . . . . . . . . . . . . 15
4.3.4. Topology Information Base . . . . . . . . . . . . . . 15 4.3.4. Topology Information Base . . . . . . . . . . . . . . 15
4.3.5. Received Message Information Base . . . . . . . . . . 16 4.3.5. Received Message Information Base . . . . . . . . . . 16
4.4. Signaling Overview . . . . . . . . . . . . . . . . . . . 16 4.4. Signaling Overview . . . . . . . . . . . . . . . . . . . 16
4.5. Link Metrics . . . . . . . . . . . . . . . . . . . . . . 17 4.5. Link Metrics . . . . . . . . . . . . . . . . . . . . . . 18
4.6. Routing Set Use . . . . . . . . . . . . . . . . . . . . . 18 4.6. Routing Set Use . . . . . . . . . . . . . . . . . . . . . 19
5. Protocol Parameters and Constants . . . . . . . . . . . . . . 19 5. Protocol Parameters and Constants . . . . . . . . . . . . . . 19
5.1. Protocol and Port Numbers . . . . . . . . . . . . . . . . 19 5.1. Protocol and Port Numbers . . . . . . . . . . . . . . . . 20
5.2. Multicast Address . . . . . . . . . . . . . . . . . . . . 19 5.2. Multicast Address . . . . . . . . . . . . . . . . . . . . 20
5.3. Interface Parameters . . . . . . . . . . . . . . . . . . 19 5.3. Interface Parameters . . . . . . . . . . . . . . . . . . 20
5.3.1. Received Message Validity Time . . . . . . . . . . . 20 5.3.1. Received Message Validity Time . . . . . . . . . . . 20
5.4. Router Parameters . . . . . . . . . . . . . . . . . . . . 20 5.4. Router Parameters . . . . . . . . . . . . . . . . . . . . 21
5.4.1. Local History Times . . . . . . . . . . . . . . . . . 20 5.4.1. Local History Times . . . . . . . . . . . . . . . . . 21
5.4.2. Link Metric Parameters . . . . . . . . . . . . . . . 20 5.4.2. Link Metric Parameters . . . . . . . . . . . . . . . 21
5.4.3. Message Intervals . . . . . . . . . . . . . . . . . . 20 5.4.3. Message Intervals . . . . . . . . . . . . . . . . . . 21
5.4.4. Advertised Information Validity Times . . . . . . . . 21 5.4.4. Advertised Information Validity Times . . . . . . . . 22
5.4.5. Processing and Forwarding Validity Times . . . . . . 22 5.4.5. Processing and Forwarding Validity Times . . . . . . 22
5.4.6. Jitter . . . . . . . . . . . . . . . . . . . . . . . 22 5.4.6. Jitter . . . . . . . . . . . . . . . . . . . . . . . 23
5.4.7. Hop Limit . . . . . . . . . . . . . . . . . . . . . . 23 5.4.7. Hop Limit . . . . . . . . . . . . . . . . . . . . . . 23
5.4.8. Willingness . . . . . . . . . . . . . . . . . . . . . 23 5.4.8. Willingness . . . . . . . . . . . . . . . . . . . . . 24
5.5. Parameter Change Constraints . . . . . . . . . . . . . . 24 5.5. Parameter Change Constraints . . . . . . . . . . . . . . 25
5.6. Constants . . . . . . . . . . . . . . . . . . . . . . . . 26 5.6. Constants . . . . . . . . . . . . . . . . . . . . . . . . 27
5.6.1. Link Metric Constants . . . . . . . . . . . . . . . . 26 5.6.1. Link Metric Constants . . . . . . . . . . . . . . . . 27
5.6.2. Willingness Constants . . . . . . . . . . . . . . . . 26 5.6.2. Willingness Constants . . . . . . . . . . . . . . . . 27
6. Link Metric Values . . . . . . . . . . . . . . . . . . . . . 27 6. Link Metric Values . . . . . . . . . . . . . . . . . . . . . 27
6.1. Link Metric Representation . . . . . . . . . . . . . . . 27 6.1. Link Metric Representation . . . . . . . . . . . . . . . 27
6.2. Link Metric Compressed Form . . . . . . . . . . . . . . . 27 6.2. Link Metric Compressed Form . . . . . . . . . . . . . . . 28
7. Local Information Base . . . . . . . . . . . . . . . . . . . 28 7. Local Information Base . . . . . . . . . . . . . . . . . . . 28
7.1. Originator Set . . . . . . . . . . . . . . . . . . . . . 28 7.1. Originator Set . . . . . . . . . . . . . . . . . . . . . 29
7.2. Local Attached Network Set . . . . . . . . . . . . . . . 29 7.2. Local Attached Network Set . . . . . . . . . . . . . . . 29
8. Interface Information Base . . . . . . . . . . . . . . . . . 30 8. Interface Information Base . . . . . . . . . . . . . . . . . 30
8.1. Link Set . . . . . . . . . . . . . . . . . . . . . . . . 30 8.1. Link Set . . . . . . . . . . . . . . . . . . . . . . . . 30
8.2. 2-Hop Set . . . . . . . . . . . . . . . . . . . . . . . . 30 8.2. 2-Hop Set . . . . . . . . . . . . . . . . . . . . . . . . 31
9. Neighbor Information Base . . . . . . . . . . . . . . . . . . 31 9. Neighbor Information Base . . . . . . . . . . . . . . . . . . 31
10. Topology Information Base . . . . . . . . . . . . . . . . . . 32 10. Topology Information Base . . . . . . . . . . . . . . . . . . 33
10.1. Advertising Remote Router Set . . . . . . . . . . . . . . 32 10.1. Advertising Remote Router Set . . . . . . . . . . . . . . 33
10.2. Router Topology Set . . . . . . . . . . . . . . . . . . . 33 10.2. Router Topology Set . . . . . . . . . . . . . . . . . . . 34
10.3. Routable Address Topology Set . . . . . . . . . . . . . . 34 10.3. Routable Address Topology Set . . . . . . . . . . . . . . 34
10.4. Attached Network Set . . . . . . . . . . . . . . . . . . 34 10.4. Attached Network Set . . . . . . . . . . . . . . . . . . 35
10.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 35 10.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 36
11. Received Message Information Base . . . . . . . . . . . . . . 36 11. Received Message Information Base . . . . . . . . . . . . . . 36
11.1. Received Set . . . . . . . . . . . . . . . . . . . . . . 36 11.1. Received Set . . . . . . . . . . . . . . . . . . . . . . 37
11.2. Processed Set . . . . . . . . . . . . . . . . . . . . . . 36 11.2. Processed Set . . . . . . . . . . . . . . . . . . . . . . 37
11.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . . . 37 11.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . . . 38
12. Information Base Properties . . . . . . . . . . . . . . . . . 37 12. Information Base Properties . . . . . . . . . . . . . . . . . 38
13. Packets and Messages . . . . . . . . . . . . . . . . . . . . 39 13. Packets and Messages . . . . . . . . . . . . . . . . . . . . 40
13.1. Messages . . . . . . . . . . . . . . . . . . . . . . . . 39 13.1. Messages . . . . . . . . . . . . . . . . . . . . . . . . 40
13.2. Packets . . . . . . . . . . . . . . . . . . . . . . . . . 39 13.2. Packets . . . . . . . . . . . . . . . . . . . . . . . . . 40
13.3. TLVs . . . . . . . . . . . . . . . . . . . . . . . . . . 40 13.3. TLVs . . . . . . . . . . . . . . . . . . . . . . . . . . 40
13.3.1. Message TLVs . . . . . . . . . . . . . . . . . . . . 40 13.3.1. Message TLVs . . . . . . . . . . . . . . . . . . . . 41
13.3.2. Address Block TLVs . . . . . . . . . . . . . . . . . 40 13.3.2. Address Block TLVs . . . . . . . . . . . . . . . . . 41
14. Message Processing and Forwarding . . . . . . . . . . . . . . 42 14. Message Processing and Forwarding . . . . . . . . . . . . . . 43
14.1. Actions when Receiving a Message . . . . . . . . . . . . 43 14.1. Actions when Receiving a Message . . . . . . . . . . . . 44
14.2. Message Considered for Processing . . . . . . . . . . . . 44 14.2. Message Considered for Processing . . . . . . . . . . . . 45
14.3. Message Considered for Forwarding . . . . . . . . . . . . 45 14.3. Message Considered for Forwarding . . . . . . . . . . . . 46
15. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . . 46 15. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . . 47
15.1. HELLO Message Generation . . . . . . . . . . . . . . . . 47 15.1. HELLO Message Generation . . . . . . . . . . . . . . . . 48
15.2. HELLO Message Transmission . . . . . . . . . . . . . . . 48 15.2. HELLO Message Transmission . . . . . . . . . . . . . . . 50
15.3. HELLO Message Processing . . . . . . . . . . . . . . . . 49 15.3. HELLO Message Processing . . . . . . . . . . . . . . . . 50
15.3.1. HELLO Message Discarding . . . . . . . . . . . . . . 49 15.3.1. HELLO Message Discarding . . . . . . . . . . . . . . 50
15.3.2. HELLO Message Usage . . . . . . . . . . . . . . . . . 50 15.3.2. HELLO Message Usage . . . . . . . . . . . . . . . . . 51
16. TC Messages . . . . . . . . . . . . . . . . . . . . . . . . . 53 16. TC Messages . . . . . . . . . . . . . . . . . . . . . . . . . 54
16.1. TC Message Generation . . . . . . . . . . . . . . . . . . 53 16.1. TC Message Generation . . . . . . . . . . . . . . . . . . 54
16.2. TC Message Transmission . . . . . . . . . . . . . . . . . 55 16.2. TC Message Transmission . . . . . . . . . . . . . . . . . 56
16.3. TC Message Processing . . . . . . . . . . . . . . . . . . 56 16.3. TC Message Processing . . . . . . . . . . . . . . . . . . 57
16.3.1. Invalid Message . . . . . . . . . . . . . . . . . . . 56 16.3.1. TC Message Discarding . . . . . . . . . . . . . . . . 57
16.3.2. TC Message Processing Definitions . . . . . . . . . . 57 16.3.2. TC Message Processing Definitions . . . . . . . . . . 59
16.3.3. Initial TC Message Processing . . . . . . . . . . . . 58 16.3.3. Initial TC Message Processing . . . . . . . . . . . . 59
16.3.4. Completing TC Message Processing . . . . . . . . . . 61 16.3.4. Completing TC Message Processing . . . . . . . . . . 63
17. Information Base Changes . . . . . . . . . . . . . . . . . . 62 17. Information Base Changes . . . . . . . . . . . . . . . . . . 64
17.1. Originator Address Changes . . . . . . . . . . . . . . . 62 17.1. Originator Address Changes . . . . . . . . . . . . . . . 64
17.2. Link State Changes . . . . . . . . . . . . . . . . . . . 63 17.2. Link State Changes . . . . . . . . . . . . . . . . . . . 64
17.3. Neighbor State Changes . . . . . . . . . . . . . . . . . 63 17.3. Neighbor State Changes . . . . . . . . . . . . . . . . . 65
17.4. Advertised Neighbor Changes . . . . . . . . . . . . . . . 64 17.4. Advertised Neighbor Changes . . . . . . . . . . . . . . . 65
17.5. Advertising Remote Router Tuple Expires . . . . . . . . . 64 17.5. Advertising Remote Router Tuple Expires . . . . . . . . . 66
17.6. Neighborhood Changes and MPR Updates . . . . . . . . . . 65 17.6. Neighborhood Changes and MPR Updates . . . . . . . . . . 66
17.7. Routing Set Updates . . . . . . . . . . . . . . . . . . . 66 17.7. Routing Set Updates . . . . . . . . . . . . . . . . . . . 68
18. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . 67 18. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . 69
18.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 68 18.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 69
18.2. Neighbor Graph . . . . . . . . . . . . . . . . . . . . . 68 18.2. Neighbor Graph . . . . . . . . . . . . . . . . . . . . . 70
18.3. MPR Properties . . . . . . . . . . . . . . . . . . . . . 69 18.3. MPR Properties . . . . . . . . . . . . . . . . . . . . . 71
18.4. Flooding MPRs . . . . . . . . . . . . . . . . . . . . . . 70 18.4. Flooding MPRs . . . . . . . . . . . . . . . . . . . . . . 72
18.5. Routing MPRs . . . . . . . . . . . . . . . . . . . . . . 72 18.5. Routing MPRs . . . . . . . . . . . . . . . . . . . . . . 74
18.6. Calculating MPRs . . . . . . . . . . . . . . . . . . . . 73 18.6. Calculating MPRs . . . . . . . . . . . . . . . . . . . . 75
19. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 73 19. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 75
19.1. Network Topology Graph . . . . . . . . . . . . . . . . . 74 19.1. Network Topology Graph . . . . . . . . . . . . . . . . . 76
19.2. Populating the Routing Set . . . . . . . . . . . . . . . 76 19.2. Populating the Routing Set . . . . . . . . . . . . . . . 78
20. Proposed Values for Parameters . . . . . . . . . . . . . . . 77 20. Proposed Values for Parameters . . . . . . . . . . . . . . . 79
20.1. Local History Time Parameters . . . . . . . . . . . . . . 77 20.1. Local History Time Parameters . . . . . . . . . . . . . . 79
20.2. Message Interval Parameters . . . . . . . . . . . . . . . 77 20.2. Message Interval Parameters . . . . . . . . . . . . . . . 79
20.3. Advertised Information Validity Time Parameters . . . . . 77 20.3. Advertised Information Validity Time Parameters . . . . . 79
20.4. Received Message Validity Time Parameters . . . . . . . . 77 20.4. Received Message Validity Time Parameters . . . . . . . . 79
20.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . 78 20.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . 80
20.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 78 20.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 80
20.7. Willingness Parameter . . . . . . . . . . . . . . . . . . 78 20.7. Willingness Parameter . . . . . . . . . . . . . . . . . . 80
21. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . 78 21. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . 80
22. Extensions . . . . . . . . . . . . . . . . . . . . . . . . . 79 22. Extensions . . . . . . . . . . . . . . . . . . . . . . . . . 81
23. Security Considerations . . . . . . . . . . . . . . . . . . . 79 23. Security Considerations . . . . . . . . . . . . . . . . . . . 81
23.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 79 23.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 81
23.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 80 23.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 82
23.3. Interaction with External Routing Domains . . . . . . . . 81 23.3. Interaction with External Routing Domains . . . . . . . . 83
24. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 82 24. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 84
24.1. Expert Review: Evaluation Guidelines . . . . . . . . . . 82 24.1. Expert Review: Evaluation Guidelines . . . . . . . . . . 84
24.2. Message Types . . . . . . . . . . . . . . . . . . . . . . 82 24.2. Message Types . . . . . . . . . . . . . . . . . . . . . . 84
24.3. Message-Type-Specific TLV Type Registries . . . . . . . . 82 24.3. Message-Type-Specific TLV Type Registries . . . . . . . . 84
24.4. Message TLV Types . . . . . . . . . . . . . . . . . . . . 83 24.4. Message TLV Types . . . . . . . . . . . . . . . . . . . . 85
24.5. Address Block TLV Types . . . . . . . . . . . . . . . . . 84 24.5. Address Block TLV Types . . . . . . . . . . . . . . . . . 86
24.6. NBR_ADDR_TYPE and MPR Values . . . . . . . . . . . . . . 87 24.6. NBR_ADDR_TYPE and MPR Values . . . . . . . . . . . . . . 89
25. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 87 25. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 89
26. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 88 26. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 90
27. References . . . . . . . . . . . . . . . . . . . . . . . . . 88 27. References . . . . . . . . . . . . . . . . . . . . . . . . . 90
27.1. Normative References . . . . . . . . . . . . . . . . . . 88 27.1. Normative References . . . . . . . . . . . . . . . . . . 90
27.2. Informative References . . . . . . . . . . . . . . . . . 89 27.2. Informative References . . . . . . . . . . . . . . . . . 91
Appendix A. Example Algorithm for Calculating MPRs . . . . . . . 89 Appendix A. Example Algorithm for Calculating MPRs . . . . . . . 91
A.1. Additional Notation . . . . . . . . . . . . . . . . . . . 89 A.1. Additional Notation . . . . . . . . . . . . . . . . . . . 91
A.2. MPR Selection Algorithm . . . . . . . . . . . . . . . . . 90 A.2. MPR Selection Algorithm . . . . . . . . . . . . . . . . . 92
Appendix B. Example Algorithm for Calculating the Routing Set . 91 Appendix B. Example Algorithm for Calculating the Routing Set . 93
B.1. Local Interfaces and Neighbors . . . . . . . . . . . . . 91 B.1. Local Interfaces and Neighbors . . . . . . . . . . . . . 93
B.2. Add Neighbor Routers . . . . . . . . . . . . . . . . . . 92 B.2. Add Neighbor Routers . . . . . . . . . . . . . . . . . . 94
B.3. Add Remote Routers . . . . . . . . . . . . . . . . . . . 92 B.3. Add Remote Routers . . . . . . . . . . . . . . . . . . . 94
B.4. Add Neighbor Addresses . . . . . . . . . . . . . . . . . 94 B.4. Add Neighbor Addresses . . . . . . . . . . . . . . . . . 96
B.5. Add Remote Routable Addresses . . . . . . . . . . . . . . 94 B.5. Add Remote Routable Addresses . . . . . . . . . . . . . . 96
B.6. Add Attached Networks . . . . . . . . . . . . . . . . . . 95 B.6. Add Attached Networks . . . . . . . . . . . . . . . . . . 97
B.7. Add 2-Hop Neighbors . . . . . . . . . . . . . . . . . . . 95 B.7. Add 2-Hop Neighbors . . . . . . . . . . . . . . . . . . . 97
Appendix C. TC Message Example . . . . . . . . . . . . . . . . . 96 Appendix C. TC Message Example . . . . . . . . . . . . . . . . . 98
Appendix D. Constraints . . . . . . . . . . . . . . . . . . . . 98 Appendix D. Constraints . . . . . . . . . . . . . . . . . . . . 100
Appendix E. Flow and Congestion Control . . . . . . . . . . . . 103 Appendix E. Flow and Congestion Control . . . . . . . . . . . . 105
1. Introduction 1. Introduction
The Optimized Link State Routing protocol version 2 (OLSRv2) is an The Optimized Link State Routing protocol version 2 (OLSRv2) is an
update to OLSR (version 1) as published in [RFC3626]. Compared to update to OLSR (version 1) as published in [RFC3626]. Compared to
[RFC3626], OLSRv2 retains the same basic mechanisms and algorithms, [RFC3626], OLSRv2 retains the same basic mechanisms and algorithms,
enhanced by the ability to use a link metric other than hop count in enhanced by the ability to use a link metric other than hop count in
the selection of shortest routes. OLSRv2 also uses a more flexible the selection of shortest routes. OLSRv2 also uses a more flexible
and efficient signaling framework, and includes some simplification and efficient signaling framework, and includes some simplification
of the messages being exchanged. of the messages being exchanged.
OLSRv2 is developed for mobile ad hoc networks (MANETs). It operates OLSRv2 is developed for mobile ad hoc networks (MANETs). It operates
as a table driven, proactive protocol, i.e., it exchanges topology as a table driven, proactive protocol, i.e., it exchanges topology
information with other routers in the network regularly. OLSRv2 is information with other routers in the network regularly. OLSRv2 is
an optimization of the classical link state routing protocol. Its an optimization of the classic link state routing protocol. Its key
key concept is that of MultiPoint Relays (MPRs). Each router selects concept is that of MultiPoint Relays (MPRs). Each router selects two
two sets of MPRs, each being a set of its neighbor routers that sets of MPRs, each being a set of its neighbor routers that "cover"
"cover" all of its symmetrically connected 2-hop neighbor routers. all of its symmetrically connected 2-hop neighbor routers. These two
These two sets are of flooding MPRs and routing MPRs, and are used to sets are of "flooding MPRs" and "routing MPRs", and are used to
achieve flooding reduction and topology reduction, respectively. achieve flooding reduction and topology reduction, respectively.
Flooding reduction is achieved by control traffic being flooded Flooding reduction is achieved by control traffic being flooded
through the network using hop by hop forwarding, but with a router through the network using hop by hop forwarding, but with a router
only needing to forward control traffic that is first received only needing to forward control traffic that is first received
directly from one of the routers that have selected it as a flooding directly from one of the routers that have selected it as a flooding
MPR (its "flooding MPR selectors"). This mechanism, denoted "MPR MPR (its "flooding MPR selectors"). This mechanism, denoted "MPR
flooding", provides an efficient mechanism for information flooding", provides an efficient mechanism for information
distribution within the MANET by reducing the number of transmissions distribution within the MANET by reducing the number of transmissions
required. required [MPR].
Topology reduction is achieved by assigning a special responsibility Topology reduction is achieved by assigning a special responsibility
to routers selected as routing MPRs when declaring link state to routers selected as routing MPRs when declaring link state
information. A sufficient requirement for OLSRv2 to provide shortest information. A sufficient requirement for OLSRv2 to provide shortest
routes to all destinations is that routers declare link state routes to all destinations is that routers declare link state
information for their routing MPR selectors, if any. Routers that information for their routing MPR selectors, if any. Routers that
are not selected as routing MPRs need not send any link state are not selected as routing MPRs need not send any link state
information. Based on this reduced link state information, routing information. Based on this reduced link state information, routing
MPRs are used as intermediate routers in multi-hop routes. MPRs are used as intermediate routers in multi-hop routes.
skipping to change at page 7, line 9 skipping to change at page 7, line 9
A router selects both routing and flooding MPRs from among its one A router selects both routing and flooding MPRs from among its one
hop neighbors connected by "symmetric", i.e., bidirectional, links. hop neighbors connected by "symmetric", i.e., bidirectional, links.
Therefore, selecting routes through routing MPRs avoids the problems Therefore, selecting routes through routing MPRs avoids the problems
associated with data packet transfer over unidirectional links (e.g., associated with data packet transfer over unidirectional links (e.g.,
the problem of not getting link layer acknowledgments at each hop, the problem of not getting link layer acknowledgments at each hop,
for link layers employing this technique). for link layers employing this technique).
OLSRv2 uses and extends the MANET NeighborHood Discovery Protocol OLSRv2 uses and extends the MANET NeighborHood Discovery Protocol
(NHDP) defined in [RFC6130] and also uses the MANET generalized (NHDP) defined in [RFC6130] and also uses the MANET generalized
packet/message format [RFC5444] and the specifications in [RFC5497] packet/message format [RFC5444], the TLVs specified in [RFC5497] and,
and, optionally, [RFC5148]. These four other protocols and optionally, message jitter as specified in [RFC5148]. These four
specifications were all originally created as part of OLSRv2, but other protocols and specifications were all originally created as
have been specified separately for wider use. part of OLSRv2, but have been specified separately for wider use.
OLSRv2 makes no assumptions about the underlying link layer. OLSRv2, OLSRv2 makes no assumptions about the underlying link layer. OLSRv2,
through its use of [RFC6130], may use link layer information and through its use of [RFC6130], may use link layer information and
notifications when available and applicable. In addition OLSRv2 uses notifications when available and applicable. In addition, OLSRv2
link metrics that may be derived from link layer or any other uses link metrics that may be derived from link layer or any other
information. OLSRv2 does not specify the physical meaning of link information. OLSRv2 does not specify the physical meaning of link
metrics, but specifies a means by which new types of link metrics may metrics, but specifies a means by which new types of link metrics may
be specified in the future, but used by OLSRv2 without modification. be specified in the future, but used by OLSRv2 without modification.
OLSRv2, as OLSR [RFC3626], inherits its concept of forwarding and OLSRv2, as OLSR [RFC3626], inherits its concept of forwarding and
relaying from HIPERLAN (a MAC layer protocol) which is standardized relaying from HIPERLAN (a MAC layer protocol) which is standardized
by ETSI [HIPERLAN], [HIPERLAN2]. by ETSI [HIPERLAN], [HIPERLAN2].
2. Terminology 2. Terminology
skipping to change at page 7, line 42 skipping to change at page 7, line 42
All terms introduced in [RFC5444], including "packet", "Packet All terms introduced in [RFC5444], including "packet", "Packet
Header", "message", "Message Header", "Message Body", "Message Type", Header", "message", "Message Header", "Message Body", "Message Type",
"message sequence number", "hop limit", "hop count", "Address Block", "message sequence number", "hop limit", "hop count", "Address Block",
"TLV Block", "TLV", "Message TLV", "Address Block TLV", "type" (of "TLV Block", "TLV", "Message TLV", "Address Block TLV", "type" (of
TLV), "type extension" (of TLV), "value" (of TLV), "address", TLV), "type extension" (of TLV), "value" (of TLV), "address",
"address prefix", and "address object" are to be interpreted as "address prefix", and "address object" are to be interpreted as
described there. described there.
All terms introduced in [RFC6130], including "interface", "MANET All terms introduced in [RFC6130], including "interface", "MANET
interface", "network address", "link", "symmetric link", "1-hop interface", "network address", "link", "symmetric link", "symmetric
neighbor", "symmetric 1-hop neighbor", "symmetric 2-hop neighbor", 1-hop neighbor", "symmetric 2-hop neighbor", "symmetric 1-hop
"constant", "interface parameter", "router parameter", "Information neighborhood" "constant", "interface parameter", "router parameter",
Base", and "HELLO message" are to be interpreted as described there. "Information Base", and "HELLO message" are to be interpreted as
described there.
Additionally, this specification uses the following terminology: Additionally, this specification uses the following terminology:
Router: Router:
A MANET router which implements this protocol. A MANET router which implements this protocol.
OLSRv2 interface: OLSRv2 interface:
A MANET interface running this protocol. A MANET interface running this protocol. A router running this
protocol MUST have at least one OLSRv2 interface.
Routable address: Routable address:
A network address which may be used as the destination of a data A network address which may be used as the destination of a data
packet. A router MUST be able to distinguish a routable address packet. A router MUST be able to distinguish a routable address
from a non-routable address by direct inspection of the network from a non-routable address by direct inspection of the network
address, based on global scope address allocations by IANA and/or address, based on global scope address allocations by IANA and/or
administrative configuration. Broadcast, multicast and anycast administrative configuration. Broadcast and multicast addresses,
addresses, and addresses which are limited in scope to less than and addresses which are limited in scope to less than the entire
the entire MANET, MUST NOT be considered as routable addresses. MANET, MUST NOT be considered as routable addresses. Anycast
addresses MAY be considered as routable addresses.
Originator address Originator address:
An address which is unique (within the MANET) to a router. A An address which is unique (within the MANET) to a router. A
router MUST select an originator address; it MAY choose one of its router MUST select an originator address; it MAY choose one of its
interface addresses as its originator address; it MAY select interface addresses as its originator address; it MAY select
either a routable or non-routable address. If it selects a either a routable or non-routable address. A broadcast, multicast
routable address then this MUST be one which the router will or anycast address MUST NOT be chosen as an originator address.
accept as destination. An originator address MUST NOT have a If the router selects a routable address then this MUST be one
prefix length, except for when included in an Address Block where which the router will accept as destination. An originator
it MAY be associated with a prefix of maximum prefix length (e.g., address MUST NOT have a prefix length, except for when included in
if the originator address is an IPv6 address, it MUST have either an Address Block where it MAY be associated with a prefix of
no prefix length, or have a prefix length of 128). maximum prefix length (e.g., if the originator address is an IPv6
address, it MUST have either no prefix length, or have a prefix
length of 128).
Message originator address Message originator address:
The originator address of the router which created a message, as The originator address of the router which created a message, as
deduced from that message by its recipient. The message deduced from that message by its recipient. For all messages used
originator address will usually be included in the message as its in this specification, including HELLO messages defined in
<msg-orig-addr> element as defined in [RFC5444]. However an [RFC6130], the recipient MUST be able to deduce an originator
exceptional case in a HELLO message is also allowed by this address. The message originator address will usually be included
specification, when a router only uses a single address. For all in the message as its <msg-orig-addr> element as defined in
messages used in this specification, including HELLO messages [RFC5444]. However, an exceptional case, which does not add a
defined in [RFC6130], the recipient MUST be able to deduce an <msg-orig-addr> element to a HELLO message, may be used by a
originator address. router that only has a single address.
Willingness: Willingness:
A numerical value between WILL_NEVER and WILL_ALWAYS (both A numerical value between WILL_NEVER and WILL_ALWAYS (both
inclusive), that represents the router's willingness to be inclusive), that represents the router's willingness to be
selected as an MPR. A router has separate willingness values to selected as an MPR. A router has separate willingness values to
be a flooding MPR and a routing MPR. be a flooding MPR and a routing MPR.
Willing symmetric 1-hop neighbor Willing symmetric 1-hop neighbor:
A symmetric 1-hop neighbor of this router that has willingness not A symmetric 1-hop neighbor that has willingness not equal to
equal to WILL_NEVER. WILL_NEVER.
Multipoint relay (MPR): Multipoint relay (MPR):
A router, X, is an MPR for a router, Y, if router Y has indicated A router, X, is an MPR for a router, Y, if router Y has indicated
its selection of router X as an MPR in a recent HELLO message. its selection of router X as an MPR in a recent HELLO message.
Router X may be a flooding MPR for Y, if it is indicated to Router X may be a flooding MPR for Y if it is indicated to
participate in the flooding process of messages received from participate in the flooding process of messages received from
router Y, or it may be a routing MPR for Y, if it is indicated to router Y, or it may be a routing MPR for Y, if it is indicated to
declare link-state information for the link from X to Y. It may declare link-state information for the link from X to Y. It may
also be both at the same time. also be both at the same time.
MPR selector: MPR selector:
A router, Y, is a flooding/routing MPR selector of router X if A router, Y, is a flooding/routing MPR selector of router X if
router Y has selected router X as a flooding/routing MPR. router Y has selected router X as a flooding/routing MPR.
MPR flooding: MPR flooding:
The optimized MANET-wide information distribution mechanism, The optimized MANET-wide information distribution mechanism,
employed by this protocol, in which a message is relayed by only a employed by this protocol, in which a message is relayed by only a
reduced subset of the routers in the network. MPR flooding is the reduced subset of the routers in the network. MPR flooding is the
mechanism by which flooding reduction is achieved. mechanism by which flooding reduction is achieved.
This document employs the same notational conventions as in [RFC5444] This specification employs the same notational conventions as in
and [RFC6130]. [RFC5444] and [RFC6130].
3. Applicability Statement 3. Applicability Statement
This protocol: This protocol:
o Is a proactive routing protocol for mobile ad hoc networks o Is a proactive routing protocol for mobile ad hoc networks
(MANETs) [RFC2501]. (MANETs) [RFC2501].
o Is designed to work in networks with a dynamic topology, and in o Is designed to work in networks with a dynamic topology, and in
which messages may be lost, such as due to collisions in wireless which messages may be lost, such as due to collisions over
networks. wireless media.
o Supports routers that each have one or more participating OLSRv2 o Supports routers that each have one or more participating OLSRv2
interfaces. The set of a router's interfaces may change over interfaces, which will consist of some or all of its MANET
time. Each OLSRv2 interface may have one or more network interfaces using [RFC6130]. The set of a router's OLSRv2
addresses (which may have prefix lengths), and these may also be interfaces, and the sets of its other MANET and non-MANET
dynamically changing. interfaces, may change over time. Each interface may have one or
more network addresses (which may have prefix lengths), and these
may also be dynamically changing.
o Enables hop-by-hop routing, i.e., each router can use its local o Enables hop-by-hop routing, i.e., each router can use its local
information provided by this protocol to route packets. information provided by this protocol to route packets.
o Enables source routing, i.e., each router can use its local
information provided by this protocol to specify the complete path
for a packet. (This will require the retention of additional
information during the Routing Set evaluation.)
o Continuously maintains routes to all destinations in the network, o Continuously maintains routes to all destinations in the network,
i.e., routes are instantly available and data traffic is subject i.e., routes are instantly available and data traffic is subject
to no delays due to route discovery. Consequently, no data to no delays due to route discovery. Consequently, no data
traffic buffering is required. traffic buffering is required.
o Supports routers that have non-OLSRv2 interfaces which may be o Supports routers that have non-OLSRv2 interfaces that may be local
local to a router or that can serve as gateways towards other to a router or that can serve as gateways towards other networks.
networks.
o Enables the use of bidirectional additive link metrics to use o Enables the use of bidirectional additive link metrics to use
shortest distance routes (i.e., routes with smallest total of link shortest distance routes (i.e., routes with smallest total of link
metrics). Incoming link metric values are to be determined by a metrics). Incoming link metric values are to be determined by a
process outside this specification. process outside this specification.
o Is optimized for large and dense networks; the larger and more o Is optimized for large and dense networks; the larger and more
dense a network, the more optimization can be achieved by using dense a network, the more optimization can be achieved by using
MPRs, compared to the classic link state algorithm. MPRs, compared to the classic link state algorithm [MPR].
o Uses [RFC5444] as described in its "Intended Usage" appendix and o Uses [RFC5444] as described in its "Intended Usage" appendix and
by [RFC5498]. by [RFC5498].
o Allows "external" and "internal" extensibility (adding new message o Allows "external" and "internal" extensibility (adding new message
types and adding information to existing messages) as enabled by types and adding information to existing messages) as enabled by
[RFC5444]. [RFC5444].
o Is designed to work in a completely distributed manner, and does o Is designed to work in a completely distributed manner, and does
not depend on any central entity. not depend on any central entity.
4. Protocol Overview and Functioning 4. Protocol Overview and Functioning
The objectives of this protocol are for each router to, The objectives of this protocol are for each router to:
independently:
o Identify all destinations in the network. o Identify all destinations in the network.
o Identify a sufficient subset of links in the network, in order o Identify a sufficient subset of links in the network, in order
that shortest paths can be calculated to all available that shortest routes can be calculated to all available
destinations. destinations.
o Provide a Routing Set, containing these shortest paths from this o Provide a Routing Set, containing these shortest routes from this
router to all destinations (routable addresses and local links). router to all destinations (routable addresses and local links).
4.1. Overview 4.1. Overview
These objectives are achieved, for each router, by: These objectives are achieved, for each router, by:
o Using [RFC6130] to identify symmetric 1-hop neighbors and o Using [RFC6130] to identify symmetric 1-hop neighbors and
symmetric 2-hop neighbors. symmetric 2-hop neighbors.
o Extending [RFC6130] to allow the addition of directional link o Reporting its participation in OLSRv2, and its willingness to be a
metrics to advertised links, and to indicate which link metric flooding MPR and to be a routing MPR, by extending the HELLO
type is being used by that router. Both incoming and outgoing messages defined in [RFC6130], by the addition of an MPR_WILLING
link metrics may be reported, the latter determined by the Message TLV. The router's "flooding willingness" indicates how
advertising router. willing it is to participate in MPR flooding. The router's
"routing willingness" indicates how willing it is to be an
intermediate router for routing. Note that a router is still able
to be a routing source or destination, even if unwilling to
perform either function.
o Selecting flooding MPRs and routing MPRs from among its symmetric o Extending the HELLO messages defined in [RFC6130] to allow the
1-hop neighbors such that, for each set of MPRs all symmetric addition of directional link metrics to advertised links with
2-hop neighbors are reachable either directly or via at least one other routers participating in OLSRv2, and to indicate which link
symmetric 1-hop neighbor, using a path of minimum total metric metric type is being used by those routers. Both incoming and
where appropriate. An analysis and examples of MPR selection outgoing link metrics may be reported, the former determined by
algorithms are given in [MPR]; a suggested algorithm, the advertising router.
appropriately adapted for each set of MPRs, is included in this
specification. Note that it is not necessary for routers to use
the same algorithm in order to interoperate in the same MANET, but
these algorithms must each have the appropriate properties.
o Signaling its flooding MPR and routing MPR selections by extending o Selecting flooding MPRs and routing MPRs from among its willing
[RFC6130] to report this information in outgoing HELLO messages, symmetric 1-hop neighbors such that, for each set of MPRs, all
by the addition of MPR Address Block TLV(s) associated with the symmetric 2-hop neighbors are reachable either directly or via at
appropriate network addresses. least one selected MPR, using a path of appropriate minimum total
metric for at least routing MPR selection. An analysis and
examples of MPR selection algorithms are given in [MPR]; a
suggested algorithm, appropriately adapted for each set of MPRs,
is included in Appendix A of this specification. Note that it is
not necessary for routers to use the same algorithm in order to
interoperate in the same MANET, but each such algorithm must have
the appropriate properties, described in Section 18.
o Signaling its flooding MPR and routing MPR selections, by
extending the HELLO messages defined in [RFC6130] to report this
information by the addition of MPR Address Block TLV(s) associated
with the appropriate network addresses.
o Extracting its flooding MPR selectors and routing MPR selectors o Extracting its flooding MPR selectors and routing MPR selectors
from received HELLO messages, using the included MPR Address Block from received HELLO messages, using the included MPR Address Block
TLV(s). TLV(s).
o Reporting its willingness to be a flooding MPR and to be a routing o Defining a TC (Topology Control) Message Type using the message
MPR in HELLO messages, by the addition of an MPR_WILLING Message format specified in [RFC5444]. TC messages are used to
TLV. The router's flooding willingness indicates how willing it
is to participate in MPR flooding and the router's routing
willingness indicates how willing it is to be an intermediate node
for routing, while still being able to be a routing source or
destination even if unwilling to perform either function.
o Using the message format specified in [RFC5444], specifically
defining a TC (Topology Control) Message Type, used to
periodically signal links between routing MPR selectors and itself periodically signal links between routing MPR selectors and itself
throughout the MANET. This signaling includes suitable throughout the MANET. This signaling includes suitable
directional neighbor metrics (the best link metric in that directional neighbor metrics (the best link metric in that
direction between those routers). direction between those routers).
o Allowing its TC messages, as well as HELLO messages, to be o Allowing its TC messages, as well as HELLO messages, to be
included in packets specified in [RFC5444], using the "manet" IP included in packets specified in [RFC5444], using the "manet" IP
protocol or UDP port as specified in [RFC5498]. protocol or UDP port as specified in [RFC5498].
o Diffusing TC messages by using a flooding reduction mechanism, o Diffusing TC messages by using a flooding reduction mechanism,
skipping to change at page 12, line 22 skipping to change at page 12, line 37
Received Message Information Base. Received Message Information Base.
o TC messages, which are used for MANET wide signaling (using MPR o TC messages, which are used for MANET wide signaling (using MPR
flooding) of selected topology (link state) information. flooding) of selected topology (link state) information.
o A requirement for each router to have an originator address to be o A requirement for each router to have an originator address to be
included in, or deducible from, HELLO messages and TC messages. included in, or deducible from, HELLO messages and TC messages.
o The specification of new Message TLVs and Address Block TLVs that o The specification of new Message TLVs and Address Block TLVs that
are used in HELLO messages and TC messages, including for are used in HELLO messages and TC messages, including for
reporting link metrics and their usage, willingness to be an MPR, reporting neighbor status, MPR selection, external gateways, link
MPR selection, and content sequence number information. Note that metrics, willingness to be an MPR, and content sequence numbers.
the generation of (incoming) link metric values is to be Note that the generation of (incoming) link metric values is to be
undertaken by a process outside this specification; this undertaken by a process outside this specification; this
specification concerns only the distribution and use of those specification concerns only the distribution and use of those
metrics. metrics.
o The generation of TC messages from the appropriate information in o The generation of TC messages from the appropriate information in
the Information Bases. the Information Bases.
o The updating of the Topology Information Base according to o The updating of the Topology Information Base according to
received TC messages. received TC messages.
skipping to change at page 12, line 49 skipping to change at page 13, line 16
o The response to other events, such as the expiration of o The response to other events, such as the expiration of
information in the Information Bases. information in the Information Bases.
This protocol inherits the stability of a link state algorithm, and This protocol inherits the stability of a link state algorithm, and
has the advantage of having routes immediately available when needed, has the advantage of having routes immediately available when needed,
due to its proactive nature. due to its proactive nature.
This protocol only interacts with IP through routing table This protocol only interacts with IP through routing table
management, and the use of the sending IP address for IP datagrams management, and the use of the sending IP address for IP datagrams
containing OLSRv2 packets. containing messages used by this specification.
4.2. Routers and Interfaces 4.2. Routers and Interfaces
In order for a router to participate in a MANET using this protocol In order for a router to participate in a MANET using this protocol
it MUST have at least one, and possibly more, OLSRv2 interfaces. it must have at least one, and possibly more, OLSRv2 interfaces.
Each OLSRv2 interface: Each OLSRv2 interface:
o Is configured with one or more network addresses, as specified in o Is a MANET interface, as specified in [RFC6130]. In particular it
[RFC6130]. These addresses MUST each be specific to this router, must be configured with one or more network addresses; these
and MUST include any address that will be used as the sending addresses must each be specific to this router, and must include
address of any IP packet sent on this OLSRv2 interface. any address that will be used as the sending address of any IP
packet sent on this OLSRv2 interface.
o Has a number of interface parameters, adding to those specified in o Has a number of interface parameters, adding to those specified in
[RFC6130]. [RFC6130].
o Has an Interface Information Base, extending that specified in o Has an Interface Information Base, extending that specified in
[RFC6130]. [RFC6130].
o Generates and processes HELLO messages according to [RFC6130], o Generates and processes HELLO messages according to [RFC6130],
extended as specified in Section 15. extended as specified in Section 15.
In addition to a set of OLSRv2 interfaces as described above, each In addition to a set of OLSRv2 interfaces as described above, each
router: router:
o May have one or more non-OLSRv2 interfaces and/or local attached o May have one or more non-OLSRv2 interfaces (which may include
networks for which this router can accept packets. All routable MANET interfaces and/or non-MANET interfaces) and/or local
addresses for which the router is to accept packets MUST be used attached networks for which this router can accept IP packets.
as an (OLSRv2 or non-OLSRv2) interface network address or as an All routable addresses for which the router is to accept IP
address of a local attached network of the router. packets must be used as an (OLSRv2 or non-OLSRv2) interface
network address, or as an address of a local attached network of
the router.
o Has a number of router parameters, adding to those specified in o Has a number of router parameters, adding to those specified in
[RFC6130]. [RFC6130].
o Has a Local Information Base, extending that specified in o Has a Local Information Base, extending that specified in
[RFC6130], including selection of an originator address and [RFC6130], including selection of an originator address and
recording any locally attached networks. recording any locally attached networks.
o Has a Neighbor Information Base, extending that specified in o Has a Neighbor Information Base, extending that specified in
[RFC6130] to record MPR selection and advertisement information. [RFC6130] to record MPR selection and advertisement information.
o Has a Topology Information Base, recording information received in o Has a Topology Information Base, recording information received in
TC messages. TC messages.
o Has a Received Message Information Base, recording information o Has a Received Message Information Base, recording information
about received messages to ensure that each TC message is only about received messages to ensure that each TC message is only
processed once, and forwarded at most once on each OLSRv2 processed once, and forwarded at most once on each OLSRv2
interface, by a router. interface, by a router.
o Generates and processes TC messages. o Generates, receives, and processes TC messages.
4.3. Information Base Overview 4.3. Information Base Overview
Each router maintains the Information Bases described in the Each router maintains the Information Bases described in the
following sections. These are used for describing the protocol in following sections. These are used for describing the protocol in
this specification. An implementation of this protocol MAY maintain this specification. An implementation of this protocol may maintain
this information in the indicated form, or in any other organization this information in the indicated form, or in any other organization
which offers access to this information. In particular, note that it which offers access to this information. In particular, note that it
is not necessary to remove Tuples from Sets at the exact time is not necessary to remove Tuples from Sets at the exact time
indicated, only to behave as if the Tuples were removed at that time. indicated, only to behave as if the Tuples were removed at that time.
4.3.1. Local Information Base 4.3.1. Local Information Base
The Local Information Base is specified in [RFC6130], and contains a The Local Information Base is specified in [RFC6130], and contains a
router's local configuration. It is extended in this specification router's local configuration. It is extended in this specification
to also record an originator address, and to include a router's: to also record an originator address, and to include a router's:
skipping to change at page 14, line 35 skipping to change at page 14, line 50
router's current originator address, to enable a router to router's current originator address, to enable a router to
recognize and discard control traffic which was originated by the recognize and discard control traffic which was originated by the
router itself. router itself.
o Local Attached Network Set, containing network addresses of o Local Attached Network Set, containing network addresses of
networks to which this router can act as a gateway, and advertises networks to which this router can act as a gateway, and advertises
in its TC messages. in its TC messages.
4.3.2. Interface Information Bases 4.3.2. Interface Information Bases
The Interface Information Bases, one for each OLSRv2 interface, are The Interface Information Base for each OLSRv2 interface is as
specified in [RFC6130], and are extended to also record, in each Link specified in [RFC6130], extended to also record, in each Link Set,
Set, link metric values (incoming and outgoing) and flooding MPR link metric values (incoming and outgoing) and flooding MPR selector
selector information. information.
4.3.3. Neighbor Information Base 4.3.3. Neighbor Information Base
The Neighbor Information Base is specified in [RFC6130], and is The Neighbor Information Base is specified in [RFC6130], and is
extended to also record, in the Neighbor Tuple for each neighbor: extended to also record, in the Neighbor Tuple for each neighbor:
o Its originator address. o Its originator address.
o Neighbor metric values, these being the minimum of the link metric o Neighbor metric values, these being the minimum of the link metric
values in the indicated direction for all symmetric 1-hop links values in the indicated direction for all symmetric 1-hop links
skipping to change at page 15, line 16 skipping to change at page 15, line 30
as a routing MPR, and whether it is a routing MPR selector of this as a routing MPR, and whether it is a routing MPR selector of this
router. (Whether it is a flooding MPR selector of this neighbor router. (Whether it is a flooding MPR selector of this neighbor
is recorded in the Interface Information Base.) is recorded in the Interface Information Base.)
o Whether it is to be advertised in TC messages sent by this router. o Whether it is to be advertised in TC messages sent by this router.
4.3.4. Topology Information Base 4.3.4. Topology Information Base
The Topology Information Base in each router contains: The Topology Information Base in each router contains:
o An Advertising Remote Router Set, recording each other router from o An Advertising Remote Router Set, recording each remote router
which TC messages have been received. This is used in order to from which TC messages have been received. This is used in order
determine if a received TC message contains fresh or outdated to determine if a received TC message contains fresh or outdated
information; a received TC message is ignored in the latter case. information; a received TC message is ignored in the latter case.
o A Router Topology Set, recording links between routers in the o A Router Topology Set, recording links between routers in the
MANET, as described by received TC messages. MANET, as described by received TC messages.
o A Routable Address Topology Set, recording routable addresses in o A Routable Address Topology Set, recording routable addresses in
the MANET (available as packet destinations) and from which other the MANET (available as IP packet destinations) and from which
router these routable addresses can be directly reached (i.e., in remote router these routable addresses can be directly reached
a single IP hop), as reported by received TC messages. (i.e., in a single IP hop from that remote router), as reported by
received TC messages.
o An Attached Network Set, recording networks to which a remote o An Attached Network Set, recording networks to which a remote
router has advertised that it may act as a gateway. These router has advertised that it may act as a gateway. These
networks may be reached in one or more IP hops. networks may be reached in one or more IP hops from that remote
router.
o A Routing Set, recording routes from this router to all available o A Routing Set, recording routes from this router to all available
destinations. The IP routing table is to be updated using this destinations. The IP routing table is to be updated using this
Routing Set. (A router MAY choose to use any or all destination Routing Set. (A router may choose to use any or all destination
network addresses in the Routing Set to update the IP routing network addresses in the Routing Set to update the IP routing
table, this selection is outside the scope of this specification.) table, this selection is outside the scope of this specification.)
The purpose of the Topology Information Base is to record information The purpose of the Topology Information Base is to record information
used, in addition to that in the Local Information Base, the used, in addition to that in the Local Information Base, the
Interface Information Bases and the Neighbor Information Base, to Interface Information Bases and the Neighbor Information Base, to
construct the Routing Set (which is also included in the Topology construct the Routing Set (which is also included in the Topology
Information Base). Information Base).
This specification describes the calculation of the Routing Set based This specification describes the calculation of the Routing Set based
skipping to change at page 16, line 8 skipping to change at page 16, line 25
graph representing the routers in the MANET, and the connectivity graph representing the routers in the MANET, and the connectivity
between them, is constructed from the Local Information Base, the between them, is constructed from the Local Information Base, the
Neighbor Information Base and the Router Topology Set. Second, this Neighbor Information Base and the Router Topology Set. Second, this
graph is "decorated" with additional destination network addresses graph is "decorated" with additional destination network addresses
using the Local Information Base, the Routable Address Topology Set using the Local Information Base, the Routable Address Topology Set
and the Attached Network Set. and the Attached Network Set.
The Topology Graph does not need to be recorded in the Topology The Topology Graph does not need to be recorded in the Topology
Information Base, it can either be constructed as required when the Information Base, it can either be constructed as required when the
Routing Set is to be changed, or need not be explicitly constructed Routing Set is to be changed, or need not be explicitly constructed
(as illustrated in Appendix B). An implementation MAY construct and (as illustrated in Appendix B). An implementation may however
retain the Topology Graph if preferred. construct and retain the Topology Graph if preferred.
4.3.5. Received Message Information Base 4.3.5. Received Message Information Base
The Received Message Information Base in each router contains: The Received Message Information Base in each router contains:
o A Received Set for each OLSRv2 interface, describing TC messages o A Received Set for each OLSRv2 interface, describing TC messages
received by this router on that OLSRv2 interface. received by this router on that OLSRv2 interface.
o A Processed Set, describing TC messages processed by this router. o A Processed Set, describing TC messages processed by this router.
o A Forwarded Set, describing TC messages forwarded by this router. o A Forwarded Set, describing TC messages forwarded by this router.
The Received Message Information Base serves the MPR flooding The Received Message Information Base serves the MPR flooding
mechanism by ensuring that received messages are forwarded at most mechanism by ensuring that received messages are forwarded at most
once by a router, and also ensures that received messages are once by a router, and also ensures that received messages are
processed exactly once by a router. The Received Messages processed exactly once by a router. The Received Message Information
Information Base MAY also record information about other message Base may also record information about other message types that use
types that use the MPR flooding mechanism. the MPR flooding mechanism.
4.4. Signaling Overview 4.4. Signaling Overview
This protocol generates and processes HELLO messages according to This protocol generates and processes HELLO messages according to
[RFC6130], extended according to Section 15 of this specification to [RFC6130]. HELLO messages transmitted on OLSRv2 interfaces are
include an originator address, link metrics, and MPR selection extended according to Section 15 of this specification to include an
information. originator address, link metrics, and MPR selection information.
This specification defines a single message type, the TC message. TC This specification defines a single message type, the TC message. TC
messages are sent by their originating router proactively, at a messages are sent by their originating router proactively, at a
regular interval. This interval may be fixed, or may be dynamic, for regular interval, on all OLSRv2 interfaces. This interval may be
example it may be backed off due to congestion or network stability. fixed, or may be dynamic, for example it may be backed off due to
TC messages may also be sent as a response to a change in the router congestion or network stability. TC messages may also be sent as a
itself, or its advertised 1-hop neighborhood, for example on first response to a change in the router itself, or its advertised
being selected as a routing MPR. symmetric 1-hop neighborhood, for example on first being selected as
a routing MPR.
Because TC messages are sent periodically, this protocol is tolerant Because TC messages are sent periodically, this protocol is tolerant
of unreliable transmissions of TC messages. Message losses may occur of unreliable transmissions of TC messages. Message losses may occur
more frequently in wireless networks due to collisions or other more frequently in wireless networks due to collisions or other
transmission problems. This protocol may use "jitter", randomized transmission problems. This protocol may use "jitter", randomized
adjustments to message transmission times, to reduce the incidence of adjustments to message transmission times, to reduce the incidence of
collisions, as specified in [RFC5148]. collisions, as specified in [RFC5148].
This protocol is tolerant of out of sequence delivery of TC messages This protocol is tolerant of out of sequence delivery of TC messages
due to in transit message reordering. Each router maintains an due to in transit message reordering. Each router maintains an
Advertised Neighbor Sequence Number (ANSN) that is incremented when Advertised Neighbor Sequence Number (ANSN) that is incremented when
its recorded neighbor information that is to be included in its TC its recorded neighbor information that is to be included in its TC
messages changes. This ANSN is included in the router's TC messages. messages changes. This ANSN is included in the router's TC messages.
The recipient of a TC message can used this included ANSN to identify The recipient of a TC message can use this included ANSN to identify
which of the information it has received is most recent, even if which of the information it has received is most recent, even if
messages have been reordered while in transit. Only the most recent messages have been reordered while in transit. Only the most recent
information received is used, older information received later is information received is used, older information received later is
discarded. discarded.
TC messages may be "complete" or "incomplete". A complete TC message TC messages may be "complete" or "incomplete". A complete TC message
advertises all of the originating router's routing MPR selectors, it advertises all of the originating router's routing MPR selectors, it
may also advertise other symmetric 1-hop neighbors. Complete TC may also advertise other symmetric 1-hop neighbors. Complete TC
messages are generated periodically (and also, optionally, in messages are generated periodically (and also, optionally, in
response to neighborhood changes). Incomplete TC messages may be response to symmetric 1-hop neighborhood changes). Incomplete TC
used to report additions to advertised information, without repeating messages may be used to report additions to advertised information,
unchanged information. without repeating unchanged information.
TC messages, and HELLO messages as extended by this specification, TC messages, and HELLO messages as extended by this specification,
include an originator address for the router that created the define (by inclusion, or by deduction when having a single address)
message. A TC message reports both the originator addresses and an originator address for the router that created the message. A TC
routable addresses of its advertised neighbors, distinguishing the message reports both the originator addresses and routable addresses
two using an Address Block TLV (an address may be both routable and of its advertised neighbors, distinguishing the two using an Address
an originator address). TC messages also report the originator's Block TLV (an address may be both routable and an originator
locally attached networks. address). TC messages also report the originator's locally attached
networks.
TC messages are MPR flooded throughout the MANET. A router TC messages are MPR flooded throughout the MANET. A router
retransmits a TC message received on an OLSRv2 interface if and only retransmits a TC message received on an OLSRv2 interface if and only
if the message did not originate at this router and has not been if the message did not originate at this router and has not been
previously forwarded by this router, this is the first time the previously forwarded by this router, this is the first time the
message has been received on this OLSRv2 interface, and the message message has been received on this OLSRv2 interface, and the message
is received from (i.e., originated from or was last relayed by) one is received from (i.e., originated from or was last relayed by) one
of this router's flooding MPR selectors. of this router's flooding MPR selectors.
Some TC messages may be MPR flooded over only part of the network, Some TC messages may be MPR flooded over only part of the network,
skipping to change at page 18, line 16 skipping to change at page 18, line 35
metric (also known as a cost). Link metrics as defined in OLSRv2 are metric (also known as a cost). Link metrics as defined in OLSRv2 are
additive, and the routes that are to be created are minimum length additive, and the routes that are to be created are minimum length
routes, where the length of a route is defined as the sum of the routes, where the length of a route is defined as the sum of the
metrics of the links in that route. metrics of the links in that route.
Link metrics are defined to be directional; the link metric from one Link metrics are defined to be directional; the link metric from one
router to another may be different from that on the reverse link. router to another may be different from that on the reverse link.
The link metric is assessed at the receiver, as on a (typically) The link metric is assessed at the receiver, as on a (typically)
wireless link, that is the better informed as to link information. wireless link, that is the better informed as to link information.
Both incoming and outgoing link information is used by OLSRv2, the Both incoming and outgoing link information is used by OLSRv2, the
distinctions in the specification must be clearly followed. distinctions in this specification must be clearly followed.
This specification also defines both incoming and outgoing neighbor This specification also defines both incoming and outgoing neighbor
metrics for each symmetric 1-hop neighbor, these being the minimum metrics for each symmetric 1-hop neighbor, these being the minimum
value of the link metrics in the same direction for all symmetric value of the link metrics in the same direction for all symmetric
links with that neighbor. Note that this means that all neighbor links with that neighbor. Note that this means that all neighbor
metric values are link metric values and that specification of, for metric values are link metric values and that specification of, for
example, link metric value encoding also includes neighbor metric example, link metric value encoding also includes encoding of
values. neighbor metric values.
This specification does not define the nature of the link metric. This specification does not define the nature of the link metric.
However this specification allows, through use of the type extension However, this specification allows, through use of the type extension
of a defined Address Block TLV, for link metrics with specific of a defined Address Block TLV, for link metrics with specific
meanings to be defined and either allocated by IANA or privately meanings to be defined and either allocated by IANA or privately
used. Each HELLO or TC message carrying link (or neighbor) metrics used. Each HELLO or TC message carrying link (or neighbor) metrics
thus indicates which link metric information it is carrying, thus thus indicates which link metric information it is carrying, allowing
allowing routers to determine if they can interoperate. If link routers to determine if they can interoperate. If link metrics
metrics require additional signaling to determine their values, require additional signaling to determine their values, whether in
whether in HELLO messages or otherwise, then this is permitted but is HELLO messages or otherwise, then this is permitted but is outside
outside the scope of this specification. the scope of this specification.
Users are advised that they should carefully consider how to use link Users are advised that they should carefully consider how to use link
metrics. In particular they should not simply default to use of all metrics. In particular they should not simply default to use of all
links with equal metrics (i.e. hop count) for routing without careful links with equal metrics (i.e., hop count) for routing without
consideration of whether that is advisable or not. careful consideration of whether that is advisable or not.
4.6. Routing Set Use 4.6. Routing Set Use
The purpose of the Routing Set is to determine and record routes The purpose of the Routing Set is to determine and record routes
(local interface network address and next hop interface network (local interface network address and next hop interface network
address) to all possible routable addresses advertised by this address) to all possible routable addresses advertised by this
protocol, as well as of all destinations that are local, i.e., within protocol, as well as of all destinations that are local, i.e., within
one hop, to the router (whether using routable addresses or not). one hop, to the router (whether using routable addresses or not).
Only symmetric links are used in such routes. Only symmetric links are used in such routes.
It is intended that the Routing Set can be used for packet routing, It is intended that the Routing Set can be used for IP packet
by using its contents to update IP's routing tables. That update, routing, by using its contents to update the IP routing table. That
and whether any Routing Tuples are not used in IP's routing table, is update, and whether any Routing Tuples are not used in the IP routing
outside the scope of this specification. table, is outside the scope of this specification.
The signaling in this specification has been designed so that a The signaling in this specification has been designed so that a
"backbone" Topology Graph of routers, each identified by its "backbone" Topology Graph of routers, each identified by its
originator address, with at most one direct connection between any originator address, with at most one direct connection between any
pair of routers, can be constructed (from the Neighbor Set and the pair of routers, can be constructed (from the Neighbor Set and the
Router Topology Set) using a suitable minimum path length algorithm. Router Topology Set) using a suitable minimum path length algorithm.
This Topology Graph can, then, have other network addresses (routable This Topology Graph can then have other network addresses (routable,
or of symmetric 1-hop neighbors) added to it (using the Interface or of symmetric 1-hop neighbors) added to it (using the Interface
Information Bases, the Routable Address Topology Set and the Attached Information Bases, the Routable Address Topology Set and the Attached
Network Set). Network Set).
5. Protocol Parameters and Constants 5. Protocol Parameters and Constants
The parameters and constants used in this specification are those The parameters and constants used in this specification are those
defined in [RFC6130] plus those defined in this section. The defined in [RFC6130] plus those defined in this section. The
separation in [RFC6130] into interface parameters, router parameters separation in [RFC6130] into interface parameters, router parameters
and constants is also used in this specification. and constants is also used in this specification.
skipping to change at page 19, line 36 skipping to change at page 20, line 12
the same on different routers, even in the same MANET, or, for the same on different routers, even in the same MANET, or, for
interface parameters, on different interfaces of the same router. interface parameters, on different interfaces of the same router.
5.1. Protocol and Port Numbers 5.1. Protocol and Port Numbers
This protocol specifies TC messages, which are included in packets as This protocol specifies TC messages, which are included in packets as
defined by [RFC5444]. These packets may be sent either using the defined by [RFC5444]. These packets may be sent either using the
"manet" protocol number or the "manet" UDP well-known port number, as "manet" protocol number or the "manet" UDP well-known port number, as
specified in [RFC5498]. specified in [RFC5498].
TC messages and HELLO messages [RFC6130] SHOULD, in a given TC messages and HELLO messages [RFC6130] MUST, in a given MANET, both
deployment of this protocol, both be using the same of either of IP be using the same of either of IP or UDP, in order that it is
or UDP, in order that it is possible to combine messages of both possible to combine messages of both protocols into the same
protocols into the same [RFC5444] packet for transmission. [RFC5444] packet for transmission.
5.2. Multicast Address 5.2. Multicast Address
This protocol specifies TC messages, which are included in packets as This protocol specifies TC messages, which are included in packets as
defined by [RFC5444]. These packets MAY be transmitted using the defined by [RFC5444]. These packets MAY be transmitted using the
link local multicast address "LL-MANET-Routers", as specified in link local multicast address "LL-MANET-Routers", as specified in
[RFC5498]. [RFC5498].
5.3. Interface Parameters 5.3. Interface Parameters
A single additional interface parameter is specified for OLSRv2
interfaces only.
5.3.1. Received Message Validity Time 5.3.1. Received Message Validity Time
The following parameter manages the validity time of recorded The following parameter manages the validity time of recorded
received message information: received message information:
RX_HOLD_TIME: RX_HOLD_TIME:
The period after receipt of a message by the appropriate OLSRv2 The period after receipt of a message by the appropriate OLSRv2
interface of this router for which that information is recorded, interface of this router for which that information is recorded,
in order that the message is recognized as having been previously in order that the message is recognized as having been previously
received on this OLSRv2 interface. received on this OLSRv2 interface.
skipping to change at page 21, line 5 skipping to change at page 21, line 34
which may take any value from 0 to 255, inclusive. which may take any value from 0 to 255, inclusive.
5.4.3. Message Intervals 5.4.3. Message Intervals
The following parameters regulate TC message transmissions by a The following parameters regulate TC message transmissions by a
router. TC messages are usually sent periodically, but MAY also be router. TC messages are usually sent periodically, but MAY also be
sent in response to changes in the router's Neighbor Set and/or Local sent in response to changes in the router's Neighbor Set and/or Local
Attached Network Set. In a highly dynamic network, and with a larger Attached Network Set. In a highly dynamic network, and with a larger
value of the parameter TC_INTERVAL and a smaller value of the value of the parameter TC_INTERVAL and a smaller value of the
parameter TC_MIN_INTERVAL, TC messages may be transmitted more often parameter TC_MIN_INTERVAL, TC messages may be transmitted more often
in response to changes than periodically. However because a router in response to changes than periodically. However, because a router
has no knowledge of, for example, routers remote to it (i.e., beyond has no knowledge of, for example, routers remote to it (i.e., beyond
two hops away) joining the network, TC messages MUST NOT be sent two hops away) joining the network, TC messages MUST NOT be sent
purely responsively. purely responsively.
TC_INTERVAL: TC_INTERVAL:
The maximum time between the transmission of two successive TC The maximum time between the transmission of two successive TC
messages by this router. When no TC messages are sent in response messages by this router. When no TC messages are sent in response
to local network changes (by design, or because the local network to local network changes (by design, or because the local network
is not changing) then TC messages SHOULD be sent at a regular is not changing) then TC messages MUST be sent at a regular
interval TC_INTERVAL, possibly modified by jitter as specified in interval TC_INTERVAL, possibly modified by jitter as specified in
[RFC5148]. [RFC5148].
TC_MIN_INTERVAL: TC_MIN_INTERVAL:
The minimum interval between transmission of two successive TC The minimum interval between transmission of two successive TC
messages by this router. (This minimum interval MAY be modified messages by this router. (This minimum interval MAY be modified
by jitter, as specified in [RFC5148].) by jitter, as specified in [RFC5148].)
The following constraints apply to these parameters: The following constraints apply to these parameters:
skipping to change at page 23, line 11 skipping to change at page 23, line 41
TP_MAXJITTER: TP_MAXJITTER:
Represents the value of MAXJITTER used in [RFC5148] for Represents the value of MAXJITTER used in [RFC5148] for
periodically generated TC messages sent by this router. periodically generated TC messages sent by this router.
TT_MAXJITTER: TT_MAXJITTER:
Represents the value of MAXJITTER used in [RFC5148] for externally Represents the value of MAXJITTER used in [RFC5148] for externally
triggered TC messages sent by this router. triggered TC messages sent by this router.
F_MAXJITTER: F_MAXJITTER:
Represents the default value of MAXJITTER used in [RFC5148] for Represents the default value of MAXJITTER used in [RFC5148] for
messages forwarded by this router. However before using messages forwarded by this router. However, before using
F_MAXJITTER a router MAY attempt to deduce a more appropriate F_MAXJITTER a router MAY attempt to deduce a more appropriate
value of MAXJITTER, for example based on any TLVs with Type = value of MAXJITTER, for example based on any TLVs with Type =
INTERVAL_TIME or Type = VALIDITY_TIME contained in the message to INTERVAL_TIME or Type = VALIDITY_TIME contained in the message to
be forwarded. be forwarded.
For constraints on these parameters see [RFC5148]. For constraints on these parameters see [RFC5148].
5.4.7. Hop Limit 5.4.7. Hop Limit
The parameter TC_HOP_LIMIT is the hop limit set in each TC message. The parameter TC_HOP_LIMIT is the hop limit set in each TC message.
TC_HOP_LIMIT MAY be a single fixed value, or MAY be different in TC TC_HOP_LIMIT MAY be a single fixed value, or MAY be different in TC
messages sent by the same router. However each other router, at any messages sent by the same router. However each other router, at any
hop count distance, SHOULD see a regular pattern of TC messages in hop count distance, MUST see a regular pattern of TC messages in
order that meaningful values of TLVs with Type = INTERVAL_TIME and order that meaningful values of TLVs with Type = INTERVAL_TIME and
Type = VALIDITY_TIME at each hop count distance can be included as Type = VALIDITY_TIME at each hop count distance can be included as
defined in [RFC5497]. Thus the pattern of TC_HOP_LIMIT SHOULD be defined in [RFC5497]. Thus the pattern of TC_HOP_LIMIT MUST be
defined to have this property. For example the repeating pattern defined to have this property. For example the repeating pattern
(255 4 4) satisfies this property (having period TC_INTERVAL at hop (255 4 4) satisfies this property (having period TC_INTERVAL at hop
counts up to 4, inclusive, and 3 x TC_INTERVAL at hop counts greater counts up to 4, inclusive, and 3 x TC_INTERVAL at hop counts greater
than 4), but the repeating pattern (255 255 4 4) does not satisfy than 4), but the repeating pattern (255 255 4 4) does not satisfy
this property because at hop counts greater than 4, message intervals this property because at hop counts greater than 4, message intervals
are alternately TC_INTERVAL and 3 x TC_INTERVAL. are alternately TC_INTERVAL and 3 x TC_INTERVAL.
The following constraints apply to this parameter: The following constraints apply to this parameter:
o The maximum value of TC_HOP_LIMIT >= the network diameter in hops, o The maximum value of TC_HOP_LIMIT >= the network diameter in hops,
skipping to change at page 24, line 20 skipping to change at page 24, line 50
router has a willingness value of WILL_NEVER (the lowest possible router has a willingness value of WILL_NEVER (the lowest possible
value) it does not perform the corresponding task. A MANET using value) it does not perform the corresponding task. A MANET using
this protocol with too many routers having either willingness value this protocol with too many routers having either willingness value
equal to WILL_NEVER will not function; it MUST be ensured, by equal to WILL_NEVER will not function; it MUST be ensured, by
administrative or other means, that this does not happen. administrative or other means, that this does not happen.
If a router has a willingness value equal to WILL_ALWAYS (the highest If a router has a willingness value equal to WILL_ALWAYS (the highest
possible value) then it will always be selected as a flooding or possible value) then it will always be selected as a flooding or
routing MPR, respectively, by all symmetric 1-hop neighbors. routing MPR, respectively, by all symmetric 1-hop neighbors.
A MANET in which all routers have WILL_FLOODING = WILL_ALWAYS, the In a MANET in which all routers have WILL_FLOODING = WILL_ALWAYS,
flooding operation will effectively disable optimizations, and flooding reduction will effectively be disabled, and flooding will
perform as blind flooding. perform as blind flooding.
A router, which has WILL_ROUTING = WILL_NEVER will not act as an In a MANET in which all routers have WILL_ROUTING = WILL_ALWAYS,
topology reduction will effectively be disabled, and all routers will
advertise all of their links in TC messages.
A router that has WILL_ROUTING = WILL_NEVER will not act as an
intermediate router in the MANET. Such a router can, act as a intermediate router in the MANET. Such a router can, act as a
source, destination or gateway to another routing domain. source, destination or gateway to another routing domain.
Different routers MAY have different values for WILL_FLOODING and/or Different routers MAY have different values for WILL_FLOODING and/or
WILL_ROUTING. A router that has both WILL_FLOODING = WILL_DEFAULT WILL_ROUTING.
and WILL_ROUTING = WILL_DEFAULT need not include an MPR_WILLING TLV
in its HELLO messages.
The following constraints apply to these parameters: The following constraints apply to these parameters:
o WILL_FLOODING >= WILL_NEVER o WILL_FLOODING >= WILL_NEVER
o WILL_FLOODING <= WILL_ALWAYS o WILL_FLOODING <= WILL_ALWAYS
o WILL_ROUTING >= WILL_NEVER o WILL_ROUTING >= WILL_NEVER
o WILL_ROUTING <= WILL_ALWAYS o WILL_ROUTING <= WILL_ALWAYS
skipping to change at page 25, line 7 skipping to change at page 25, line 40
in this section apply. in this section apply.
RX_HOLD_TIME RX_HOLD_TIME
* If RX_HOLD_TIME for an OLSRv2 interface changes, then the * If RX_HOLD_TIME for an OLSRv2 interface changes, then the
expiry time for all Received Tuples for that OLSRv2 interface expiry time for all Received Tuples for that OLSRv2 interface
MAY be changed. MAY be changed.
O_HOLD_TIME O_HOLD_TIME
* If O_HOLD_TIME for a router changes, then the expiry time for * If O_HOLD_TIME changes, then the expiry time for all Originator
all Originator Tuples MAY be changed. Tuples MAY be changed.
TC_INTERVAL TC_INTERVAL
* If the TC_INTERVAL for a router increases, then the next TC * If TC_INTERVAL increases, then the next TC message generated by
message generated by this router MUST be generated according to this router MUST be generated according to the previous,
the previous, shorter, TC_INTERVAL. Additional subsequent TC shorter, TC_INTERVAL. Additional subsequent TC messages MAY be
messages MAY be generated according to the previous, shorter, generated according to the previous, shorter, TC_INTERVAL.
TC_INTERVAL.
* If the TC_INTERVAL for a router decreases, then the following * If TC_INTERVAL decreases, then the following TC messages from
TC messages from this router MUST be generated according to the this router MUST be generated according to the current,
current, shorter, TC_INTERVAL. shorter, TC_INTERVAL.
P_HOLD_TIME P_HOLD_TIME
* If P_HOLD_TIME changes, then the expiry time for all Processed * If P_HOLD_TIME changes, then the expiry time for all Processed
Tuples MAY be changed. Tuples MAY be changed.
F_HOLD_TIME F_HOLD_TIME
* If F_HOLD_TIME changes, then the expiry time for all Forwarded * If F_HOLD_TIME changes, then the expiry time for all Forwarded
Tuples MAY be changed. Tuples MAY be changed.
skipping to change at page 26, line 9 skipping to change at page 26, line 42
TC_HOP_LIMIT TC_HOP_LIMIT
* If TC_HOP_LIMIT changes, and the router uses multiple values * If TC_HOP_LIMIT changes, and the router uses multiple values
after the change, then message intervals and validity times after the change, then message intervals and validity times
included in TC messages MUST be respected. The simplest way to included in TC messages MUST be respected. The simplest way to
do this is to start any new repeating pattern of TC_HOP_LIMIT do this is to start any new repeating pattern of TC_HOP_LIMIT
values with its largest value. values with its largest value.
LINK_METRIC_TYPE LINK_METRIC_TYPE
* If LINK_METRIC_TYPE changes then all link metric information * If LINK_METRIC_TYPE changes, then all link metric information
recorded by the router is invalid. The router MUST take the recorded by the router is invalid. The router MUST take the
following actions, and all consequent actions described in following actions, and all consequent actions described in
Section 17 and [RFC6130]. Section 17 and [RFC6130].
+ For each Link Tuple in any Link Set, either update + For each Link Tuple in any Link Set for an OLSRv2 interface,
L_in_metric (the value MAXIMUM_METRIC MAY be used) or remove either update L_in_metric (the value MAXIMUM_METRIC MAY be
the Link Tuple from the Link Set. used) or remove the Link Tuple from the Link Set.
+ For each Link Tuple that is not removed, set: + For each Link Tuple that is not removed, set:
- L_out_metric := UNKNOWN_METRIC; - L_out_metric := UNKNOWN_METRIC;
- L_SYM_time := expired; - L_SYM_time := expired;
- L_MPR_selector := false. - L_MPR_selector := false.
+ Remove all Router Topology Tuples, Routable Address Topology + Remove all Router Topology Tuples, Routable Address Topology
Tuples, Attached Network Tuples and Routing Tuples from Tuples, Attached Network Tuples and Routing Tuples from
their respective protocol sets in the Topology Information their respective Protocol Sets in the Topology Information
Base. Base.
5.6. Constants 5.6. Constants
5.6.1. Link Metric Constants 5.6.1. Link Metric Constants
The constant minimum, maximum and default metric values are defined The constant minimum and maximum link metric values are defined by:
by:
o MINIMUM_METRIC := 1 o MINIMUM_METRIC := 1
o MAXIMUM_METRIC := 16776960 o MAXIMUM_METRIC := 16776960
o DEFAULT_METRIC := 256
The symbolic value UNKNOWN_METRIC is defined in Section 6.1. The symbolic value UNKNOWN_METRIC is defined in Section 6.1.
5.6.2. Willingness Constants 5.6.2. Willingness Constants
The constant minimum, maximum and default willingness values are The constant minimum, RECOMMENDED default, and maximum, willingness
defined by: values are defined by:
o WILL_NEVER := 0 o WILL_NEVER := 0
o WILL_ALWAYS := 15
o WILL_DEFAULT := 7 o WILL_DEFAULT := 7
o WILL_ALWAYS := 15
6. Link Metric Values 6. Link Metric Values
A router records a link metric value for each direction of a link of A router records a link metric value for each direction of a link of
which it has knowledge. These link metric values are used to create which it has knowledge. These link metric values are used to create
metrics for routes by the addition of link metric values. metrics for routes by the addition of link metric values.
6.1. Link Metric Representation 6.1. Link Metric Representation
Link metrics are reported in messages using a compressed Link metrics are reported in messages using a compressed
representation that occupies 12 bits, a 4 bit field and an 8 bit representation that occupies 12 bits, a 4 bit field and an 8 bit
field. The compressed representation represents positive integer field. The compressed representation represents positive integer
values with a minimum value of 1 and a maximum value that is slightly values with a minimum value of 1 and a maximum value that is slightly
smaller than the maximum 24 bit value. Only those values that have smaller than the maximum 24 bit value. Only those values that have
exact representation in the compressed form are used. Route metrics exact representation in the compressed form are used. Route metrics
are the summation of no more then 255 link metric values, and can are the summation of no more than 255 link metric values, and can
therefore be represented using no more than 32 bits. therefore be represented using no more than 32 bits.
Link and route metrics used in the Information Bases defined in this Link and route metrics used in the Information Bases defined in this
specification refer to the uncompressed values, and arithmetic specification refer to the uncompressed values, and arithmetic
involving them does likewise, and assumes full precision in the involving them does likewise, and assumes full precision in the
result. (How an implementation records the values is not part of result. (How an implementation records the values is not part of
this specification, as long as it behaves as if recording this specification, as long as it behaves as if recording
uncompressed values. An implementation can, for example, use 32 bit uncompressed values. An implementation can, for example, use 32 bit
values for all link and route metrics.) values for all link and route metrics.)
In some cases a link metric value may be unknown. This is indicated In some cases a link metric value may be unknown. This is indicated
in this specification by the value UNKNOWN_METRIC. An implementation in this specification by the symbolic value UNKNOWN_METRIC. An
may use any representation of UNKNOWN_METRIC as it is never included implementation may use any representation of UNKNOWN_METRIC as it is
in messages or used in any computation. (Possible values are zero, never included in messages, or used in any computation. (Possible
or any value greater than the maximum representable metric value.) representations are zero, or any value greater than the maximum
representable metric value.)
6.2. Link Metric Compressed Form 6.2. Link Metric Compressed Form
The 12-bit compressed form of a link metric uses a modified form of a The 12-bit compressed form of a link metric uses a modified form of a
representation with as 8-bit mantissa (denoted b) and a 4-bit representation with an 8-bit mantissa (denoted b) and a 4-bit
exponent (denoted a). Note that if represented as the 12 bit value exponent (denoted a). Note that if represented as the 12 bit value
256a+b then the ordering of those 12 bit values is identical to the 256a+b then the ordering of those 12 bit values is identical to the
ordering of the represented values. ordering of the represented values.
The value so represented is (257+b)2^a - 256, where ^ denotes The value so represented is (257+b)2^a - 256, where ^ denotes
exponentiation. This has a minimum value (when a = 0 and b = 0) of exponentiation. This has a minimum value (when a = 0 and b = 0) of
MINIMUM_METRIC = 1 and a maximum value (when a = 15 and b = 255) of MINIMUM_METRIC = 1 and a maximum value (when a = 15 and b = 255) of
MAXIMUM_METRIC = 2^24 - 256. MAXIMUM_METRIC = 2^24 - 256.
An algorithm for computing a and b for the smallest representable An algorithm for computing a and b for the smallest representable
value not less than a link metric value v such that MINIMUM_METRIC <= value not less than a link metric value v such that MINIMUM_METRIC <=
v <= MAXIMUM_METRIC is: v <= MAXIMUM_METRIC is:
1. Find the smallest integer a such that v + 256 <= 2^(a + 9). 1. Find the smallest integer a such that v + 256 <= 2^(a + 9).
2. Set b := (v - 256(2^a - 1)) / (2^a) - 1, rounded up to the 2. Set b := (v - 256(2^a - 1)) / (2^a) - 1, rounded up to the
nearest integer. nearest integer.
To allow for more efficient messages, a default link metric
DEFAULT_METRIC is defined, which can be omitted from messages. Note
that this is not the same as the link metric value that should be
used when this specification requires a link metric, but no
information about a link, beyond that a HELLO message has been
received using that link, is available. In this case the link metric
used SHOULD be MAXIMUM_METRIC.
7. Local Information Base 7. Local Information Base
The Local Information Base, as defined for each router in [RFC6130], The Local Information Base, as defined for each router in [RFC6130],
is extended by this protocol by: is extended by this protocol by:
o Recording the router's originator address. The originator address o Recording the router's originator address. The originator address
MUST be unique to this router. It MUST NOT be used by any other MUST be unique to this router. It MUST NOT be used by any other
router as an originator address. It MAY be included in any router as an originator address. It MAY be included in any
network address in any I_local_iface_addr_list of this router, it network address in any I_local_iface_addr_list of this router, it
MUST NOT be included in any network address in any MUST NOT be included in any network address in any
I_local_iface_addr_list of any other router. It MAY be included I_local_iface_addr_list of any other router. It MAY be included
in, but MUST NOT be equal to, the AL_net_addr in any Local in, but MUST NOT be equal to, the AL_net_addr in any Local
Attached Network Tuple in this or any other router. Attached Network Tuple in this or any other router.
o The addition of an Originator Set, defined in Section 7.1, and a o The addition of an Originator Set, defined in Section 7.1, and a
Local Attached Network Set, defined in Section 7.2. Local Attached Network Set, defined in Section 7.2.
All routable addresses of the router for which it is to accept All routable addresses of the router for which it is to accept IP
packets as destination MUST be included in the Local Interface Set or packets as destination MUST be included in the Local Interface Set or
the Local Attached Network Set. the Local Attached Network Set.
7.1. Originator Set 7.1. Originator Set
A router's Originator Set records addresses that were recently used A router's Originator Set records addresses that were recently used
as originator addresses by this router. If a router's originator as originator addresses by this router. If a router's originator
address is immutable then this set is always empty and MAY be address is immutable then the Originator Set is always empty and MAY
omitted. It consists of Originator Tuples: be omitted. It consists of Originator Tuples:
(O_orig_addr, O_time) (O_orig_addr, O_time)
where: where:
O_orig_addr is a recently used originator address; note that this O_orig_addr is a recently used originator address; note that this
does not include a prefix length; does not include a prefix length;
O_time specifies the time at which this Tuple expires and MUST be O_time specifies the time at which this Tuple expires and MUST be
removed. removed.
skipping to change at page 30, line 4 skipping to change at page 30, line 29
routers. Routing to an AL_net_addr will use maximum prefix length routers. Routing to an AL_net_addr will use maximum prefix length
matching; consequently an AL_net_addr MAY include, but MUST NOT equal matching; consequently an AL_net_addr MAY include, but MUST NOT equal
or be included in, any network address which is of any interface of or be included in, any network address which is of any interface of
any router (i.e., is included in any I_local_iface_addr_list) or any router (i.e., is included in any I_local_iface_addr_list) or
equal any router's originator address. equal any router's originator address.
It is not the responsibility of this protocol to maintain routes from It is not the responsibility of this protocol to maintain routes from
this router to networks recorded in the Local Attached Network Set. this router to networks recorded in the Local Attached Network Set.
Local Attached Neighbor Tuples are removed from the Local Attached Local Attached Neighbor Tuples are removed from the Local Attached
Network Set only when the routers' local attached network Network Set only when the router's local attached network
configuration changes, i.e., they are not subject to timer-based configuration changes, i.e., they are not subject to timer-based
expiration or changes due to received messages. expiration or changes due to received messages.
8. Interface Information Base 8. Interface Information Base
An Interface Information Base, as defined in [RFC6130], is maintained An Interface Information Base, as defined in [RFC6130], is maintained
for each OLSRv2 interface. Its Link Set and 2-Hop Set are modified for each MANET interface. The Link Set and 2-Hop Set in the
by this protocol. Interface Information Base for an OLSRv2 interface are modified by
this protocol. In some cases it may be convenient to consider these
Sets as also containing these additional elements for other MANET
interfaces, taking the indicated values on creation, but never being
updated.
8.1. Link Set 8.1. Link Set
The Link Set is modified by adding these additional elements to each The Link Set is modified by adding these additional elements to each
Link Tuple: Link Tuple:
L_in_metric is the metric of the link from the OLSRv2 interface L_in_metric is the metric of the link from the OLSRv2 interface
with addresses L_neighbor_iface_addr_list to this OLSRv2 with addresses L_neighbor_iface_addr_list to this OLSRv2
interface; interface;
L_out_metric is the metric of the link to the OLSRv2 interface L_out_metric is the metric of the link to the OLSRv2 interface
with addresses L_neighbor_iface_addr_list from this OLSRv2 with addresses L_neighbor_iface_addr_list from this OLSRv2
interface; interface;
L_mpr_selector is a boolean flag, describing if this neighbor has L_mpr_selector is a boolean flag, describing if this neighbor has
selected this router as a flooding MPR, i.e., is a flooding MPR selected this router as a flooding MPR, i.e., is a flooding MPR
selector of this router. selector of this router.
L_in_metric will be specified by a process that is external to this L_in_metric will be specified by a process that is external to this
specification. Any Link Tuple with L_status = HEARD or L_status = specification. Any Link Tuple with L_status = HEARD or L_status =
skipping to change at page 30, line 33 skipping to change at page 31, line 14
L_out_metric is the metric of the link to the OLSRv2 interface L_out_metric is the metric of the link to the OLSRv2 interface
with addresses L_neighbor_iface_addr_list from this OLSRv2 with addresses L_neighbor_iface_addr_list from this OLSRv2
interface; interface;
L_mpr_selector is a boolean flag, describing if this neighbor has L_mpr_selector is a boolean flag, describing if this neighbor has
selected this router as a flooding MPR, i.e., is a flooding MPR selected this router as a flooding MPR, i.e., is a flooding MPR
selector of this router. selector of this router.
L_in_metric will be specified by a process that is external to this L_in_metric will be specified by a process that is external to this
specification. Any Link Tuple with L_status = HEARD or L_status = specification. Any Link Tuple with L_status = HEARD or L_status =
SYMMETRIC MUST have a specified value of L_in_metric. SYMMETRIC MUST have a specified value of L_in_metric if it is to be
used by this protocol.
A Link Tuple created (but not updated) by [RFC6130] MUST set: A Link Tuple created (but not updated) by [RFC6130] MUST set:
o L_in_metric := UNKNOWN_METRIC; o L_in_metric := UNKNOWN_METRIC;
o L_out_metric := UNKNOWN_METRIC; o L_out_metric := UNKNOWN_METRIC;
o L_mpr_selector := false. o L_mpr_selector := false.
8.2. 2-Hop Set 8.2. 2-Hop Set
skipping to change at page 31, line 16 skipping to change at page 31, line 46
N2_neighbor_iface_addr_list. N2_neighbor_iface_addr_list.
A 2-Hop Tuple created (but not updated) by [RFC6130] MUST set: A 2-Hop Tuple created (but not updated) by [RFC6130] MUST set:
o N2_in_metric := UNKNOWN_METRIC; o N2_in_metric := UNKNOWN_METRIC;
o N2_out_metric := UNKNOWN_METRIC. o N2_out_metric := UNKNOWN_METRIC.
9. Neighbor Information Base 9. Neighbor Information Base
An Neighbor Information Base, as defined in [RFC6130], is maintained A Neighbor Information Base, as defined in [RFC6130], is maintained
for each router. It is modified by this protocol by adding these for each router. It is modified by this protocol by adding these
additional elements to each Neighbor Tuple in the Neighbor Set: additional elements to each Neighbor Tuple in the Neighbor Set. In
some cases it may be convenient to consider these Sets as also
containing these additional elements for other MANET interfaces,
taking the indicated values on creation, but never being updated.
N_orig_addr is the neighbor's originator address, which may be N_orig_addr is the neighbor's originator address, which may be
unknown. Note that this originator address does not include a unknown. Note that this originator address does not include a
prefix length; prefix length;
N_in_metric is the neighbor metric of any link from this neighbor N_in_metric is the neighbor metric of any link from this neighbor
to this router, i.e., the minimum of all corresponding L_in_metric to an OLSRv2 interface of this router, i.e., the minimum of all
with L_status = SYMMETRIC, UNKNOWN_METRIC if there are no such corresponding L_in_metric with L_status = SYMMETRIC and
L_in_metric != UNKNOWN_METRIC, UNKNOWN_METRIC if there are no such
Link Tuples; Link Tuples;
N_out_metric is the neighbor metric of any link from this router N_out_metric is the neighbor metric of any link from an OLSRv2
to this neighbor, i.e., the minimum of all corresponding interface of this router to this neighbor, i.e., the minimum of
L_out_metric with L_status = SYMMETRIC, UNKNOWN_METRIC if there all corresponding L_out_metric with L_status = SYMMETRIC and
are no such Link Tuples; L_out_metric != UNKNOWN_METRIC, UNKNOWN_METRIC if there are no
such Link Tuples;
N_will_flooding is the neighbor's willingness to be selected as a N_will_flooding is the neighbor's willingness to be selected as a
flooding MPR, in the range from WILL_NEVER to WILL_ALWAYS, both flooding MPR, in the range from WILL_NEVER to WILL_ALWAYS, both
inclusive; inclusive, taking the value WILL_NEVER if no OLSRv2 specific
information is received from this neighbor;
N_will_routing is the neighbor's willingness to be selected as a N_will_routing is the neighbor's willingness to be selected as a
routing MPR, in the range from WILL_NEVER to WILL_ALWAYS, both routing MPR, in the range from WILL_NEVER to WILL_ALWAYS, both
inclusive; inclusive, taking the value WILL_NEVER if no OLSRv2 specific
information is received from this neighbor;
N_flooding_mpr is a boolean flag, describing if this neighbor is N_flooding_mpr is a boolean flag, describing if this neighbor is
selected as a flooding MPR by this router; selected as a flooding MPR by this router;
N_routing_mpr is a boolean flag, describing if this neighbor is N_routing_mpr is a boolean flag, describing if this neighbor is
selected as a routing MPR by this router; selected as a routing MPR by this router;
N_mpr_selector is a boolean flag, describing if this neighbor has N_mpr_selector is a boolean flag, describing if this neighbor has
selected this router as a routing MPR, i.e., is a routing MPR selected this router as a routing MPR, i.e., is a routing MPR
selector of this router. selector of this router.
skipping to change at page 35, line 42 skipping to change at page 36, line 30
where: where:
R_dest_addr is the network address of the destination, either the R_dest_addr is the network address of the destination, either the
network address of an interface of a destination router, or the network address of an interface of a destination router, or the
network address of an attached network; network address of an attached network;
R_next_iface_addr is the network address of the "next hop" on the R_next_iface_addr is the network address of the "next hop" on the
selected path to the destination; selected path to the destination;
R_local_iface_addr is the network address of the local OLSRv2 R_local_iface_addr is the network address of the local OLSRv2
interface over which a packet MUST be sent to reach the interface over which an IP packet MUST be sent to reach the
destination by the selected path. destination by the selected path.
R_dist is the number of hops on the selected path to the R_dist is the number of hops on the selected path to the
destination; destination;
R_metric is the metric of the route to the destination with R_metric is the metric of the route to the destination with
address R_dest_addr. address R_dest_addr.
The Routing Set for a router is derived from the contents of other The Routing Set for a router is derived from the contents of other
protocol sets of the router (the Link Sets, the Neighbor Set, the Protocol Sets of the router (the Link Sets, the Neighbor Set, the
Router Topology Set, the Routable Address Topology Set, the Attached Router Topology Set, the Routable Address Topology Set, the Attached
Network Set, and OPTIONALLY the 2-Hop Sets). The Routing Set is Network Set, and OPTIONAL use of the 2-Hop Sets). The Routing Set is
updated (Routing Tuples added or removed, or the complete Routing Set updated (Routing Tuples added or removed, or the complete Routing Set
recalculated) when routing paths are calculated, based on changes to recalculated) when routing paths are calculated, based on changes to
these other protocol sets. Routing Tuples are not subject to timer- these other Protocol Sets. Routing Tuples are not subject to timer-
based expiration. based expiration.
11. Received Message Information Base 11. Received Message Information Base
The Received Message Information Base, defined by this specification, The Received Message Information Base, defined by this specification,
records information required to ensure that a message is processed at records information required to ensure that a message is processed at
most once and is forwarded at most once per OLSRv2 interface of a most once and is forwarded at most once per OLSRv2 interface of a
router, using MPR flooding. router, using MPR flooding. Messages are recorded using their
"signature", consisting of their type, originator address, and
message sequence number.
11.1. Received Set 11.1. Received Set
A router has a Received Set per OLSRv2 interface. Each Received Set A router has a Received Set per OLSRv2 interface. Each Received Set
records the signatures of messages which have been received over that records the signatures of messages which have been received over that
OLSRv2 interface. Each consists of Received Tuples: OLSRv2 interface. Each consists of Received Tuples:
(RX_type, RX_orig_addr, RX_seq_number, RX_time) (RX_type, RX_orig_addr, RX_seq_number, RX_time)
where: where:
skipping to change at page 37, line 45 skipping to change at page 38, line 37
As part of this specification, in a number of cases there is a As part of this specification, in a number of cases there is a
natural correspondence from a Protocol Tuple in one Protocol Set to a natural correspondence from a Protocol Tuple in one Protocol Set to a
single Protocol Tuple in another Protocol Set, in the same or another single Protocol Tuple in another Protocol Set, in the same or another
Information Base. The latter Protocol Tuple is referred to as Information Base. The latter Protocol Tuple is referred to as
"corresponding" to the former Protocol Tuple. "corresponding" to the former Protocol Tuple.
Specific examples of corresponding Protocol Tuples include: Specific examples of corresponding Protocol Tuples include:
o There is a Local Interface Tuple corresponding to each Link Tuple, o There is a Local Interface Tuple corresponding to each Link Tuple,
where the Link Tuple is in the Link Set for an OLSRv2 interface, where the Link Tuple is in the Link Set for a MANET interface, and
and the Local Interface Tuple represents that OLSRv2 interface. the Local Interface Tuple represents that MANET interface.
o There is a Neighbor Tuple corresponding to each Link Tuple which o There is a Neighbor Tuple corresponding to each Link Tuple which
has L_HEARD_time not expired, such that N_neighbor_addr_list has L_HEARD_time not expired, such that N_neighbor_addr_list
contains L_neighbor_iface_addr_list. contains L_neighbor_iface_addr_list.
o There is a Link Tuple (in the Link Set in the same Interface o There is a Link Tuple (in the Link Set in the same Interface
Information Base) corresponding to each 2-Hop Tuple such that Information Base) corresponding to each 2-Hop Tuple such that
L_neighbor_iface_addr_list = N2_neighbor_iface_addr_list. L_neighbor_iface_addr_list = N2_neighbor_iface_addr_list.
o There is a Neighbor Tuple corresponding to each 2-Hop Tuple, such o There is a Neighbor Tuple corresponding to each 2-Hop Tuple, such
that N_neighbor_addr_list contains N2_neighbor_iface_addr_list. that N_neighbor_addr_list contains N2_neighbor_iface_addr_list.
(This is the Neighbor Tuple corresponding to the Link Tuple that (This is the Neighbor Tuple corresponding to the Link Tuple
corresponds to the 2-Hop Tuple.) corresponding to the 2-Hop Tuple.)
o There is an Advertising Remote Router Tuple corresponding to each o There is an Advertising Remote Router Tuple corresponding to each
Router Topology Tuple such that AR_orig_addr = TR_from_orig_addr. Router Topology Tuple such that AR_orig_addr = TR_from_orig_addr.
o There is an Advertising Remote Router Tuple corresponding to each o There is an Advertising Remote Router Tuple corresponding to each
Routable Address Topology Tuple such that AR_orig_addr = Routable Address Topology Tuple such that AR_orig_addr =
TA_from_orig_addr. TA_from_orig_addr.
o There is an Advertising Remote Router Tuple corresponding to each o There is an Advertising Remote Router Tuple corresponding to each
Attached Network Tuple such that AR_orig_addr = AN_orig_addr. Attached Network Tuple such that AR_orig_addr = AN_orig_addr.
o There is an Neighbor Tuple corresponding to each Routing Tuple o There is a Neighbor Tuple corresponding to each Routing Tuple such
such that N_neighbor_addr_list contains R_next_iface_addr. that N_neighbor_addr_list contains R_next_iface_addr.
Addresses or network addresses with the following properties are Addresses or network addresses with the following properties are
considered as "fully owned" by a router when processing a received considered as "fully owned" by a router when processing a received
message: message:
o Equaling its originator address, OR; o Equaling its originator address, OR;
o Equaling the O_orig_addr in an Originator Tuple, OR; o Equaling the O_orig_addr in an Originator Tuple, OR;
o Equaling or being a sub-range of the I_local_iface_addr_list in a o Equaling or being a sub-range of the I_local_iface_addr_list in a
skipping to change at page 40, line 10 skipping to change at page 40, line 50
received in a single packet SHOULD be the same. The value of received in a single packet SHOULD be the same. The value of
MAXJITTER used in jittering a forwarded message MAY be based on MAXJITTER used in jittering a forwarded message MAY be based on
information in that message (in particular any Message TLVs with Type information in that message (in particular any Message TLVs with Type
= INTERVAL_TIME or Type = VALIDITY_TIME) or otherwise SHOULD be with = INTERVAL_TIME or Type = VALIDITY_TIME) or otherwise SHOULD be with
a maximum delay of F_MAXJITTER. A router MAY modify the jitter a maximum delay of F_MAXJITTER. A router MAY modify the jitter
applied to a message in order to more efficiently combine messages in applied to a message in order to more efficiently combine messages in
packets, as long as the maximum jitter is not exceeded. packets, as long as the maximum jitter is not exceeded.
13.3. TLVs 13.3. TLVs
This specification defines 2 Message TLVs and 4 Address Block TLVs. This specification defines two Message TLVs and four Address Block
TLVs.
All references in this specification to TLVs that do not indicate a All references in this specification to TLVs that do not indicate a
type extension, assume Type Extension = 0. TLVs in processed type extension, assume Type Extension = 0. TLVs in processed
messages with a type extension which is neither zero as so assumed, messages with a type extension which is neither zero as so assumed,
nor a specifically indicated non-zero type extension, are ignored. nor a specifically indicated non-zero type extension, are ignored.
13.3.1. Message TLVs 13.3.1. Message TLVs
The MPR_WILLING TLV is used in HELLO messages. A message MUST NOT The MPR_WILLING TLV is used in HELLO messages. A message MUST NOT
contain more than one MPR_WILLING TLV. contain more than one MPR_WILLING TLV.
skipping to change at page 40, line 32 skipping to change at page 41, line 25
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| MPR_WILLING | 1 octet | Bits 0-3 encode the parameter | | MPR_WILLING | 1 octet | Bits 0-3 encode the parameter |
| | | WILL_FLOODING; bits 4-7 encode the | | | | WILL_FLOODING; bits 4-7 encode the |
| | | parameter WILL_ROUTING. | | | | parameter WILL_ROUTING. |
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
Table 1: MPR_WILLING TLV definition Table 1: MPR_WILLING TLV definition
The CONT_SEQ_NUM TLV is used in TC messages. message MUST NOT contain The CONT_SEQ_NUM TLV is used in TC messages. A message MUST NOT
more than one CONT_SEQ_NUM TLV. contain more than one CONT_SEQ_NUM TLV.
+--------------+--------------+-------------------------------------+ +--------------+--------------+-------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+--------------+--------------+-------------------------------------+ +--------------+--------------+-------------------------------------+
| CONT_SEQ_NUM | 2 octets | The ANSN contained in the Neighbor | | CONT_SEQ_NUM | 2 octets | The ANSN contained in the Neighbor |
| | | Information Base. | | | | Information Base. |
+--------------+--------------+-------------------------------------+ +--------------+--------------+-------------------------------------+
Table 2: CONT_SEQ_NUM TLV definition Table 2: CONT_SEQ_NUM TLV definition
13.3.2. Address Block TLVs 13.3.2. Address Block TLVs
The LINK_METRIC TLV is used in HELLO messages and TC messages. It The LINK_METRIC TLV is used in HELLO messages and TC messages. It
MAY use any type extension; only LINK_METRIC TLVs with type extension MAY use any type extension; only LINK_METRIC TLVs with type extension
equal to LINK_METRIC_TYPE will be used by this specification. At equal to LINK_METRIC_TYPE will be used by this specification. An
most one link metric value of any given kind (link or neighbor) and address MUST NOT be associated with more than one link metric value
direction may be associated with any address. for any given type extension, kind (link or neighbor) and direction
using this TLV.
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| LINK_METRIC | 2 octets | Bits 0-3 indicates kind(s) and | | LINK_METRIC | 2 octets | Bits 0-3 indicates kind(s) and |
| | | direction(s), Bits 4-7 indicate | | | | direction(s), bits 4-7 indicate |
| | | exponent (a), Bits 8-15 indicate | | | | exponent (a), bits 8-15 indicate |
| | | mantissa (b) | | | | mantissa (b) |
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
Table 3: LINK_METRIC TLV definition Table 3: LINK_METRIC TLV definition
The exponent and mantissa use the representation defined in The exponent and mantissa use the representation defined in
Section 6. Each bit of the types and directions sub-field, if set Section 6. Each bit of the types and directions sub-field, if set
('1') indicates that the link metric is of the indicated kind and ('1') indicates that the link metric is of the indicated kind and
direction. Any combination of these bits MAY be used. direction. Any combination of these bits MAY be used.
skipping to change at page 41, line 44 skipping to change at page 42, line 44
been selected as an MPR. been selected as an MPR.
+------+--------------+---------------------------------------------+ +------+--------------+---------------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+------+--------------+---------------------------------------------+ +------+--------------+---------------------------------------------+
| MPR | 1 octet | FLOODING indicates that the corresponding | | MPR | 1 octet | FLOODING indicates that the corresponding |
| | | address is of a neighbor selected as a | | | | address is of a neighbor selected as a |
| | | flooding MPR, ROUTING indicates that the | | | | flooding MPR, ROUTING indicates that the |
| | | corresponding address is of a neighbor | | | | corresponding address is of a neighbor |
| | | selected as a routing MPR, FLOOD_ROUTE | | | | selected as a routing MPR, FLOOD_ROUTE |
| | | indicates both | | | | indicates both (see Section 24.6). |
+------+--------------+---------------------------------------------+ +------+--------------+---------------------------------------------+
Table 5: MPR TLV definition Table 5: MPR TLV definition
The NBR_ADDR_TYPE TLV is used in TC messages. The NBR_ADDR_TYPE TLV is used in TC messages.
+---------------+--------------+------------------------------------+ +---------------+--------------+------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+---------------+--------------+------------------------------------+ +---------------+--------------+------------------------------------+
| NBR_ADDR_TYPE | 1 octet | ORIGINATOR indicates that the | | NBR_ADDR_TYPE | 1 octet | ORIGINATOR indicates that the |
| | | corresponding address (which MUST | | | | corresponding address (which MUST |
| | | have maximum prefix length) is an | | | | have maximum prefix length) is an |
| | | originator address, ROUTABLE | | | | originator address, ROUTABLE |
| | | indicates that the corresponding | | | | indicates that the corresponding |
| | | network address is a routable | | | | network address is a routable |
| | | address of an interface, | | | | address of an interface, |
| | | ROUTABLE_ORIG indicates that the | | | | ROUTABLE_ORIG indicates that the |
| | | corresponding address is both | | | | corresponding address is both (see |
| | | Section 24.6). |
+---------------+--------------+------------------------------------+ +---------------+--------------+------------------------------------+
Table 6: NBR_ADDR_TYPE TLV definition Table 6: NBR_ADDR_TYPE TLV definition
If an address is both an originator address and a routable address, If an address is both an originator address and a routable address,
then it may be associated with either one Address Block TLV with Type then it may be associated with either one Address Block TLV with Type
:= NBR_ADDR_TYPE and Value := ROUTABLE_ORIG, or with two Address := NBR_ADDR_TYPE and Value := ROUTABLE_ORIG, or with two Address
Block TLVs with Type:= NBR_ADDR_TYPE, one with Value := ORIGINATOR Block TLVs with Type:= NBR_ADDR_TYPE, one with Value := ORIGINATOR
and one with Value := ROUTABLE. and one with Value := ROUTABLE.
The GATEWAY TLV is used in TC messages. At most one GATEWAY TLV may The GATEWAY TLV is used in TC messages. An address MUST NOT be
be associated with any address. associated with more than one hop count value using this TLV.
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
| GATEWAY | 1 octet | Number of hops to attached network. | | GATEWAY | 1 octet | Number of hops to attached network. |
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
Table 7: GATEWAY TLV definition Table 7: GATEWAY TLV definition
All address objects included in a TC message according to this All address objects included in a TC message according to this
skipping to change at page 43, line 10 skipping to change at page 44, line 12
defines when a received message is, or is not, processed and/or defines when a received message is, or is not, processed and/or
forwarded. forwarded.
This flooding mechanism is used by this protocol and MAY be used by This flooding mechanism is used by this protocol and MAY be used by
extensions to this protocol which define, and hence own, other extensions to this protocol which define, and hence own, other
message types, to manage processing and/or forwarding of these message types, to manage processing and/or forwarding of these
messages. This specification contains elements (P_type, RX_type, messages. This specification contains elements (P_type, RX_type,
F_type) required only for such usage. F_type) required only for such usage.
This flooding mechanism is always used for TC messages (see This flooding mechanism is always used for TC messages (see
Section 16). Received HELLO messages (see Section 15 are, unless Section 16). Received HELLO messages (see Section 15) are, unless
invalid, always processed, and never forwarded by this flooding invalid, always processed, and never forwarded by this flooding
mechanism. They thus do not need to be recorded in the Received mechanism. They thus do not need to be recorded in the Received
Message Information Base. Message Information Base.
The processing selection and forwarding mechanisms are designed to The processing selection and forwarding mechanisms are designed to
only need to parse the Message Header in order to determine whether a only need to parse the Message Header in order to determine whether a
message is to be processed and/or forwarded, and not to have to parse message is to be processed and/or forwarded, and not to have to parse
the Message Body even if the message is forwarded (but not the Message Body even if the message is forwarded (but not
processed). An implementation MAY only parse the Message Body if processed). An implementation MAY only parse the Message Body if
necessary, or MAY always parse the Message Body and reject the necessary, or MAY always parse the Message Body and reject the
message if it cannot be so parsed, or any other error is identified. message if it cannot be so parsed, or any other error is identified.
An implementation MUST discard the message silently if it is unable An implementation MUST discard the message silently if it is unable
to parse the Message Header or (if attempted) the Message Body, or if to parse the Message Header or (if attempted) the Message Body, or if
a message (other than a HELLO message) does not include a message a message (other than a HELLO message) does not include a message
sequence number. sequence number.
14.1. Actions when Receiving a Message 14.1. Actions when Receiving a Message
On receiving a message of a type specified to be using this On receiving, on an OLSRv2 interface, a message of a type specified
mechanism, which includes the TC messages defined in this to be using this mechanism, which includes the TC messages defined in
specification, a router MUST perform the following: this specification, a router MUST perform the following:
1. If the router recognizes from the originator address of the 1. If the router recognizes from the originator address of the
message that the message is one which the receiving router itself message that the message is one which the receiving router itself
originated (i.e., the message originator address is the originated (i.e., the message originator address is the
originator address of this router, or is an O_orig_addr in an originator address of this router, or is an O_orig_addr in an
Originator Tuple) then the message MUST be silently discarded. Originator Tuple) then the message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. If the message is of a type which may be processed, then the 1. If the message is of a type which may be processed, then the
message is considered for processing according to message is considered for processing according to
Section 14.2. Section 14.2.
2. If the message is of a type which may be forwarded, AND: 2. If the message is of a type which may be forwarded, AND:
+ <msg-hop-limit> is present and <msg-hop-limit> > 1, AND; + <msg-hop-limit> is present and <msg-hop-limit> > 1; AND
+ <msg-hop-count> is not present or <msg-hop-count> < 255; + <msg-hop-count> is not present or <msg-hop-count> < 255;
then the message is considered for forwarding according to then the message is considered for forwarding according to
Section 14.3. Section 14.3.
14.2. Message Considered for Processing 14.2. Message Considered for Processing
If a message (the "current message") is considered for processing, If a message (the "current message") is considered for processing,
then the following tasks MUST be performed: then the following tasks MUST be performed:
1. If the sending address (i.e., the source address of the IP 1. If the sending address (i.e., the source address of the IP
datagram containing the current message) does not match (taking datagram containing the current message) does not match (taking
skipping to change at page 44, line 24 skipping to change at page 45, line 26
into account any address prefix) a network address in an into account any address prefix) a network address in an
L_neighbor_iface_addr_list of a Link Tuple, with L_status = L_neighbor_iface_addr_list of a Link Tuple, with L_status =
SYMMETRIC, in the Link Set for the OLSRv2 interface on which the SYMMETRIC, in the Link Set for the OLSRv2 interface on which the
current message was received (the "receiving interface") then current message was received (the "receiving interface") then
processing the current message is OPTIONAL. If the current processing the current message is OPTIONAL. If the current
message is not processed then the following steps are not carried message is not processed then the following steps are not carried
out. out.
2. If a Processed Tuple exists with: 2. If a Processed Tuple exists with:
* P_type = the Message Type of the current message, AND; * P_type = the Message Type of the current message; AND
* P_orig_addr = the originator address of the current message, * P_orig_addr = the originator address of the current message;
AND; AND
* P_seq_number = the message sequence number of the current * P_seq_number = the message sequence number of the current
message; message;
then the current message MUST NOT be processed. then the current message MUST NOT be processed.
3. Otherwise: 3. Otherwise:
1. Create a Processed Tuple with: 1. Create a Processed Tuple in the Processed Set with:
+ P_type := the Message Type of the current message; + P_type := the Message Type of the current message;
+ P_orig_addr := the originator address of the current + P_orig_addr := the originator address of the current
message; message;
+ P_seq_number := the sequence number of the current + P_seq_number := the sequence number of the current
message; message;
+ P_time := current time + P_HOLD_TIME. + P_time := current time + P_HOLD_TIME.
skipping to change at page 45, line 23 skipping to change at page 46, line 26
L_neighbor_iface_addr_list of a Link Tuple, with L_status = L_neighbor_iface_addr_list of a Link Tuple, with L_status =
SYMMETRIC, in the Link Set for the OLSRv2 interface on which the SYMMETRIC, in the Link Set for the OLSRv2 interface on which the
current message was received (the "receiving interface") then the current message was received (the "receiving interface") then the
current message MUST be silently discarded. current message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. If a Received Tuple exists in the Received Set for the 1. If a Received Tuple exists in the Received Set for the
receiving interface, with: receiving interface, with:
+ RX_type = the Message Type of the current message, AND; + RX_type = the Message Type of the current message; AND
+ RX_orig_addr = the originator address of the current + RX_orig_addr = the originator address of the current
message, AND; message; AND
+ RX_seq_number = the sequence number of the current + RX_seq_number = the sequence number of the current
message; message;
then the current message MUST be silently discarded. then the current message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. Create a Received Tuple in the Received Set for the 1. Create a Received Tuple in the Received Set for the
receiving interface with: receiving interface with:
skipping to change at page 45, line 50 skipping to change at page 47, line 7
- RX_orig_addr := originator address of the current - RX_orig_addr := originator address of the current
message; message;
- RX_seq_number := sequence number of the current - RX_seq_number := sequence number of the current
message; message;
- RX_time := current time + RX_HOLD_TIME. - RX_time := current time + RX_HOLD_TIME.
2. If a Forwarded Tuple exists with: 2. If a Forwarded Tuple exists with:
- F_type = the Message Type of the current message, AND; - F_type = the Message Type of the current message; AND
- F_orig_addr = the originator address of the current - F_orig_addr = the originator address of the current
message, AND; message; AND
- F_seq_number = the sequence number of the current - F_seq_number = the sequence number of the current
message. message.
then the current message MUST be silently discarded. then the current message MUST be silently discarded.
3. Otherwise if the sending address matches (taking account 3. Otherwise if the sending address matches (taking account
of any address prefix) any network address in an of any address prefix) any network address in an
L_neighbor_iface_addr_list of a Link Tuple in the Link L_neighbor_iface_addr_list of a Link Tuple in the Link
Set for the receiving OLSRv2 interface that has L_status Set for the receiving OLSRv2 interface that has L_status
= SYMMETRIC and whose corresponding Neighbor Tuple has = SYMMETRIC and whose corresponding Neighbor Tuple has
N_mpr_selector = true, then: N_mpr_selector = true, then:
1. Create a Forwarded Tuple with: 1. Create a Forwarded Tuple in the Forwarded Set with:
o F_type := the Message Type of the current message; o F_type := the Message Type of the current message;
o F_orig_addr := originator address of the current o F_orig_addr := originator address of the current
message; message;
o F_seq_number := sequence number of the current o F_seq_number := sequence number of the current
message; message;
o F_time := current time + F_HOLD_TIME. o F_time := current time + F_HOLD_TIME.
2. The Message Header of the current message is modified 2. The Message Header of the current message is modified
by: by:
o if present, decrement <msg-hop-limit> in the o Decrement <msg-hop-limit> in the Message Header by
Message Header by 1, AND; 1; AND
o if present, increment <msg-hop-count> in the o If present, increment <msg-hop-count> in the
Message Header by 1. Message Header by 1.
3. The message is transmitted over all OLSRv2 3. The message is transmitted over all OLSRv2
interfaces, as described in Section 13. interfaces, as described in Section 13.
15. HELLO Messages 15. HELLO Messages
The HELLO message Message Type is owned by [RFC6130], and thus HELLO The HELLO Message Type is owned by [RFC6130], and thus HELLO messages
messages are generated, transmitted, received and processed by are generated, transmitted, received and processed by [RFC6130].
[RFC6130]. This protocol, as permitted by [RFC6130], also uses HELLO This protocol, as permitted by [RFC6130], also uses HELLO messages,
messages, including adding to HELLO message generation, and including adding to HELLO message generation, and implementing
implementing additional processing based on received HELLO messages. additional processing based on received HELLO messages. HELLO
HELLO messages are not forwarded by [RFC6130] or by this messages are not forwarded by [RFC6130] or by this specification.
specification.
15.1. HELLO Message Generation 15.1. HELLO Message Generation
A HELLO message is generated as defined in [RFC6130], extended by the HELLO messages sent over OLSRv2 interfaces are generated as defined
following elements being added to the HELLO message by this in [RFC6130], and then modified as described in this section. HELLO
specification before the HELLO message is sent over an OLSRv2 messages sent on other MANET interfaces are not modified by this
interface: specification.
HELLO messages sent over OLSRv2 interfaces are extended by adding the
following elements:
o A message originator address, recording this router's originator o A message originator address, recording this router's originator
address. This MUST use a <msg-orig-addr> element, unless: address. This MUST use a <msg-orig-addr> element, unless:
* The message specifies only a single local interface address * The message specifies only a single local interface address
(i.e., contains only one address object that is associated with (i.e., contains only one address object that is associated with
an Address Block TLV with Type = LOCAL_IF, and which has no an Address Block TLV with Type = LOCAL_IF, and which has no
prefix length, or a maximum prefix length) which will then be prefix length, or a maximum prefix length) which will then be
interpreted as the message originator address, OR; used as the message originator address, OR;
* The message does not include any local interface network * The message does not include any local interface network
addresses (i.e., has no address objects associated with an addresses (i.e., has no address objects associated with an
Address Block TLV with Type = LOCAL_IF), as permitted by the Address Block TLV with Type = LOCAL_IF), as permitted by the
specification in [RFC6130] when the router that generated the specification in [RFC6130], when the router that generated the
HELLO message has only one interface address and will use that HELLO message has only one interface address and will use that
as the sending address of the IP datagram in which the HELLO as the sending address of the IP datagram in which the HELLO
message is contained. In this case that address will be message is contained. In this case, that address will be used
interpreted as the message originator address. as the message originator address.
o A Message TLV with Type := MPR_WILLING MUST be included, unless o A Message TLV with Type := MPR_WILLING MUST be included.
both willingness values that it reports are equal to WILL_DEFAULT
(in which case it MAY be included).
o The following cases associate Address Block TLVs with one or more o The following cases associate Address Block TLVs with one or more
addresses from a Link Tuple or a Neighbor Tuple if these are addresses from a Link Tuple or a Neighbor Tuple if these are
included in the HELLO message. In each case the TLV MUST be included in the HELLO message. In each case, the TLV MUST be
associated with at least copy of one address from the relevant associated with at least one address object for an address from
Tuple; the TLV MAY be associated with more such addresses the relevant Tuple; the TLV MAY be associated with more such
(including a copy of that address object, possibly not itself addresses (including a copy of that address object, possibly not
associated with any other indicated TLVs, in the same or a itself associated with any other indicated TLVs, in the same or a
different Address Block). These additional TLVs MUST NOT be different Address Block). These additional TLVs MUST NOT be
associated with any other addresses in a HELLO message that will associated with any other addresses in a HELLO message that will
be processed by [RFC6130]. be processed by [RFC6130].
* For each Link Tuple for which L_in_metric != UNKNOWN_METRIC, * For each Link Tuple for which L_in_metric != UNKNOWN_METRIC,
and for which one or more addresses in its and for which one or more addresses in its
L_neighbor_iface_addr_list are included as address objects with L_neighbor_iface_addr_list are included as address objects with
an associated Address Block TLV with Type = LINK_STATUS and an associated Address Block TLV with Type = LINK_STATUS and
Value = HEARD or Value = SYMMETRIC, at least one of these Value = HEARD or Value = SYMMETRIC, at least one of these
addresses MUST be associated with an Address Block TLV with addresses MUST be associated with an Address Block TLV with
Type := LINK_METRIC indicating an incoming link metric with Type := LINK_METRIC indicating an incoming link metric with
value L_in_metric, unless this equals DEFAULT_METRIC. value L_in_metric.
* For each Link Tuple for which L_out_metric != UNKNOWN_METRIC, * For each Link Tuple for which L_out_metric != UNKNOWN_METRIC,
and for which one or more addresses in its and for which one or more addresses in its
L_neighbor_iface_addr_list are included as address objects with L_neighbor_iface_addr_list are included as address objects with
an associated Address Block TLV with Type = LINK_STATUS and an associated Address Block TLV with Type = LINK_STATUS and
Value = SYMMETRIC, at least one of these addresses MUST be Value = SYMMETRIC, at least one of these addresses MUST be
associated with an Address Block TLV with Type := LINK_METRIC associated with an Address Block TLV with Type := LINK_METRIC
indicating an outgoing link metric with value L_out_metric, indicating an outgoing link metric with value L_out_metric.
unless this equals DEFAULT_METRIC.
* For each Neighbor Tuple for which N_symmetric = true, and for * For each Neighbor Tuple for which N_symmetric = true, and for
which one or more addresses in its N_neighbor_addr_list are which one or more addresses in its N_neighbor_addr_list are
included as address objects with an associated Address Block included as address objects with an associated Address Block
TLV with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = TLV with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value =
SYMMETRIC, at least one of these addresses MUST be associated SYMMETRIC, at least one of these addresses MUST be associated
with an Address Block TLV with Type := LINK_METRIC indicating with an Address Block TLV with Type := LINK_METRIC indicating
an incoming neighbor metric with value N_in_metric, unless this an incoming neighbor metric with value N_in_metric.
equals DEFAULT_METRIC.
* For each Neighbor Tuple for which N_symmetric = true, and for * For each Neighbor Tuple for which N_symmetric = true, and for
which one or more addresses in its N_neighbor_addr_list are which one or more addresses in its N_neighbor_addr_list are
included as address objects with an associated Address Block included as address objects with an associated Address Block
TLV with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = TLV with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value =
SYMMETRIC, at least one of these addresses MUST be associated SYMMETRIC, at least one of these addresses MUST be associated
with an Address Block TLV with Type := LINK_METRIC indicating with an Address Block TLV with Type := LINK_METRIC indicating
an outgoing neighbor metric with value N_out_metric, unless an outgoing neighbor metric with value N_out_metric.
this equals DEFAULT_METRIC.
* For each Neighbor Tuple with N_flooding_mpr = true, and for * For each Neighbor Tuple with N_flooding_mpr = true, and for
which one or more network addresses in its N_neighbor_addr_list which one or more network addresses in its N_neighbor_addr_list
are included as address objects in the HELLO message with an are included as address objects in the HELLO message with an
associated Address Block TLV with Type = LINK_STATUS and Value associated Address Block TLV with Type = LINK_STATUS and Value
= SYMMETRIC, at least one of these addresses MUST be associated = SYMMETRIC, at least one of these addresses MUST be associated
with an Address Block TLV with Type := MPR and Value := with an Address Block TLV with Type := MPR and Value :=
FLOODING or Value := FLOOD_ROUTE. FLOODING or Value := FLOOD_ROUTE.
* For each Neighbor Tuple with N_routing_mpr = true, and for * For each Neighbor Tuple with N_routing_mpr = true, and for
which one or more network addresses in its N_neighbor_addr_list which one or more network addresses in its N_neighbor_addr_list
are included as address objects in the HELLO message with an are included as address objects in the HELLO message with an
associated Address Block TLV with Type = LINK_STATUS and Value associated Address Block TLV with Type = LINK_STATUS and Value
= SYMMETRIC, at least one of these addresses MUST be associated = SYMMETRIC, at least one of these addresses MUST be associated
with an Address Block TLV with Type := MPR and Value := ROUTING with an Address Block TLV with Type := MPR and Value := ROUTING
or Value := FLOOD_ROUTE. or Value := FLOOD_ROUTE.
15.2. HELLO Message Transmission 15.2. HELLO Message Transmission
HELLO messages are scheduled and transmitted by [RFC6130]. This HELLO messages are scheduled and transmitted by [RFC6130]. This
protocol MAY require that an additional HELLO message is sent when protocol MAY require that an additional HELLO message is sent on each
either of the router's sets of MPRs changes, in addition to the cases OLSRv2 interface when either of the router's sets of MPRs changes, in
specified in [RFC6130], and subject to the same constraints. addition to the cases specified in [RFC6130], and subject to the
constraints specified in [RFC6130] (notably on minimum HELLO message
transmission intervals).
15.3. HELLO Message Processing 15.3. HELLO Message Processing
When received on an OLSRv2 interface, HELLO messages are made When received on an OLSRv2 interface, HELLO messages are made
available to this protocol in two ways, both as permitted by available to this protocol in two ways, both as permitted by
[RFC6130]: [RFC6130]:
o Such received HELLO messages MUST be made available to this o Such received HELLO messages MUST be made available to this
protocol on reception, which allows them to be discarded before protocol on reception, which allows them to be discarded before
being processed by [RFC6130], for example if the information added being processed by [RFC6130], for example if the information added
to the HELLO message by this specification is inconsistent. to the HELLO message by this specification is inconsistent.
o Such received HELLO messages MUST be made available to OLSRv2 o Such received HELLO messages MUST be made available to OLSRv2
after [RFC6130] has completed its processing thereof, unless after [RFC6130] has completed its processing thereof, unless
discarded as malformed by [RFC6130], for processing by this discarded as malformed by [RFC6130], for processing by this
specification. specification.
15.3.1. HELLO Message Discarding 15.3.1. HELLO Message Discarding
In addition to the reasons specified in [RFC6130] for discarding a In addition to the reasons specified in [RFC6130] for discarding a
HELLO message on reception, a HELLO message MUST be discarded before HELLO message on reception, a HELLO message received on an OLSRv2
processing by [RFC6130] or this specification if it: interface MUST be discarded before processing by [RFC6130] or this
specification if it:
o Has more than one Message TLV with Type = MPR_WILLING. o Has more than one Message TLV with Type = MPR_WILLING.
o Has a message originator address, or a network address o Has a message originator address, or a network address
corresponding to an address object associated with an Address corresponding to an address object associated with an Address
Block TLV with Type = LOCAL_IF, that is partially owned by this Block TLV with Type = LOCAL_IF, that is partially owned by this
router. (Some of these cases are already excluded by [RFC6130].) router. (Some of these cases are already excluded by [RFC6130].)
o Includes any address object associated with an Address Block TLV o Includes any address object associated with an Address Block TLV
with Type = LINK_STATUS or Type = OTHER_NEIGHB that overlaps the with Type = LINK_STATUS or Type = OTHER_NEIGHB that overlaps the
skipping to change at page 50, line 11 skipping to change at page 51, line 19
TLV with Type = LINK_STATUS and Value = SYMMETRIC (including using TLV with Type = LINK_STATUS and Value = SYMMETRIC (including using
a different copy of that address object, in the same or a a different copy of that address object, in the same or a
different Address Block). different Address Block).
15.3.2. HELLO Message Usage 15.3.2. HELLO Message Usage
HELLO messages are first processed as specified in [RFC6130]. That HELLO messages are first processed as specified in [RFC6130]. That
processing includes identifying (or creating) a Link Tuple and a processing includes identifying (or creating) a Link Tuple and a
Neighbor Tuple corresponding to the originator of the HELLO message Neighbor Tuple corresponding to the originator of the HELLO message
(the "current Link Tuple" and the "current Neighbor Tuple"). After (the "current Link Tuple" and the "current Neighbor Tuple"). After
this, the following processing MUST also be performed: this, the following processing MUST also be performed if the HELLO
message is received on an OLSRv2 interface and contains a TLV with
Type = MPR_WILLING:
1. If the HELLO message has a well-defined message originator 1. If the HELLO message has a well-defined message originator
address, i.e., has an <msg-orig-addr> element or has zero or one address, i.e., has an <msg-orig-addr> element, or has zero or one
network addresses associated with a TLV with Type = LOCAL_IF: network addresses associated with a TLV with Type = LOCAL_IF:
1. Remove any Neighbor Tuple, other than the current Neighbor 1. Remove any Neighbor Tuple, other than the current Neighbor
Tuple, with N_orig_addr = message originator address, taking Tuple, with N_orig_addr = message originator address, taking
any consequent action (including removing one or more Link any consequent action (including removing one or more Link
Tuples) as specified in [RFC6130]. Tuples) as specified in [RFC6130].
2. The current Link Tuple is then updated according to: 2. The current Link Tuple is then updated according to:
1. Update L_in_metric and L_out_metric as described in 1. Update L_in_metric and L_out_metric as described in
skipping to change at page 50, line 51 skipping to change at page 52, line 15
2. If there are any changes to the router's Information Bases, then 2. If there are any changes to the router's Information Bases, then
perform the processing defined in Section 17. perform the processing defined in Section 17.
15.3.2.1. Updating Metrics 15.3.2.1. Updating Metrics
For each address in a received HELLO message with an associated TLV For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS and Value = HEARD or Value = SYMMETRIC, an with Type = LINK_STATUS and Value = HEARD or Value = SYMMETRIC, an
incoming (to the message originator) link metric value is defined incoming (to the message originator) link metric value is defined
either using an associated TLV with Type = LINK_METRIC and Type either using an associated TLV with Type = LINK_METRIC and Type
Extension = LINK_METRIC_TYPE that indicates the appropriate kind Extension = LINK_METRIC_TYPE that indicates the appropriate kind
(link) and direction (incoming) of metric, or as the value (link) and direction (incoming) of metric, or as UNKNOWN_METRIC.
DEFAULT_METRIC.
For each address in a received HELLO message with an associated TLV For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS and Value = SYMMETRIC, an outgoing (to the with Type = LINK_STATUS and Value = SYMMETRIC, an outgoing (from the
message originator) link metric value is defined either using an message originator) link metric value is defined either using an
associated TLV with Type = LINK_METRIC and Type Extension = associated TLV with Type = LINK_METRIC and Type Extension =
LINK_METRIC_TYPE that indicates the appropriate kind (link) and LINK_METRIC_TYPE that indicates the appropriate kind (link) and
direction (outgoing) of metric, or as the value DEFAULT_METRIC. direction (outgoing) of metric, or as UNKNOWN_METRIC.
For each address in a received HELLO message with an associated TLV For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = SYMMETRIC, with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = SYMMETRIC,
an incoming (to the message originator) neighbor metric value is an incoming (to the message originator) neighbor metric value is
defined either using an associated TLV with Type = LINK_METRIC and defined either using an associated TLV with Type = LINK_METRIC and
Type Extension = LINK_METRIC_TYPE that indicates the appropriate kind Type Extension = LINK_METRIC_TYPE that indicates the appropriate kind
(neighbor) and direction (incoming) of metric, or as the value (neighbor) and direction (incoming) of metric, or as UNKNOWN_METRIC.
DEFAULT_METRIC.
For each address in a received HELLO message with an associated TLV For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = SYMMETRIC, with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = SYMMETRIC,
an outgoing (to the message originator) neighbor metric value is an outgoing (from the message originator) neighbor metric value is
defined either using an associated TLV with Type = LINK_METRIC and defined either using an associated TLV with Type = LINK_METRIC and
Type Extension = LINK_METRIC_TYPE that indicates the appropriate kind Type Extension = LINK_METRIC_TYPE that indicates the appropriate kind
(neighbor) and direction (outgoing) of metric, or as the value (neighbor) and direction (outgoing) of metric, or as UNKNOWN_METRIC.
DEFAULT_METRIC.
The link metric elements L_in_metric and L_out_metric in a Link Tuple The link metric elements L_in_metric and L_out_metric in a Link Tuple
are updated according to the following: are updated according to the following:
o For any Link Tuple, L_in_metric MAY be set to any representable o For any Link Tuple, L_in_metric MAY be set to any representable
value, by a process outside this specification, at any time. value, by a process outside this specification, at any time.
L_in_metric MUST be so set whenever L_status becomes equal to L_in_metric MUST be so set whenever L_status becomes equal to
HEARD or SYMMETRIC (if no other value is available then the value HEARD or SYMMETRIC (if no other value is available then the value
MAXIMUM_METRIC SHOULD be used). This MAY use information based on MAXIMUM_METRIC MUST be used). Setting L_in_metric MAY use
the receipt of a packet including a HELLO message that causes the information based on the receipt of a packet including a HELLO
creation or updating of that Link Tuple. message that causes the creation or updating of the Link Tuple.
o When, as specified in [RFC6130], a Link Tuple is updated (possibly o When, as specified in [RFC6130], a Link Tuple is updated (possibly
immediately after being created) due to the receipt of a HELLO immediately after being created) due to the receipt of a HELLO
message, if L_status = SYMMETRIC, then L_out_metric is set equal message, if L_status = SYMMETRIC, then L_out_metric is set equal
to the incoming link metric for any included address of the to the incoming link metric for any included address of the
interface on which the HELLO message was received, ignoring any interface on which the HELLO message was received. (Note that the
values equal to DEFAULT_METRIC unless there are only such values. rules for discarding HELLO messages in Section 15.3.1 make this
(Note that the rules for discarding HELLO messages in value unambiguous.) If there is no such link metric then
Section 15.3.1 make this value unambiguous.) L_out_metric is set to UNKNOWN_METRIC.
The neighbor metric elements N_in_metric and N_out_metric in a The neighbor metric elements N_in_metric and N_out_metric in a
Neighbor Tuple are updated according to Section 17.3. Neighbor Tuple are updated according to Section 17.3.
The metric elements N2_in_metric and N2_out_metric in any 2-Hop Tuple The metric elements N2_in_metric and N2_out_metric in any 2-Hop Tuple
updated as defined in [RFC6130] are updated to equal the incoming updated as defined in [RFC6130] are updated to equal the incoming
neighbor metric and outgoing neighbor metric, respectively, neighbor metric and outgoing neighbor metric, respectively,
associated with the corresponding N2_2hop_addr. associated with the corresponding N2_2hop_addr. If there are no such
metrics then these elements are set to UNKNOWN_METRIC.
15.3.2.2. Updating Willingness 15.3.2.2. Updating Willingness
N_will_flooding and N_will_routing in the current Neighbor Tuple are N_will_flooding and N_will_routing in the current Neighbor Tuple are
updated as follows: updated using the Message TLV with Type = MPR_WILLING (note that this
must be present) as follows:
1. If the HELLO message contains a Message TLV with Type = o N_will_flooding := bits 0-3 of the value of that TLV; AND
MPR_WILLING then N_will_flooding := bits 0-3 of the value of that
TLV, and N_will_routing := bits 4-7 of the value of that TLV
(each in the range 0 to 15).
2. Otherwise, N_will_flooding := WILL_DEFAULT, and N_will_routing := o N_will_routing := bits 4-7 of the value of that TLV.
WILL_DEFAULT.
(Each being in the range 0 to 15, i.e., WILL_NEVER to WILL_ALWAYS.)
15.3.2.3. Updating MPR Selector Status 15.3.2.3. Updating MPR Selector Status
L_mpr_selector is updated as follows: L_mpr_selector is updated as follows:
1. If a router finds an address object representing any of its local 1. If a router finds an address object representing any of its
interface network addresses (i.e., those contained in the relevant local interface network addresses (i.e., those contained
I_local_iface_addr_list of an OLSRv2 interface) with an in the I_local_iface_addr_list of an OLSRv2 interface) with an
associated Address Block TLV with Type = MPR and Value = FLOODING associated Address Block TLV with Type = MPR and Value = FLOODING
or Value = FLOOD_ROUTE in the HELLO message (indicating that the or Value = FLOOD_ROUTE in the HELLO message (indicating that the
originating router has selected the receiving router as a originating router has selected the receiving router as a
flooding MPR) then, for the current Link Tuple: flooding MPR) then, for the current Link Tuple:
* L_mpr_selector := true. * L_mpr_selector := true.
2. Otherwise (i.e., if no such address object and Address Block TLV 2. Otherwise (i.e., if no such address object and Address Block TLV
was found) if a router finds an address object representing any was found), if a router finds an address object representing any
of its local interface network addresses (i.e., those contained of its relevant local interface network addresses (i.e., those
in the I_local_iface_addr_list of an OLSRv2 interface) with an contained in the I_local_iface_addr_list of an OLSRv2 interface)
associated Address Block TLV with Type = LINK_STATUS and Value = with an associated Address Block TLV with Type = LINK_STATUS and
SYMMETRIC in the HELLO message, then for the current Link Tuple: Value = SYMMETRIC in the HELLO message, then for the current Link
Tuple:
* L_mpr_selector := false. * L_mpr_selector := false.
N_mpr_selector is updated as follows: N_mpr_selector is updated as follows:
1. If a router finds an address object representing any of its local 1. If a router finds an address object representing any of its
interface network addresses (i.e., those contained in the relevant local interface network addresses (those contained in
I_local_iface_addr_list of an OLSRv2 interface) with an the I_local_iface_addr_list of an OLSRv2 interface) with an
associated Address Block TLV with Type = MPR and Value = ROUTING associated Address Block TLV with Type = MPR and Value = ROUTING
or Value = FLOOD_ROUTE in the HELLO message (indicating that the or Value = FLOOD_ROUTE in the HELLO message (indicating that the
originating router has selected the receiving router as a routing originating router has selected the receiving router as a routing
MPR) then, for the current Neighbor Tuple: MPR) then, for the current Neighbor Tuple:
* N_mpr_selector := true; * N_mpr_selector := true;
* N_advertised := true. * N_advertised := true.
2. Otherwise (i.e., if no such address object and Address Block TLV 2. Otherwise (i.e., if no such address object and Address Block TLV
was found) if a router finds an address object representing any was found), if a router finds an address object representing any
of its local interface network addresses (i.e., those contained of its relevant local interface network addresses (those
in the I_local_iface_addr_list of an OLSRv2 interface) with an contained in the I_local_iface_addr_list of an OLSRv2 interface)
associated Address Block TLV with Type = LINK_STATUS and Value = with an associated Address Block TLV with Type = LINK_STATUS and
SYMMETRIC in the HELLO message, then for the current Neighbor Value = SYMMETRIC in the HELLO message, then for the current
Tuple: Neighbor Tuple:
* N_mpr_selector := false; * N_mpr_selector := false;
* The router MAY also set N_advertised := false. * The router MAY also set N_advertised := false.
16. TC Messages 16. TC Messages
This protocol defines, and hence owns, the TC message type (see This protocol defines, and hence owns, the TC message type (see
Section 24). Thus, as specified in [RFC5444], this protocol Section 24). Thus, as specified in [RFC5444], this protocol
generates and transmits all TC messages, receives all TC messages and generates and transmits all TC messages, receives all TC messages and
skipping to change at page 54, line 14 skipping to change at page 55, line 28
otherwise it MUST have Type Extension := INCOMPLETE. (Exception: otherwise it MUST have Type Extension := INCOMPLETE. (Exception:
a TC message MAY omit such a Message TLV if the TC message does a TC message MAY omit such a Message TLV if the TC message does
not include any address objects with an associated Address Block not include any address objects with an associated Address Block
TLV with Type = NBR_ADDR_TYPE or Type = GATEWAY.) TLV with Type = NBR_ADDR_TYPE or Type = GATEWAY.)
o A single Message TLV with Type := VALIDITY_TIME, as specified in o A single Message TLV with Type := VALIDITY_TIME, as specified in
[RFC5497]. If all TC messages are sent with the same hop limit [RFC5497]. If all TC messages are sent with the same hop limit
then this TLV MUST have a value encoding the period T_HOLD_TIME. then this TLV MUST have a value encoding the period T_HOLD_TIME.
If TC messages are sent with different hop limits (more than one If TC messages are sent with different hop limits (more than one
value of TC_HOP_LIMIT) then this TLV MUST specify times that vary value of TC_HOP_LIMIT) then this TLV MUST specify times that vary
with the number of hops distance appropriate to the chosen pattern with the number of hops appropriate to the chosen pattern of TC
of TC message hop limits, as specified in [RFC5497]; these times message hop limits, as specified in [RFC5497]; these times SHOULD
SHOULD be appropriate multiples of T_HOLD_TIME. The options be appropriate multiples of T_HOLD_TIME. The options included in
included in [RFC5497] for representing zero and infinite times [RFC5497] for representing zero and infinite times MUST NOT be
MUST NOT be used. used.
o If the TC message is complete, all network addresses which are the o If the TC message is complete, all network addresses which are the
N_orig_addr of a Neighbor Tuple with N_advertised = true, MUST be N_orig_addr of a Neighbor Tuple with N_advertised = true, MUST be
represented by address objects in one or more Address Blocks. If represented by address objects in one or more Address Blocks. If
the TC message is incomplete then any such address objects MAY be the TC message is incomplete then any such address objects MAY be
included. At least one copy of each such address object that is included. At least one copy of each such address object that is
included MUST be associated with an Address Block TLV with Type := included MUST be associated with an Address Block TLV with Type :=
NBR_ADDR_TYPE, and Value := ORIGINATOR, or with Value := NBR_ADDR_TYPE, and Value := ORIGINATOR, or with Value :=
ROUTABLE_ORIG if that address object is also to be associated with ROUTABLE_ORIG if that address object is also to be associated with
Value = ROUTABLE. Value = ROUTABLE.
skipping to change at page 54, line 41 skipping to change at page 56, line 6
the N_neighbor_addr_list of a Neighbor Tuple with N_advertised = the N_neighbor_addr_list of a Neighbor Tuple with N_advertised =
true MUST be represented by address objects in one or more Address true MUST be represented by address objects in one or more Address
Blocks. If the TC message is incomplete then any such address Blocks. If the TC message is incomplete then any such address
objects MAY be included. At least one copy of each such address objects MAY be included. At least one copy of each such address
object MUST be associated with an Address Block TLV with Type = object MUST be associated with an Address Block TLV with Type =
NBR_ADDR_TYPE, and Value = ROUTABLE, or with Value = ROUTABLE_ORIG NBR_ADDR_TYPE, and Value = ROUTABLE, or with Value = ROUTABLE_ORIG
if also to be associated with Value = ORIGINATOR. At least one if also to be associated with Value = ORIGINATOR. At least one
copy of each such address object MUST be associated with an copy of each such address object MUST be associated with an
Address Block TLV with Type = LINK_METRIC and Type Extension = Address Block TLV with Type = LINK_METRIC and Type Extension =
LINK_METRIC_TYPE indicating an outgoing neighbor metric with value LINK_METRIC_TYPE indicating an outgoing neighbor metric with value
equal to the corresponding N_out_metric, unless that value is equal to the corresponding N_out_metric.
DEFAULT_METRIC.
o If the TC message is complete, all network addresses which are the o If the TC message is complete, all network addresses which are the
AL_net_addr of a Local Attached Network Tuple MUST be represented AL_net_addr of a Local Attached Network Tuple MUST be represented
by address objects in one or more Address Blocks. If the TC by address objects in one or more Address Blocks. If the TC
message is incomplete then any such address objects MAY be message is incomplete then any such address objects MAY be
included. At least one copy of each such address object MUST be included. At least one copy of each such address object MUST be
associated with an Address Block TLV with Type := GATEWAY, and associated with an Address Block TLV with Type := GATEWAY, and
Value := AN_dist. At least one copy of each such address object Value := AN_dist. At least one copy of each such address object
MUST be associated with an Address Block TLV with Type = MUST be associated with an Address Block TLV with Type =
LINK_METRIC and Type Extension = LINK_METRIC_TYPE indicating an LINK_METRIC and Type Extension = LINK_METRIC_TYPE indicating an
outgoing neighbor metric equal to the corresponding AL_metric, outgoing neighbor metric equal to the corresponding AL_metric.
unless that value is DEFAULT_METRIC.
A TC message MAY contain: A TC message MAY contain:
o A single Message TLV with Type := INTERVAL_TIME, as specified in o A single Message TLV with Type := INTERVAL_TIME, as specified in
[RFC5497]. If all TC messages are sent with the same hop limit [RFC5497]. If all TC messages are sent with the same hop limit
then this TLV MUST have a value encoding the period TC_INTERVAL. then this TLV MUST have a value encoding the period TC_INTERVAL.
If TC messages are sent with different hop limits, then this TLV If TC messages are sent with different hop limits, then this TLV
MUST specify times that vary with the number of hops distance MUST specify times that vary with the number of hops appropriate
appropriate to the chosen pattern of TC message hop limits, as to the chosen pattern of TC message hop limits, as specified in
specified in [RFC5497]; these times SHOULD be appropriate [RFC5497]; these times MUST be appropriate multiples of
multiples of TC_INTERVAL. The options included in [RFC5497] for TC_INTERVAL. The options included in [RFC5497] for representing
representing zero and infinite times MUST NOT be used. zero and infinite times MUST NOT be used.
16.2. TC Message Transmission 16.2. TC Message Transmission
A router with one or more OLSRv2 interfaces, and with any Neighbor A router with one or more OLSRv2 interfaces, and with any Neighbor
Tuples with N_advertised = true, or with a non-empty Local Attached Tuples with N_advertised = true, or with a non-empty Local Attached
Network Set MUST generate TC messages. A router which does not have Network Set MUST generate TC messages. A router which does not have
such information to advertise SHOULD also generate "empty" TC such information to advertise MUST also generate "empty" TC messages
messages for a period A_HOLD_TIME after it last generated a non-empty for a period A_HOLD_TIME after it last generated a non-empty TC
TC message. message.
Complete TC messages are generated and transmitted periodically on Complete TC messages are generated and transmitted periodically on
all OLSRv2 interfaces, with a default interval between two all OLSRv2 interfaces, with a default interval between two
consecutive TC message transmissions by the same router of consecutive TC message transmissions by the same router of
TC_INTERVAL. TC_INTERVAL.
TC messages MAY be generated in response to a change in the TC messages MAY be generated in response to a change in the
information which they are to advertise, indicated by a change in the information which they are to advertise, indicated by a change in the
ANSN in the Neighbor Information Base. In this case a router MAY ANSN in the Neighbor Information Base. In this case a router MAY
send a complete TC message, and if so MAY re-start its TC message send a complete TC message, and if so MAY re-start its TC message
schedule. Alternatively a router MAY send an incomplete TC message schedule. Alternatively, a router MAY send an incomplete TC message
with at least the newly advertised network addresses (i.e., not with at least the newly advertised network addresses (i.e., not
previously, but now, an N_orig_addr or in an N_neighbor_addr_list in previously, but now, an N_orig_addr or in an N_neighbor_addr_list in
a Neighbor Tuple with N_advertised = true, or an AL_net_addr) in its a Neighbor Tuple with N_advertised = true, or an AL_net_addr) in its
Address Blocks, with associated Address Block TLV(s). Note that a Address Blocks, with associated Address Block TLV(s). Note that a
router cannot report removal of advertised content using an router cannot report removal of advertised content using an
incomplete TC message. incomplete TC message.
When sending a TC message in response to a change of advertised When sending a TC message in response to a change of advertised
network addresses, a router MUST respect a minimum interval of network addresses, a router MUST respect a minimum interval of
TC_MIN_INTERVAL between generated TC messages. Sending an incomplete TC_MIN_INTERVAL between generated TC messages. Sending an incomplete
TC message MUST NOT cause the interval between complete TC messages TC message MUST NOT cause the interval between complete TC messages
to be increased, and thus a router MUST NOT send an incomplete TC to be increased, and thus a router MUST NOT send an incomplete TC
message if within TC_MIN_INTERVAL of the next scheduled complete TC message if within TC_MIN_INTERVAL of the next scheduled complete TC
message. message.
The generation of TC messages, whether scheduled or triggered by a The generation of TC messages, whether scheduled or triggered by a
change of contents, MAY be jittered as described in [RFC5148]. The change of contents, MAY be jittered as described in [RFC5148]. The
values of MAXJITTER used SHOULD be: values of MAXJITTER used MUST be:
o TP_MAXJITTER for periodic TC message generation; o TP_MAXJITTER for periodic TC message generation;
o TT_MAXJITTER for responsive TC message generation. o TT_MAXJITTER for responsive TC message generation.
16.3. TC Message Processing 16.3. TC Message Processing
On receiving a TC message, the receiving router MUST then follow the On receiving a TC message on an OLSRv2 interface, the receiving
processing and forwarding procedure, defined in Section 14. router MUST then follow the processing and forwarding procedures,
defined in Section 14.
If the message is considered for processing (Section 14.2), then a If the message is considered for processing (Section 14.2), then a
router MUST first check if the message is invalid for processing by router MUST first check if the message is invalid for processing by
this router, as defined in Section 16.3.1. A router MAY make a this router, as defined in Section 16.3.1. A router MAY make a
similar check before considering a message for forwarding, it MUST similar check before considering a message for forwarding, it MUST
make those aspects of the check that apply to elements in the Message make those aspects of the check that apply to elements in the Message
Header. Header.
If the TC message is not invalid, then the TC message type specific If the TC message is not invalid, then the TC message type specific
processing, described in Section 16.3.2 MUST be applied. This will processing, described in Section 16.3.2 MUST be applied. This will
update its appropriate Interface Information Base and its Router update its appropriate Interface Information Bases and its Router
Information Base. Following this, if there are any changes in these Information Base. Following this, if there are any changes in these
Information Bases, then the processing in Section 17 MUST be Information Bases, then the processing in Section 17 MUST be
performed. performed.
16.3.1. Invalid Message 16.3.1. TC Message Discarding
A received TC message is invalid for processing by this router if the A received TC message is invalid for processing by this router if the
message: message:
o Has an address length specified in the Message Header that is not o Has an address length specified in the Message Header that is not
equal to the length of the addresses used by this router. equal to the length of the addresses used by this router.
o Does not include a message originator address and a message o Does not include a message originator address and a message
sequence number. sequence number.
skipping to change at page 58, line 14 skipping to change at page 59, line 27
o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM
and Type Extension = COMPLETE, then processing according to and Type Extension = COMPLETE, then processing according to
Section 16.3.3 and then according to Section 16.3.4 is carried Section 16.3.3 and then according to Section 16.3.4 is carried
out. out.
o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM
and Type Extension = INCOMPLETE, then only processing according to and Type Extension = INCOMPLETE, then only processing according to
Section 16.3.3 is carried out. Section 16.3.3 is carried out.
For the purposes of this section: For the purposes of the TC message processing in Section 16.3.3 and
Section 16.3.4:
o "validity time" is calculated from a VALIDITY_TIME Message TLV in o "validity time" is calculated from a VALIDITY_TIME Message TLV in
the TC message according to the specification in [RFC5497]. All the TC message according to the specification in [RFC5497]. All
information in the TC message has the same validity time. information in the TC message has the same validity time.
o "received ANSN" is defined as being the value of a Message TLV o "received ANSN" is defined as being the value of a Message TLV
with Type = CONT_SEQ_NUM. with Type = CONT_SEQ_NUM.
o "associated metric value" is defined for any address in the TC o "associated metric value" is defined for any address in the TC
message as being either the outgoing neighbor metric value message as being either the outgoing neighbor metric value
indicated by a TLV with Type = LINK_METRIC and Type Extension = indicated by a TLV with Type = LINK_METRIC and Type Extension =
LINK_METRIC_TYPE that is associated with any address object in the LINK_METRIC_TYPE that is associated with any address object in the
TC message that is equal to that address, or as DEFAULT_METRIC TC message that is equal to that address, or as UNKNOWN_METRIC
otherwise. (Note that the rules in Section 16.3.1 make this otherwise. (Note that the rules in Section 16.3.1 make this
definition unambiguous.) definition unambiguous.)
o Comparisons of sequence numbers are carried out as specified in o Comparisons of sequence numbers are carried out as specified in
Section 21. Section 21.
16.3.3. Initial TC Message Processing 16.3.3. Initial TC Message Processing
The TC message is processed as follows: The TC message is processed as follows:
skipping to change at page 59, line 11 skipping to change at page 60, line 23
4. The Attached Network Set is updated according to 4. The Attached Network Set is updated according to
Section 16.3.3.4. Section 16.3.3.4.
16.3.3.1. Populating the Advertising Remote Router Set 16.3.3.1. Populating the Advertising Remote Router Set
The router MUST update its Advertising Remote Router Set as follows: The router MUST update its Advertising Remote Router Set as follows:
1. If there is an Advertising Remote Router Tuple with: 1. If there is an Advertising Remote Router Tuple with:
* AR_orig_addr = message originator address, AND; * AR_orig_addr = message originator address; AND
* AR_seq_number > received ANSN, * AR_seq_number > received ANSN,
then the TC message MUST be discarded. then the TC message MUST be discarded.
2. Otherwise: 2. Otherwise:
1. If there is no Advertising Remote Router Tuple such that: 1. If there is no Advertising Remote Router Tuple such that:
+ AR_orig_addr = message originator address; + AR_orig_addr = message originator address;
skipping to change at page 59, line 44 skipping to change at page 61, line 7
16.3.3.2. Populating the Router Topology Set 16.3.3.2. Populating the Router Topology Set
The router MUST update its Router Topology Set as follows: The router MUST update its Router Topology Set as follows:
1. For each address (henceforth advertised address) corresponding to 1. For each address (henceforth advertised address) corresponding to
one or more address objects with an associated Address Block TLV one or more address objects with an associated Address Block TLV
with Type = NBR_ADDR_TYPE and Value = ORIGINATOR or Value = with Type = NBR_ADDR_TYPE and Value = ORIGINATOR or Value =
ROUTABLE_ORIG, and that is not partially owned by this router, ROUTABLE_ORIG, and that is not partially owned by this router,
perform the following processing: perform the following processing:
1. If there is no Router Topology Tuple such that: 1. If the associated metric is UNKNOWN_METRIC then remove any
Router Topology Tuple such that:
+ TR_from_orig_addr = message originator address, AND; + TR_from_orig_addr = message originator address; AND
+ TR_to_orig_addr = advertised address,
2. Otherwise if there is no Router Topology Tuple such that:
+ TR_from_orig_addr = message originator address; AND
+ TR_to_orig_addr = advertised address, + TR_to_orig_addr = advertised address,
then create a new Router Topology Tuple with: then create a new Router Topology Tuple with:
+ TR_from_orig_addr := message originator address; + TR_from_orig_addr := message originator address;
+ TR_to_orig_addr := advertised address. + TR_to_orig_addr := advertised address.
2. This Router Topology Tuple (existing or new) is then modified 3. This Router Topology Tuple (existing or new) is then modified
as follows: as follows:
+ TR_seq_number := received ANSN; + TR_seq_number := received ANSN;
+ TR_metric := associated link metric; + TR_metric := associated link metric;
+ TR_time := current time + validity time. + TR_time := current time + validity time.
16.3.3.3. Populating the Routable Address Topology Set 16.3.3.3. Populating the Routable Address Topology Set
The router MUST update its Routable Address Topology Set as follows: The router MUST update its Routable Address Topology Set as follows:
1. For each network address (henceforth advertised address) 1. For each network address (henceforth advertised address)
corresponding to one or more address objects with an associated corresponding to one or more address objects with an associated
Address Block TLV with Type = NBR_ADDR_TYPE and Value = ROUTABLE Address Block TLV with Type = NBR_ADDR_TYPE and Value = ROUTABLE
or Value = ROUTABLE_ORIG, and that is not partially owned by this or Value = ROUTABLE_ORIG, and that is not partially owned by this
router, perform the following processing: router, perform the following processing:
1. If there is no Routable Address Topology Tuple such that: 1. If the associated metric is UNKNOWN_METRIC then remove any
Routable Address Topology Tuple such that:
+ TA_from_orig_addr = message originator address, AND; + TA_from_orig_addr = message originator address; AND
+ TA_dest_addr = advertised address.
2. Otherwise if there is no Routable Address Topology Tuple such
that:
+ TA_from_orig_addr = message originator address; AND
+ TA_dest_addr = advertised address, + TA_dest_addr = advertised address,
then create a new Routable Address Topology Tuple with: then create a new Routable Address Topology Tuple with:
+ TA_from_orig_addr := message originator address; + TA_from_orig_addr := message originator address;
+ TA_dest_addr := advertised address. + TA_dest_addr := advertised address.
2. This Routable Address Topology Tuple (existing or new) is 3. This Routable Address Topology Tuple (existing or new) is
then modified as follows: then modified as follows:
+ TA_seq_number := received ANSN; + TA_seq_number := received ANSN;
+ TA_metric := associated link metric; + TA_metric := associated link metric;
+ TA_time := current time + validity time. + TA_time := current time + validity time.
16.3.3.4. Populating the Attached Network Set 16.3.3.4. Populating the Attached Network Set
The router MUST update its Attached Network Set as follows: The router MUST update its Attached Network Set as follows:
1. For each network address (henceforth attached address) 1. For each network address (henceforth attached address)
corresponding to one or more address objects with an associated corresponding to one or more address objects with an associated
Address Block TLV with Type = GATEWAY, and that is not fully Address Block TLV with Type = GATEWAY, and that is not fully
owned by this router, perform the following processing: owned by this router, perform the following processing:
1. If there is no Attached Network Tuple such that: 1. If the associated metric is UNKNOWN_METRIC then remove any
Attached Network Tuple such that:
+ AN_net_addr = attached address, AND; + AN_net_addr = attached address; AND
+ AN_orig_addr = message originator address.
2. Otherwise if there is no Attached Network Tuple such that:
+ AN_net_addr = attached address; AND
+ AN_orig_addr = message originator address, + AN_orig_addr = message originator address,
then create a new Attached Network Tuple with: then create a new Attached Network Tuple with:
+ AN_net_addr := attached address; + AN_net_addr := attached address;
+ AN_orig_addr := message originator address. + AN_orig_addr := message originator address.
2. This Attached Network Tuple (existing or new) is then 3. This Attached Network Tuple (existing or new) is then
modified as follows: modified as follows:
+ AN_seq_number := received ANSN; + AN_seq_number := received ANSN;
+ AN_dist := the Value of the associated GATEWAY TLV; + AN_dist := the Value of the associated GATEWAY TLV;
+ AN_metric := associated link metric; + AN_metric := associated link metric;
+ AN_time := current time + validity time. + AN_time := current time + validity time.
skipping to change at page 62, line 11 skipping to change at page 63, line 35
3. The Attached Network Set is updated according to 3. The Attached Network Set is updated according to
Section 16.3.4.3. Section 16.3.4.3.
16.3.4.1. Purging the Router Topology Set 16.3.4.1. Purging the Router Topology Set
The Router Topology Set MUST be updated as follows: The Router Topology Set MUST be updated as follows:
1. Any Router Topology Tuples with: 1. Any Router Topology Tuples with:
* TR_from_orig_addr = message originator address, AND; * TR_from_orig_addr = message originator address; AND
* TR_seq_number < received ANSN, * TR_seq_number < received ANSN,
MUST be removed. MUST be removed.
16.3.4.2. Purging the Routable Address Topology Set 16.3.4.2. Purging the Routable Address Topology Set
The Routable Address Topology Set MUST be updated as follows: The Routable Address Topology Set MUST be updated as follows:
1. Any Routable Address Topology Tuples with: 1. Any Routable Address Topology Tuples with:
* TA_from_orig_addr = message originator address, AND; * TA_from_orig_addr = message originator address; AND
* TA_seq_number < received ANSN, * TA_seq_number < received ANSN,
MUST be removed. MUST be removed.
16.3.4.3. Purging the Attached Network Set 16.3.4.3. Purging the Attached Network Set
The Attached Network Set MUST be updated as follows: The Attached Network Set MUST be updated as follows:
1. Any Attached Network Tuples with: 1. Any Attached Network Tuples with:
* AN_orig_addr = message originator address, AND; * AN_orig_addr = message originator address; AND
* AN_seq_number < received ANSN, * AN_seq_number < received ANSN,
MUST be removed. MUST be removed.
17. Information Base Changes 17. Information Base Changes
The changes described in the following sections MUST be carried out The changes described in the following sections MUST be carried out
when any Information Base changes as indicated. when any Information Base changes as indicated.
17.1. Originator Address Changes 17.1. Originator Address Changes
If the router changes originator address, then: If the router changes its originator address, then:
1. If there is no Originator Tuple with: 1. If there is no Originator Tuple with:
* O_orig_addr = old originator address * O_orig_addr = old originator address
then create an Originator Tuple with: then create an Originator Tuple with:
* O_orig_addr := old originator address * O_orig_addr := old originator address
The Originator Tuple (existing or new) with: The Originator Tuple (existing or new) with:
skipping to change at page 63, line 40 skipping to change at page 65, line 16
SYMMETRIC; set L_SYM_time := expired if this would otherwise be SYMMETRIC; set L_SYM_time := expired if this would otherwise be
the case. the case.
17.3. Neighbor State Changes 17.3. Neighbor State Changes
The consistency of a Neighbor Tuple MUST be maintained according to The consistency of a Neighbor Tuple MUST be maintained according to
the following rules, in addition to those in [RFC6130]: the following rules, in addition to those in [RFC6130]:
1. If N_symmetric = true, then N_in_metric MUST equal the minimum 1. If N_symmetric = true, then N_in_metric MUST equal the minimum
value of all L_in_metric of corresponding Link Tuples with value of all L_in_metric of corresponding Link Tuples with
L_status = SYMMETRIC. L_status = SYMMETRIC and L_in_metric != UNKNOWN_METRIC. If there
are no such Link Tuples then N_in_metric MUST equal
UNKNOWN_METRIC.
2. If N_symmetric = true, then N_out_metric MUST equal the minimum 2. If N_symmetric = true, then N_out_metric MUST equal the minimum
value of all L_out_metric of corresponding Link Tuples with value of all L_out_metric of corresponding Link Tuples with
L_status = SYMMETRIC. L_status = SYMMETRIC and L_out_metric != UNKNOWN_METRIC. If
there are no such Link Tuples then N_out_metric MUST equal
UNKNOWN_METRIC.
3. If N_symmetric = false, then N_flooding_mpr, N_routing_mpr, 3. If N_symmetric = false, then N_flooding_mpr, N_routing_mpr,
N_mpr_selector and N_advertised MUST all be equal to false. N_mpr_selector and N_advertised MUST all be equal to false.
4. If N_mpr_selector = true, then N_advertised MUST be equal to 4. If N_mpr_selector = true, then N_advertised MUST be equal to
true. true.
5. If N_symmetric = true and N_mpr_selector = false, then a router 5. If N_symmetric = true, N_out_metric != UNKNOWN_METRIC and
MAY select N_advertised = true or N_advertised = false. The more N_mpr_selector = false, then a router MAY select N_advertised =
neighbors that are advertised, the larger TC messages become, but true or N_advertised = false. The more neighbors that are
the more redundancy is available for routing. A router SHOULD advertised, the larger TC messages become, but the more
consider the nature of its network in making such a decision, and redundancy is available for routing. A router SHOULD consider
SHOULD avoid unnecessary changes in advertising status, which may the nature of its network in making such a decision, and SHOULD
result both in additional TC messages having to be sent by its avoid unnecessary changes in advertising status, which may result
both in additional TC messages having to be sent by its
neighbors, and in unnecessary changes to routing, which will have neighbors, and in unnecessary changes to routing, which will have
similar effects to other forms of topology changes in the MANET. similar effects to other forms of topology changes in the MANET.
17.4. Advertised Neighbor Changes 17.4. Advertised Neighbor Changes
The router MUST increment the ANSN in the Neighbor Information Base The router MUST increment the ANSN in the Neighbor Information Base
whenever: whenever:
1. Any Neighbor Tuple changes its N_advertised value, or any 1. Any Neighbor Tuple changes its N_advertised value, or any
Neighbor Tuple with N_advertised = true is removed. Neighbor Tuple with N_advertised = true is removed.
skipping to change at page 65, line 20 skipping to change at page 66, line 47
are removed. are removed.
17.6. Neighborhood Changes and MPR Updates 17.6. Neighborhood Changes and MPR Updates
The sets of symmetric 1-hop neighbors selected as flooding MPRs and The sets of symmetric 1-hop neighbors selected as flooding MPRs and
routing MPRs MUST satisfy the conditions defined in Section 18. To routing MPRs MUST satisfy the conditions defined in Section 18. To
ensure this: ensure this:
1. The set of flooding MPRs of a router MUST be recalculated if: 1. The set of flooding MPRs of a router MUST be recalculated if:
* a Link Tuple is added with L_status = SYMMETRIC, OR; * A Link Tuple is added with L_status = SYMMETRIC and
L_out_metric != UNKNOWN_METRIC, OR;
* a Link Tuple with L_status = SYMMETRIC is removed, OR; * A Link Tuple with L_status = SYMMETRIC and L_out_metric !=
UNKNOWN_METRIC is removed, OR;
* a Link Tuple with L_status = SYMMETRIC changes to having * A Link Tuple with L_status = SYMMETRIC and L_out_metric !=
L_status = HEARD or L_status = LOST, OR; UNKNOWN_METRIC changes to having L_status = HEARD, L_status =
LOST or L_out_metric = UNKNOWN_METRIC, OR;
* a Link Tuple with L_status = HEARD or L_status = LOST changes * A Link Tuple with L_status = HEARD or L_status = LOST changes
to having L_status = SYMMETRIC, OR; to having L_status = SYMMETRIC and L_out_metric !=
UNKNOWN_METRIC, OR;
* the flooding MPR selection process uses metrics (see * The flooding MPR selection process uses metric values (see
Section 18.4 and the L_out_metric of any Link Tuple with Section 18.4) and the L_out_metric of any Link Tuple with
L_status = SYMMETRIC changes, OR; L_status = SYMMETRIC changes, OR;
* a 2-Hop Tuple is added or removed, OR; * The N_will_flooding of a Neighbor Tuple with N_symmetric =
true and N_out_metric != UNKNOWN_METRIC changes from
* the N_will_flooding of a Neighbor Tuple with N_symmetric = WILL_NEVER to any other value, OR;
true changes from WILL_NEVER to any other value, OR;
* the N_will_flooding of a Neighbor Tuple with N_flooding_mpr = * The N_will_flooding of a Neighbor Tuple with N_flooding_mpr =
true changes to WILL_NEVER from any other value, OR; true changes to WILL_NEVER from any other value, OR;
* the N_will_flooding of a Neighbor Tuple with N_symmetric = * The N_will_flooding of a Neighbor Tuple with N_symmetric =
true and N_flooding_mpr = false changes to WILL_ALWAYS from true, N_out_metric != UNKNOWN_METRIC, and N_flooding_mpr =
any other value, OR; false changes to WILL_ALWAYS from any other value, OR;
* the flooding MPR selection process uses metrics (see * A 2-Hop Tuple with N2_out_metric != UNKNOWN_METRIC is added or
Section 18.4 and the N2_out_metric of any 2-Hop Tuple changes. removed, OR;
* The flooding MPR selection process uses metric values (see
Section 18.4) and the N2_out_metric of any 2-Hop Tuple
changes.
2. Otherwise, the set of flooding MPRs of a router MAY be 2. Otherwise, the set of flooding MPRs of a router MAY be
recalculated if the N_will_flooding of a Neighbor Tuple with recalculated if the N_will_flooding of a Neighbor Tuple with
N_symmetric = true changes in any other way; it SHOULD be N_symmetric = true changes in any other way; it SHOULD be
recalculated if N_flooding_mpr = false and this is an increase in recalculated if N_flooding_mpr = false and this is an increase in
N_will_flooding or if N_flooding_mpr = true and this is a N_will_flooding or if N_flooding_mpr = true and this is a
decrease in N_will_flooding. decrease in N_will_flooding.
3. The set of routing MPRs of a router MUST be recalculated if: 3. The set of routing MPRs of a router MUST be recalculated if:
* a Link Tuple is added with L_status = SYMMETRIC, OR; * A Neighbor Tuple is added with N_symmetric = true and
N_in_metric != UNKNOWN_METRIC, OR;
* a Link Tuple with L_status = SYMMETRIC is removed, OR; * A Neighbor Tuple with N_symmetric = true and N_in_metric !=
UNKNOWN_METRIC is removed, OR;
* a Link Tuple with L_status = SYMMETRIC changes to having * A Neighbor Tuple with N_symmetric = true and N_in_metric !=
L_status = HEARD or L_status = LOST, OR; UNKNOWN_METRIC changes to having N_symmetric = false, OR;
* a Link Tuple with L_status = HEARD or L_status = LOST changes * A Neighbor Tuple with N_symmetric = false changes to having
to having L_status = SYMMETRIC, OR; N_symmetric = true and N_in_metric != UNKNOWN_METRIC, OR;
* a 2-Hop Tuple is added or removed, OR; * The N_in_metric of any Neighbor Tuple with N_symmetric = true
changes, OR;
* the N_will_routing of a Neighbor Tuple with N_symmetric = true * The N_will_routing of a Neighbor Tuple with N_symmetric = true
changes from WILL_NEVER to any other value, OR; and N_in_metric != UNKNOWN_METRIC changes from WILL_NEVER to
any other value, OR;
* the N_will_routing of a Neighbor Tuple with N_routing_mpr = * The N_will_routing of a Neighbor Tuple with N_routing_mpr =
true changes to WILL_NEVER from any other value, OR; true changes to WILL_NEVER from any other value, OR;
* the N_will_routing of a Neighbor Tuple with N_symmetric = true * The N_will_routing of a Neighbor Tuple with N_symmetric =
and N_routing_mpr = false changes to WILL_ALWAYS from any true, N_in_metric != UNKNOWN_METRIC and N_routing_mpr = false
other value, OR; changes to WILL_ALWAYS from any other value, OR;
* the N_in_metric of any Neighbor Tuple with N_symmetric * A 2-Hop Tuple with N2_in_metric != UNKNOWN_METRIC is added or
changes, OR; removed, OR;
* the N2_in_metric of any 2-Hop Tuple changes. * The N2_in_metric of any 2-Hop Tuple changes.
4. Otherwise, the set of routing MPRs of a router MAY be 4. Otherwise, the set of routing MPRs of a router MAY be
recalculated if the N_will_routing of a Neighbor Tuple with recalculated if the N_will_routing of a Neighbor Tuple with
N_symmetric = true changes in any other way; it SHOULD be N_symmetric = true changes in any other way; it SHOULD be
recalculated if N_routing_mpr = false and this is an increase in recalculated if N_routing_mpr = false and this is an increase in
N_will_routing or if N_routing_mpr = true and this is a decrease N_will_routing or if N_routing_mpr = true and this is a decrease
in N_will_routing. in N_will_routing.
If either set of MPRs of a router is recalculated, this MUST be as If either set of MPRs of a router is recalculated, this MUST be as
described in Section 18. described in Section 18.
skipping to change at page 67, line 8 skipping to change at page 68, line 47
17.7. Routing Set Updates 17.7. Routing Set Updates
The Routing Set MUST be updated, as described in Section 19, when The Routing Set MUST be updated, as described in Section 19, when
changes in the Local Information Base, the Neighborhood Information changes in the Local Information Base, the Neighborhood Information
Base or the Topology Information Base indicate a change (including of Base or the Topology Information Base indicate a change (including of
any potentially used outgoing neighbor metric values) of the known any potentially used outgoing neighbor metric values) of the known
symmetric links and/or attached networks in the MANET, hence changing symmetric links and/or attached networks in the MANET, hence changing
the Topology Graph. It is sufficient to consider only changes which the Topology Graph. It is sufficient to consider only changes which
affect at least one of: affect at least one of:
o The Local Interface Set, if the change removes any network address o The Local Interface Set for an OLSRv2 interface, if the change
in an I_local_iface_addr_list. In this case, unless the OLSRv2 removes any network address in an I_local_iface_addr_list. In
interface is removed, it may not be necessary to do more than this case, unless the OLSRv2 interface is removed, it may not be
replace such network addresses, if used, by an alternative network necessary to do more than replace such network addresses, if used,
address from the same I_local_iface_addr_list. by an alternative network address from the same
I_local_iface_addr_list.
o The Local Attached Set, if the change removes any AL_net_addr o The Local Attached Set, if the change removes any AL_net_addr
which is also an AN_net_addr. In this case it may not be which is also an AN_net_addr. In this case it may not be
necessary to do more than add Routing Tuples with R_dest_addr necessary to do more than add Routing Tuples with R_dest_addr
equal to that AN_net_addr. equal to that AN_net_addr.
o The Link Set of any OLSRv2 interface, considering only Link Tuples o The Link Set of any OLSRv2 interface, considering only Link Tuples
which have, or just had, L_status = SYMMETRIC (including removal which have, or just had, L_status = SYMMETRIC and L_out_metric !=
of such Link Tuples). UNKNOWN_METRIC (including removal of such Link Tuples).
o The Neighbor Set of the router, considering only Neighbor Tuples o The Neighbor Set of the router, considering only Neighbor Tuples
that have, or just had, N_symmetric = true, and do not have that have, or just had, N_symmetric = true and N_out_metric !=
N_orig_addr = unknown. UNKNOWN_METRIC, and do not have N_orig_addr = unknown.
o The 2-Hop Set of any OLSRv2 interface, if used in the creation of o The 2-Hop Set of any OLSRv2 interface, if used in the creation of
the Routing Set. the Routing Set, and if the change affects any 2-Hop Tuples with
N2_out_metric != UNKNOWN_METRIC.
o The Router Topology Set of the router. o The Router Topology Set of the router.
o The Routable Address Topology Set of the router. o The Routable Address Topology Set of the router.
o The Attached Network Set of the router. o The Attached Network Set of the router.
18. Selecting MPRs 18. Selecting MPRs
Each router MUST select, from among its willing symmetric 1-hop Each router MUST select, from among its willing symmetric 1-hop
skipping to change at page 68, line 13 skipping to change at page 70, line 5
required then a router can select all of its relevant neighbors as required then a router can select all of its relevant neighbors as
routing MPRs.) Consequently, while it is not essential that these routing MPRs.) Consequently, while it is not essential that these
two sets of MPRs are minimal, keeping the numbers of MPRs small two sets of MPRs are minimal, keeping the numbers of MPRs small
ensures that the overhead of this protocol is kept to a minimum. ensures that the overhead of this protocol is kept to a minimum.
18.1. Overview 18.1. Overview
MPRs are selected according to the following steps, defined in the MPRs are selected according to the following steps, defined in the
following sections: following sections:
o A form of data structure known as a Neighbor Graph is defined. o A data structure known as a Neighbor Graph is defined.
o The properties of an MPR Set derived from a Neighbor Graph are o The properties of an MPR Set derived from a Neighbor Graph are
defined. Any algorithm that creates an MPR Set that satisfies defined. Any algorithm that creates an MPR Set that satisfies
these properties is a valid MPR selection algorithm. An example these properties is a valid MPR selection algorithm. An example
algorithm that creates such an MPR Set is given in Appendix A. algorithm that creates such an MPR Set is given in Appendix A.
o How to create a Neighbor Graph for each interface based on the o How to create a Neighbor Graph for each interface based on the
corresponding Interface Information Base is defined, and how to corresponding Interface Information Base is defined, and how to
combine the resulting MPR Sets to determine the router's flooding combine the resulting MPR Sets to determine the router's flooding
MPRs and record those in the router's Neighbor Set. MPRs and record those in the router's Neighbor Set.
o How to create a single Neighbor Graph based on all Interface o How to create a single Neighbor Graph based on all Interface
Information Bases and the Neighbor Information Base is defined, Information Bases and the Neighbor Information Base is defined,
and how to record the resulting MPR Set as the router's routing and how to record the resulting MPR Set as the router's routing
MPRs in the router's Neighbor Set. MPRs in the router's Neighbor Set.
o A specification as to when MPRs MUST be calculated is given. o A specification as to when MPRs MUST be calculated is given.
When a router selects its MPRs it MAY consider any other When a router selects its MPRs it MAY consider any characteristics of
characteristics of its neighbors that it is aware of. In particular its neighbors that it is aware of. In particular it SHOULD consider
it SHOULD consider the willingness of the neighbor, as recorded by the willingness of the neighbor, as recorded by the corresponding
the corresponding N_will_flooding or N_will_routing value, as N_will_flooding or N_will_routing value, as appropriate, preferring
appropriate, preferring neighbors with higher values. (Note that neighbors with higher values. (Note that willingness values equal to
willingness values equal to WILL_NEVER and WILL_ALWAYS are always WILL_NEVER and WILL_ALWAYS are always considered, as described.)
considered, as described.) However a router MAY consider other However, a router MAY consider other characteristics to have a
characteristics to have a greater significance. greater significance.
Each router MAY select its flooding and routing MPRs independently Each router MAY select its flooding and routing MPRs independently
from each other, or coordinate its selections. A router MAY make its from each other, or coordinate its selections. A router MAY make its
MPR selections independently of the MPR selection by other routers, MPR selections independently of the MPR selection by other routers,
or it MAY, for example, give preference to routers that either are, or it MAY, for example, give preference to routers that either are,
or are not, already selected as MPRs by other routers. or are not, already selected as MPRs by other routers.
18.2. Neighbor Graph 18.2. Neighbor Graph
A Neighbor Graph is a structure defined here as consisting of sets N1 A Neighbor Graph is a structure defined here as consisting of sets N1
skipping to change at page 69, line 48 skipping to change at page 71, line 40
o For any subset S of N1, and for each y in N2, the metric d(y,S) is o For any subset S of N1, and for each y in N2, the metric d(y,S) is
the minimum value of d1(y), if defined, and of all d(x,y) for x in the minimum value of d1(y), if defined, and of all d(x,y) for x in
N1(y) and in S. If there are no such metrics to take the minimum N1(y) and in S. If there are no such metrics to take the minimum
value of, then d(y,S) is undefined (may be considered to be value of, then d(y,S) is undefined (may be considered to be
infinite). From the final property above, d(y,N1) is defined for infinite). From the final property above, d(y,N1) is defined for
all y. all y.
18.3. MPR Properties 18.3. MPR Properties
Given a Neighbor Graph as defined in Section 18.2. an MPR Set for Given a Neighbor Graph as defined in Section 18.2, an MPR Set for
that Neighbor Graph is a subset M of the set N1 that satisfies the that Neighbor Graph is a subset M of the set N1 that satisfies the
following properties: following properties:
o If x in N1 has W(x) = WILL_ALWAYS then x is in M. o If x in N1 has W(x) = WILL_ALWAYS then x is in M.
o For any y in N2 that does not have a defined d1(y), there is at o For any y in N2 that does not have a defined d1(y), there is at
least one element in M that is also in N1(y). This is equivalent least one element in M that is also in N1(y). This is equivalent
to the requirement that d(y,M) is defined. to the requirement that d(y,M) is defined.
o For any y in N2, d(y,M) = d(y,N1). o For any y in N2, d(y,M) = d(y,N1).
skipping to change at page 70, line 31 skipping to change at page 72, line 21
have a defined d1(y). have a defined d1(y).
18.4. Flooding MPRs 18.4. Flooding MPRs
Whenever flooding MPRs are to be calculated, an implementation MUST Whenever flooding MPRs are to be calculated, an implementation MUST
determine and record a set of flooding MPRs that is equivalent to one determine and record a set of flooding MPRs that is equivalent to one
calculated as described in this section. calculated as described in this section.
The calculation of flooding MPRs need not use link metrics, or The calculation of flooding MPRs need not use link metrics, or
equivalently may use link metrics with a fixed value, here taken to equivalently may use link metrics with a fixed value, here taken to
be 1. Routers MAY make individual decisions as to whether to use be 1. However, links with unknown metric (L_out_metric =
link metrics for the calculation of flooding MPRs. A router MUST use UNKNOWN_METRIC) MUST NOT be used even if link metrics are otherwise
the same approach to the choice of whether to use link metrics for not used.
all links, i.e. in the cases indicated by a or b, the same choice
MUST be made in each case. Routers MAY make individual decisions as to whether to use link
metrics for the calculation of flooding MPRs. A router MUST use the
same approach to the choice of whether to use link metrics for all
links, i.e., in the cases indicated by A or B, the same choice MUST
be made in each case.
For each OLSRv2 interface (the "current interface") define a Neighbor For each OLSRv2 interface (the "current interface") define a Neighbor
Graph as defined in Section 18.2 according to the following: Graph as defined in Section 18.2 according to the following:
o Define a reachable Link Tuple to be a Link Tuple in the Link Set o Define a reachable Link Tuple to be a Link Tuple in the Link Set
for the current interface with L_status = SYMMETRIC. for the current interface with L_status = SYMMETRIC and
L_out_metric != UNKNOWN_METRIC.
o Define an allowed Link Tuple to be a reachable Link Tuple whose o Define an allowed Link Tuple to be a reachable Link Tuple whose
corresponding Neighbor Tuple has N_will_flooding > WILL_NEVER. corresponding Neighbor Tuple has N_will_flooding > WILL_NEVER.
o Define an allowed 2-Hop Tuple to be a 2-Hop Tuple in the 2-Hop Set o Define an allowed 2-Hop Tuple to be a 2-Hop Tuple in the 2-Hop Set
for the current interface for which there is an allowed Link Tuple for the current interface for which N2_out_metric !=
with L_neighbor_iface_addr_list = N2_neighbor_iface_addr_list. UNKNOWN_METRIC and there is an allowed Link Tuple with
L_neighbor_iface_addr_list = N2_neighbor_iface_addr_list.
o Define an element of N1 for each allowed Link Tuple. This then o Define an element of N1 for each allowed Link Tuple. This then
defines the corresponding Link Tuple for each element of N1 and defines the corresponding Link Tuple for each element of N1 and
the corresponding Neighbor Tuple for each element of N1, being the the corresponding Neighbor Tuple for each element of N1, being the
Neighbor Tuple corresponding to that Link Tuple. Neighbor Tuple corresponding to that Link Tuple.
o For each element x in N1, define W(x) := N_will_flooding of the o For each element x in N1, define W(x) := N_will_flooding of the
corresponding Neighbor Tuple. corresponding Neighbor Tuple.
o For each element x in N1, define d1(x) as either: o For each element x in N1, define d1(x) as either:
skipping to change at page 71, line 28 skipping to change at page 73, line 27
o For each element y in N2, if the corresponding address is in the o For each element y in N2, if the corresponding address is in the
N_neighbor_addr_list of a Neighbor Tuple that corresponds to one N_neighbor_addr_list of a Neighbor Tuple that corresponds to one
or more reachable Link Tuples, then define d1(y) as either: or more reachable Link Tuples, then define d1(y) as either:
A. the minimum value of the L_out_metric of those Link Tuples, A. the minimum value of the L_out_metric of those Link Tuples,
OR; OR;
B. 1. B. 1.
Otherwise d1(y) is not defined. In the latter case, where d1(y) : Otherwise d1(y) is not defined. In the latter case, where d1(y)
=1, all such y in N2 may instead be removed from N2. := 1, all such y in N2 may instead be removed from N2.
o For each element x in N1, define N2(x) as the set of elements y in o For each element x in N1, define N2(x) as the set of elements y in
N2 whose corresponding address is the N2_2hop_addr of an allowed N2 whose corresponding address is the N2_2hop_addr of an allowed
2-Hop Tuple that has N2_neighbor_iface_addr_list = 2-Hop Tuple that has N2_neighbor_iface_addr_list =
L_neighbor_iface_addr_list of the Link Tuple corresponding to x. L_neighbor_iface_addr_list of the Link Tuple corresponding to x.
For all such x and y, define d2(x,y) as either: For all such x and y, define d2(x,y) as either:
A. N2_out_metric of that 2-Hop Tuple; A. N2_out_metric of that 2-Hop Tuple, OR;
B. 1. B. 1.
It is up to the implementer to decide how to label each element of N1 It is up to an implementation to decide how to label each element of
or N2. For example an element of N1 may be labeled with one or more N1 or N2. For example an element of N1 may be labeled with one or
addresses from the corresponding L_neighbor_iface_addr_list, or with more addresses from the corresponding L_neighbor_iface_addr_list, or
a pointer or reference to the corresponding Link Tuple. with a pointer or reference to the corresponding Link Tuple.
Using these Neighbor Graphs, flooding MPRs are selected and recorded Using these Neighbor Graphs, flooding MPRs are selected and recorded
by: by:
o For each OLSRv2 interface, determine an MPR Set as specified in o For each OLSRv2 interface, determine an MPR Set as specified in
Section 18.3. Section 18.3.
o A Neighbor Tuple represents a flooding MPR and has N_flooding_mpr o A Neighbor Tuple represents a flooding MPR and has N_flooding_mpr
:= true (otherwise N_flooding_mpr := false) if and only if that := true (otherwise N_flooding_mpr := false) if and only if that
Neighbor Tuple corresponds to an element in an MPR Set created for Neighbor Tuple corresponds to an element in an MPR Set created for
skipping to change at page 72, line 32 skipping to change at page 74, line 29
18.5. Routing MPRs 18.5. Routing MPRs
Whenever routing MPRs are to be calculated, an implementation MUST Whenever routing MPRs are to be calculated, an implementation MUST
determine and record a set of routing MPRs that is equivalent to one determine and record a set of routing MPRs that is equivalent to one
calculated as described in this section. calculated as described in this section.
Define a single Neighbor Graph as defined in Section 18.2 according Define a single Neighbor Graph as defined in Section 18.2 according
to the following: to the following:
o Define a reachable Neighbor Tuple to be a Neighbor Tuple with o Define a reachable Neighbor Tuple to be a Neighbor Tuple with
N_symmetric = true. N_symmetric = true and N_in_metric != UNKNOWN_METRIC.
o Define an allowed Neighbor Tuple to be a reachable Neighbor Tuple o Define an allowed Neighbor Tuple to be a reachable Neighbor Tuple
with N_will_routing > WILL_NEVER. with N_will_routing > WILL_NEVER.
o Define an allowed 2-Hop Tuple to be a 2-Hop Tuple in the 2-Hop Set o Define an allowed 2-Hop Tuple to be a 2-Hop Tuple in the 2-Hop Set
for any OLSRv2 interface for which there is an allowed Neighbor for any OLSRv2 interface with N2_in_metric != UNKNOWN_METRIC and
Tuple with N_neighbor_addr_list containing for which there is an allowed Neighbor Tuple with
N2_neighbor_iface_addr_list. N_neighbor_addr_list containing N2_neighbor_iface_addr_list.
o Define an element of N1 for each allowed Neighbor Tuple. This o Define an element of N1 for each allowed Neighbor Tuple. This
then defines the corresponding Neighbor Tuple for each element of then defines the corresponding Neighbor Tuple for each element of
N1. N1.
o For each element x in N1, define W(x) := N_will_routing of the o For each element x in N1, define W(x) := N_will_routing of the
corresponding Neighbor Tuple. corresponding Neighbor Tuple.
o For each element x in N1, define d1(x) := N_in_metric of the o For each element x in N1, define d1(x) := N_in_metric of the
corresponding Neighbor Tuple. corresponding Neighbor Tuple.
skipping to change at page 73, line 21 skipping to change at page 75, line 17
d1(y) to be the N_in_metric of that Neighbor Tuple, otherwise d1(y) to be the N_in_metric of that Neighbor Tuple, otherwise
d1(y) is not defined. d1(y) is not defined.
o For each element x in N1, define N2(x) as the set of elements y in o For each element x in N1, define N2(x) as the set of elements y in
N2 whose corresponding address is the N2_2hop_addr of an allowed N2 whose corresponding address is the N2_2hop_addr of an allowed
2-Hop Tuple that has N2_neighbor_iface_addr_list contained in 2-Hop Tuple that has N2_neighbor_iface_addr_list contained in
N_neighbor_addr_list of the Neighbor Tuple corresponding to x. N_neighbor_addr_list of the Neighbor Tuple corresponding to x.
For all such x and y, define d2(x,y) := N2_out_metric of that For all such x and y, define d2(x,y) := N2_out_metric of that
2-Hop Tuple. 2-Hop Tuple.
It is up to the implementer to decide how to label each element of N1 It is up to an implementation to decide how to label each element of
or N2. For example an element of N1 may be labeled with one or more N1 or N2. For example an element of N1 may be labeled with one or
addresses from the corresponding N_neighbor_addr_list, or with a more addresses from the corresponding N_neighbor_addr_list, or with a
pointer or reference to the corresponding Neighbor Tuple. pointer or reference to the corresponding Neighbor Tuple.
Using these Neighbor Graphs, routing MPRs are selected and recorded Using these Neighbor Graphs, routing MPRs are selected and recorded
by: according to the following:
o Determine an MPR Set as specified in Section 18.3 o Determine an MPR Set as specified in Section 18.3.
o A Neighbor Tuple represents a routing MPR and has N_routing_mpr := o A Neighbor Tuple represents a routing MPR and has N_routing_mpr :=
true (otherwise N_routing_mpr := false) if and only if that true (otherwise N_routing_mpr := false) if and only if that
Neighbor Tuple corresponds to an element in the MPR Set created as Neighbor Tuple corresponds to an element in the MPR Set created as
described above. described above.
18.6. Calculating MPRs 18.6. Calculating MPRs
A router MUST recalculate each of its sets of MPRs whenever the A router MUST recalculate each of its sets of MPRs whenever the
currently selected set of MPRs does not still satisfy the required currently selected set of MPRs does not still satisfy the required
skipping to change at page 74, line 5 skipping to change at page 75, line 50
19. Routing Set Calculation 19. Routing Set Calculation
The Routing Set of a router is populated with Routing Tuples that The Routing Set of a router is populated with Routing Tuples that
represent paths from that router to all destinations in the network. represent paths from that router to all destinations in the network.
These paths are calculated based on the Network Topology Graph, which These paths are calculated based on the Network Topology Graph, which
is constructed from information in the Information Bases, obtained is constructed from information in the Information Bases, obtained
via HELLO and TC message exchange. via HELLO and TC message exchange.
Changes to the Routing Set do not require any messages to be Changes to the Routing Set do not require any messages to be
transmitted. The state of the Routing Set SHOULD, however, be transmitted. The state of the Routing Set SHOULD, however, be
reflected in IP's routing table by adding and removing entries from reflected in the IP routing table by adding and removing entries from
IP's routing table as appropriate. Only appropriate Routing Tuples that routing table as appropriate. Only appropriate Routing Tuples
(in particular only those that represent local links or paths to (in particular only those that represent local links or paths to
routable addresses) need be reflected in IP's routing table. routable addresses) need be reflected in the IP routing table.
19.1. Network Topology Graph 19.1. Network Topology Graph
The Network Topology Graph is formed from information from the The Network Topology Graph is formed from information from the
router's Local Interface Set, Link Sets, Neighbor Set, Router router's Local Interface Set, Link Sets for OLSRv2 interfaces,
Topology Set, Routable Address Topology Set and Attached Network Set. Neighbor Set, Router Topology Set, Routable Address Topology Set and
The Network Topology Graph MAY also use information from the router's Attached Network Set. The Network Topology Graph MAY also use
2-Hop Sets. The Network Topology Graph forms the router's information from the router's 2-Hop Sets for OLSRv2 interfaces. The
topological view of the network in form of a directed graph. Each Network Topology Graph forms the router's topological view of the
edge in that graph has a metric value. The Network Topology Graph network in form of a directed graph. Each edge in that graph has a
has a "backbone" (within which minimum total metric routes will be metric value. The Network Topology Graph has a "backbone" (within
constructed) containing the following edges: which minimum total metric routes will be constructed) containing the
following edges:
o Edges X -> Y for all possible Y, and one X per Y, such that: o Edges X -> Y for all possible Y, and one X per Y, such that:
* Y is the N_orig_addr of a Neighbor Tuple, AND; * Y is the N_orig_addr of a Neighbor Tuple; AND
* N_orig_addr is not unknown; * N_orig_addr is not unknown;
* X is in the I_local_iface_addr_list of a Local Interface Tuple, * X is in the I_local_iface_addr_list of a Local Interface Tuple;
AND; AND
* There is a Link Tuple with L_status = SYMMETRIC such that this * There is a Link Tuple with L_status = SYMMETRIC and
Neighbor Tuple and this Local Interface Tuple correspond to it. L_out_metric != UNKNOWN_METRIC such that this Neighbor Tuple
A network address from L_neighbor_iface_addr_list will be and this Local Interface Tuple correspond to it. A network
denoted R in this case. address from L_neighbor_iface_addr_list will be denoted R in
this case.
It SHOULD be preferred, where possible, to select R = S and X from It SHOULD be preferred, where possible, to select R = S and X from
the Local Interface Tuple corresponding to the Link Tuple from the Local Interface Tuple corresponding to the Link Tuple from
which R was selected. The metric such an edge is the which R was selected. The metric for such an edge is the
corresponding N_out_metric. corresponding N_out_metric.
o All edges W -> U such that: o All edges W -> U such that:
* W is the TR_from_orig_addr of a Router Topology Tuple, AND; * W is the TR_from_orig_addr of a Router Topology Tuple; AND
* U is the TR_to_orig_addr of the same Router Topology Tuple. * U is the TR_to_orig_addr of the same Router Topology Tuple.
The metric of such an edge is the corresponding TR_metric. The metric of such an edge is the corresponding TR_metric.
The Network Topology Graph is further "decorated" with the following The Network Topology Graph is further "decorated" with the following
edges. If a network address S, V, Z or T equals a network address Y edges. If a network address S, V, Z or T equals a network address Y
or W, then the edge terminating in the network address S, V, Z or T or W, then the edge terminating in the network address S, V, Z or T
MUST NOT be used in any path. MUST NOT be used in any path.
o Edges X -> S for all possible S, and one X per S, such that: o Edges X -> S for all possible S, and one X per S, such that:
* S is in the N_neighbor_addr_list of a Neighbor Tuple, AND; * S is in the N_neighbor_addr_list of a Neighbor Tuple; AND
* X is in the I_local_iface_addr_list of a Local Interface Tuple, * X is in the I_local_iface_addr_list of a Local Interface Tuple;
AND; AND
* There is a Link Tuple with L_status = SYMMETRIC such that this * There is a Link Tuple with L_status = SYMMETRIC and
Neighbor Tuple and this Local Interface Tuple correspond to it. L_out_metric != UNKNOWN_METRIC such that this Neighbor Tuple
A network address from L_neighbor_iface_addr_list will be and this Local Interface Tuple correspond to it. A network
denoted R in this case. address from L_neighbor_iface_addr_list will be denoted R in
this case.
It SHOULD be preferred, where possible, to select R = S and X from It SHOULD be preferred, where possible, to select R = S and X from
the Local Interface Tuple corresponding to the Link Tuple from the Local Interface Tuple corresponding to the Link Tuple from
which R was selected. The metric of such an edge is the which R was selected. The metric for such an edge is the
corresponding N_out_metric. corresponding N_out_metric.
o All edges W -> V such that: o All edges W -> V such that:
* W is the TA_from_orig_addr of a Routable Address Topology * W is the TA_from_orig_addr of a Routable Address Topology
Tuple, AND; Tuple; AND
* V is the TA_dest_addr of the same Routable Address Topology * V is the TA_dest_addr of the same Routable Address Topology
Tuple. Tuple.
The metric for such an edge is the corresponding TA_metric. The metric for such an edge is the corresponding TA_metric.
o All edges W -> T such that: o All edges W -> T such that:
* W is the AN_orig_addr of an Attached Network Tuple, AND; * W is the AN_orig_addr of an Attached Network Tuple; AND
* T is the AN_net_addr of the same Attached Network Tuple. * T is the AN_net_addr of the same Attached Network Tuple.
The metric for such an edge is the corresponding AN_metric. The metric for such an edge is the corresponding AN_metric.
o OPTIONALLY, all edges Y -> Z such that: o (OPTIONAL) All edges Y -> Z such that:
* Z is a routable address and is the N2_2hop_addr of a 2-Hop * Z is a routable address and is the N2_2hop_addr of a 2-Hop
Tuple, AND; Tuple with N2_out_metric != UNKNOWN_METRIC; AND
* Y is the N_orig_addr of the corresponding Neighbor Tuple, AND; * Y is the N_orig_addr of the corresponding Neighbor Tuple; AND
* This Neighbor Tuple has N_will_routing not equal to WILL_NEVER. * This Neighbor Tuple has N_will_routing not equal to WILL_NEVER.
A path terminating with such an edge SHOULD NOT be used in A path terminating with such an edge MUST NOT be used in
preference to any other path. The metric for such an edge is the preference to any other path. The metric for such an edge is the
corresponding N2_out_metric. corresponding N2_out_metric.
Any part of the Topology Graph which is not connected to a local Any part of the Topology Graph which is not connected to a local
network address X is not used. Only one selection X SHOULD be made network address X is not used. Only one selection X SHOULD be made
from each I_local_iface_addr_list, and only one selection R SHOULD be from each I_local_iface_addr_list, and only one selection R SHOULD be
made from any L_neighbor_iface_addr_list. All edges have a hop count made from any L_neighbor_iface_addr_list. All edges have a hop count
of 1, except edges W -> T that have a hop count of the corresponding of 1, except edges W -> T that have a hop count of the corresponding
value of AN_dist. value of AN_dist.
skipping to change at page 76, line 41 skipping to change at page 78, line 40
S or X -> Y, by: S or X -> Y, by:
o R_local_iface_addr := X; o R_local_iface_addr := X;
o R_next_iface_addr := R; o R_next_iface_addr := R;
o R_dest_addr := S or Y; o R_dest_addr := S or Y;
o R_dist := 1; o R_dist := 1;
o R_metric := edge metric. o R_metric := edge metric,
where R is as defined in Section 19.1 for these types of edges. where R is as defined in Section 19.1 for these types of edges.
The second type will represent a multiple edge path, which will The second type will represent a multiple edge path, which will
always have first edge of type X -> Y, and will have final edge of always have first edge of type X -> Y, and will have final edge of
type W -> U, W -> V, W -> T or Y -> Z. The Routing Tuple will be: type W -> U, W -> V, W -> T or Y -> Z. The Routing Tuple will be:
o R_local_iface_addr := X; o R_local_iface_addr := X;
o R_next_iface_addr := Y;
o R_next_iface_addr := Y;
o R_dest_addr := U, V, T or Z; o R_dest_addr := U, V, T or Z;
o R_dist := the total hop count of all edges in the path; o R_dist := the total hop count of all edges in the path;
o R_metric := the total metric of all edges in the path. o R_metric := the total metric of all edges in the path.
Finally, Routing Tuples of the second type whose R_dest_addr is not Finally, Routing Tuples of the second type whose R_dest_addr is not
routable MAY be discarded. routable MAY be discarded.
An example algorithm for calculating the Routing Set of a router is An example algorithm for calculating the Routing Set of a router is
skipping to change at page 78, line 20 skipping to change at page 80, line 19
o TT_MAXJITTER := HT_MAXJITTER o TT_MAXJITTER := HT_MAXJITTER
o F_MAXJITTER := TT_MAXJITTER o F_MAXJITTER := TT_MAXJITTER
20.6. Hop Limit Parameter 20.6. Hop Limit Parameter
o TC_HOP_LIMIT := 255 o TC_HOP_LIMIT := 255
20.7. Willingness Parameter 20.7. Willingness Parameter
o WILLINGNESS := WILL_DEFAULT o WILL_FLOODING := WILL_DEFAULT
o WILL_ROUTING := WILL_DEFAULT
21. Sequence Numbers 21. Sequence Numbers
Sequence numbers are used in this specification for the purpose of Sequence numbers are used in this specification for the purpose of
discarding "old" information, i.e., messages received out of order. discarding "old" information, i.e., messages received out of order.
However with a limited number of bits for representing sequence However with a limited number of bits for representing sequence
numbers, wrap-around (that the sequence number is incremented from numbers, wrap-around (that the sequence number is incremented from
the maximum possible value to zero) will occur. To prevent this from the maximum possible value to zero) will occur. To prevent this from
interfering with the operation of this protocol, the following MUST interfering with the operation of this protocol, the following MUST
be observed when determining the ordering of sequence numbers. be observed when determining the ordering of sequence numbers.
skipping to change at page 79, line 27 skipping to change at page 81, line 27
transmitted over any OLSRv2 interface, and to add information to transmitted over any OLSRv2 interface, and to add information to
it as specified in [RFC5444]. This MAY include Message TLVs it as specified in [RFC5444]. This MAY include Message TLVs
and/or network addresses with associated Address Block TLVs. and/or network addresses with associated Address Block TLVs.
(Network addresses without new associated TLVs SHOULD NOT be added (Network addresses without new associated TLVs SHOULD NOT be added
to messages.) This may, for example, be to allow a security to messages.) This may, for example, be to allow a security
protocol, as suggested in Section 23, to add a TLV containing a protocol, as suggested in Section 23, to add a TLV containing a
cryptographic signature to the message. cryptographic signature to the message.
o Through accessing an incoming message, and potentially discarding o Through accessing an incoming message, and potentially discarding
it prior to processing by this protocol. This may, for example, it prior to processing by this protocol. This may, for example,
allow a security protocol as suggested in Section 23 to perform allow a security protocol, as suggested in Section 23, to perform
verification of message signatures and prevent processing and/or verification of message signatures and prevent processing and/or
forwarding of unverifiable messages by this protocol. forwarding of unverifiable messages by this protocol.
o Through accessing an incoming message after it has been completely o Through accessing an incoming message after it has been completely
processed by this protocol. This may, in particular, allow a processed by this protocol. In particular, this may allow a
protocol which has added information, by way of inclusion of protocol which has added information, by way of inclusion of
appropriate TLVs, or of network addresses associated with new appropriate TLVs, or of network addresses associated with new
TLVs, access to such information after appropriate updates have TLVs, access to such information after appropriate updates have
been recorded in the Information Bases in this protocol. been recorded in the Information Bases in this protocol.
o Through requesting that a message be generated at a specific time. o Through requesting that a message be generated at a specific time.
In that case, message generation MUST still respect the In that case, message generation MUST still respect the
constraints in [RFC6130] and Section 5.4.3. constraints in [RFC6130] and Section 5.4.3.
23. Security Considerations 23. Security Considerations
skipping to change at page 80, line 24 skipping to change at page 82, line 24
23.2. Integrity 23.2. Integrity
Each router is injecting topological information into the network Each router is injecting topological information into the network
through transmitting HELLO messages and, for some routers, TC through transmitting HELLO messages and, for some routers, TC
messages. If some routers for some reason, malicious or malfunction, messages. If some routers for some reason, malicious or malfunction,
inject invalid control traffic, network integrity may be compromised. inject invalid control traffic, network integrity may be compromised.
Therefore, message authentication is recommended. Therefore, message authentication is recommended.
Different such situations may occur, for instance: Different such situations may occur, for instance:
1. a router generates TC messages, advertising links to non-neighbor 1. A router generates TC messages, advertising links to non-neighbor
routers; routers;
2. a router generates TC messages, pretending to be another router; 2. A router generates TC messages, pretending to be another router;
3. a router generates HELLO messages, advertising non-neighbor 3. A router generates HELLO messages, advertising non-neighbor
routers; routers;
4. a router generates HELLO messages, pretending to be another 4. A router generates HELLO messages, pretending to be another
router; router;
5. a router forwards altered control messages; 5. A router forwards altered control messages;
6. a router does not forward control messages; 6. A router does not forward control messages;
7. a router does not select multipoint relays correctly; 7. A router does not select multipoint relays correctly;
8. a router forwards broadcast control messages unaltered, but does 8. A router forwards broadcast control messages unaltered, but does
not forward unicast data traffic; not forward unicast data traffic;
9. a router "replays" previously recorded control traffic from 9. A router "replays" previously recorded control traffic from
another router. another router.
Authentication of the originator router for control messages (for Authentication of the originator router for control messages (for
situations 2, 4 and 5) and on the individual links announced in the situations 2, 4 and 5) and on the individual links announced in the
control messages (for situations 1 and 3) may be used as a control messages (for situations 1 and 3) may be used as a
countermeasure. However to prevent routers from repeating old (and countermeasure. However to prevent routers from repeating old (and
correctly authenticated) information (situation 9) temporal correctly authenticated) information (situation 9) temporal
information is required, allowing a router to positively identify information is required, allowing a router to positively identify
such delayed messages. such delayed messages.
In general, digital signatures and other required security In general, digital signatures and other required security
information may be transmitted as a separate Message Type, or information may be transmitted as a separate Message Type, or
signatures and security information may be transmitted within the signatures and security information may be transmitted within the
HELLO and TC messages, using the TLV mechanism. Either option HELLO and TC messages, using the TLV mechanism. Either option
permits that "secured" and "unsecured" routers can coexist in the permits that "secured" and "unsecured" routers can coexist in the
same network, if desired, same network, if desired.
Specifically, the authenticity of entire control packets can be Specifically, the authenticity of entire control packets can be
established through employing IPsec authentication headers, whereas established through employing IPsec authentication headers, whereas
authenticity of individual links (situations 1 and 3) require authenticity of individual links (situations 1 and 3) require
additional security information to be distributed. additional security information to be distributed.
An important consideration is that all control messages are An important consideration is that all control messages (HELLO
transmitted either to all routers in the neighborhood (HELLO messages and TC messages) are transmitted to all routers in the 1-hop
messages) or broadcast to all routers in the network (TC messages). neighborhood and some (TC messages) are flooded to all routers in the
network.
For example, a control message in this protocol is always a point-to- Thus, a control message in this protocol is always a point-to-
multipoint transmission. It is therefore important that the multipoint transmission. It is therefore important that the
authentication mechanism employed permits that any receiving router authentication mechanism employed permits that any receiving router
can validate the authenticity of a message. As an analogy, given a can validate the authenticity of a message. As an analogy, given a
block of text, signed by a PGP private key, then anyone with the block of text, signed by a PGP private key, then anyone with the
corresponding public key can verify the authenticity of the text. corresponding public key can verify the authenticity of the text.
23.3. Interaction with External Routing Domains 23.3. Interaction with External Routing Domains
This protocol does, through the use of TC messages, provide a basic This protocol does, through the use of TC messages, provide a basic
mechanism for injecting external routing information to this mechanism for injecting external routing information to this
skipping to change at page 83, line 36 skipping to change at page 85, line 38
+-------------+------+-----------+---------------------+------------+ +-------------+------+-----------+---------------------+------------+
| MPR_WILLING | TBD2 | 0 | Bits 0-3 specify | | | MPR_WILLING | TBD2 | 0 | Bits 0-3 specify | |
| | | | the originating | | | | | | the originating | |
| | | | router's | | | | | | router's | |
| | | | willingness to act | | | | | | willingness to act | |
| | | | as a flooding MPR; | | | | | | as a flooding MPR; | |
| | | | bits 4-7 specify | | | | | | bits 4-7 specify | |
| | | | the originating | | | | | | the originating | |
| | | | router's | | | | | | router's | |
| | | | willingness to act | | | | | | willingness to act | |
| | | | as a routing MPR | | | | | | as a routing MPR. | |
| MPR_WILLING | TBD2 | 1-255 | Unassigned | Expert | | MPR_WILLING | TBD2 | 1-255 | Unassigned. | Expert |
| | | | | Review | | | | | | Review |
+-------------+------+-----------+---------------------+------------+ +-------------+------+-----------+---------------------+------------+
Table 11: Message TLV Type assignment: MPR_WILLING Table 11: Message TLV Type assignment: MPR_WILLING
+--------------+------+-----------+--------------------+------------+ +--------------+------+-----------+--------------------+------------+
| Name | Type | Type | Description | Allocation | | Name | Type | Type | Description | Allocation |
| | | Extension | | Policy | | | | Extension | | Policy |
+--------------+------+-----------+--------------------+------------+ +--------------+------+-----------+--------------------+------------+
| CONT_SEQ_NUM | TBD3 | 0 | COMPLETE : | | | CONT_SEQ_NUM | TBD3 | 0 | COMPLETE: | |
| | | | Specifies a | | | | | | Specifies a | |
| | | | content sequence | | | | | | content sequence | |
| | | | number for this | | | | | | number for this | |
| | | | complete message | | | | | | complete message. | |
| CONT_SEQ_NUM | TBD3 | 1 | INCOMPLETE : | | | CONT_SEQ_NUM | TBD3 | 1 | INCOMPLETE: | |
| | | | Specifies a | | | | | | Specifies a | |
| | | | content sequence | | | | | | content sequence | |
| | | | number for this | | | | | | number for this | |
| | | | incomplete message | | | | | | incomplete | |
| CONT_SEQ_NUM | TBD3 | 2-255 | Unassigned | Expert | | | | | message. | |
| CONT_SEQ_NUM | TBD3 | 2-255 | Unassigned. | Expert |
| | | | | Review | | | | | | Review |
+--------------+------+-----------+--------------------+------------+ +--------------+------+-----------+--------------------+------------+
Table 12: Message TLV Type assignment: CONT_SEQ_NUM Table 12: Message TLV Type assignment: CONT_SEQ_NUM
Type extensions indicated as Expert Review SHOULD be allocated as Type extensions indicated as Expert Review SHOULD be allocated as
described in [RFC5444], based on Expert Review as defined in described in [RFC5444], based on Expert Review as defined in
[RFC5226]. [RFC5226].
24.5. Address Block TLV Types 24.5. Address Block TLV Types
skipping to change at page 84, line 45 skipping to change at page 86, line 46
with assignments as specified in Table 13, Table 14, Table 15 and with assignments as specified in Table 13, Table 14, Table 15 and
Table 16. Specifications of these TLVs are in Section 13.3.2. Table 16. Specifications of these TLVs are in Section 13.3.2.
+-------------+------+-----------+-------------------+--------------+ +-------------+------+-----------+-------------------+--------------+
| Name | Type | Type | Description | Allocation | | Name | Type | Type | Description | Allocation |
| | | Extension | | Policy | | | | Extension | | Policy |
+-------------+------+-----------+-------------------+--------------+ +-------------+------+-----------+-------------------+--------------+
| LINK_METRIC | TBD4 | 0 | Link metric | | | LINK_METRIC | TBD4 | 0 | Link metric | |
| | | | meaning assigned | | | | | | meaning assigned | |
| | | | by administrative | | | | | | by administrative | |
| | | | action | | | | | | action. | |
| LINK_METRIC | TBD4 | 1-223 | Unassigned | Expert | | LINK_METRIC | TBD4 | 1-223 | Unassigned. | Expert |
| | | | | Review | | | | | | Review |
| LINK_METRIC | TBD4 | 224-255 | Unassigned | Experimental | | LINK_METRIC | TBD4 | 224-255 | Unassigned. | Experimental |
| | | | | Use | | | | | | Use |
+-------------+------+-----------+-------------------+--------------+ +-------------+------+-----------+-------------------+--------------+
Table 13: Address Block TLV Type assignment: LINK_METRIC Table 13: Address Block TLV Type assignment: LINK_METRIC
All LINK_METRIC TLVs, whatever their type extension, MUST use their All LINK_METRIC TLVs, whatever their type extension, MUST use their
value field to encode the kind and value (in the interval value field to encode the kind and value (in the interval
MINIMUM_METRIC, to MAXIMUM_METRIC, inclusive) of a link metric as MINIMUM_METRIC, to MAXIMUM_METRIC, inclusive) of a link metric as
specified in Section 6 and Section 13.3.2. An assignment of a specified in Section 6 and Section 13.3.2. An assignment of a
LINK_METRIC TLV type extension MUST specify the physical meaning, and LINK_METRIC TLV type extension MUST specify the physical meaning, and
mapping of that physical meaning to the representable values in the mapping of that physical meaning to the representable values in the
indicated interval, of the link metric. indicated interval, of the link metric.
skipping to change at page 85, line 25 skipping to change at page 87, line 26
| | | Extension | | Policy | | | | Extension | | Policy |
+------+------+-----------+----------------------------+------------+ +------+------+-----------+----------------------------+------------+
| MPR | TBD5 | 0 | Specifies that a given | | | MPR | TBD5 | 0 | Specifies that a given | |
| | | | network address is of a | | | | | | network address is of a | |
| | | | router selected as a | | | | | | router selected as a | |
| | | | flooding MPR (FLOODING = | | | | | | flooding MPR (FLOODING = | |
| | | | 1), that a given network | | | | | | 1), that a given network | |
| | | | address is of a router | | | | | | address is of a router | |
| | | | selected as a routing MPR | | | | | | selected as a routing MPR | |
| | | | (ROUTING = 2), or both | | | | | | (ROUTING = 2), or both | |
| | | | (FLOOD_ROUTE = 3) | | | | | | (FLOOD_ROUTE = 3). | |
| MPR | TBD5 | 1-255 | Unassigned | Expert | | MPR | TBD5 | 1-255 | Unassigned. | Expert |
| | | | | Review | | | | | | Review |
+------+------+-----------+----------------------------+------------+ +------+------+-----------+----------------------------+------------+
Table 14: Address Block TLV Type assignment: MPR Table 14: Address Block TLV Type assignment: MPR
+---------------+------+-----------+-------------------+------------+ +---------------+------+-----------+-------------------+------------+
| Name | Type | Type | Description | Allocation | | Name | Type | Type | Description | Allocation |
| | | Extension | | Policy | | | | Extension | | Policy |
+---------------+------+-----------+-------------------+------------+ +---------------+------+-----------+-------------------+------------+
| NBR_ADDR_TYPE | TBD6 | 0 | Specifies that a | | | NBR_ADDR_TYPE | TBD6 | 0 | Specifies that a | |
skipping to change at page 86, line 24 skipping to change at page 88, line 24
| | | | originating | | | | | | originating | |
| | | | router, if it is | | | | | | router, if it is | |
| | | | an originator | | | | | | an originator | |
| | | | address | | | | | | address | |
| | | | (ORIGINATOR = 1), | | | | | | (ORIGINATOR = 1), | |
| | | | is a routable | | | | | | is a routable | |
| | | | address (ROUTABLE | | | | | | address (ROUTABLE | |
| | | | = 2), or if it is | | | | | | = 2), or if it is | |
| | | | both | | | | | | both | |
| | | | (ROUTABLE_ORIG = | | | | | | (ROUTABLE_ORIG = | |
| | | | 3) | | | | | | 3). | |
| NBR_ADDR_TYPE | TBD6 | 1-255 | Unassigned | Expert | | NBR_ADDR_TYPE | TBD6 | 1-255 | Unassigned. | Expert |
| | | | | Review | | | | | | Review |
+---------------+------+-----------+-------------------+------------+ +---------------+------+-----------+-------------------+------------+
Table 15: Address Block TLV Type assignment: NBR_ADDR_TYPE Table 15: Address Block TLV Type assignment: NBR_ADDR_TYPE
+---------+------+-----------+-------------------------+------------+ +---------+------+-----------+-------------------------+------------+
| Name | Type | Type | Description | Allocation | | Name | Type | Type | Description | Allocation |
| | | extension | | Policy | | | | extension | | Policy |
+---------+------+-----------+-------------------------+------------+ +---------+------+-----------+-------------------------+------------+
| GATEWAY | TBD7 | 0 | Specifies that a given | | | GATEWAY | TBD7 | 0 | Specifies that a given | |
| | | | network address is | | | | | | network address is | |
| | | | reached via a gateway | | | | | | reached via a gateway | |
| | | | on the originating | | | | | | on the originating | |
| | | | router, with value | | | | | | router, with value | |
| | | | equal to the number of | | | | | | equal to the number of | |
| | | | hops | | | | | | hops. | |
| GATEWAY | TBD7 | 1-255 | | Expert | | GATEWAY | TBD7 | 1-255 | | Expert |
| | | | | Review | | | | | | Review |
+---------+------+-----------+-------------------------+------------+ +---------+------+-----------+-------------------------+------------+
Table 16: Address Block TLV Type assignment: GATEWAY Table 16: Address Block TLV Type assignment: GATEWAY
Type extensions indicated as Expert Review SHOULD be allocated as Type extensions indicated as Expert Review SHOULD be allocated as
described in [RFC5444], based on Expert Review as defined in described in [RFC5444], based on Expert Review as defined in
[RFC5226]. [RFC5226].
skipping to change at page 87, line 46 skipping to change at page 89, line 46
o Emmanuel Baccelli, INRIA , France, <Emmanuel.Baccelli@inria.fr> o Emmanuel Baccelli, INRIA , France, <Emmanuel.Baccelli@inria.fr>
o Thomas Heide Clausen, LIX, France, <T.Clausen@computer.org> o Thomas Heide Clausen, LIX, France, <T.Clausen@computer.org>
o Justin Dean, NRL, USA, <jdean@itd.nrl.navy.mil> o Justin Dean, NRL, USA, <jdean@itd.nrl.navy.mil>
o Christopher Dearlove, BAE Systems, UK, o Christopher Dearlove, BAE Systems, UK,
<chris.dearlove@baesystems.com> <chris.dearlove@baesystems.com>
o Ulrich Herberg, Fujitsu Laboratories of America, USA,
<ulrich@herberg.name>
o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com> o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com>
o Philippe Jacquet, INRIA, France, <Philippe.Jacquet@inria.fr> o Philippe Jacquet, Alcatel Lucent Bell Labs, France,
<philippe.jacquet@alcatel-lucent.fr>
o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com> o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com>
o Kenichi Mase, Niigata University, Japan, <mase@ie.niigata-u.ac.jp> o Kenichi Mase, Niigata University, Japan, <mase@ie.niigata-u.ac.jp>
o Ryuji Wakikawa, Toyota, Japan, <ryuji@sfc.wide.ad.jp> o Ryuji Wakikawa, Toyota, Japan, <ryuji@sfc.wide.ad.jp>
26. Acknowledgments 26. Acknowledgments
The authors would like to acknowledge the team behind OLSRv1, The authors would like to acknowledge the team behind OLSRv1,
specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale
Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir
Qayyum (M.A. Jinnah University, Islamabad) for their contributions. Qayyum (M.A. Jinnah University, Islamabad) for their contributions.
skipping to change at page 88, line 18 skipping to change at page 90, line 21
26. Acknowledgments 26. Acknowledgments
The authors would like to acknowledge the team behind OLSRv1, The authors would like to acknowledge the team behind OLSRv1,
specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale
Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir
Qayyum (M.A. Jinnah University, Islamabad) for their contributions. Qayyum (M.A. Jinnah University, Islamabad) for their contributions.
The authors would like to gratefully acknowledge the following people The authors would like to gratefully acknowledge the following people
for intense technical discussions, early reviews and comments on the for intense technical discussions, early reviews and comments on the
specification and its components (listed alphabetically): Khaldoun Al specification and its components (listed alphabetically): Khaldoun Al
Agha (LRI), Teco Boot (Infinity Networks), Song-Yean Cho (LIX), Alan Agha (LRI), Teco Boot (Infinity Networks), Song-Yean Cho (Samsung),
Cullen (BAE Systems), Ulrich Herberg (Fujitsu), Louise Lamont (CRC), Alan Cullen (BAE Systems), Louise Lamont (CRC), Li Li (CRC), Joe
Li Li (CRC), Joe Macker (NRL), Richard Ogier (SRI), Charles E. Macker (NRL), Richard Ogier (SRI), Charles E. Perkins, Henning Rogge
Perkins (WiChorus), Henning Rogge (FGAN), and the entire IETF MANET (FGAN), and the entire IETF MANET working group.
working group.
27. References 27. References
27.1. Normative References 27.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", RFC 2119, BCP 14, March 1997. Requirement Levels", RFC 2119, BCP 14, March 1997.
[RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter [RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter
Considerations in Mobile Ad Hoc Networks (MANETs)", Considerations in Mobile Ad Hoc Networks (MANETs)",
skipping to change at page 90, line 25 skipping to change at page 92, line 25
R(x,M): R(x,M):
For an element x in N1, the number of elements y in N for which For an element x in N1, the number of elements y in N for which
d(x,y) is defined, has minimal value among the d(z,y) for all z in d(x,y) is defined, has minimal value among the d(z,y) for all z in
N1, and no such minimal values have z in M. (Note that, denoting N1, and no such minimal values have z in M. (Note that, denoting
the empty set by 0, D(x) = R(x,0).) the empty set by 0, D(x) = R(x,0).)
A.2. MPR Selection Algorithm A.2. MPR Selection Algorithm
To create the MPR Set M, starting with M := I: To create the MPR Set M, starting with M := I:
1. Add all elements x in N1 that have W(x) = WILL_ALWAYS. 1. Add all elements x in N1 that have W(x) = WILL_ALWAYS to M.
2. For each element y in N for which there is only one element x in 2. For each element y in N for which there is only one element x in
N1 such that d2(x,y) is defined, add that element x to M. N1 such that d2(x,y) is defined, add that element x to M.
3. While there exists any element x in N1 with R(x,M) > 0: 3. While there exists any element x in N1 with R(x,M) > 0:
1. Select an element x in N1 with R(x,M) > 0 in the following 1. Select an element x in N1 with R(x,M) > 0 in the following
order of priority: order of priority, and then add to M:
+ greatest W(x), THEN; + greatest W(x), THEN;
+ greatest R(x,M), THEN; + greatest R(x,M), THEN;
+ greatest D(x), THEN; + greatest D(x), THEN;
+ any choice, which MAY be based on other criteria (for + any choice, which MAY be based on other criteria (for
example a router MAY choose to prefer a neighbor as an MPR example a router MAY choose to prefer a neighbor as an MPR
if that neighbor has already selected the router as an MPR if that neighbor has already selected the router as an MPR
of the same type, MAY prefer a neighbor based on of the same type, MAY prefer a neighbor based on
information freshness, or MAY prefer a neighbor based on information freshness, or MAY prefer a neighbor based on
length of time previously selected as an MPR) or MAY be length of time previously selected as an MPR) or MAY be
random. random.
4. OPTIONALLY, consider each element x in M, but not in I, in turn 4. OPTIONAL: consider each element x in M, but not in I, in turn and
and if x can be removed from M while still leaving it satisfying if x can be removed from M while still leaving it satisfying the
the definition of an MPR Set, then remove that element x from M. definition of an MPR Set, then remove that element x from M.
Elements MAY be considered in any order, e.g. in order of Elements MAY be considered in any order, e.g., in order of
increasing W(x). increasing W(x).
Appendix B. Example Algorithm for Calculating the Routing Set Appendix B. Example Algorithm for Calculating the Routing Set
The following procedure is given as an example for calculating the The following procedure is given as an example for calculating the
Routing Set using a variation of Dijkstra's algorithm. First all Routing Set using a variation of Dijkstra's algorithm. First all
Routing Tuples are removed, and then, using the selections and Routing Tuples are removed, and then, using the selections and
definitions in Appendix B.1, the procedures in the following sections definitions in Appendix B.1, the procedures in the following sections
(each considered a "stage" of the processing) are applied in turn. (each considered a "stage" of the processing) are applied in turn.
skipping to change at page 91, line 26 skipping to change at page 93, line 26
The following selections and definitions are made: The following selections and definitions are made:
1. For each Local Interface Tuple, select a network address from its 1. For each Local Interface Tuple, select a network address from its
I_local_iface_addr_list, this is defined as the selected address I_local_iface_addr_list, this is defined as the selected address
for this Local Interface Tuple. for this Local Interface Tuple.
2. For each Link Tuple, the selected address of its corresponding 2. For each Link Tuple, the selected address of its corresponding
Local Interface Tuple is defined as the selected local address Local Interface Tuple is defined as the selected local address
for this Local Interface Tuple. for this Local Interface Tuple.
3. For each Neighbor Tuple with N_symmetric = true, select a Link 3. For each Neighbor Tuple with N_symmetric = true and N_out_metric
Tuple with L_status = SYMMETRIC for which this is the != UNKNOWN_METRIC, select a Link Tuple with L_status = SYMMETRIC
corresponding Neighbor Tuple and has L_out_metric = N_out_metric. for which this is the corresponding Neighbor Tuple and has
This is defined as the selected Link Tuple for this Neighbor L_out_metric = N_out_metric. This is defined as the selected
Tuple. Link Tuple for this Neighbor Tuple.
4. For each network address (N_orig_addr or in N_neighbor_addr_list, 4. For each network address (N_orig_addr or in N_neighbor_addr_list,
the "neighbor address") from a Neighbor Tuple with N_symmetric = the "neighbor address") from a Neighbor Tuple with N_symmetric =
true, select a Link Tuple (the "selected Link Tuple") from those true and N_out_metric != UNKNOWN_METRIC, select a Link Tuple (the
for which this is the corresponding Neighbor Tuple, have L_status "selected Link Tuple") from those for which this is the
= SYMMETRIC, and have L_out_metric = N_out_metric, by: corresponding Neighbor Tuple, have L_status = SYMMETRIC, and have
L_out_metric = N_out_metric, by:
1. If there is such a Link Tuple whose 1. If there is such a Link Tuple whose
L_neighbor_iface_addr_list contains the neighbor address, L_neighbor_iface_addr_list contains the neighbor address,
select that Link Tuple. select that Link Tuple.
2. Otherwise select the selected Link Tuple for this Neighbor 2. Otherwise select the selected Link Tuple for this Neighbor
Tuple. Tuple.
Then for this neighbor address: Then for this neighbor address:
skipping to change at page 92, line 24 skipping to change at page 94, line 27
Note that preferred Routing Tuples SHOULD be used. Routing Note that preferred Routing Tuples SHOULD be used. Routing
Tuples with minimum R_metric MUST be used, this is specified Tuples with minimum R_metric MUST be used, this is specified
outside the definition of preference. An implementation MAY outside the definition of preference. An implementation MAY
modify this definition of preference (including for minimum modify this definition of preference (including for minimum
R_dist) without otherwise affecting this algorithm. R_dist) without otherwise affecting this algorithm.
B.2. Add Neighbor Routers B.2. Add Neighbor Routers
The following procedure is executed once. The following procedure is executed once.
1. For each Neighbor Tuple with N_symmetric = true, add a Routing 1. For each Neighbor Tuple with N_symmetric = true and N_out_metric
Tuple with: != UNKNOWN_METRIC, add a Routing Tuple with:
* R_dest_addr := N_orig_addr; * R_dest_addr := N_orig_addr;
* R_next_iface_addr := selected link address for N_orig_addr; * R_next_iface_addr := selected link address for N_orig_addr;
* R_local_iface_addr := selected local address for N_orig_addr; * R_local_iface_addr := selected local address for N_orig_addr;
* R_metric := N_out_metric; * R_metric := N_out_metric;
* R_dist := 1. * R_dist := 1.
skipping to change at page 94, line 9 skipping to change at page 96, line 9
current Routing Tuple; current Routing Tuple;
- R_metric := new_metric; - R_metric := new_metric;
- R_dist := new_dist. - R_dist := new_dist.
B.4. Add Neighbor Addresses B.4. Add Neighbor Addresses
The following procedure is executed once. The following procedure is executed once.
1. For each Neighbor Tuple with N_symmetric = true: 1. For each Neighbor Tuple with N_symmetric = true and N_out_metric
!= UNKNOWN_METRIC:
1. For each network address (the "neighbor address") in 1. For each network address (the "neighbor address") in
N_neighbor_addr_list, if the neighbor address is not equal to N_neighbor_addr_list, if the neighbor address is not equal to
the R_dest_addr of any Routing Tuple, then add a new Routing the R_dest_addr of any Routing Tuple, then add a new Routing
Tuple, with: Tuple, with:
+ R_dest_addr := neighbor address; + R_dest_addr := neighbor address;
+ R_next_iface_addr := selected link address for the + R_next_iface_addr := selected link address for the
neighbor address; neighbor address;
skipping to change at page 94, line 35 skipping to change at page 96, line 36
+ R_dist := 1. + R_dist := 1.
B.5. Add Remote Routable Addresses B.5. Add Remote Routable Addresses
The following procedure is executed once. The following procedure is executed once.
1. For each Routable Address Topology Tuple, if: 1. For each Routable Address Topology Tuple, if:
* TA_dest_addr is not equal to the R_dest_addr of any Routing * TA_dest_addr is not equal to the R_dest_addr of any Routing
Tuple added in an earlier stage, AND; Tuple added in an earlier stage; AND
* TA_from_orig_addr is equal to the R_dest_addr of a Routing * TA_from_orig_addr is equal to the R_dest_addr of a Routing
Tuple (the "previous Routing Tuple"), Tuple (the "previous Routing Tuple"),
then add a new Routing Tuple, with: then add a new Routing Tuple, with:
* R_dest_addr := TA_dest_addr; * R_dest_addr := TA_dest_addr;
* R_next_iface_addr := R_next_iface_addr of the previous Routing * R_next_iface_addr := R_next_iface_addr of the previous Routing
Tuple; Tuple;
skipping to change at page 95, line 20 skipping to change at page 97, line 20
selected, otherwise a Routing Tuple which is preferred SHOULD be selected, otherwise a Routing Tuple which is preferred SHOULD be
added. added.
B.6. Add Attached Networks B.6. Add Attached Networks
The following procedure is executed once. The following procedure is executed once.
1. For each Attached Network Tuple, if: 1. For each Attached Network Tuple, if:
* AN_net_addr is not equal to the R_dest_addr of any Routing * AN_net_addr is not equal to the R_dest_addr of any Routing
Tuple added in an earlier stage, AND; Tuple added in an earlier stage; AND
* AN_orig_addr is equal to the R_dest_addr of a Routing Tuple * AN_orig_addr is equal to the R_dest_addr of a Routing Tuple
(the "previous Routing Tuple), (the "previous Routing Tuple),
then add a new Routing Tuple, with: then add a new Routing Tuple, with:
* R_dest_addr := AN_net_addr; * R_dest_addr := AN_net_addr;
* R_next_iface_addr := R_next_iface_addr of the previous Routing * R_next_iface_addr := R_next_iface_addr of the previous Routing
Tuple; Tuple;
skipping to change at page 95, line 50 skipping to change at page 97, line 50
There may be more than one Routing Tuple that may be added for an There may be more than one Routing Tuple that may be added for an
R_dest_addr in this stage. If so, then, for each such R_dest_addr in this stage. If so, then, for each such
R_dest_addr, a Routing Tuple with minimum R_metric MUST be R_dest_addr, a Routing Tuple with minimum R_metric MUST be
selected, otherwise a Routing Tuple which is preferred SHOULD be selected, otherwise a Routing Tuple which is preferred SHOULD be
added. added.
B.7. Add 2-Hop Neighbors B.7. Add 2-Hop Neighbors
The following procedure is executed once. The following procedure is executed once.
1. For each 2-Hop Tuple, if: 1. For each 2-Hop Tuple with N2_out_metric != UNKNOWN_METRIC, if:
* N2_2hop_addr is a routable address, AND; * N2_2hop_addr is a routable address; AND
* N2_2hop_addr is not equal to the R_dest_addr of any Routing * N2_2hop_addr is not equal to the R_dest_addr of any Routing
Tuple added in an earlier stage, AND; Tuple added in an earlier stage; AND
* the Routing Tuple with R_dest_addr = N_orig_addr of the * the Routing Tuple with R_dest_addr = N_orig_addr of the
corresponding Neighbor Tuple (the "previous Routing Tuple") corresponding Neighbor Tuple (the "previous Routing Tuple")
has R_dist = 1, has R_dist = 1,
then add a new Routing Tuple, with: then add a new Routing Tuple, with:
* R_dest_addr := N2_2hop_addr; * R_dest_addr := N2_2hop_addr;
* R_next_iface_addr := R_next_iface_addr of the previous Routing * R_next_iface_addr := R_next_iface_addr of the previous Routing
skipping to change at page 96, line 38 skipping to change at page 98, line 38
There may be more than one Routing Tuple that may be added for an There may be more than one Routing Tuple that may be added for an
R_dest_addr in this stage. If so, then, for each such R_dest_addr in this stage. If so, then, for each such
R_dest_addr, a Routing Tuple with minimum R_metric MUST be R_dest_addr, a Routing Tuple with minimum R_metric MUST be
selected, otherwise a Routing Tuple which is preferred SHOULD be selected, otherwise a Routing Tuple which is preferred SHOULD be
added. added.
Appendix C. TC Message Example Appendix C. TC Message Example
TC messages are instances of [RFC5444] messages. This specification TC messages are instances of [RFC5444] messages. This specification
requires that TC messages contains <msg-hop-limit> and <msg-orig- requires that TC messages contain <msg-hop-limit> and <msg-orig-addr>
addr> fields. It supports TC messages with any combination of fields. It supports TC messages with any combination of remaining
remaining message header options and address encodings, enabled by message header options and address encodings, enabled by [RFC5444]
[RFC5444] that convey the required information. As a consequence, that convey the required information. As a consequence, there is no
there is no single way to represent how all TC messages look. This single way to represent how all TC messages look. This appendix
appendix illustrates a TC message, the exact values and content illustrates a TC message, the exact values and content included are
included are explained in the following text. explained in the following text.
The TC message's four bit Message Flags (MF) field has value 15 The TC message's four bit Message Flags (MF) field has value 15
indicating that the message header contains originator address, hop indicating that the message header contains originator address, hop
limit, hop count, and message sequence number fields. Its four bit limit, hop count, and message sequence number fields. Its four bit
Message Address Length (MAL) field has value 3, indicating addresses Message Address Length (MAL) field has value 3, indicating addresses
in the message have a length of four octets, here being IPv4 in the message have a length of four octets, here being IPv4
addresses. The overall message length is 71 octets. addresses. The overall message length is 75 octets.
The message has a Message TLV Block with content length 13 octets The message has a Message TLV Block with content length 17 octets
containing three TLVs. The first two TLVs are validity and interval containing four TLVs. The first two TLVs are validity and interval
times for the message. The third TLV is the content sequence number times for the message. The third TLV is the content sequence number
TLV used to carry the 2 octet ANSN, and (with default type extension TLV used to carry the 2 octet ANSN, and (with default type extension
zero, i.e., COMPLETE) indicating that the TC message is complete. zero, i.e., COMPLETE) indicating that the TC message is complete.
Each TLV uses a TLV with Flags octet (MTLVF) value 16, indicating The fourth TLV contains forwarding and routing willingness values for
that it has a Value, but no type extension or start and stop indexes. the originating router (FWILL and RWILL, respectively). Each TLV
The first two TLVs have a Value Length of 1 octet, the last has a uses a TLV with Flags octet (MTLVF) value 16, indicating that it has
Value Length of 2 octets. a Value, but no type extension or start and stop indexes. The first
two TLVs have a Value Length of 1 octet, the last has a Value Length
of 2 octets.
The message has two Address Blocks. (This is not necessary, the The message has two Address Blocks. (This is not necessary, the
information could be conveyed using a single Address Block, the use information could be conveyed using a single Address Block, the use
of two Address Blocks, which is also allowed, is illustrative only.) of two Address Blocks, which is also allowed, is illustrative only.)
The first Address Block contains 3 addresses, with Flags octet The first Address Block contains 3 addresses, with Flags octet
(ATLVF) value 128, hence with a Head section (with length 2 octets), (ATLVF) value 128, hence with a Head section (with length 2 octets),
but no Tail section, and hence with Mid sections with length two but no Tail section, and hence with Mid sections with length two
octets. The following TLV Block (content length 13 octets) contains octets. The following TLV Block (content length 13 octets) contains
two TLVs. The first TLV is a NBR_ADDR_TYPE TLV with Flags octet two TLVs. The first TLV is a NBR_ADDR_TYPE TLV with Flags octet
(ATLVF) value 16, indicating a single Value but no indexes. Thus all (ATLVF) value 16, indicating a single Value but no indexes. Thus all
three addresses are associated with the Value (with Value Length 1 these addresses are associated with the Value (with Value Length 1
octet) ROUTABLE_ORIG, i.e., they are originator addresses of octet) ROUTABLE_ORIG, i.e., they are originator addresses of
advertised neighbors that are also routable addresses. The second advertised neighbors that are also routable addresses. The second
TLV is a LINK_STATUS TLV with Flags octet (ATLVF) value 20, TLV is a LINK_STATUS TLV with Flags octet (ATLVF) value 20,
indicating a Value for each address, i.e. as the total Value Length indicating a Value for each address, i.e., as the total Value Length
is 6 octets, each address is associated with a Value with length two is 6 octets, each address is associated with a Value with length two
octets. These Value fields are each shown as having four bits octets. These Value fields are each shown as having four bits
indicating that they are outgoing neighbor metric values, and as indicating that they are outgoing neighbor metric values, and as
having twelve bits that represent the metric value (the first four having twelve bits that represent the metric value (the first four
bits being the exponent, the remaining twelve bits the mantissa). bits being the exponent, the remaining twelve bits the mantissa).
The second Address Block contains 1 address, with Flags octet (ATLVF) The second Address Block contains 1 address, with Flags octet (ATLVF)
176, indicating that there is a Head section (with length 2 octets), 176, indicating that there is a Head section (with length 2 octets),
that the Tail section (with length 2 octets) consists of zero valued that the Tail section (with length 2 octets) consists of zero valued
octets (not included), and that there is a single prefix length, octets (not included), and that there is a single prefix length,
skipping to change at page 98, line 8 skipping to change at page 100, line 8
a Flags octet (ATLVF) of 16, again indicating that no indexes are a Flags octet (ATLVF) of 16, again indicating that no indexes are
needed, but that a Value (with Value Length 1 octet) is present, needed, but that a Value (with Value Length 1 octet) is present,
indicating the address distance as a number of hops. The second TLV indicating the address distance as a number of hops. The second TLV
is another LINK_METRIC TLV, as in the first Address TLV Block except is another LINK_METRIC TLV, as in the first Address TLV Block except
with a Flags octet (ATLVF) value 16, indicating that a single Value with a Flags octet (ATLVF) value 16, indicating that a single Value
is present. is present.
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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| TC | MF=15 | MAL=3 | Message Length = 71 | | TC | MF=15 | MAL=3 | Message Length = 75 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Originator Address | | Originator Address |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Hop Limit | Hop Count | Message Sequence Number | | Hop Limit | Hop Count | Message Sequence Number |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Message TLV Block Length = 13 | VALIDITY_TIME | MTLVF = 16 | | Message TLV Block Length = 17 | VALIDITY_TIME | MTLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Value Len = 1 | Value (Time) | INTERVAL_TIME | MTLVF = 16 | | Value Len = 1 | Value (Time) | INTERVAL_TIME | MTLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Value Len = 1 | Value (Time) | CONT_SEQ_NUM | MTLVF = 16 | | Value Len = 1 | Value (Time) | CONT_SEQ_NUM | MTLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Value Len = 2 | Value (ANSN) | Num Addrs = 3 | | Value Len = 2 | Value (ANSN) | MPR_WILLING |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| MTLVF = 16 | Value Len = 1 | FWILL | RWILL | Num Addrs = 3 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| ABF = 128 | Head Len = 2 | Head | | ABF = 128 | Head Len = 2 | Head |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Mid | | Mid | Mid |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Address TLV Block Length = 13 | | Mid | Address TLV Block Length = 13 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| NBR_ADDR_TYPE | ATLVF = 16 | Value Len = 1 | ROUTABLE_ORIG | | NBR_ADDR_TYPE | ATLVF = 16 | Value Len = 1 | ROUTABLE_ORIG |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| LINK_METRIC | ATLVF = 20 | Value Len = 6 |0|0|0|1|Metric | | LINK_METRIC | ATLVF = 20 | Value Len = 6 |0|0|0|1|Metric |
skipping to change at page 99, line 28 skipping to change at page 101, line 30
equal the O_orig_addr in any Originator Tuple. equal the O_orig_addr in any Originator Tuple.
o AL_dist MUST NOT be less than zero. o AL_dist MUST NOT be less than zero.
In each Link Tuple: In each Link Tuple:
o L_neighbor_iface_addr_list MUST NOT contain any network address o L_neighbor_iface_addr_list MUST NOT contain any network address
that AL_net_addr of any Local Attached Network Tuple equals or is that AL_net_addr of any Local Attached Network Tuple equals or is
a sub-range of. a sub-range of.
o If L_status = HEARD or L_status = SYMMETRIC then L_in_metric !=
UNKNOWN_METRIC.
o If L_status = SYMMETRIC then L_in_metric != UNKNOWN_METRIC.
o if L_in_metric != UNKNOWN_METRIC then L_in_metric MUST be o if L_in_metric != UNKNOWN_METRIC then L_in_metric MUST be
representable in the defined compressed form. representable in the defined compressed form.
o if L_out_metric != UNKNOWN_METRIC then L_out_metric MUST be o if L_out_metric != UNKNOWN_METRIC then L_out_metric MUST be
representable in the defined compressed form. representable in the defined compressed form.
o If L_mpr_selector = true, then L_status = SYMMETRIC. o If L_mpr_selector = true, then L_status = SYMMETRIC.
In each Neighbor Tuple: In each Neighbor Tuple:
skipping to change at page 100, line 15 skipping to change at page 102, line 12
o N_neighbor_addr_list MUST NOT contain any network address which o N_neighbor_addr_list MUST NOT contain any network address which
includes this router's originator address, the O_orig_addr in any includes this router's originator address, the O_orig_addr in any
Originator Tuple, or equal or have as a sub-range the AL_net_addr Originator Tuple, or equal or have as a sub-range the AL_net_addr
in any Local Attached Network Tuple. in any Local Attached Network Tuple.
o If N_orig_addr = unknown, then N_will_flooding = WILL_NEVER, o If N_orig_addr = unknown, then N_will_flooding = WILL_NEVER,
N_will_routing = WILL_NEVER, N_flooding_mpr, N_routing_mpr = N_will_routing = WILL_NEVER, N_flooding_mpr, N_routing_mpr =
false, N_mpr_selector = false, and N_advertised = false. false, N_mpr_selector = false, and N_advertised = false.
o N_in_metric MUST equal the minimum value of the L_in_metric values o N_in_metric MUST equal the minimum value of the L_in_metric values
of all corresponding Link Tuples, if any, otherwise N_in_metric = of all corresponding Link Tuples with L_status = SYMMETRIC and
L_in_metric != UNKNOWN_METRIC, if any, otherwise N_in_metric =
UNKNOWN_METRIC. UNKNOWN_METRIC.
o N_out_metric MUST equal the minimum value of the L_out_metric o N_out_metric MUST equal the minimum value of the L_out_metric
values of all corresponding Link Tuples, if any, otherwise values of all corresponding Link Tuples with L_status = SYMMETRIC
N_out_metric = UNKNOWN_METRIC. and L_out_metric != UNKNOWN_METRIC, if any, otherwise N_out_metric
= UNKNOWN_METRIC.
o N_will_flooding and N_will_routing MUST be in the range from o N_will_flooding and N_will_routing MUST be in the range from
WILL_NEVER to WILL_ALWAYS, inclusive. WILL_NEVER to WILL_ALWAYS, inclusive.
o If N_flooding_mpr = true, then N_symmetric MUST be true and o If N_flooding_mpr = true, then N_symmetric MUST be true,
N_will_flooding MUST NOT equal WILL_NEVER. N_out_metric MUST NOT equal UNKNOWN_METRIC and N_will_flooding
MUST NOT equal WILL_NEVER.
o If N_routing_mpr = true, then N_symmetric MUST be true and o If N_routing_mpr = true, then N_symmetric MUST be true,
N_will_routing MUST NOT equal WILL_NEVER. N_in_metric MUST NOT equal UNKNOWN_METRIC and N_will_routing MUST
NOT equal WILL_NEVER.
o If N_symmetric = true and N_flooding_mpr = false, then o If N_symmetric = true and N_flooding_mpr = false, then
N_will_flooding MUST NOT equal WILL_ALWAYS. N_will_flooding MUST NOT equal WILL_ALWAYS.
o If N_symmetric = true and N_routing_mpr = false, then o If N_symmetric = true and N_routing_mpr = false, then
N_will_routing MUST NOT equal WILL_ALWAYS. N_will_routing MUST NOT equal WILL_ALWAYS.
o If N_mpr_selector = true, then N_advertised MUST be true. o If N_mpr_selector = true, then N_advertised MUST be true.
o If N_advertised = true, then N_symmetric MUST be true. o If N_advertised = true, then N_symmetric MUST be true and
N_out_metric MUST NOT equal UNKNOWN_METRIC.
In each Lost Neighbor Tuple: In each Lost Neighbor Tuple:
o NL_neighbor_addr MUST NOT include this router's originator o NL_neighbor_addr MUST NOT include this router's originator
address, the O_orig_addr in any Originator Tuple, or equal or have address, the O_orig_addr in any Originator Tuple, or equal or have
as a sub-range the AL_net_addr in any Local Attached Network as a sub-range the AL_net_addr in any Local Attached Network
Tuple. Tuple.
In each 2-Hop Tuple: In each 2-Hop Tuple:
o N2_2hop_addr MUST NOT equal this router's originator address, o N2_2hop_addr MUST NOT equal this router's originator address,
equal the O_orig_addr in any Originator Tuple, or equal or have as equal the O_orig_addr in any Originator Tuple, or equal or have as
a sub-range the AL_net_addr in any Local Attached Network Tuple a sub-range the AL_net_addr in any Local Attached Network Tuple.
o N2_in_metric and N2_out_metric MUST be representable in the o if N2_in_metric != UNKNOWN_METRIC then N2_in_metric MUST be
defined compressed form. representable in the defined compressed form.
o if N2_out_metric != UNKNOWN_METRIC then N2_out_metric MUST be
representable in the defined compressed form.
In each Advertising Remote Router Tuple: In each Advertising Remote Router Tuple:
o AR_orig_addr MUST NOT be in any network address in the o AR_orig_addr MUST NOT be in any network address in the
I_local_iface_addr_list in any Local Interface Tuple or be in the I_local_iface_addr_list in any Local Interface Tuple or be in the
IR_local_iface_addr in any Removed Interface Address Tuple. IR_local_iface_addr in any Removed Interface Address Tuple.
o AR_orig_addr MUST NOT equal this router's originator address or o AR_orig_addr MUST NOT equal this router's originator address or
equal the O_orig_addr in any Originator Tuple. equal the O_orig_addr in any Originator Tuple.
skipping to change at page 103, line 21 skipping to change at page 105, line 28
This protocol employs [RFC6130] for local signaling, embedding MPR This protocol employs [RFC6130] for local signaling, embedding MPR
selection advertisement through a simple Address Block TLV, and selection advertisement through a simple Address Block TLV, and
router willingness advertisement (if any) as a single Message TLV. router willingness advertisement (if any) as a single Message TLV.
Local signaling, therefore, shares the characteristics and Local signaling, therefore, shares the characteristics and
constraints of [RFC6130]. constraints of [RFC6130].
Furthermore, the use of MPRs can greatly reduce the signaling Furthermore, the use of MPRs can greatly reduce the signaling
overhead from link state information dissemination in two ways, overhead from link state information dissemination in two ways,
attaining both flooding reduction and topology reduction. First, attaining both flooding reduction and topology reduction. First,
using MPR flooding, the cost of distributing link state information using MPR flooding, the cost of distributing link state information
throughout the network is reduced, as compared to when using classic throughout the network is reduced, as compared to when using blind
flooding, since only MPRs need to forward link state declaration flooding, since only MPRs need to forward link state declaration
messages. Second, the amount of link state information for a router messages. Second, the amount of link state information for a router
to declare is reduced to need only contain that router's MPR to declare is reduced to need only contain that router's MPR
selectors. This reduces the size of a link state declaration as selectors. This reduces the size of a link state declaration as
compared to declaring full link state information. In particular compared to declaring full link state information. In particular
some routers may not need to declare any such information. In dense some routers may not need to declare any such information. In dense
networks, the reduction of control traffic can be of several orders networks, the reduction of control traffic can be of several orders
of magnitude compared to routing protocols using classical flooding of magnitude compared to routing protocols using blind flooding
[MPR]. This feature naturally provides more bandwidth for useful [MPR]. This feature naturally provides more bandwidth for useful
data traffic and pushes further the frontier of congestion. data traffic and pushes further the frontier of congestion.
Since the control traffic is continuous and periodic, it keeps the Since the control traffic is continuous and periodic, it keeps the
quality of the links used in routing more stable. However, using quality of the links used in routing more stable. However, using
some options, some control messages (HELLO messages or TC messages) some options, some control messages (HELLO messages or TC messages)
may be intentionally sent in advance of their deadline in order to may be intentionally sent in advance of their deadline in order to
increase the responsiveness of the protocol to topology changes. increase the responsiveness of the protocol to topology changes.
This may cause a small, temporary, and local increase of control This may cause a small, temporary, and local increase of control
traffic, however this is at all times bounded by the use of minimum traffic, however this is at all times bounded by the use of minimum
skipping to change at page 104, line 4 skipping to change at page 106, line 13
message intervals. message intervals.
Authors' Addresses Authors' Addresses
Thomas Heide Clausen Thomas Heide Clausen
LIX, Ecole Polytechnique LIX, Ecole Polytechnique
Phone: +33 6 6058 9349 Phone: +33 6 6058 9349
EMail: T.Clausen@computer.org EMail: T.Clausen@computer.org
URI: http://www.ThomasClausen.org/ URI: http://www.ThomasClausen.org/
Christopher Dearlove Christopher Dearlove
BAE Systems ATC BAE Systems ATC
Phone: +44 1245 242194 Phone: +44 1245 242194
EMail: chris.dearlove@baesystems.com EMail: chris.dearlove@baesystems.com
URI: http://www.baesystems.com/ URI: http://www.baesystems.com/
Philippe Jacquet Philippe Jacquet
Project Hipercom, INRIA Alcatel-Lucent Bell Labs
Phone: +33 1 3963 5263 Phone: +33 6 7337 1880
EMail: philippe.jacquet@inria.fr EMail: philippe.jacquet@alcatel-lucent.fr
Ulrich Herberg
Fujitsu Laboratories of America
1240 E. Arques Ave.
Sunnyvale, CA, 94085
USA
EMail: ulrich@herberg.name
URI: http://www.herberg.name/
 End of changes. 320 change blocks. 
723 lines changed or deleted 823 lines changed or added

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