draft-ietf-manet-olsrv2-11.txt   draft-ietf-manet-olsrv2-12.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: October 22, 2010 BAE Systems ATC Expires: January 27, 2012 BAE Systems ATC
P. Jacquet P. Jacquet
Project Hipercom, INRIA Project Hipercom, INRIA
The OLSRv2 Design Team July 26, 2011
MANET Working Group
April 20, 2010
The Optimized Link State Routing Protocol version 2 The Optimized Link State Routing Protocol version 2
draft-ietf-manet-olsrv2-11 draft-ietf-manet-olsrv2-12
Abstract Abstract
This document describes version 2 of the Optimized Link State Routing This document describes version 2 of the Optimized Link State Routing
(OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs). (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.
skipping to change at page 1, line 36 skipping to change at page 1, line 34
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 October 22, 2010. This Internet-Draft will expire on January 27, 2012.
Copyright Notice Copyright Notice
Copyright (c) 2010 IETF Trust and the persons identified as the Copyright (c) 2011 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 25 skipping to change at page 2, line 23
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 . . . . . . . . . . . . . . . . . . . . . . . . . 5 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 5
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6
3. Applicability Statement . . . . . . . . . . . . . . . . . . . 8 3. Applicability Statement . . . . . . . . . . . . . . . . . . . 8
4. Protocol Overview and Functioning . . . . . . . . . . . . . . 9 4. Protocol Overview and Functioning . . . . . . . . . . . . . . 9
4.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . . 10
4.2. Routers and Interfaces . . . . . . . . . . . . . . . . . . 11 4.2. Routers and Interfaces . . . . . . . . . . . . . . . . . . 12
4.3. Information Base Overview . . . . . . . . . . . . . . . . 12 4.3. Information Base Overview . . . . . . . . . . . . . . . . 13
4.3.1. Local Information Base . . . . . . . . . . . . . . . . 12 4.3.1. Local Information Base . . . . . . . . . . . . . . . . 13
4.3.2. Interface Information Bases . . . . . . . . . . . . . 13 4.3.2. Interface Information Bases . . . . . . . . . . . . . 13
4.3.3. Neighbor Information Base . . . . . . . . . . . . . . 13 4.3.3. Neighbor Information Base . . . . . . . . . . . . . . 14
4.3.4. Topology Information Base . . . . . . . . . . . . . . 13 4.3.4. Topology Information Base . . . . . . . . . . . . . . 14
4.3.5. Received Message Information Base . . . . . . . . . . 14 4.3.5. Received Message Information Base . . . . . . . . . . 15
4.4. Signaling Overview . . . . . . . . . . . . . . . . . . . . 15 4.4. Signaling Overview . . . . . . . . . . . . . . . . . . . . 15
4.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 16 4.5. Link Metrics . . . . . . . . . . . . . . . . . . . . . . . 17
5. Protocol Parameters and Constants . . . . . . . . . . . . . . 16 4.6. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 18
5.1. Protocol and Port Numbers . . . . . . . . . . . . . . . . 17 5. Protocol Parameters and Constants . . . . . . . . . . . . . . 18
5.2. Multicast Address . . . . . . . . . . . . . . . . . . . . 17 5.1. Protocol and Port Numbers . . . . . . . . . . . . . . . . 18
5.3. Local History Times . . . . . . . . . . . . . . . . . . . 17 5.2. Multicast Address . . . . . . . . . . . . . . . . . . . . 19
5.4. Message Intervals . . . . . . . . . . . . . . . . . . . . 17 5.3. Interface Parameters . . . . . . . . . . . . . . . . . . . 19
5.5. Advertised Information Validity Times . . . . . . . . . . 18 5.3.1. Received Message Validity Time . . . . . . . . . . . . 19
5.6. Received Message Validity Times . . . . . . . . . . . . . 19 5.4. Router Parameters . . . . . . . . . . . . . . . . . . . . 19
5.7. Jitter . . . . . . . . . . . . . . . . . . . . . . . . . . 20 5.4.1. Local History Times . . . . . . . . . . . . . . . . . 19
5.8. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 20 5.4.2. Link_Metric_Parameters . . . . . . . . . . . . . . . . 19
5.9. Willingness . . . . . . . . . . . . . . . . . . . . . . . 21 5.4.3. Message Intervals . . . . . . . . . . . . . . . . . . 20
5.10. Parameter Change Constraints . . . . . . . . . . . . . . . 21 5.4.4. Advertised Information Validity Times . . . . . . . . 20
6. Local Information Base . . . . . . . . . . . . . . . . . . . . 22 5.4.5. Processing and Forwarding Validity Times . . . . . . . 21
6.1. Originator Set . . . . . . . . . . . . . . . . . . . . . . 23 5.4.6. Jitter . . . . . . . . . . . . . . . . . . . . . . . . 22
6.2. Local Attached Network Set . . . . . . . . . . . . . . . . 23 5.4.7. Hop Limit . . . . . . . . . . . . . . . . . . . . . . 22
7. Interface Information Base . . . . . . . . . . . . . . . . . . 24 5.4.8. Willingness . . . . . . . . . . . . . . . . . . . . . 23
8. Neighbor Information Base . . . . . . . . . . . . . . . . . . 24 5.5. Parameter Change Constraints . . . . . . . . . . . . . . . 24
9. Topology Information Base . . . . . . . . . . . . . . . . . . 25 5.6. Constants . . . . . . . . . . . . . . . . . . . . . . . . 25
9.1. Advertising Remote Router Set . . . . . . . . . . . . . . 25 5.6.1. Link Metric Constants . . . . . . . . . . . . . . . . 25
9.2. Router Topology Set . . . . . . . . . . . . . . . . . . . 26 6. Link Metric Values . . . . . . . . . . . . . . . . . . . . . . 26
9.3. Routable Address Topology Set . . . . . . . . . . . . . . 26 6.1. Link Metric Representation . . . . . . . . . . . . . . . . 26
9.4. Attached Network Set . . . . . . . . . . . . . . . . . . . 27 6.2. Link Metric Compressed Form . . . . . . . . . . . . . . . 26
9.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 28 7. Local Information Base . . . . . . . . . . . . . . . . . . . . 27
10. Received Message Information Base . . . . . . . . . . . . . . 28 7.1. Originator Set . . . . . . . . . . . . . . . . . . . . . . 27
10.1. Received Set . . . . . . . . . . . . . . . . . . . . . . . 28 7.2. Local Attached Network Set . . . . . . . . . . . . . . . . 28
10.2. Processed Set . . . . . . . . . . . . . . . . . . . . . . 29 8. Interface Information Base . . . . . . . . . . . . . . . . . . 29
10.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . . . 29 9. Neighbor Information Base . . . . . . . . . . . . . . . . . . 30
11. Updating Information Bases . . . . . . . . . . . . . . . . . . 30 10. Topology Information Base . . . . . . . . . . . . . . . . . . 31
12. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 31 10.1. Advertising Remote Router Set . . . . . . . . . . . . . . 31
13. Message Processing and Forwarding . . . . . . . . . . . . . . 32 10.2. Router Topology Set . . . . . . . . . . . . . . . . . . . 32
13.1. Actions when Receiving a Message . . . . . . . . . . . . . 33 10.3. Routable Address Topology Set . . . . . . . . . . . . . . 32
13.2. Message Considered for Processing . . . . . . . . . . . . 33 10.4. Attached Network Set . . . . . . . . . . . . . . . . . . . 33
13.3. Message Considered for Forwarding . . . . . . . . . . . . 34 10.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 34
14. HELLO messages . . . . . . . . . . . . . . . . . . . . . . . . 36 11. Received Message Information Base . . . . . . . . . . . . . . 35
14.1. HELLO Message Generation . . . . . . . . . . . . . . . . . 36 11.1. Received Set . . . . . . . . . . . . . . . . . . . . . . . 35
14.2. HELLO Message TLVs . . . . . . . . . . . . . . . . . . . . 37 11.2. Processed Set . . . . . . . . . . . . . . . . . . . . . . 35
14.2.1. Message TLVs . . . . . . . . . . . . . . . . . . . . . 37 11.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . . . 36
14.2.2. Address Block TLVs . . . . . . . . . . . . . . . . . . 38 12. Information Base Properties . . . . . . . . . . . . . . . . . 36
14.3. HELLO Message Transmission . . . . . . . . . . . . . . . . 38 13. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 38
14.4. HELLO Message Processing . . . . . . . . . . . . . . . . . 38 13.1. Messages . . . . . . . . . . . . . . . . . . . . . . . . . 38
14.4.1. HELLO Message Discarding . . . . . . . . . . . . . . . 38 13.2. Packets . . . . . . . . . . . . . . . . . . . . . . . . . 38
14.4.2. HELLO Message Usage . . . . . . . . . . . . . . . . . 39 13.3. TLVs . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
15. TC Messages . . . . . . . . . . . . . . . . . . . . . . . . . 40 13.3.1. Message TLVs . . . . . . . . . . . . . . . . . . . . . 39
15.1. TC Message Generation . . . . . . . . . . . . . . . . . . 40 13.3.2. Address Block TLVs . . . . . . . . . . . . . . . . . . 39
15.2. TC Message TLVs . . . . . . . . . . . . . . . . . . . . . 42 14. Message Processing and Forwarding . . . . . . . . . . . . . . 41
15.2.1. Message TLVs . . . . . . . . . . . . . . . . . . . . . 42 14.1. Actions when Receiving a Message . . . . . . . . . . . . . 42
15.2.2. Address Block TLVs . . . . . . . . . . . . . . . . . . 42 14.2. Message Considered for Processing . . . . . . . . . . . . 43
15.3. TC Message Transmission . . . . . . . . . . . . . . . . . 43 14.3. Message Considered for Forwarding . . . . . . . . . . . . 44
15.4. TC Message Processing . . . . . . . . . . . . . . . . . . 44 15. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . . . 45
15.4.1. Invalid Message . . . . . . . . . . . . . . . . . . . 45 15.1. HELLO Message Generation . . . . . . . . . . . . . . . . . 46
15.4.2. TC Message Processing Definitions . . . . . . . . . . 46 15.2. HELLO Message Transmission . . . . . . . . . . . . . . . . 47
15.4.3. Initial TC Message Processing . . . . . . . . . . . . 46 15.3. HELLO Message Processing . . . . . . . . . . . . . . . . . 48
15.4.4. Completing TC Message Processing . . . . . . . . . . . 49 15.3.1. HELLO Message Discarding . . . . . . . . . . . . . . . 48
16. Information Base Changes . . . . . . . . . . . . . . . . . . . 50 15.3.2. HELLO Message Usage . . . . . . . . . . . . . . . . . 49
16.1. Originator Address Changes . . . . . . . . . . . . . . . . 50 16. TC Messages . . . . . . . . . . . . . . . . . . . . . . . . . 52
16.2. Neighbor State Changes . . . . . . . . . . . . . . . . . . 51 16.1. TC Message Generation . . . . . . . . . . . . . . . . . . 52
16.3. Advertised Neighbor Changes . . . . . . . . . . . . . . . 51 16.2. TC Message Transmission . . . . . . . . . . . . . . . . . 54
16.4. Advertising Remote Router Tuple Expires . . . . . . . . . 51 16.3. TC Message Processing . . . . . . . . . . . . . . . . . . 55
16.5. Neighborhood Changes and MPR Updates . . . . . . . . . . . 52 16.3.1. Invalid Message . . . . . . . . . . . . . . . . . . . 55
16.6. Routing Set Updates . . . . . . . . . . . . . . . . . . . 53 16.3.2. TC Message Processing Definitions . . . . . . . . . . 56
17. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 54 16.3.3. Initial TC Message Processing . . . . . . . . . . . . 57
18. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 55 16.3.4. Completing TC Message Processing . . . . . . . . . . . 60
18.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 56 17. Information Base Changes . . . . . . . . . . . . . . . . . . . 61
18.2. Populating the Routing Set . . . . . . . . . . . . . . . . 58 17.1. Originator Address Changes . . . . . . . . . . . . . . . . 61
19. Proposed Values for Parameters and Constants . . . . . . . . . 59 17.2. Link State Changes . . . . . . . . . . . . . . . . . . . . 62
19.1. Local History Time Parameters . . . . . . . . . . . . . . 59 17.3. Neighbor State Changes . . . . . . . . . . . . . . . . . . 62
19.2. Message Interval Parameters . . . . . . . . . . . . . . . 59 17.4. Advertised Neighbor Changes . . . . . . . . . . . . . . . 63
19.3. Advertised Information Validity Time Parameters . . . . . 59 17.5. Advertising Remote Router Tuple Expires . . . . . . . . . 63
19.4. Received Message Validity Time Parameters . . . . . . . . 59 17.6. Neighborhood Changes and MPR Updates . . . . . . . . . . . 64
19.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 59 17.7. Routing Set Updates . . . . . . . . . . . . . . . . . . . 65
19.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 59 18. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 66
19.7. Willingness Parameter and Constants . . . . . . . . . . . 60 19. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 68
20. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 60 19.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 68
21. Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . 60 19.2. Populating the Routing Set . . . . . . . . . . . . . . . . 70
22. Security Considerations . . . . . . . . . . . . . . . . . . . 61 20. Proposed Values for Parameters and Constants . . . . . . . . . 71
22.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 61 20.1. Local History Time Parameters . . . . . . . . . . . . . . 72
22.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 62 20.2. Message Interval Parameters . . . . . . . . . . . . . . . 72
22.3. Interaction with External Routing Domains . . . . . . . . 63 20.3. Advertised Information Validity Time Parameters . . . . . 72
23. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 63 20.4. Received Message Validity Time Parameters . . . . . . . . 72
23.1. Expert Review: Evaluation Guidelines . . . . . . . . . . . 64 20.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 72
23.2. Message Types . . . . . . . . . . . . . . . . . . . . . . 64 20.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 72
23.3. Message-Type-specific TLV Type Registries . . . . . . . . 64 20.7. Willingness Parameter and Constants . . . . . . . . . . . 72
23.4. Message TLV Types . . . . . . . . . . . . . . . . . . . . 65 21. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 73
23.5. Address Block TLV Types . . . . . . . . . . . . . . . . . 66 22. Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . 73
23.6. NBR_ADDR_TYPE Values . . . . . . . . . . . . . . . . . . . 68 23. Security Considerations . . . . . . . . . . . . . . . . . . . 74
24. Contributors . . . . . . . . . . . . . . . . . . . . . . . . . 68 23.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 74
25. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 68 23.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 74
26. References . . . . . . . . . . . . . . . . . . . . . . . . . . 69 23.3. Interaction with External Routing Domains . . . . . . . . 76
26.1. Normative References . . . . . . . . . . . . . . . . . . . 69 24. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 76
26.2. Informative References . . . . . . . . . . . . . . . . . . 69 24.1. Expert Review: Evaluation Guidelines . . . . . . . . . . . 76
Appendix A. Example Algorithm for Calculating MPRs . . . . . . . 70 24.2. Message Types . . . . . . . . . . . . . . . . . . . . . . 77
A.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 71 24.3. Message-Type-specific TLV Type Registries . . . . . . . . 77
A.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 71 24.4. Message TLV Types . . . . . . . . . . . . . . . . . . . . 77
Appendix B. Example Algorithm for Calculating the Routing Set . . 72 24.5. Address Block TLV Types . . . . . . . . . . . . . . . . . 79
B.1. Local Interfaces and Neighbors . . . . . . . . . . . . . . 72 24.6. NBR_ADDR_TYPE Values . . . . . . . . . . . . . . . . . . . 81
B.2. Add Neighbor Routers . . . . . . . . . . . . . . . . . . . 73 25. Contributors . . . . . . . . . . . . . . . . . . . . . . . . . 82
B.3. Add Remote Routers . . . . . . . . . . . . . . . . . . . . 73 26. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 82
B.4. Add Neighbor Addresses . . . . . . . . . . . . . . . . . . 74 27. References . . . . . . . . . . . . . . . . . . . . . . . . . . 82
B.5. Add Remote Routable Addresses . . . . . . . . . . . . . . 74 27.1. Normative References . . . . . . . . . . . . . . . . . . . 82
B.6. Add Attached Networks . . . . . . . . . . . . . . . . . . 75 27.2. Informative References . . . . . . . . . . . . . . . . . . 83
B.7. Add 2-Hop Neighbors . . . . . . . . . . . . . . . . . . . 76 Appendix A. Example Algorithm for Calculating MPRs . . . . . . . 84
Appendix C. TC Message Example . . . . . . . . . . . . . . . . . 76 A.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 85
Appendix D. Constraints . . . . . . . . . . . . . . . . . . . . . 78 A.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 85
Appendix E. Flow and Congestion Control . . . . . . . . . . . . . 82 Appendix B. Example Algorithm for Calculating the Routing Set . . 86
B.1. Local Interfaces and Neighbors . . . . . . . . . . . . . . 86
B.2. Add Neighbor Routers . . . . . . . . . . . . . . . . . . . 87
B.3. Add Remote Routers . . . . . . . . . . . . . . . . . . . . 87
B.4. Add Neighbor Addresses . . . . . . . . . . . . . . . . . . 88
B.5. Add Remote Routable Addresses . . . . . . . . . . . . . . 89
B.6. Add Attached Networks . . . . . . . . . . . . . . . . . . 89
B.7. Add 2-Hop Neighbors . . . . . . . . . . . . . . . . . . . 90
Appendix C. TC Message Example . . . . . . . . . . . . . . . . . 91
Appendix D. Constraints . . . . . . . . . . . . . . . . . . . . . 93
Appendix E. Flow and Congestion Control . . . . . . . . . . . . . 98
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,
while using a more flexible and efficient signaling framework, and enhanced by the ability to use a link metric other than hop count in
includes some simplification of the messages being exchanged. the selection of shortest routes. OLSRv2 also uses a more flexible
and efficient signaling framework, and includes some simplification
of the messages being exchanged.
OLSRv2 is developed for mobile ad hoc networks. It operates as a OLSRv2 is developed for mobile ad hoc networks. It operates as a
table driven, proactive protocol, i.e., it exchanges topology 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 classical link state routing protocol. Its
key concept is that of MultiPoint Relays (MPRs). Each router selects key concept is that of MultiPoint Relays (MPRs). Each router selects
as MPRs a set of its neighbor routers that "cover" all of its as MPRs a set of its neighbor routers that "cover" all of its
symmetrically connected 2-hop neighbor routers. MPRs are then used symmetrically connected 2-hop neighbor routers. Separate sets of
to achieve both flooding reduction and topology reduction. flooding MPRs and routing MPRs are then used to 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 an MPR (its directly from one of the routers that have selected it as a flooding
"MPR selectors"). This mechanism, denoted "MPR flooding", provides MPR (its "flooding MPR selectors"). This mechanism, denoted "MPR
an efficient mechanism for information distribution within the MANET flooding", provides an efficient mechanism for information
by reducing the number of transmissions required. distribution within the MANET by reducing the number of transmissions
required.
Topology reduction is achieved by assigning a special responsibility Topology reduction is achieved by assigning a special responsibility
to routers selected as MPRs when declaring link state information. A to routers selected as routing MPRs when declaring link state
sufficient requirement for OLSRv2 to provide shortest (lowest hop information. A sufficient requirement for OLSRv2 to provide shortest
count) routes to all destinations is that routers declare link state routes to all destinations is that routers declare link state
information for their MPR selectors, if any. Routers that are not information for their routing MPR selectors, if any. Routers that
selected as MPRs need not send any link state information. Thus the are not selected as routing MPRs need not send any link state
use of MPRs allows reduction of the number and the size of link state information. Based on this reduced link state information, routing
messages, and in the amount of link state information maintained in MPRs are used as intermediate routers in multi-hop routes.
each router. Based on this reduced link state information, MPRs are
used as intermediate routers in multi-hop routes.
A router selects MPRs from among its one hop neighbors connected by Thus the use of MPRs allows reduction of the number and the size of
"symmetric", i.e., bidirectional, links. Therefore, selecting routes link state messages, and in the amount of link state information
through MPRs avoids the problems associated with data packet transfer maintained in each router. When possible (in particular when using a
over unidirectional links (e.g., the problem of not getting link hop count metric) the same routers may be picked as both flooding
layer acknowledgments at each hop, for link layers employing this MPRs and routing MPRs.
technique).
OLSRv2 uses and extends [NHDP] and uses [RFC5444], [RFC5497] and, A router selects both routing and flooding MPRs from among its one
hop neighbors connected by "symmetric", i.e., bidirectional, links.
Therefore, selecting routes through routing MPRs avoids the problems
associated with data packet transfer over unidirectional links (e.g.,
the problem of not getting link layer acknowledgments at each hop,
for link layers employing this technique).
OLSRv2 uses and extends [RFC6130] and uses [RFC5444], [RFC5497] and,
optionally, [RFC5148]. These other protocols and specifications were optionally, [RFC5148]. These other protocols and specifications were
all originally created as part of OLSRv2, but have been specified all originally created as part of OLSRv2, but have been specified
separately for wider use. 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 [NHDP], may use link layer information and through its use of [RFC6130], may use link layer information and
notifications when available and applicable. notifications when available and applicable. Link metrics may be
derived from link layer or any other information. OLSRv2 does not
specify the physical meaning of link metrics, but specifies a means
by which new types of link metrics may 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].
Note: This is the first version of this specification to incorporate
the use of link metrics. It is not compete: Section 18 and
Appendix A have not yet been updated to use link metrics and separate
sets of flooding and routing MPRs.
2. Terminology 2. Terminology
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
"OPTIONAL" in this document are to be interpreted as described in "OPTIONAL" in this document are to be interpreted as described in
[RFC2119]. [RFC2119].
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 [NHDP], 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", "1-hop
neighbor", "symmetric 1-hop neighbor", "symmetric 2-hop neighbor", neighbor", "symmetric 1-hop neighbor", "symmetric 2-hop neighbor",
"constant", "interface parameter", "router parameter", "Information "constant", "interface parameter", "router parameter", "Information
Base", and "HELLO message" are to be interpreted as described there. Base", and "HELLO message" are to be interpreted as described there.
Additionally, this document uses the following terminology: Additionally, this specification uses the following terminology:
Router - A MANET router which implements this protocol. Router - A MANET router which implements this protocol.
OLSRv2 interface - A MANET interface running this protocol. OLSRv2 interface - A MANET interface running this protocol.
Routable address - A network address which may be used as the Routable address - A network address which may be used as the
destination of a packet. A router MUST be able to distinguish a destination of a data packet. A router MUST be able to
routable address from a non-routable address by direct inspection distinguish a routable address from a non-routable address by
of the network address, based on global scope address allocations direct inspection of the network address, based on global scope
by IANA and/or administrative configuration. Broadcast, multicast address allocations by IANA and/or administrative configuration.
and anycast addresses, and addresses which are limited in scope to Broadcast, multicast and anycast addresses, and addresses which
less than the entire MANET, MUST NOT be considered as routable are limited in scope to less than the entire MANET, MUST NOT be
addresses. considered as routable addresses.
Originator address - An address which is unique (within the MANET) Originator address - An address which is unique (within the MANET)
to a router. A router MUST select an originator address; it MAY to a router. A router MUST select an originator address; it MAY
choose one of its interface addresses as its originator address. choose one of its interface addresses as its originator address.
If it selects a routable address then this MUST be one which this If it selects a routable address then this MUST be one which this
router will accept as destination. An originator address MUST NOT router will accept as destination. An originator address MUST NOT
have a prefix length, except for when included in an Address Block have a prefix length, except for when included in an Address Block
where it MAY be associated with a prefix of maximum prefix length where it MAY be associated with a prefix of maximum prefix length
(e.g., if the originator address is an IPv6 address, it MUST have (e.g., if the originator address is an IPv6 address, it MUST have
either no prefix length, or have a prefix length of 128). An either no prefix length, or have a prefix length of 128). An
originator address may be a routable or non-routable address. originator address may be a routable or non-routable address.
Message originator address - The originator address of the router Message originator address - The originator address of the router
which created a message, as deduced from that message by its which created a message, as deduced from that message by its
recipient. The message originator address will usually be recipient. The message originator address will usually be
included in the message as its <msg-orig-addr> element as defined included in the message as its <msg-orig-addr> element as defined
in [RFC5444]. However an exceptional case in a HELLO message is in [RFC5444]. However an exceptional case in a HELLO message is
also allowed by this specification, when a router only uses a also allowed by this specification, when a router only uses a
single address. For all messages used in this specification, single address. For all messages used in this specification,
including HELLO messages defined in [NHDP], the recipient MUST be including HELLO messages defined in [RFC6130], the recipient MUST
able to deduce an originator address. be able to deduce an originator address.
Willingness - A numerical value between WILL_NEVER and WILL_ALWAYS Willingness - A numerical value between WILL_NEVER and WILL_ALWAYS
(both inclusive), that represents the router's willingness to be (both inclusive), that represents the router's willingness to be
selected as an MPR. selected as an MPR.
Willing symmetric 1-hop neighbor - A symmetric 1-hop neighbor of Willing symmetric 1-hop neighbor - A symmetric 1-hop neighbor of
this router that has willingness not equal to WILL_NEVER. this router that has willingness not equal to WILL_NEVER.
Symmetric 1-hop neighbor through OLSRv2 interface I - A symmetric Symmetric 1-hop neighbor through OLSRv2 interface I - A symmetric
1-hop neighbor of the router via a symmetric link using OLSRv2 1-hop neighbor of the router via a symmetric link using OLSRv2
skipping to change at page 7, line 49 skipping to change at page 8, line 22
Symmetric strict 2-hop neighbor through OLSRv2 interface I - A Symmetric strict 2-hop neighbor through OLSRv2 interface I - A
symmetric 1-hop neighbor of a willing symmetric 1-hop neighbor symmetric 1-hop neighbor of a willing symmetric 1-hop neighbor
through OLSRv2 interface I that is not a symmetric 1-hop neighbor through OLSRv2 interface I that is not a symmetric 1-hop neighbor
through OLSRv2 interface I. The router MAY elect to use only through OLSRv2 interface I. The router MAY elect to use only
information received over OLSRv2 interface I in making this information received over OLSRv2 interface I in making this
determination. determination.
Multipoint relay (MPR) - A router, X, is an MPR for a router, Y, if Multipoint relay (MPR) - 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 router Y has indicated its selection of router X as an MPR in a
recent HELLO message. recent HELLO message. Router X may be a Flooding MPR for Y, if it
is indicated to 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 declare link-state information for the link from X to
Y. It may also be both at the same time.
MPR selector - A router, Y, is an MPR selector of router X if router MPR selector - A router, Y, is an MPR selector of router X if router
Y has selected router X as an MPR. Y has selected router X as an MPR.
MPR flooding - The optimized MANET-wide information distribution MPR flooding - The optimized MANET-wide information distribution
mechanism, employed by this protocol, in which a message is mechanism, employed by this protocol, in which a message is
relayed by only a reduced subset of the routers in the network. relayed by only a reduced subset of the routers in the network.
MPR flooding is the mechanism by which flooding reduction is MPR flooding is the mechanism by which flooding reduction is
achieved. achieved.
This document employs the same notational conventions as in [RFC5444] This document employs the same notational conventions as in [RFC5444]
and [NHDP]. 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 in wireless
skipping to change at page 8, line 46 skipping to change at page 9, line 20
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 which may be
local to a router or that can serve as gateways towards other local to a router or that can serve as gateways towards other
networks. networks.
o Enables the use of bidirectional additive link metrics to use
shortest distance (i.e., the total of metrics) routes. Incoming
link metric values are to be determined by a 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.
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 as enabled by o Allows "external" and "internal" extensibility as enabled by
[RFC5444]. [RFC5444].
skipping to change at page 9, line 28 skipping to change at page 10, line 9
that shortest paths can be calculated to all available that shortest paths 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 paths 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 [NHDP] to identify symmetric 1-hop neighbors and symmetric o Using [RFC6130] to identify symmetric 1-hop neighbors and
2-hop neighbors. symmetric 2-hop neighbors.
o Independently selecting MPRs from among its symmetric 1-hop o Extending [RFC6130] to allow the addition of directional link
neighbors such that all symmetric 2-hop neighbors are reachable metrics to advertised links, and to indicate which link metric
via at least one symmetric 1-hop neighbor. An analysis and type is being used by that router. Both incoming and outgoing
examples of MPR selection algorithms is given in [MPR], a link metrics may be reported, the latter determined by the
suggested algorithm is included in this specification. Note that advertising router.
it is not necessary for routers to use the same algorithm in order
to interoperate in the same MANET.
o Signaling its MPR selection by extending [NHDP] to include this o Independently selecting flooding MPRs and routing MPRs from among
information in outgoing HELLO messages, by the addition of MPR its symmetric 1-hop neighbors such that, for each set of MPRs all
Address Block TLV(s) associated with the appropriate network symmetric 2-hop neighbors are reachable via at least one symmetric
addresses. 1-hop neighbor. An analysis and examples of MPR selection
algorithms is given in [MPR], a suggested algorithm, modified 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 Extracting its MPR selectors from received HELLO messages, using o Signaling its flooding MPR and routing MPR selections by extending
the included MPR Address Block TLV(s). [RFC6130] to report this information in outgoing HELLO messages,
by the addition of MPR Address Block TLV(s) associated with the
appropriate network addresses.
o Reporting its willingness to be an MPR in HELLO messages, by the o Extracting its flooding MPR selectors and routing MPR selectors
addition on an MPR_WILLING Message TLV. The router's willingness from received HELLO messages, using the included MPR Address Block
to be an MPR indicates how willing it is to participate in MPR TLV(s).
flooding and to be an intermediate node for routing. A node can
absolutely decline to perform either role, while still being able o Reporting its willingness to be a flooding MPR and to be a routing
to be a routing source or destination. MPR in HELLO messages, by the addition on an MPR_WILLING Message
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 is is to be an intermediate node
for routing, while still being able to be a routing source or
destination.
o Using the message format specified in [RFC5444], specifically o Using the message format specified in [RFC5444], specifically
defining a TC (Topology Control) Message Type, used to defining a TC (Topology Control) Message Type, used to
periodically signal links between MPR selectors and itself periodically signal links between routing MPR selectors and itself
throughout the MANET. throughout the MANET. This signaling includes suitable direction
router metrics (the best link metric in that 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,
denoted "MPR flooding"; only the MPRs of a router will retransmit denoted "MPR flooding"; only the flooding MPRs of a router will
messages received from (i.e., originated or last relayed by) that retransmit messages received from (i.e., originated or last
router. relayed by) that router.
Note that the indicated extensions to [NHDP] are of forms permitted Note that the indicated extensions to [RFC6130] are of forms
by that specification. permitted by that specification.
This specification defines: This specification defines:
o Parameters and constants used by this protocol, in addition to o The requirement to use [RFC6130], its parameters, constants, HELLO
those specified in [NHDP]. Parameters used by this protocol may, messages, and Information Bases, each as extended in this
where appropriate, be specific to a given OLSRv2 interface, or to specification.
a router. This protocol allows all parameters to be changed
dynamically, and to be set independently for each router or each
OLSRv2 interface, as appropriate.
o Extensions to the Information Bases specified in [NHDP].
o Two new Information Bases: the Topology Information Base and the o Two new Information Bases: the Topology Information Base and the
Received Message Information Base. Received Message Information Base.
o A requirement for each router to have an originator address to be
included in, or deducible from, the HELLO messages of [NHDP].
o A Message TLV, to be included in the HELLO messages of [NHDP],
allowing a router to indicate its willingness to be an MPR.
o An Address Block TLV, to be included in the HELLO messages of
[NHDP], allowing a router to signal its MPR selection.
o The MPR flooding mechanism, including the inclusion of message
originator address and sequence number to manage duplicate
messages.
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
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 TC messages. are used in HELLO messages and TC messages, including for
reporting link metrics and their usage, willingness to be an MPR,
MPR selection, and content sequence number information. Note that
the generation of (incoming) link metric values is to be
undertaken by a process outside this specification. This
specification concerns only the distribution and use of those
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.
o The MPR flooding mechanism, including the inclusion of message
originator address and sequence number to manage duplicate
messages, using information recorded in the Received Message
Information Base.
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 OLSRv2 packets.
4.2. Routers and Interfaces 4.2. Routers and Interfaces
In order for a router to participate in a MANET, it MUST have at In order for a router to participate in a MANET, it MUST have at
least one, and possibly more, OLSRv2 interfaces. Each OLSRv2 least one, and possibly more, OLSRv2 interfaces. Each OLSRv2
interface: interface:
o Is configured with one or more network addresses, as specified in o Is configured with one or more network addresses, as specified in
[NHDP]. These addresses MUST each be specific to this router, and [RFC6130]. These addresses MUST each be specific to this router,
MUST include any address that will be used as the sending address and MUST include any address that will be used as the sending
of any IP packet sent on this OLSRv2 interface. 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
[NHDP]. [RFC6130].
o Has an Interface Information Base, extending that specified in o Has an Interface Information Base, extending that specified in
[NHDP]. [RFC6130].
o Generates and processes HELLO messages according to [NHDP], o Generates and processes HELLO messages according to [RFC6130],
extended as specified in Section 14. 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 and/or local attached
networks for which this router can accept packets. All routable networks for which this router can accept packets. All routable
addresses for which the router is to accept packets MUST be used addresses for which the router is to accept packets MUST be used
as an (OLSRv2 or non-OLSRv2) interface network address or as an as an (OLSRv2 or non-OLSRv2) interface network address or as an
address of a local attached network of the router. 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
[NHDP]. [RFC6130].
o Has a Local Information Base, extending that specified in [NHDP], o Has a Local Information Base, extending that specified in
including selection of an originator address and recording any [RFC6130], including selection of an originator address and
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
[NHDP] 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 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 document. An implementation of this protocol MAY maintain this this specification. An implementation of this protocol MAY maintain
information in the indicated form, or in any other organization which this information in the indicated form, or in any other organization
offers access to this information. In particular, note that it is which offers access to this information. In particular, note that it
not necessary to remove Tuples from Sets at the exact time indicated, is not necessary to remove Tuples from Sets at the exact time
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 [NHDP], 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:
o Originator Set, containing addresses that were recently used as o Originator Set, containing addresses that were recently used as
this router's originator address, and is used, together with the this router's originator address, and is used, together with the
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 Bases, one for each OLSRv2 interface, are
specified in [NHDP]. In addition to the uses in [NHDP], information specified in [RFC6130], and are extended to also record, in each Link
recorded in the Interface Information Bases is used for completing Set, link metric values (incoming and outgoing) and flooding MPR
the Routing Set. selector information.
4.3.3. Neighbor Information Base 4.3.3. Neighbor Information Base
The Neighbor Information Base is specified in [NHDP], and is extended The Neighbor Information Base is specified in [RFC6130], and is
to also record each neighbor's originator address, the willingness of extended to also record, in the Neighbor Tuple for each neighbor:
each neighbor to be an MPR, as well as this router's MPR
relationships with each neighbor (whether an MPR and/or an MPR
selector of that neighbor), and whether that neighbor is to be
advertised in TC messages.
A router selects some of its symmetric 1-hop neighbors as MPRs (see o Its originator address.
Section 17). That selection is recorded in the Neighbor Set. This
selection is then reported in the router's HELLO messages, extending
the specification in [NHDP], by using an MPR Address Block TLV. In
making that selection, a router MUST consider its 1-hop neighbors'
willingness to be an MPR, which (unless having default value) is
reported using an Address Block TLV in HELLO messages and recorded in
the receiving router's Neighbor Set.
A router also records, in the Neighbor Set, which symmetric 1-hop o Neighbor metric values, these being the minimum of the link metric
neighbors have selected it as an MPR (i.e., its MPR selectors). This values in the indicated directon for all symmetric 1-hop links
is determined from the MPR TLVs in received HELLO messages. It also with that neighbor.
records which symmetric 1-hop neighbors that it is to advertise
connectivity to in its TC messages; this MUST include all of its MPR
selectors.
The Neighbor Set finally records each 1-hop neighbor's originator o Its willingness to be a flooding MPR and to be a routing MPR.
address, as deduced from received HELLO messages as described in
Section 14.4. This, and other information in the Neighbor Set, o Whether it has been selected by this router as a flooding MPR or
including each 1-hop neighbor's routable addresses, is used in as a routing MPR, and whether it is a routing MPR selector of this
advertising the selected symmetric 1-hop neighbors in TC messages. router. (Whether it is a flooding MPR selector of this neighbor
is recorded in the Interface Information Base.)
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 other router from
which TC messages have been received. This is used in order to which TC messages have been received. This is used in order to
determine if a received TC message contains fresh or outdated 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.
skipping to change at page 15, line 15 skipping to change at page 15, line 43
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. processed exactly once by a router.
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
[NHDP], extended according to Section 14 of this specification to [RFC6130], extended according to Section 15 of this specification to
include an originator address and MPR selection information. include an originator address, link metrics, and MPR selection
information.
This protocol specifies a single message type, the TC message. TC This protocol specifies 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. This interval may be fixed, or may be dynamic, for
example it may be backed off due to congestion or network stability. example it may be backed off due to congestion or network stability.
TC messages may also be sent as a response to a change in the router TC messages may also be sent as a response to a change in the router
itself, or its advertised 1-hop neighborhood, for example on first itself, or its advertised 1-hop neighborhood, for example on first
being selected as an MPR. 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 used 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 MPR selectors, it may also advertises all of the originating router's routing MPR selectors, it
advertise other symmetric 1-hop neighbors. Complete TC messages are may also advertise other symmetric 1-hop neighbors. Complete TC
generated periodically (and also, optionally, in response to messages are generated periodically (and also, optionally, in
neighborhood changes). Incomplete TC messages may be used to report response to neighborhood changes). Incomplete TC messages may be
additions to advertised information, without repeating unchanged used to report additions to advertised information, without repeating
information. 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 include an originator address for the router that created the
message. A TC message reports both the originator addresses and message. A TC message reports both the originator addresses and
routable addresses of its advertised neighbors, distinguishing the routable addresses of its advertised neighbors, distinguishing the
two using an Address Block TLV (an address may be both routable and two using an Address Block TLV (an address may be both routable and
an originator address). TC messages also report the originator's an originator address). TC messages also report the originator's
locally attached networks. 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 only if it is received from (i.e., retransmits a TC message only if it is received from (i.e.,
originated from or was last relayed by) one of that router's MPR originated from or was last relayed by) one of that router's flooding
selectors. 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,
e.g., allowing a router to ensure that nearer routers are kept more e.g., allowing a router to ensure that nearer routers are kept more
up to date than distant routers, such as is used in Fisheye State up to date than distant routers, such as is used in Fisheye State
Routing [FSR] and Fuzzy Sighted Link State routing [FSLS]. This is Routing [FSR] and Fuzzy Sighted Link State routing [FSLS]. This is
enabled using [RFC5497]. enabled using [RFC5497].
4.5. Routing Set TC messages include outgoing neighbor metrics that will be used in
the creation of route metrics.
4.5. Link Metrics
OLSRv1 [RFC3626] created minimum hop routes to destinations. However
in many, if not most, circumstances, better routes (in terms of
quality of service for end users) can be created by use of link
metrics.
OLSRv2, as defined in this specification, allows links to have a
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
routes, where the length of a route is defined as the sum of the
metrics of the links in that route.
Link metrics are defined to be directional; the link metric from one
router to another may be different from that on the reverse link.
The link metric is assessed at the receiver, as on a (typically)
wireless link, that is the better informed as to link information.
Both incoming and outgoing link information is used by OLSRv2, the
distinctions in the specification must be clearly followed.
This specification also defines both incoming annd outgoing neighbor
metrics for each symmetric 1-hop neighbor, these being the minimum
value of the link metrics in the same direction for all symmstric
links with that neighbor. Note that this means that all neighbor
metric values are link metric values and that specification of, for
example, link metric value encoding also includes neighbor metric
values.
This specification does not define the nature of the link metric.
However this psecification allows, through use of the type extension
of a defined Address Block TLV, for link metrics with specific
meanings to be defined and either allocated by IANA or privately
used. Each HELLO or TC message carrying link (or neighbor) metrics
thus indicates which link metric information it is carrying, thus
allowing routers to determine if they can interoperate. If link
metrics require additional signaling to determine their values,
whether in HELLO messages or otherwise, then this is permitted but is
outside the scope of this specification.
Users are advised that they should carefully consider how to use link
metrics. In particular they should not simply default to use of all
links with equal metrics (i.e. hop count) without careful
consideration of whether that is advisable or not.
4.6. Routing Set
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 packet routing,
by using its contents to update IP's routing tables. That update, by using its contents to update IP's routing tables. That update,
skipping to change at page 16, line 49 skipping to change at page 18, line 32
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 [NHDP] plus those defined in this section. The separation defined in [RFC6130] plus those defined in this section. The
in [NHDP] into interface parameters, router parameters and constants separation in [RFC6130] into interface parameters, router parameters
is also used in this specification, however all but one and constants is also used in this specification.
(RX_HOLD_TIME) of the parameters added by this specification are
router parameters.
Parameters and constants are detailed in the following sections. As As for the parameters in [RFC6130], parameters defined in this
for the parameters in [NHDP], parameters defined in this
specification may be changed dynamically by a router, and need not be specification may be changed dynamically by a router, and need not be
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 [NHDP] SHOULD, in a given deployment TC messages and HELLO messages [RFC6130] SHOULD, in a given
of this protocol, both be using the same of either of IP or UDP, in deployment of this protocol, both be using the same of either of IP
order that it is possible to combine messages of both protocols into or UDP, in order that it is possible to combine messages of both
the same [RFC5444] packet for transmission. protocols into the same [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. Local History Times 5.3. Interface Parameters
5.3.1. Received Message Validity Time
The following parameter manages the validity time of recorded
received message information:
RX_HOLD_TIME - is the period after receipt of a message by the
appropriate OLSRv2 interface of this router for which that
information is recorded, in order that the message is recognized
as having been previously received on this OLSRv2 interface.
The following constraints apply to this parameters:
o RX_HOLD_TIME > 0
o RX_HOLD_TIME SHOULD be greater than the maximum difference in time
that a message may take to traverse the MANET, taking into account
any message forwarding jitter as well as propagation, queuing, and
processing delays.
5.4. Router Parameters
5.4.1. Local History Times
The following router parameter manages the time for which local The following router parameter manages the time for which local
information is retained: information is retained:
O_HOLD_TIME - is used to define the time for which a recently used O_HOLD_TIME - is used to define the time for which a recently used
and replaced originator address is used to recognize the router's and replaced originator address is used to recognize the router's
own messages. own messages.
The following constraint applies to this parameter: The following constraint applies to this parameter:
o O_HOLD_TIME >= 0 o O_HOLD_TIME >= 0
5.4. Message Intervals 5.4.2. Link_Metric_Parameters
The following router parameters regulate TC message transmissions by All routes found using this specification use a single link metric
a router. TC messages are usually sent periodically, but MAY also be type that is specified by the router parameter LINK_METRIC_TYPE,
which may take any value from 0 to 255, inclusive.
5.4.3. Message Intervals
The following parameters regulate TC message transmissions by a
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 - is the maximum time between the transmission of two TC_INTERVAL - is the maximum time between the transmission of two
skipping to change at page 18, line 33 skipping to change at page 20, line 41
o TC_INTERVAL > 0 o TC_INTERVAL > 0
o TC_MIN_INTERVAL >= 0 o TC_MIN_INTERVAL >= 0
o TC_INTERVAL >= TC_MIN_INTERVAL o TC_INTERVAL >= TC_MIN_INTERVAL
o If TLVs with Type = INTERVAL_TIME, as defined in [RFC5497], are o If TLVs with Type = INTERVAL_TIME, as defined in [RFC5497], are
included in TC messages, then TC_INTERVAL MUST be representable as included in TC messages, then TC_INTERVAL MUST be representable as
described in [RFC5497]. described in [RFC5497].
5.5. Advertised Information Validity Times 5.4.4. Advertised Information Validity Times
The following router parameters manage the validity time of The following parameters manage the validity time of information
information advertised in TC messages: advertised in TC messages:
T_HOLD_TIME - is used to define the minimum value in the TLV with T_HOLD_TIME - is used to define the minimum value in the TLV with
Type = VALIDITY_TIME included in all TC messages sent by this Type = VALIDITY_TIME included in all TC messages sent by this
router. If a single value of parameter TC_HOP_LIMIT (see router. If a single value of parameter TC_HOP_LIMIT (see
Section 5.8) is used then this will be the only value in that TLV. Section 5.4.7) is used then this will be the only value in that
TLV.
A_HOLD_TIME - is the period during which TC messages are sent after A_HOLD_TIME - is the period during which TC messages are sent after
they no longer have any advertised information to report, but are they no longer have any advertised information to report, but are
sent in order to accelerate outdated information removal by other sent in order to accelerate outdated information removal by other
routers. routers.
The following constraints apply to these parameters: The following constraints apply to these parameters:
o T_HOLD_TIME > 0 o T_HOLD_TIME > 0
o A_HOLD_TIME >= 0 o A_HOLD_TIME >= 0
o T_HOLD_TIME >= TC_INTERVAL o T_HOLD_TIME >= TC_INTERVAL
o If TC messages can be lost, then both T_HOLD_TIME and A_HOLD_TIME o If TC messages can be lost, then both T_HOLD_TIME and A_HOLD_TIME
SHOULD be significantly greater than TC_INTERVAL; a value >= 3 x SHOULD be significantly greater than TC_INTERVAL; a value >= 3 x
TC_INTERVAL is RECOMMENDED. TC_INTERVAL is RECOMMENDED.
o T_HOLD_TIME MUST be representable as described in [RFC5497]. o T_HOLD_TIME MUST be representable as described in [RFC5497].
5.6. Received Message Validity Times 5.4.5. Processing and Forwarding Validity Times
The following parameters manage the validity time of recorded
received message information:
RX_HOLD_TIME - is an interface parameter, and is the period after The following parameters manage the processing and forwarding
receipt of a message by the appropriate OLSRv2 interface of this validity time of recorded message information:
router for which that information is recorded, in order that the
message is recognized as having been previously received on this
OLSRv2 interface.
P_HOLD_TIME - is a router parameter, and is the period after receipt P_HOLD_TIME is the period after receipt of a message that is
of a message that is processed by this router for which that processed by this router for which that information is recorded,
information is recorded, in order that the message is not in order that the message is not processed again if received
processed again if received again. again.
F_HOLD_TIME - is a router parameter, and is the period after receipt F_HOLD_TIME is the period after receipt of a message that is
of a message that is forwarded by this router for which that forwarded by this router for which that information is recorded,
information is recorded, in order that the message is not in order that the message is not forwarded again if received
forwarded again if received again. again.
The following constraints apply to these parameters: The following constraints apply to these parameters:
o RX_HOLD_TIME > 0
o P_HOLD_TIME > 0 o P_HOLD_TIME > 0
o F_HOLD_TIME > 0 o F_HOLD_TIME > 0
o All of these parameters SHOULD be greater than the maximum o Both of these parameters SHOULD be greater than the maximum
difference in time that a message may take to traverse the MANET, difference in time that a message may take to traverse the MANET,
taking into account any message forwarding jitter as well as taking into account any message forwarding jitter as well as
propagation, queuing, and processing delays. propagation, queuing, and processing delays.
5.7. Jitter 5.4.6. Jitter
If jitter, as defined in [RFC5148], is used then the governing jitter If jitter, as defined in [RFC5148], is used then the governing jitter
parameters are as follows: parameters are as follows:
TP_MAXJITTER - represents the value of MAXJITTER used in [RFC5148] TP_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
for periodically generated TC messages sent by this router. for periodically generated TC messages sent by this router.
TT_MAXJITTER - represents the value of MAXJITTER used in [RFC5148] TT_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
for externally triggered TC messages sent by this router. for externally triggered TC messages sent by this router.
F_MAXJITTER - represents the default value of MAXJITTER used in F_MAXJITTER - represents the default value of MAXJITTER used in
[RFC5148] for messages forwarded by this router. However before [RFC5148] for messages forwarded by this router. However before
using F_MAXJITTER a router MAY attempt to deduce a more using F_MAXJITTER a router MAY attempt to deduce a more
appropriate value of MAXJITTER, for example based on any TLVs with appropriate value of MAXJITTER, for example based on any TLVs with
Type = INTERVAL_TIME or Type = VALIDITY_TIME contained in the Type = INTERVAL_TIME or Type = VALIDITY_TIME contained in the
message to be forwarded. message to be forwarded.
For constraints on these parameters see [RFC5148]. For constraints on these parameters see [RFC5148].
5.8. Hop Limit Parameter 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, SHOULD 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 SHOULD 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
skipping to change at page 21, line 5 skipping to change at page 23, line 5
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,
a value of 255 is RECOMMENDED. Note that if using a pattern of a value of 255 is RECOMMENDED. Note that if using a pattern of
different values of TC_HOP_LIMIT as described above, then only the different values of TC_HOP_LIMIT as described above, then only the
maximum value in the pattern is so constrained. maximum value in the pattern is so constrained.
o All values of TC_HOP_LIMIT >= 2. o All values of TC_HOP_LIMIT >= 2.
5.9. Willingness 5.4.8. Willingness
Each router has a WILLINGNESS parameter, which MUST be in the range Each router has two willingness parameters: WILL_FLOODING and
WILL_NEVER to WILL_ALWAYS, inclusive, and which represents the WILL_ROUTING, each of which MUST be in the range WILL_NEVER to
router's willingness to be an MPR, and hence its willingness to WILL_ALWAYS, inclusive.
forward messages and be an intermediate router on routes. The higher
the value, the greater the router's willingness to be an MPR. If a
router has WILLINGNESS = WILL_NEVER (the lowest possible value) it
does not perform these tasks. A MANET using this protocol with too
many routers having WILLINGNESS = WILL_NEVER will not function; it
MUST be ensured, by administrative or other means, that this does not
happen. If a router has WILLINGNESS = WILL_ALWAYS (the highest
possible value) then it MUST always be selected as an MPR by all
symmetric 1-hop neighbors.
Routers MAY have different WILLINGNESS values; however the three WILL_FLOODING represents the router's willingness to be selected as a
constants WILL_NEVER, WILL_DEFAULT and WILL_ALWAYS MUST have the flooding MPR and hence to participate in MPR flooding, in particular
values defined in Section 19. (Use of WILLINGNESS = WILL_DEFAULT of TC messages.
allows a router to avoid advertising its WILLINGNESS in its HELLO
messages.)
The following constraints apply to this parameter: WILL_ROUTING represents the router's willingness to be selected as a
routing MPR and hence to be an intermediate router on routes.
o WILLINGNESS >= WILL_NEVER In either case, the higher the value, the greater the router's
willingness to be a flooding or routing MPR, respectively. If a
router has a willingness value of WILL_NEVER (the lowest possible
value) it does not perform the corresponding task. A MANET using
this protocol with too many routers having either willingness value
equal to WILL_NEVER will not function; it MUST be ensured, by
administrative or other means, that this does not happen.
o WILLINGNESS <= WILL_ALWAYS 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
routing MPR, respectively, by all symmetric 1-hop neighbors.
5.10. Parameter Change Constraints A MANET in which all routers have WILL_FLOODING = WILL_ALWAYS, the
flooding operation will effectively disable optimizations, and
perform as classic flooding.
A router, which has WILL_ROUTING = WILL_NEVER will not act as an
intermediate router in the MANET. Such a router can, act as a
source, destination or gateway to another routing domain.
Different routers MAY have different values for WILL_FLOODING and/or
WILL_ROUTING. A router that has both WILL_FLOODING = WILL_DEFAULT
and WILL_ROUTING = WILL_DEFAULT need not include an MPR_WILLING TLV
in its HELLO messages.
The following constraints apply to these parameters:
o WILL_FLOODING >= WILL_NEVER
o WILL_FLOODING <= WILL_ALWAYS
o WILL_ROUTING >= WILL_NEVER
o WILL_ROUTING <= WILL_ALWAYS
5.5. Parameter Change Constraints
If protocol parameters are changed dynamically, then the constraints If protocol parameters are changed dynamically, then the constraints
in this section apply. in this section apply.
RX_HOLD_TIME
* If RX_HOLD_TIME for an OLSRv2 interface changes, then the
expiry time for all Received Tuples for that OLSRv2 interface
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 for a router changes, then the expiry time for
all Originator Tuples MAY be changed. all Originator Tuples MAY be changed.
TC_INTERVAL TC_INTERVAL
* If the TC_INTERVAL for a router increases, then the next TC * If the TC_INTERVAL for a router increases, then the next TC
message generated by this router MUST be generated according to message generated by this router MUST be generated according to
the previous, shorter, TC_INTERVAL. Additional subsequent TC the previous, shorter, TC_INTERVAL. Additional subsequent TC
messages MAY be generated according to the previous, shorter, messages MAY be generated according to the previous, shorter,
TC_INTERVAL. TC_INTERVAL.
* If the TC_INTERVAL for a router decreases, then the following * If the TC_INTERVAL for a router decreases, then the following
TC messages from this router MUST be generated according to the TC messages from this router MUST be generated according to the
current, shorter, TC_INTERVAL. current, shorter, TC_INTERVAL.
RX_HOLD_TIME
* If RX_HOLD_TIME for an OLSRv2 interface changes, then the
expiry time for all Received Tuples for that OLSRv2 interface
MAY be changed.
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 22, line 45 skipping to change at page 25, line 19
rescheduled. rescheduled.
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.
6. Local Information Base LINK_METRIC_TYPE
The Local Information Base, as defined for each router in [NHDP], is * If LINK_METRIC_TYPE changes then all link metric information
extended by this protocol by: recorded by the router is invalid. The router MUST take the
following actions, and all consequent actions described in
Section 17 and [RFC6130].
+ For each Link Tuple in any Link Set, either update
L_in_metric (the value MAXIMUM_METRIC MAY be used) or remove
the Link Tuple from the Link Set.
+ For each Link Tuple that is not removed, set:
- L_out_metric := UNKNOWN_METRIC;
- L_SYM_time := expired;
- L_MPR_selector := false.
+ Remove all Router Topology Tuples, Routable Address Topology
Tuples, Attached Network Tuples and Routing Tuples from
their respective protocol sets in the Topology Information
Base.
5.6. Constants
5.6.1. Link Metric Constants
The constant minimum, maximum and default metric values are defined
by:
o MINIMUM_METRIC := 1
o MAXIMUM_METRIC := 16776960
o DEFAULT_METRIC := 256
The symbolic value UNKNOWN_METRIC is defined in Section 6.1.
6. Link Metric Values
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
metrics for routes by the addition of link metric values.
6.1. Link Metric Representation
Link metric are reported in messages using a compressed
representation that occupies 12 bits, a 4 bit field and an 8 bit
field. The compressed representation represents positive integer
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
exact representation in the compressed form are used. Route metrics
are the summation of no more then 255 link metric values, and can
therefore be represented using no more than 32 bits.
Link and route metrics used in the Information Bases defined in this
specification refer to the uncompressed values, and arithmetic
involving them does likewise, and assumes full precision in the
result. (How an implementation records the values is not part of
this specification, as long as it behaves as if recording
uncompressed values. An implementation can, for example, use 32 bit
values for all link and route metrics.)
In some cases a link metric value may be unknown. This is indicated
in this specification by the value UNKNOWN_METRIC. An implementation
may use any representation of UNKNOWN_METRIC as it is never included
in messages or used in any computation. (Possible values are zero,
or any value greater than the maximum representable metric value.)
6.2. Link Metric Compressed Form
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
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
ordering of the represented values.
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
MINUMUM_METRIC = 1 and a maximum value (when a = 15 and b = 255) of
MAXIMUM_METRIC = 2^24 - 256.
An algorithm for computing a and b for the smallest representable
value not less than a link metric value v such that MINIMUM_METRIC <=
v <= MAXIMUM_METRIC is:
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
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
The Local Information Base, as defined for each router in [RFC6130],
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 6.1, and a o The addition of an Originator Set, defined in Section 7.1, and a
Local Attached Network Set, defined in Section 6.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
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.
6.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 this set is always empty and MAY be
omitted. It consists of Originator Tuples: 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.
6.2. Local Attached Network Set 7.2. Local Attached Network Set
A router's Local Attached Network Set records its local non-OLSRv2 A router's Local Attached Network Set records its local non-OLSRv2
interfaces via which it can act as gateways to other networks. The interfaces via which it can act as gateways to other networks. The
Local Attached Network Set is not modified by this protocol. This Local Attached Network Set is not modified by this protocol. This
protocol MAY respond to changes to the Local Attached Network Set, protocol MAY respond to changes to the Local Attached Network Set,
which MUST reflect corresponding changes in the router's status. It which MUST reflect corresponding changes in the router's status. It
consists of Local Attached Network Tuples: consists of Local Attached Network Tuples:
(AL_net_addr, AL_dist) (AL_net_addr, AL_dist, AL_metric)
where: where:
AL_net_addr - is the network address of an attached network which AL_net_addr - is the network address of an attached network which
can be reached via this router. This SHOULD be a routable can be reached via this router. This SHOULD be a routable
address. It is constrained as described below. address. It is constrained as described below.
AL_dist - is the number of hops to the network with network address AL_dist - is the number of hops to the network with network address
AL_net_addr from this router. AL_net_addr from this router.
AL_metric - is the metric of the link to the attached network with
address AL_net_addr from this router;
Attached networks local to this router only (i.e., not reachable Attached networks local to this router only (i.e., not reachable
except via this router) SHOULD be treated as local non-MANET except via this router) SHOULD be treated as local non-MANET
interfaces, and added to the Local Interface Set, as specified in interfaces, and added to the Local Interface Set, as specified in
[NHDP], rather than be added to the Local Attached Network Set. [RFC6130], rather than be added to the Local Attached Network Set.
Because an attached network is not specific to the router, and may be Because an attached network is not specific to the router, and may be
outside the MANET, an attached network MAY also be attached to other outside the MANET, an attached network MAY also be attached to other
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 routers' 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.
7. Interface Information Base 8. Interface Information Base
An Interface Information Base, as defined in [NHDP], is maintained An Interface Information Base, as defined in [RFC6130], is maintained
for each OLSRv2 interface. It is not modified by this protocol. for each OLSRv2 interface. Its Link Set and 2-Hop Set are modified
by this protocol.
8. Neighbor Information Base The Link Set is modified by adding these additional elements to each
Link Tuple:
An Neighbor Information Base, as defined in [NHDP], is maintained for L_in_metric - is the metric of the link from the OLSRv2 interface
each router. It is modified by this protocol by adding these with addresses L_neighbor_iface_addr_list to this 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
interface;
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
selector of this router.
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 =
SYMMETRIC MUST have a specified value of L_in_metric.
A Link Tuple created (but not updated) by [RFC6130] MUST set:
o L_in_metric := unknown;
o L_out_metric := unknown;
o L_mpr_selector := false.
The 2-Hop Set is modified by adding these additional elements to each
2-Hop Tuple:
N2_in_metric - is the router metric from the router with address
N2_2hop_iface_addr to the router with OLSRv2 interface addresses
N2_neighbor_iface_addr_list;
N2_out_metric - is the router metric to the router with address
N2_2hop_iface_addr from the router with OLSRv2 interface addresses
N2_neighbor_iface_addr_list.
A Neighbor Tuple created (but not updated) by [RFC6130] MUST set:
o N2_in_metric := unknown;
o N2_out_metric := unknown.
9. Neighbor Information Base
An Neighbor Information Base, as defined in [RFC6130], is maintained
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:
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_willingness - is the neighbor's willingness to be selected as an N_in_metric - is the router metric of any link from this neighbor to
MPR, in the range from WILL_NEVER to WILL_ALWAYS, both inclusive; this router, i.e., the minimum of all corresponding L_in_metric
with L_status = SYMMETRIC, unspecified if there are no such Link
Tuples;
N_mpr - is a boolean flag, describing if this neighbor is selected N_out_metric - is the router metric of any link from this router to
as an MPR by this router; this neighbor, i.e., the minimum of all corresponding L_out_metric
with L_status = SYMMETRIC, unspecified if there are no such Link
Tuples;
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
inclusive;
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
inclusive;
N_flooding_mpr - is a boolean flag, describing if this neighbor is
selected as a flooding MPR by this router;
N_routing_mpr - is a boolean flag, describing if this neighbor is
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 an MPR, i.e., is an MPR selector of this selected this router as a routing MPR, i.e., is a routing MPR
router. selector of this router.
N_advertised - is a boolean flag, describing if this router has N_advertised - is a boolean flag, describing if this router has
elected to advertise a link to this neighbor in its TC messages. elected to advertise a link to this neighbor in its TC messages.
A Neighbor Tuple created (but not updated) by [NHDP] MUST set: A Neighbor Tuple created (but not updated) by [RFC6130] MUST set:
N_orig_addr := unknown; o N_orig_addr := unknown;
N_willingness := WILL_NEVER; o N_in_metric := unknown;
N_mpr := false; o N_out_metric := unknown;
N_mpr_selector := false; o N_will_flooding := WILL_NEVER;
N_advertised := false. o N_will_routing := WILL_NEVER;
o N_routing_mpr := false;
o N_flooding_mpr := false;
o N_mpr_selector := false;
o N_advertised := false.
The Neighbor Information Base also includes a variable, the The Neighbor Information Base also includes a variable, the
Advertised Neighbor Sequence Number (ANSN), whose value is included Advertised Neighbor Sequence Number (ANSN), whose value is included
in TC messages to indicate the freshness of the information in TC messages to indicate the freshness of the information
transmitted. The ANSN is incremented whenever advertised information transmitted. The ANSN is incremented whenever advertised information
(the originator and routable addresses included in Neighbor Tuples (the originator and routable addresses included in Neighbor Tuples
with N_advertised = true, and local attached networks recorded in the with N_advertised = true, and local attached networks recorded in the
Local Attached Network Set in the Local Information Base) changes, Local Attached Network Set in the Local Information Base) changes,
including addition or removal of such information. including addition or removal of such information.
9. Topology Information Base 10. Topology Information Base
The Topology Information Base, defined for each router by this The Topology Information Base, defined for each router by this
specification, stores information received in TC messages, in the specification, stores information received in TC messages, in the
Advertising Remote Router Set, the Router Topology Set, the Routable Advertising Remote Router Set, the Router Topology Set, the Routable
Address Topology Set and the Attached Network Set. Address Topology Set and the Attached Network Set.
Additionally, a Routing Set is maintained, derived from the Additionally, a Routing Set is maintained, derived from the
information recorded in the Local Information Base, the Interface information recorded in the Local Information Base, the Interface
Information Bases, the Neighbor Information Base and the rest of the Information Bases, the Neighbor Information Base and the rest of the
Topology Information Base. Topology Information Base.
9.1. Advertising Remote Router Set 10.1. Advertising Remote Router Set
A router's Advertising Remote Router Set records information A router's Advertising Remote Router Set records information
describing each remote router in the network that transmits TC describing each remote router in the network that transmits TC
messages, allowing outdated TC messages to be recognized and messages, allowing outdated TC messages to be recognized and
discarded. It consists of Advertising Remote Router Tuples: discarded. It consists of Advertising Remote Router Tuples:
(AR_orig_addr, AR_seq_number, AR_time) (AR_orig_addr, AR_seq_number, AR_time)
where: where:
skipping to change at page 26, line 18 skipping to change at page 32, line 18
note that this does not include a prefix length; note that this does not include a prefix length;
AR_seq_number - is the greatest ANSN in any TC message received AR_seq_number - is the greatest ANSN in any TC message received
which originated from the router with originator address which originated from the router with originator address
AR_orig_addr (i.e., which contributed to the information contained AR_orig_addr (i.e., which contributed to the information contained
in this Tuple); in this Tuple);
AR_time - is the time at which this Tuple expires and MUST be AR_time - is the time at which this Tuple expires and MUST be
removed. removed.
9.2. Router Topology Set 10.2. Router Topology Set
A router's Topology Set records topology information about the links A router's Topology Set records topology information about the links
between routers in the MANET. It consists of Router Topology Tuples: between routers in the MANET. It consists of Router Topology Tuples:
(TR_from_orig_addr, TR_to_orig_addr, TR_seq_number, TR_time) (TR_from_orig_addr, TR_to_orig_addr, TR_seq_number, TR_metric,
TR_time)
where: where:
TR_from_orig_addr - is the originator address of a router which can TR_from_orig_addr - is the originator address of a router which can
reach the router with originator address TR_to_orig_addr in one reach the router with originator address TR_to_orig_addr in one
hop, note that this does not include a prefix length; hop, note that this does not include a prefix length;
TR_to_orig_addr - is the originator address of a router which can be TR_to_orig_addr - is the originator address of a router which can be
reached by the router with originator address TR_to_orig_addr in reached by the router with originator address TR_to_orig_addr in
one hop, note that this does not include a prefix length; one hop, note that this does not include a prefix length;
TR_seq_number - is the greatest ANSN in any TC message received TR_seq_number - is the greatest ANSN in any TC message received
which originated from the router with originator address which originated from the router with originator address
TR_from_orig_addr (i.e., which contributed to the information TR_from_orig_addr (i.e., which contributed to the information
contained in this Tuple); contained in this Tuple);
TR_metric - is the router metric from the router with originator
address TR_from_orig_addr to the router with originator address
TR_to_orig_addr;
TR_time - specifies the time at which this Tuple expires and MUST be TR_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
9.3. Routable Address Topology Set 10.3. Routable Address Topology Set
A router's Routable Address Topology Set records topology information A router's Routable Address Topology Set records topology information
about the routable addresses within the MANET, and via which routers about the routable addresses within the MANET, and via which routers
they may be reached. It consists of Routable Address Topology they may be reached. It consists of Routable Address Topology
Tuples: Tuples:
(TA_from_orig_addr, TA_dest_addr, TA_seq_number, TA_time) (TA_from_orig_addr, TA_dest_addr, TA_seq_number, TA_metric,
TA_time)
where: where:
TA_from_orig_addr - is the originator address of a router which can TA_from_orig_addr - is the originator address of a router which can
reach the router with routable address TA_dest_addr in one hop, reach the router with routable address TA_dest_addr in one hop,
note that this does not include a prefix length; note that this does not include a prefix length;
TA_dest_addr - is a routable address of a router which can be TA_dest_addr - is a routable address of a router which can be
reached by the router with originator address TA_from_orig_addr in reached by the router with originator address TA_from_orig_addr in
one hop; one hop;
TA_seq_number - is the greatest ANSN in any TC message received TA_seq_number - is the greatest ANSN in any TC message received
which originated from the router with originator address which originated from the router with originator address
TA_from_orig_addr (i.e., which contributed to the information TA_from_orig_addr (i.e., which contributed to the information
contained in this Tuple); contained in this Tuple);
TA_metric - is the router metric from the router with originator
address TA_from_orig_addr to the router with OLSRv2 interface
address TA_dest_addr;
TA_time - specifies the time at which this Tuple expires and MUST be TA_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
9.4. Attached Network Set 10.4. Attached Network Set
A router's Attached Network Set records information about networks A router's Attached Network Set records information about networks
(which may be outside the MANET) attached to other routers and their (which may be outside the MANET) attached to other routers and their
routable addresses. It consists of Attached Network Tuples: routable addresses. It consists of Attached Network Tuples:
(AN_orig_addr, AN_net_addr, AN_dist, AN_seq_number, AN_time) (AN_orig_addr, AN_net_addr, AN_seq_number, AN_dist, AN_metric,
AN_time)
where: where:
AN_orig_addr - is the originator address of a router which can act AN_orig_addr - is the originator address of a router which can act
as gateway to the network with network address AN_net_addr, note as gateway to the network with network address AN_net_addr, note
that this does not include a prefix length; that this does not include a prefix length;
AN_net_addr - is the network address of an attached network, which AN_net_addr - is the network address of an attached network, which
may be reached via the router with originator address may be reached via the router with originator address
AN_orig_addr; AN_orig_addr;
AN_dist - is the number of hops to the network with network address
AN_net_addr from the router with originator address AN_orig_addr;
AN_seq_number - is the greatest ANSN in any TC message received AN_seq_number - is the greatest ANSN in any TC message received
which originated from the router with originator address which originated from the router with originator address
AN_orig_addr (i.e., which contributed to the information contained AN_orig_addr (i.e., which contributed to the information contained
in this Tuple); in this Tuple);
AN_dist - is the number of hops to the network with network address
AN_net_addr from the router with originator address AN_orig_addr;
AN_metric - is the metric of the link from the router with
originator address AN_orig_addr to the attached network with
address AN_net_addr;
AN_time - specifies the time at which this Tuple expires and MUST be AN_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
9.5. Routing Set 10.5. Routing Set
A router's Routing Set records the first hop along a selected path to A router's Routing Set records the first hop along a selected path to
each destination for which any such path is known. It consists of each destination for which any such path is known. It consists of
Routing Tuples: Routing Tuples:
(R_dest_addr, R_next_iface_addr, R_local_iface_addr, R_dist) (R_dest_addr, R_next_iface_addr, R_local_iface_addr, R_dist,
R_metric)
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 a 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
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 Two Hop Sets). The Routing Set is Network Set, and OPTIONALLY the Two 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.
10. 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.
10.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:
RX_type - is the received Message Type; RX_type - is the received Message Type;
RX_orig_addr - is the originator address of the received message, RX_orig_addr - is the originator address of the received message,
note that this does not include a prefix length; note that this does not include a prefix length;
RX_seq_number - is the message sequence number of the received RX_seq_number - is the message sequence number of the received
message; message;
RX_time - specifies the time at which this Tuple expires and MUST be RX_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
10.2. Processed Set 11.2. Processed Set
A router has a single Processed Set which records signatures of A router has a single Processed Set which records signatures of
messages which have been processed by the router. It consists of messages which have been processed by the router. It consists of
Processed Tuples: Processed Tuples:
(P_type, P_orig_addr, P_seq_number, P_time) (P_type, P_orig_addr, P_seq_number, P_time)
where: where:
P_type - is the processed Message Type; P_type - is the processed Message Type;
P_orig_addr - is the originator address of the processed message, P_orig_addr - is the originator address of the processed message,
note that this does not include a prefix length; note that this does not include a prefix length;
P_seq_number - is the message sequence number of the processed P_seq_number - is the message sequence number of the processed
message; message;
P_time - specifies the time at which this Tuple expires and MUST be P_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
10.3. Forwarded Set 11.3. Forwarded Set
A router has a single Forwarded Set which records signatures of A router has a single Forwarded Set which records signatures of
messages which have been forwarded by the router. It consists of messages which have been forwarded by the router. It consists of
Forwarded Tuples: Forwarded Tuples:
(F_type, F_orig_addr, F_seq_number, F_time) (F_type, F_orig_addr, F_seq_number, F_time)
where: where:
F_type - is the forwarded Message Type; F_type - is the forwarded Message Type;
skipping to change at page 30, line 4 skipping to change at page 36, line 22
A router has a single Forwarded Set which records signatures of A router has a single Forwarded Set which records signatures of
messages which have been forwarded by the router. It consists of messages which have been forwarded by the router. It consists of
Forwarded Tuples: Forwarded Tuples:
(F_type, F_orig_addr, F_seq_number, F_time) (F_type, F_orig_addr, F_seq_number, F_time)
where: where:
F_type - is the forwarded Message Type; F_type - is the forwarded Message Type;
F_orig_addr - is the originator address of the forwarded message, F_orig_addr - is the originator address of the forwarded message,
note that this does not include a prefix length; note that this does not include a prefix length;
F_seq_number - is the message sequence number of the forwarded F_seq_number - is the message sequence number of the forwarded
message; message;
F_time - specifies the time at which this Tuple expires and MUST be F_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
11. Updating Information Bases 12. Information Base Properties
The purpose of this protocol is to determine the contents of the
router's Routing Set, which may be used to update IP's Routing Table,
providing "next hop" routing information for IP packets. This is
performed by first updating the other Protocol Sets in the
Information Bases, and then using information from some of those
other Protocol Sets to determine the contents of the Routing Set.
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,
skipping to change at page 31, line 46 skipping to change at page 38, line 8
o Overlapping the I_local_iface_addr_list in a Local Interface o Overlapping the I_local_iface_addr_list in a Local Interface
Tuple, OR; Tuple, OR;
o Overlapping the IR_local_iface_addr in a Removed Interface Address o Overlapping the IR_local_iface_addr in a Removed Interface Address
Tuple, OR; Tuple, OR;
o Equaling or having as a sub-range an AL_net_addr in a Local o Equaling or having as a sub-range an AL_net_addr in a Local
Attached Network Tuple. Attached Network Tuple.
12. Packets and Messages 13. Packets and Messages
The packet and message format used by this protocol is defined in The packet and message format used by this protocol is defined in
[RFC5444]. Except as otherwise noted, options defined in [RFC5444] [RFC5444]. Except as otherwise noted, options defined in [RFC5444]
may be freely used, in particular alternative formats defined by may be freely used, in particular alternative formats defined by
packet, message, Address Block and TLV flags. packet, message, Address Block and TLV flags.
This section describes the usage of the packets and messages defined
in [RFC5444] by this specification, and the TLVs defined by, and used
in, this specification.
13.1. Messages
Routers using this protocol exchange information through messages. Routers using this protocol exchange information through messages.
The message types used by this protocol are the HELLO message and the The message types used by this protocol are the HELLO message and the
TC message. The HELLO message is defined by [NHDP] and extended by TC message. The HELLO message is defined by [RFC6130] and extended
this specification, see Section 14. The TC message is defined by by this specification, see Section 15. The TC message is defined by
this specification, see Section 15. this specification, see Section 16.
13.2. Packets
One or more messages sent by a router at the same time SHOULD be One or more messages sent by a router at the same time SHOULD be
combined into a single packet, subject to any constraints on maximum combined into a single packet, subject to any constraints on maximum
packet size (such as derived from the MTU over a local single hop) packet size (such as derived from the MTU over a local single hop)
that MAY be imposed. These messages may have originated at the that MAY be imposed. These messages may have originated at the
sending router, or have originated at another router and are being sending router, or have originated at another router and are being
forwarded by the sending router. Messages with different originating forwarded by the sending router. Messages with different originating
routers MAY be combined for transmission within the same packet. routers MAY be combined for transmission within the same packet.
Messages from other protocols defined using [RFC5444], including but Messages from other protocols defined using [RFC5444], including but
not limited to [NHDP], MAY be combined for transmission within the not limited to [RFC6130], MAY be combined for transmission within the
same packet. This specification does not define or use any contents same packet. This specification does not define or use any contents
of the Packet Header. of the Packet Header.
Forwarded messages MAY be jittered as described in [RFC5148]. The Forwarded messages MAY be jittered as described in [RFC5148],
value of MAXJITTER used in jittering a forwarded message MAY be based including the observation that the forwarding jitter of all messages
on information in that message (in particular any Message TLVs with received in a single packet SHOULD be the same. The value of
Type = INTERVAL_TIME or Type = VALIDITY_TIME) or otherwise SHOULD be MAXJITTER used in jittering a forwarded message MAY be based on
with a maximum delay of F_MAXJITTER. A router MAY modify the jitter information in that message (in particular any Message TLVs with Type
= INTERVAL_TIME or Type = VALIDITY_TIME) or otherwise SHOULD be with
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
This specification defines 2 Message TLVs and 4 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. Message Processing and Forwarding 13.3.1. Message TLVs
The MPR_WILLING TLV is used in HELLO messages. At most one
MPR_WILLING TLV may appear in any message.
+-------------+--------------+--------------------------------------+
| Type | Value Length | Value |
+-------------+--------------+--------------------------------------+
| MPR_WILLING | 1 octet | Bits 0-3 encode the parameter |
| | | WILL_FLOODING; bits 4-7 encode the |
| | | parameter WILL_ROUTING. |
+-------------+--------------+--------------------------------------+
Table 1: MPR_WILLING TLV definition
The CONT_SEQ_NUM TLV is used in TC messages. At most one
CONT_SEQ_NUM TLV may appear in any message.
+--------------+--------------+-------------------------------------+
| Type | Value Length | Value |
+--------------+--------------+-------------------------------------+
| CONT_SEQ_NUM | 2 octets | The ANSN contained in the Neighbor |
| | | Information Base. |
+--------------+--------------+-------------------------------------+
Table 2: CONT_SEQ_NUM TLV definition
13.3.2. Address Block TLVs
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
equal to LINK_METRIC_TYPE will be used by this specification. At
most one link metric value of any given kind (link or neighbor) and
direction may be associated with any address.
+-------------+--------------+--------------------------------------+
| Type | Value Length | Value |
+-------------+--------------+--------------------------------------+
| LINK_METRIC | 2 octets | Bits 0-3 indicates kind(s) and |
| | | direction(s), Bits 4-7 indicate |
| | | exponent (a), Bits 8-15 indicate |
| | | mantissa (b) |
+-------------+--------------+--------------------------------------+
Table 3: LINK_METRIC TLV definition
The exponent and mantissa use the representation defined in
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
direction. Any combination of these bits MAY be used, except that
the combination with all bits unset ('0') SHOULD NOT be used.
+-----+-----------------+-----------+
| Bit | Kind | Direction |
+-----+-----------------+-----------+
| 0 | Link metric | Incoming |
| 1 | Link metric | Outgoing |
| 2 | Neighbor metric | Incoming |
| 3 | Neighbor metric | Outgoing |
+-----+-----------------+-----------+
Table 4: LINK_METRIC TLV types and directions
The MPR TLV is used in HELLO messages, and indicates that an address
with which it is associated is of a symmetric 1-hop neighbor that has
been selected as an MPR.
+------+--------------+---------------------------------------------+
| Type | Value Length | Value |
+------+--------------+---------------------------------------------+
| MPR | 1 octet | FLOODING indicates that the corresponding |
| | | address is of a neighbor selected as a |
| | | flooding MPR, ROUTING indicates that the |
| | | corresponding address is of a neighbor |
| | | selected as a routing MPR, FLOOD_ROUTE |
| | | indicates both |
+------+--------------+---------------------------------------------+
Table 5: MPR TLV definition
The NBR_ADDR_TYPE TLV is used in TC messages.
+---------------+--------------+------------------------------------+
| Type | Value Length | Value |
+---------------+--------------+------------------------------------+
| NBR_ADDR_TYPE | 1 octet | ORIGINATOR indicates that the |
| | | corresponding address (which MUST |
| | | have maximum prefix length) is an |
| | | originator address, ROUTABLE |
| | | indicates that the corresponding |
| | | network address is a routable |
| | | address of an interface, |
| | | ROUTABLE_ORIG indicates that the |
| | | corresponding address is both |
+---------------+--------------+------------------------------------+
Table 6: NBR_ADDR_TYPE TLV definition
If an address is both a originator address and a routable address,
then it may be associated with either one Address Block TLV with Type
:= NBR_ADDR_TYPE and Value := ROUTABLE_ORIG, or with two Address
Block TLVs with Type:= NBR_ADDR_TYPE, one with Value := ORIGINATOR
and one with Value := ROUTABLE.
The GATEWAY TLV is used in TC messages. At most one GATEWAY TLV may
be associated with any address.
+---------+--------------+-------------------------------------+
| Type | Value Length | Value |
+---------+--------------+-------------------------------------+
| GATEWAY | 1 octet | Number of hops to attached network. |
+---------+--------------+-------------------------------------+
Table 7: GATEWAY TLV definition
All address objects included in a TC message according to this
specification MUST be associated either with at least one TLV with
Type := NBR_ADDR_TYPE or with a TLV with Type := GATEWAY, but not
both. Any other address objects MAY be included in Address Blocks in
a TC message, but are ignored by this specification.
14. Message Processing and Forwarding
This section describes the optimized flooding operation (MPR This section describes the optimized flooding operation (MPR
flooding) used when control messages, as instances of [RFC5444], are flooding) used when control messages, as instances of [RFC5444], are
intended for MANET wide distribution. This flooding mechanism intended for MANET wide distribution. This flooding mechanism
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 15). Received HELLO messages (see Section 14 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.
13.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 a message of a type specified to be using this
mechanism, which includes the TC messages defined in this mechanism, which includes the TC messages defined in this
specification, a router MUST perform the following: 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 13.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 13.3. Section 14.3.
13.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
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
skipping to change at page 34, line 42 skipping to change at page 43, line 49
+ 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.
2. Process the current message according to its Message Type. 2. Process the current message according to its Message Type.
For a TC message this is as defined in Section 15.4. For a TC message this is as defined in Section 16.3.
13.3. Message Considered for Forwarding 14.3. Message Considered for Forwarding
If a message (the "current message") is considered for forwarding, If a message (the "current message") is considered for forwarding,
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
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 the current message was received (the "receiving interface") then the
skipping to change at page 36, line 31 skipping to change at page 45, line 41
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 if present, decrement <msg-hop-limit> in the
Message Header by 1, AND; Message Header by 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 12. interfaces, as described in Section 13.
14. HELLO messages 15. HELLO Messages
The HELLO message Message Type is owned by [NHDP], and thus HELLO The HELLO message Message Type is owned by [RFC6130], and thus HELLO
messages are generated, transmitted, received and processed by messages are generated, transmitted, received and processed by
[NHDP]. This protocol, as permitted by [NHDP], also uses HELLO [RFC6130]. This protocol, as permitted by [RFC6130], also uses HELLO
messages, including adding to HELLO message generation, and messages, including adding to HELLO message generation, and #
implementing additional processing based on received HELLO messages. implementing additional processing based on received HELLO messages.
HELLO messages are not forwarded by [NHDP] or this specification. HELLO messages are not forwarded by [RFC6130] or this specification.
14.1. HELLO Message Generation 15.1. HELLO Message Generation
An HELLO message is generated as defined in [NHDP], extended by the An HELLO message is generated as defined in [RFC6130], extended by
following elements being added to the HELLO message by this the following elements being added to the HELLO message by this
specification before the HELLO message is sent over an OLSRv2 specification before the HELLO message is sent over an OLSRv2
interface: interface:
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; interpreted 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 [NHDP] 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
interpreted as the message originator address. interpreted as the message originator address.
o A Message TLV with Type := MPR_WILLING and Value := WILLINGNESS o A Message TLV with Type := MPR_WILLING and Value := WILLINGNESS
MUST be included, unless WILLINGNESS = WILL_DEFAULT (in which case MUST be included, unless WILLINGNESS = WILL_DEFAULT (in which case
it MAY be included). it MAY be included).
o For each Neighbor Tuple with N_mpr = true, and for which one or o The following cases associate Address Block TLVs with one or more
more network addresses in its N_neighbor_addr_list are included as addresses from a Link Tuple or a Neighbor Tuple if these are
address objects in the HELLO message with an associated Address included in the HELLO message. In each case the TLV MUST be
Block TLV with Type = LINK_STATUS and Value = SYMMETRIC, at least associated with at least copy of one address from the relevant
one, possibly more, of these address objects (including a Tuple, the TLV MAY be associated with more such addresses
different copy of that address object, in the same or a different (including a copy of that address object, possibly not itself
Address Block) MUST be associated with an Address Block TLV with associated with any other indicated TLVs, in the same or a
Type := MPR. Address objects which do not satisfy this property different Address Block). These additional TLVs MUST NOT be
MUST NOT be associated with an Address Block TLV with Type = MPR. associated with any other addresses in a HELLO message that will
be processed by [RFC6130].
14.2. HELLO Message TLVs
This specification defines one Message TLV and one Address Block TLV
that may be added to HELLO messages by this specification.
14.2.1. Message TLVs
This specification defines one Message TLV that may be included in a * For each Link Tuple for which L_in_metric != UNKNOWN_METRIC,
HELLO message: and for which one or more addresses in its
L_neighbor_iface_addr_list are included as address objects with
an associated Address Block TLV with Type = LINK_STATUS and
Value = HEARD or Value = SYMMETRIC, at least one of these
addresses MUST be associated with an Address Block TLV with
Type := LINK_METRIC indicating an incoming link metric with
value L_in_metric, unless this equals DEFAULT_METRIC.
+-------------+--------------+--------------------------------------+ * For each Link Tuple for which L_out_metric != UNKNOWN_METRIC,
| Type | Value Length | Value | and for which one or more addresses in its
+-------------+--------------+--------------------------------------+ L_neighbor_iface_addr_list are included as address objects with
| MPR_WILLING | 1 octet | Router parameter WILLINGNESS; unused | an associated Address Block TLV with Type = LINK_STATUS and
| | | bits (based on the maximum | Value = SYMMETRIC, at least one of these addresses MUST be
| | | willingness value WILL_ALWAYS) are | associated with an Address Block TLV with Type := LINK_METRIC
| | | RESERVED and SHOULD be set to zero. | indicating an outgoing link metric with value L_out_metric,
+-------------+--------------+--------------------------------------+ unless this equals DEFAULT_METRIC.
Table 1: MPR_WILLING TLV definition
14.2.2. Address Block TLVs * For each Neighbor Tuple for which N_symmetric = true, and for
which one or more addresses in its N_neighbor_addr_list are
included as address objects with an associated Address Block
TLV with Type = LINK_STATUS and Value = SYMMETRIC, at least one
of these addresses MUST be associated with an Address Block TLV
with Type := LINK_METRIC indicating an incoming neighbor metric
with value N_in_metric, unless this equals DEFAULT_METRIC.
This specification defines one Address Block TLV that may be included * For each Neighbor Tuple for which N_symmetric = true, and for
in a HELLO message: which one or more addresses in its N_neighbor_addr_list are
included as address objects with an associated Address Block
TLV with Type = LINK_STATUS and Value = SYMMETRIC, at least one
of these addresses MUST be associated with an Address Block TLV
with Type := LINK_METRIC indicating an outcoming neighbor
metric with value N_out_metric, unless this equals
DEFAULT_METRIC.
+------+--------------+-------+ * For each Neighbor Tuple with N_flooding_mpr = true, and for
| Type | Value Length | Value | which one or more network addresses in its N_neighbor_addr_list
+------+--------------+-------+ are included as address objects in the HELLO message with an
| MPR | 0 octets | None. | associated Address Block TLV with Type = LINK_STATUS and Value
+------+--------------+-------+ = SYMMETRIC, at least one of these addresses MUST be associated
with an Address Block TLV with Type := MPR and Value := 0 or
Value := 1.
Table 2: MPR TLV definition * For each Neighbor Tuple with N_routing_mpr = true, and for
which one or more network addresses in its N_neighbor_addr_list
are included as address objects in the HELLO message with an
associated Address Block TLV with Type = LINK_STATUS and Value
= SYMMETRIC, at least one of these addresses MUST be associated
with an Address Block TLV with Type := MPR and Value := 0 or
Value := 2.
14.3. HELLO Message Transmission 15.2. HELLO Message Transmission
HELLO messages are scheduled and transmitted by [NHDP]. 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 when
the router's set of MPRs changes, in addition to the cases specified the router's set of MPRs changes, in addition to the cases specified
in [NHDP], and subject to the same constraints. in [RFC6130], and subject to the same constraints.
14.4. 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 [NHDP]: available to this protocol in two ways, both as permitted by
[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 [NHDP], for example if the information added to being processed by [RFC6130], for example if the information added
the HELLO message by this protocol is inconsistent. to the HELLO message by this protocol 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 [NHDP] has completed its processing thereof, unless after [RFC6130] has completed its processing thereof, unless
discarded as malformed by [NHDP], for processing by this protocol. discarded as malformed by [RFC6130], for processing by this
protocol.
14.4.1. HELLO Message Discarding 15.3.1. HELLO Message Discarding
In addition to the reasons specified in [NHDP] for discarding a HELLO In addition to the reasons specified in [RFC6130] for discarding a
message on reception, a HELLO message MUST be discarded before HELLO message on reception, a HELLO message MUST be discarded before
processing by [NHDP] or this specification if it: 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 [NHDP].) 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
message's originator address. message's originator address.
o Contains any address that will be processed by [RFC6130] that is
associated, using the same or different address objects, with two
different values of link metric with the same kind and direction
using a TLV with Type = LINK_METRIC and Type Extension =
LINK_METRIC_TYPE. This also applies to different addresses that
are both of the OLSRv2 interface on which the HELLO message was
received.
o Contains any address object associated with an Address Block TLV o Contains any address object associated with an Address Block TLV
with Type = MPR that is not also associated with an Address Block with Type = MPR that is not also associated with an Address Block
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).
14.4.2. HELLO Message Usage 15.3.2. HELLO Message Usage
HELLO messages are first processed as specified in [NHDP]. That HELLO messages are first processed as specified in [RFC6130]. That
processing includes identifying (or creating) a Neighbor Tuple processing includes identifying (or creating) a Neighbor Tuple
corresponding to the originator of the HELLO message (the "current corresponding to the originator of the HELLO message (the "current
Neighbor Tuple"). After this, the following processing MUST also be Neighbor Tuple"). After this, the following processing MUST also be
performed: performed:
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 other Neighbor Tuple with N_orig_addr = message 1. Remove any other Neighbor Tuple with N_orig_addr = message
originator address, taking any consequent action (including originator address, taking any consequent action (including
removing one or more Link Tuples) as specified in [NHDP]. removing one or more Link Tuples) as specified in [RFC6130].
2. The current Neighbor 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
Section 15.3.2.1;
2. Update L_mpr_selector as described in Section 15.3.2.3.
3. The current Neighbor Tuple is then updated according to:
1. N_orig_addr := message originator address; 1. N_orig_addr := message originator address;
2. Update N_willingness as described in Section 14.4.2.1; 2. Update N_in_metric and N_out_metric as described in
Section 15.3.2.1;
3. Update N_mpr_selector as described in Section 14.4.2.2. 3. Update N_will_flooding and N_will_routing as described in
Section 15.3.2.2;
4. Update N_mpr_selector as described in Section 15.3.2.3.
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 16. perform the processing defined in Section 17.
14.4.2.1. Updating Willingness 15.3.2.1. Updating Metrics
N_willingness in the current Neighbor Tuple is updated as follows: For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS and Value = HEARD or Value = SYMMETRIC, an
incoming (to the message originator) link metric value is defined
either using an associated TLV with Type = LINK_METRIC and Type
Extension = LINK_METRIC_TYPE that indicates the appropriate kind
(link) and direction (incoming) of metric, or as the value
DEFAULT_METRIC.
For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS and Value = SYMMETRIC, an outgoing (to the
message originator) link metric value is defined either using an
associated TLV with Type = LINK_METRIC and Type Extension =
LINK_METRIC_TYPE that indicates the appropriate kind (link) and
direction (outgoing) of metric, or as the value DEFAULT_METRIC.
For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = SYMMETRIC,
an incoming (to the message originator) neighbor metric value is
defined either using an associated TLV with Type = LINK_METRIC and
Type Extension = LINK_METRIC_TYPE that indicates the appropriate kind
(neighbor) and direction (incoming) of metric, or as the value
DEFAULT_METRIC.
For each address in a received HELLO message with an associated TLV
with Type = LINK_STATUS or Type = OTHER_NEIGHB and Value = SYMMETRIC,
an outgoing (to the message originator) neighbor metric value is
defined either using an associated TLV with Type = LINK_METRIC and
Type Extension = LINK_METRIC_TYPE that indicates the appropriate kind
(neighbor) and direction (outgoing) of metric, or as the value
DEFAULT_METRIC.
The link metric elements L_in_metric and L_out_metric in a Link Tuple
are updated according to the following:
o For any Link Tuple, L_in_metric MAY be set to any representable
value, by a process outside this specification, at any time.
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
MAXIMUM_METRIC SHOULD be used). This MAY use information based on
the receipt of a packet including a HELLO message that causes the
creation or updating of that Link Tuple.
o When, as specified in [RFC6130], a Link Tuple is updated (possibly
immediately after being created) due to the receipt of a HELLO
message, if L_status = SYMMETRIC, then L_out_metric is set equal
to the incoming link metric for any included address of the
interface on which the HELLO message was received, ignoring any
values equal to DEFAULT_METRIC unless there are only such values.
(Note that the rules for discarding HELLO messages in
Section 15.3.1 make this value unambiguous.)
The neighbor metric elements N_in_metric and N_out_metric in a
Neighbor Tuple are updated according to Section 17.3.
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
neighbor metric and outgoing neighbor metric, respectively,
associated with the corresponsing N2_2hop_addr.
15.3.2.2. Updating Willingness
N_will_flooding and N_will_routing in the current Neighbor Tuple are
updated as follows:
1. If the HELLO message contains a Message TLV with Type = 1. If the HELLO message contains a Message TLV with Type =
MPR_WILLING then N_willingness := the value of that TLV; 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_willingness := WILL_DEFAULT. 2. Otherwise, N_will_flooding := WILL_DEFAULT, and N_will_routing :=
WILL_DEFAULT.
14.4.2.2. Updating MPR Selector Status 15.3.2.3. Updating MPR Selector Status
L_mpr_selector is updated as follows:
1. If a router finds an address object representing any of its local
interface network addresses (i.e., those contained in the
I_local_iface_addr_list of an OLSRv2 interface) with an
associated Address Block TLV with Type = MPR and Value = 0 or
Value = 1 in the HELLO message (indicating that the originating
router has selected the receiving router as a flooding MPR) then,
for the current Link Tuple:
* L_mpr_selector := true
2. Otherwise (i.e., if no such address object and Address Block TLV
was found) if a router finds an address object representing any
of its local interface network addresses (i.e., those contained
in the I_local_iface_addr_list of an OLSRv2 interface) with an
associated Address Block TLV with Type = LINK_STATUS and Value =
SYMMETRIC in the HELLO message, then for the current Link Tuple:
* 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 local
interface network addresses (i.e., those contained in the interface network addresses (i.e., those contained in the
I_local_iface_addr_list of an OLSRv2 interface) with an I_local_iface_addr_list of an OLSRv2 interface) with an
associated Address Block TLV with Type = MPR in the HELLO message associated Address Block TLV with Type = MPR and Value = 0 or
(indicating that the originating router has selected the Value = 2 in the HELLO message (indicating that the originating
receiving router as an MPR) then, for the current Neighbor Tuple: router has selected the receiving router as a routing MPR) then,
for the current Neighbor Tuple:
* N_mpr_selector := true * N_mpr_selector := 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 local interface network addresses (i.e., those contained
in the 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 = LINK_STATUS and Value = associated Address Block TLV with Type = LINK_STATUS and Value =
SYMMETRIC in the HELLO message, then for the current Neighbor SYMMETRIC in the HELLO message, then for the current Neighbor
Tuple: Tuple:
* N_mpr_selector := false * N_mpr_selector := false
* N_advertised := false * The router MAY also set N_advertised := false
15. 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 23). 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
is responsible for determining whether and how each TC message is to is responsible for determining whether and how each TC message is to
be processed (updating the Topology Information Base) and/or be processed (updating the Topology Information Base) and/or
forwarded, according to this specification. forwarded, according to this specification.
15.1. TC Message Generation 16.1. TC Message Generation
A TC message is a message as defined in [RFC5444]. A generated TC A TC message is a message as defined in [RFC5444]. A generated TC
message MUST contain the following elements as defined in [RFC5444]: message MUST contain the following elements as defined in [RFC5444]:
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. address. This MUST use a <msg-orig-addr> element.
o <msg-seq-num> element containing the message sequence number. o <msg-seq-num> element containing the message sequence number.
o A <msg-hop-limit> element, containing TC_HOP_LIMIT. A router MAY o A <msg-hop-limit> element, containing TC_HOP_LIMIT. A router MAY
use the same or different values of TC_HOP_LIMIT in its TC use the same or different values of TC_HOP_LIMIT in its TC
messages, see Section 5.8. messages, see Section 5.4.7.
o A <msg-hop-count> element, containing zero, if the message o A <msg-hop-count> element, containing zero, if the message
contains a TLV with either Type = VALIDITY_TIME or Type = contains a TLV with either Type = VALIDITY_TIME or Type =
INTERVAL_TIME (as specified in [RFC5497]) indicating more than one INTERVAL_TIME (as specified in [RFC5497]) indicating more than one
time value according to distance. A TC message MAY contain such a time value according to distance. A TC message MAY contain such a
<msg-hop-count> element even if it does not need to. <msg-hop-count> element even if it does not need to.
o A single Message TLV with Type := CONT_SEQ_NUM and Value := ANSN o A single Message TLV with Type := CONT_SEQ_NUM and Value := ANSN
from the Neighbor Information Base. If the TC message is complete from the Neighbor Information Base. If the TC message is complete
then this Message TLV MUST have Type Extension := COMPLETE, then this Message TLV MUST have Type Extension := COMPLETE,
skipping to change at page 41, line 47 skipping to change at page 53, line 37
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.
o If the TC message is complete, all routable addresses which are in o If the TC message is complete, all routable addresses which are in
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. if also to be associated with Value = ORIGINATOR. At least one
copy of each such address object MUST be associated with an
Address Block TLV with Type = LINK_METRIC and Type Extension =
LINK_METRIC_TYPE indicating an outgoing neighbor metric with value
equal to the corresponding N_out_metric, unless that value is
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. Value := AN_dist. At least one copy of each such address object
MUST be associated with an Address Block TLV with Type =
LINK_METRIC and Type Extension = LINK_METRIC_TYPE indicating an
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 distance
appropriate to the chosen pattern of TC message hop limits, as appropriate to the chosen pattern of TC message hop limits, as
specified in [RFC5497]; these times SHOULD be appropriate specified in [RFC5497]; these times SHOULD be appropriate
multiples of TC_INTERVAL. The options included in [RFC5497] for multiples of TC_INTERVAL. The options included in [RFC5497] for
representing zero and infinite times MUST NOT be used. representing zero and infinite times MUST NOT be used.
15.2. TC Message TLVs 16.2. TC Message Transmission
This specification defines one Message TLV and two Address Block TLV
that may be used in TC messages by this specification.
15.2.1. Message TLVs
In a TC message, a router MAY include at most one (and except in an
exceptional case MUST include exactly one) CONT_SEQ_NUM Message TLV
as specified in Table 3.
+--------------+--------------+-------------------------------------+
| Type | Value Length | Value |
+--------------+--------------+-------------------------------------+
| CONT_SEQ_NUM | 2 octets | The ANSN contained in the Neighbor |
| | | Information Base. |
+--------------+--------------+-------------------------------------+
Table 3: CONT_SEQ_NUM TLV definition
15.2.2. Address Block TLVs
In a TC message, a router MAY include NBR_ADDR_TYPE Address Block
TLV(s) as specified in Table 4.
+---------------+--------------+------------------------------------+
| Type | Value Length | Value |
+---------------+--------------+------------------------------------+
| NBR_ADDR_TYPE | 1 octet | ORIGINATOR indicates that the |
| | | corresponding address (which MUST |
| | | have maximum prefix length) is an |
| | | originator address, ROUTABLE |
| | | indicates that the corresponding |
| | | network address is a routable |
| | | address of an interface, |
| | | ROUTABLE_ORIG indicates that the |
| | | corresponding address is both |
+---------------+--------------+------------------------------------+
Table 4: NBR_ADDR_TYPE TLV definition
If an address is both a originator address and a routable address,
then it may be associated with either one Address Block TLV with Type
:= NBR_ADDR_TYPE and Value := ROUTABLE_ORIG, or with two Address
Block TLVs with Type:= NBR_ADDR_TYPE, one with Value := ORIGINATOR
and one with Value := ROUTABLE.
In a TC message, a router MAY include GATEWAY Address Block TLV(s) as
specified in Table 5.
+---------+--------------+-------------------------------------+
| Type | Value Length | Value |
+---------+--------------+-------------------------------------+
| GATEWAY | 1 octet | Number of hops to attached network. |
+---------+--------------+-------------------------------------+
Table 5
All address objects included in a TC message according to this
specification MUST be associated either with at least one TLV with
Type := NBR_ADDR_TYPE or with a TLV with Type := GATEWAY, but not
both. Any other address objects MAY be included in Address Blocks in
a TC message, but are ignored by this specification.
15.3. 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 SHOULD also generate "empty" TC
messages for a period A_HOLD_TIME after it last generated a non-empty messages for a period A_HOLD_TIME after it last generated a non-empty
TC message. TC 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
skipping to change at page 44, line 37 skipping to change at page 55, line 13
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 SHOULD 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.
15.4. 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, the receiving router MUST then follow the
processing and forwarding procedure, defined in Section 13. processing and forwarding procedure, defined in Section 14.
If the message is considered for processing (Section 13.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 15.4.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 15.4.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 Base 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 16 MUST be Information Bases, then the processing in Section 17 MUST be
performed. performed.
15.4.1. Invalid Message 16.3.1. Invalid Message
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 The address length as specified in the Message Header is not equal o Has an address length specified in the Message Header that is not
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.
o Does not include a hop count, and contains a multi-value TLV with o Does not include a hop count, and contains a multi-value TLV with
Type = VALIDITY_TIME or Type = INTERVAL_TIME, as defined in Type = VALIDITY_TIME or Type = INTERVAL_TIME, as defined in
[RFC5497]. [RFC5497].
o Does not have exactly one Message TLV with Type = VALIDITY_TIME. o Does not have exactly one Message TLV with Type = VALIDITY_TIME.
skipping to change at page 45, line 50 skipping to change at page 56, line 26
or Value = ROUTABLE_ORIG. or Value = ROUTABLE_ORIG.
o Includes any address object that represents a non-routable o Includes any address object that represents a non-routable
address, associated with an Address Block TLV with Type = address, associated with an Address Block TLV with Type =
NBR_ADDR_TYPE and Value = ROUTABLE or Value = ROUTABLE_ORIG. NBR_ADDR_TYPE and Value = ROUTABLE or Value = ROUTABLE_ORIG.
o Includes any address object associated with an Address Block TLV o Includes any address object associated with an Address Block TLV
with Type = NBR_ADDR_TYPE or Type = GATEWAY that also represents with Type = NBR_ADDR_TYPE or Type = GATEWAY that also represents
the message's originator address. the message's originator address.
o Includes any address object (including different copies of an
address object, in the same or different Address Blocks) that is
associated with an Address Block TLV with Type = NBR_ADDR_TYPE or
Type = GATEWAY, that is also associated with more than one
outgoing neighbor metric using a TLV with Type = LINK_METRIC and
Type Extension = LINK_METRIC_TYPE.
o Associates any address object (including different copies of an o Associates any address object (including different copies of an
address object, in the same or different Address Blocks) with more address object, in the same or different Address Blocks) with more
than one single value using one or more Address Block TLV(s) with than one single hop count value using one or more Address Block
Type = GATEWAY. TLV(s) with Type = GATEWAY.
o Associates any address object (including different copies of an o Associates any address object (including different copies of an
address object, in the same or different Address Blocks) with address object, in the same or different Address Blocks) with
Address Block TLVs with Type = NBR_ADDR_TYPE and Type = GATEWAY. Address Block TLVs with Type = NBR_ADDR_TYPE and Type = GATEWAY.
A router MAY recognize additional reasons for identifying that a A router MAY recognize additional reasons for identifying that a
message is invalid. An invalid message MUST be silently discarded, message is invalid. An invalid message MUST be silently discarded,
without updating the router's Information Bases. without updating the router's Information Bases.
15.4.2. TC Message Processing Definitions 16.3.2. TC Message Processing Definitions
When, according to Section 13.2, a TC message is to be "processed When, according to Section 14.2, a TC message is to be "processed
according to its type", this means that: according to its type", this means that:
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 15.4.3 and then according to Section 15.4.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 15.4.3 is carried out. Section 16.3.3 is carried out.
For the purposes of this section: For the purposes of this section:
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
message as being either the outgoing neighbor metric value
indicated by a TLV with Type = LINK_METRIC and Type Extemsion =
LINK_METRIC_TYPE that is associated with any address object in the
TC message that is equal to that address, or as DEFAULT_METRIC
otherwise. (Note that the rules in Section 16.3.1 make this
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 20. Section 21.
15.4.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:
1. The Advertising Remote Router Set is updated according to 1. The Advertising Remote Router Set is updated according to
Section 15.4.3.1. If the TC message is indicated as discarded in Section 16.3.3.1. If the TC message is indicated as discarded in
that processing then the following steps are not carried out. that processing then the following steps are not carried out.
2. The Router Topology Set is updated according to Section 15.4.3.2. 2. The Router Topology Set is updated according to Section 16.3.3.2.
3. The Routable Address Topology Set is updated according to 3. The Routable Address Topology Set is updated according to
Section 15.4.3.3. Section 16.3.3.3.
4. The Attached Network Set is updated according to 4. The Attached Network Set is updated according to
Section 15.4.3.4. Section 16.3.3.4.
15.4.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.
skipping to change at page 47, line 40 skipping to change at page 58, line 34
+ AR_orig_addr := message originator address. + AR_orig_addr := message originator address.
2. This Advertising Remote Router Tuple (existing or new) is 2. This Advertising Remote Router Tuple (existing or new) is
then modified as follows: then modified as follows:
+ AR_seq_number := received ANSN; + AR_seq_number := received ANSN;
+ AR_time := current time + validity time. + AR_time := current time + validity time.
15.4.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 there is no Router Topology Tuple such that:
skipping to change at page 48, line 20 skipping to change at page 59, line 14
+ 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 2. 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_time := current time + validity time. + TR_time := current time + validity time.
15.4.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 there is no Routable Address Topology Tuple such that:
skipping to change at page 48, line 49 skipping to change at page 59, line 45
+ 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 2. 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_time := current time + validity time. + TA_time := current time + validity time.
15.4.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 there is no Attached Network Tuple such that:
skipping to change at page 49, line 29 skipping to change at page 60, line 29
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 2. This Attached Network Tuple (existing or new) is then
modified as follows: modified as follows:
+ AN_seq_number := received ANSN;
+ AN_dist := the Value of the associated GATEWAY TLV; + AN_dist := the Value of the associated GATEWAY TLV;
+ AN_seq_number := received ANSN; + AN_metric := associated link metric;
+ AN_time := current time + validity time. + AN_time := current time + validity time.
15.4.4. Completing TC Message Processing 16.3.4. Completing TC Message Processing
The TC message is processed as follows: The TC message is processed as follows:
1. The Router Topology Set is updated according to Section 15.4.4.1. 1. The Router Topology Set is updated according to Section 16.3.4.1.
2. The Routable Address Topology Set is updated according to 2. The Routable Address Topology Set is updated according to
Section 15.4.4.2. Section 16.3.4.2.
3. The Attached Network Set is updated according to 3. The Attached Network Set is updated according to
Section 15.4.4.3. Section 16.3.4.3.
15.4.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.
15.4.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.
15.4.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.
16. 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.
16.1. Originator Address Changes 17.1. Originator Address Changes
If the router changes originator address, then: If the router changes 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:
* O_orig_addr = new originator address * O_orig_addr = new originator address
is then modified as follows: is then modified as follows:
* O_time := current time + O_HOLD_TIME * O_time := current time + O_HOLD_TIME
16.2. Neighbor State Changes 17.2. Link State Changes
The N_mpr_selector and N_advertised flags in Neighbor Tuples MUST be The consistency of a Link Tuple MUST be maintained accoprding to the
maintained according to the following rules: following rules, in addition to those in [RFC6130]:
1. If N_symmetric = false, then N_mpr_selector = false and o If L_status = HEARD or L_status = SYMMETRIC, then L_in_metric MUST
N_advertised = false. be set (by a process outside this specification).
2. If N_mpr_selector = true, then N_advertised = true. o If L_status != SYMMETRIC, then set L_mpr_selector := false.
3. In other cases (i.e., N_symmetric = true and N_mpr_selector = o If L_out_metric = UNKNOWN_METRIC, then L_status MUST NOT equal
false) a router MAY select N_advertised = true or N_advertised = SYMMETRIC; set L_SYM_time := expired if this would otherwise be
false. The more neighbors that are advertised, the larger TC the case.
messages become, but the more redundancy is available for
routing. A router SHOULD consider the nature of its network in
making such a decision, and SHOULD 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 similar effects to other
forms of topology changes in the MANET.
16.3. Advertised Neighbor Changes 17.3. Neighbor State Changes
The consistency of a Neighbor Tuple MUST be maintained according to
the following rules, in addition to those in [RFC6130]:
1. If N_symmetric = true, then N_in_metric MUST equal the minimum
value of all L_in_metric of corresponding Link Tuples with
L_status = SYMMETRIC.
2. If N_symmetric = true, then N_out_metric MUST equal the minimum
value of all L_out_metric of corresponding Link Tuples with
L_status = SYMMETRIC.
3. If N_symmetric = false, then N_flooding_mpr, N_routing_mpr,
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
true.
5. If N_symmetric = true and N_mpr_selector = false, then a router
MAY select N_advertised = true or N_advertised = false. The more
neighbors that are advertised, the larger TC messages become, but
the more redundancy is available for routing. A router SHOULD
consider the nature of its network in making such a decision, and
SHOULD 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
similar effects to other forms of topology changes in the MANET.
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. 1. Any Neighbor Tuple changes its N_advertised value, or any
Neighbor Tuple with N_advertised = true is removed.
2. N_orig_addr is changed, or any routable address is added to or 2. Any Neighbor Tuple with N_advertised = true changes its
removed from any Neighbor Tuple with N_advertised = true. N_orig_addr, or has any routable address is added to or removed
from N_neighbor_addr_list.
3. Any Neighbor Tuple with N_advertised = true is removed. 3. Any Neighbor Tuple with N_advertised = true has N_out_metric
changed.
4. There is any change to the Local Attached Network Set. 4. There is any change to the Local Attached Network Set.
16.4. Advertising Remote Router Tuple Expires 17.5. Advertising Remote Router Tuple Expires
The Router Topology Set, the Routable Address Topology Set and the The Router Topology Set, the Routable Address Topology Set and the
Attached Network Set MUST be changed when an Advertising Remote Attached Network Set MUST be changed when an Advertising Remote
Router Tuple expires (AR_time is reached). The following changes are Router Tuple expires (AR_time is reached). The following changes are
required before the Advertising Remote Router Tuple is removed: required before the Advertising Remote Router Tuple is removed:
1. All Router Topology Tuples with: 1. All Router Topology Tuples with:
* TR_from_orig_addr = AR_orig_addr of the Advertising Remote * TR_from_orig_addr = AR_orig_addr of the Advertising Remote
Router Tuple Router Tuple
skipping to change at page 52, line 26 skipping to change at page 64, line 12
are removed. are removed.
3. All Attached Network Tuples with: 3. All Attached Network Tuples with:
* AN_orig_addr = AR_orig_addr of the Advertising Remote Router * AN_orig_addr = AR_orig_addr of the Advertising Remote Router
Tuple Tuple
are removed. are removed.
16.5. Neighborhood Changes and MPR Updates 17.6. Neighborhood Changes and MPR Updates
The set of symmetric 1-hop neighbors selected as MPRs MUST satisfy The sets of symmetric 1-hop neighbors selected as flooding MPRs and
the conditions defined in Section 17. To ensure this: routing MPRs MUST satisfy the conditions defined in Section 18. To
ensure this:
1. The set of 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, OR;
* a Link Tuple with L_status = SYMMETRIC is removed, OR; * a Link Tuple with L_status = SYMMETRIC is removed, OR;
* a Link Tuple with L_status = SYMMETRIC changes to having * a Link Tuple with L_status = SYMMETRIC changes to having
L_status = HEARD or L_status = LOST, OR; L_status = HEARD or L_status = LOST, 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, OR;
* a 2-Hop Tuple is added or removed, OR; * a 2-Hop Tuple is added or removed, OR;
* the N_willingness of a Neighbor Tuple with N_symmetric = true * the N_will_flooding of a Neighbor Tuple with N_symmetric =
true changes from WILL_NEVER to any other value, OR;
* the N_will_flooding of a Neighbor Tuple with N_flooding_mpr =
true changes to WILL_NEVER from any other value, OR;
* the N_will_flooding of a Neighbor Tuple with N_symmetric =
true and N_flooding_mpr = false changes to WILL_ALWAYS from
any other value.
2. Otherwise, the set of flooding MPRs of a router MAY be
recalculated if the N_will_flooding of a Neighbor Tuple with
N_symmetric = true changes in any other way; it SHOULD be
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
decrease in N_will_flooding.
3. The set of routing MPRs of a router MUST be recalculated if:
* a Link Tuple is added with L_status = SYMMETRIC, OR;
* a Link Tuple with L_status = SYMMETRIC is removed, OR;
* a Link Tuple with L_status = SYMMETRIC changes to having
L_status = HEARD or L_status = LOST, OR;
* a Link Tuple with L_status = HEARD or L_status = LOST changes
to having L_status = SYMMETRIC, OR;
* a 2-Hop Tuple is added or removed, OR;
* the N_will_routing of a Neighbor Tuple with N_symmetric = true
changes from WILL_NEVER to any other value, OR; changes from WILL_NEVER to any other value, OR;
* the N_willingness of a Neighbor Tuple with N_mpr = true * the N_will_routing of a Neighbor Tuple with N_routing mpr =
changes to WILL_NEVER from any other value, OR; true changes to WILL_NEVER from any other value, OR;
* the N_willingness of a Neighbor Tuple with N_symmetric = true * the N_will_routing of a Neighbor Tuple with N_symmetric = true
and N_mpr = false changes to WILL_ALWAYS from any other value. and N_routing_mpr = false changes to WILL_ALWAYS from any
other value.
2. Otherwise, the set of MPRs of a router MAY be recalculated if the 4. Otherwise, the set of routing MPRs of a router MAY be
N_willingness of a Neighbor Tuple with N_symmetric = true changes recalculated if the N_will_routing of a Neighbor Tuple with
in any other way; it SHOULD be recalculated if N_mpr = false and N_symmetric = true changes in any other way; it SHOULD be
this is an increase in N_willingness or if N_mpr = true and this recalculated if N_routing_mpr = false and this is an increase in
is a decrease in N_willingness. N_will_routing or if N_routing_mpr = true and this is a decrease
in N_will_routing.
If the 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 17. Before that calculation, the N_mpr of all described in Section 18. Before that calculation, N_flooding_mpr or
Neighbor Tuples are set false (although the previous values of N_mpr N_routing_mpr (as appropriate) of all Neighbor Tuples is set false
MAY be used by an algorithm that minimizes changes to the set of (although its previous value MAY be used by an algorithm that
MPRs). After that calculation the N_mpr of all Neighbor Tuples minimizes changes to the set of MPRs). After that calculation the
representing symmetric 1-hop neighbors that are chosen as MPRs, are N_flooding_mpr or N_routing_mpr (as appropriate) of all Neighbor
set true. Tuples representing symmetric 1-hop neighbors that are chosen as
MPRs, are set true.
16.6. Routing Set Updates 17.7. Routing Set Updates
The Routing Set MUST be updated, as described in Section 18 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 of the known Base or the Topology Information Base indicate a change (including of
any potentially used link metric values, all outgoing) 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, if the change removes any network address
in an I_local_iface_addr_list. In this case, unless the OLSRv2 in an I_local_iface_addr_list. In this case, unless the OLSRv2
interface is removed, it may not be necessary to do more than interface is removed, it may not be necessary to do more than
replace such network addresses, if used, by an alternative network replace such network addresses, if used, by an alternative network
address from the same I_local_iface_addr_list. 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, and to consider only Link o The Link Set of any OLSRv2 interface, considering only Link Tuples
Tuples which have, or just had, L_status = SYMMETRIC (including which have, or just had, L_status = SYMMETRIC (including removal
removal of such Link Tuples). of such Link Tuples).
o The Neighbor Set of the router, and to consider only Neighbor o The Neighbor Set of the router, considering only Neighbor Tuples
Tuples that have, or just had, N_symmetric = true, and do not have that have, or just had, N_symmetric = true, and do not have
N_orig_addr = unknown. 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.
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.
17. Selecting MPRs 18. Selecting MPRs
Note: This section has not yet been updated to use link metrics and
separate sets of flooding and routing MPRs.
Each router MUST select, from among its willing symmetric 1-hop Each router MUST select, from among its willing symmetric 1-hop
neighbors, a subset of these routers as MPRs. Only MPRs forward neighbors, a subset of these routers as MPRs. Only MPRs forward
control messages flooded through the MANET, thus effecting a flooding control messages flooded through the MANET, thus effecting a flooding
reduction, an optimization of the classical flooding mechanism, known reduction, an optimization of the classical flooding mechanism, known
as MPR flooding. MPRs MAY also be used to effect a topology as MPR flooding. MPRs MAY also be used to effect a topology
reduction in the MANET. Consequently, while it is not essential that reduction in the MANET. Consequently, while it is not essential that
the set of MPRs is minimal, keeping the number of MPRs small ensures the set of MPRs is minimal, keeping the number of MPRs small ensures
that the overhead is kept at a minimum. that the overhead is kept at a minimum.
skipping to change at page 55, line 36 skipping to change at page 68, line 12
corresponding N_symmetric = true, and corresponding N_willingness != corresponding N_symmetric = true, and corresponding N_willingness !=
WILL_NEVER). Note that although selected per OLSRv2 interface, MPRs WILL_NEVER). Note that although selected per OLSRv2 interface, MPRs
are recorded and used independent of interface, i.e., a router's set are recorded and used independent of interface, i.e., a router's set
of MPRs is the union of the sets of MPRs selected per OLSRv2 of MPRs is the union of the sets of MPRs selected per OLSRv2
interface. interface.
A router MUST recalculate its MPRs whenever the currently selected A router MUST recalculate its MPRs whenever the currently selected
set of MPRs does not still satisfy the required conditions. It MAY set of MPRs does not still satisfy the required conditions. It MAY
recalculate its MPRs if the current set of MPRs is still valid, but recalculate its MPRs if the current set of MPRs is still valid, but
could be more efficient. Sufficient conditions to recalculate a could be more efficient. Sufficient conditions to recalculate a
router's set of MPRs are given in Section 16.5. router's set of MPRs are given in Section 17.6.
An example algorithm that creates a set of MPRs that satisfies the An example algorithm that creates a set of MPRs that satisfies the
required conditions is given in Appendix A. required conditions is given in Appendix A.
18. 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 IP's routing table by adding and removing entries from
IP's routing table as appropriate. Only appropriate Routing Tuples IP's 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 IP's routing table.
18.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, Neighbor Set, Router
Topology Set, Routable Address Topology Set and Attached Network Set. Topology Set, Routable Address Topology Set and Attached Network Set.
The Network Topology Graph MAY also use information from the router's The Network Topology Graph MAY also use information from the router's
2-Hop Sets. The Network Topology Graph forms the router's 2-Hop Sets. The Network Topology Graph forms the router's
topological view of the network in form of a directed graph. The topological view of the network in form of a directed graph. Each
Network Topology Graph has a "backbone" (within which minimum edge in that graph has a metric value. The Network Topology Graph
distance routes will be constructed) containing the following edges: has a "backbone" (within 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 such that this
Neighbor Tuple and this Local Interface Tuple correspond to it. Neighbor Tuple and this Local Interface Tuple correspond to it.
A network address from L_neighbor_iface_addr_list will be A network address from L_neighbor_iface_addr_list will be
denoted R in this case. 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. which R was selected. The metrio such an edge is the
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 metrio 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 such that this
Neighbor Tuple and this Local Interface Tuple correspond to it. Neighbor Tuple and this Local Interface Tuple correspond to it.
A network address from L_neighbor_iface_addr_list will be A network address from L_neighbor_iface_addr_list will be
denoted R in this case. 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
skipping to change at page 57, line 14 skipping to change at page 69, line 42
* 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 such that this
Neighbor Tuple and this Local Interface Tuple correspond to it. Neighbor Tuple and this Local Interface Tuple correspond to it.
A network address from L_neighbor_iface_addr_list will be A network address from L_neighbor_iface_addr_list will be
denoted R in this case. 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. which R was selected. The metric of such an edge is the
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.
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.
o OPTIONALLY, all edges Y -> Z such that: o OPTIONALLY, 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, 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_willingness not equal to WILL_NEVER. * This Neighbor Tuple has N_willingness not equal to WILL_NEVER.
A path terminating with such an edge SHOULD NOT be used in A path terminating with such an edge SHOULD NOT be used in
preference to any other path. preference to any other path. The metric for such an edge is the
corresponding N2_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 cost (hop made from any L_neighbor_iface_addr_list. All edges have a hop count
count) of one, except edges W -> T which each have a cost (hop count) of 1, except edges W -> T that have a hop count of the corresponding
equal to the appropriate value of AN_dist. value of AN_dist.
18.2. Populating the Routing Set 19.2. Populating the Routing Set
The Routing Set MUST contain the shortest paths for all destinations The Routing Set MUST contain the shortest paths for all destinations
from all local OLSRv2 interfaces using the Network Topology Graph. from all local OLSRv2 interfaces using the Network Topology Graph.
This calculation MAY use any algorithm, including any means of This calculation MAY use any algorithm, including any means of
choosing between paths of equal length. choosing between paths of equal total metric. (In the case of two
paths of equal total metric but differing hop counts, the path with
the lower hop count SHOULD be used.)
Using the notation of Section 18.1, initially "backbone" paths using Using the notation of Section 19.1, initially "backbone" paths using
only edges X -> Y and W -> U need be constructed (using a minimum only edges X -> Y and W -> U need be constructed (using a minimum
distance algorithm). Then paths using only a final edge of the other distance algorithm). Then paths using only a final edge of the other
types may be added. These MUST NOT replace backbone paths with the types may be added. These MUST NOT replace backbone paths with the
same destination (and paths terminating in an edge Y -> Z SHOULD NOT same destination (and paths terminating in an edge Y -> Z SHOULD NOT
replace paths with any other form of terminating edge). replace paths with any other form of terminating edge).
Each path will correspond to a Routing Tuple. These will be of two Each path will correspond to a Routing Tuple. These will be of two
types. The first type will represent single edge paths, of type X -> types. The first type will represent single edge paths, of type X ->
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;
where R is as defined in Section 18.1 for these types of edges. o R_metric := edge metric.
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 the path. o R_dist := the total hop count of all edges in the path;
o R_dist := 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
given in Appendix B. given in Appendix B.
19. Proposed Values for Parameters and Constants 20. Proposed Values for Parameters and Constants
This protocol uses all parameters and constants defined in [NHDP] and This protocol uses all parameters and constants defined in [RFC6130]
additional parameters and constants defined in this document. All and additional parameters and constants defined in this
but one (RX_HOLD_TIME) of these additional parameters are router specification. All but one (RX_HOLD_TIME) of these additional
parameters as defined in [NHDP]. These proposed values of the parameters are router parameters as defined in [RFC6130]. These
additional parameters are appropriate to the case where all proposed values of the additional parameters are appropriate to the
parameters (including those defined in [NHDP]) have a single value. case where all parameters (including those defined in [RFC6130]) have
Proposed values for parameters defined in [NHDP] are given in that a single value. Proposed values for parameters defined in [RFC6130]
document. are given in that specification.
19.1. Local History Time Parameters 20.1. Local History Time Parameters
o O_HOLD_TIME := 30 seconds o O_HOLD_TIME := 30 seconds
19.2. Message Interval Parameters 20.2. Message Interval Parameters
o TC_INTERVAL := 5 seconds o TC_INTERVAL := 5 seconds
o TC_MIN_INTERVAL := TC_INTERVAL/4 o TC_MIN_INTERVAL := TC_INTERVAL/4
19.3. Advertised Information Validity Time Parameters 20.3. Advertised Information Validity Time Parameters
o T_HOLD_TIME := 3 x TC_INTERVAL o T_HOLD_TIME := 3 x TC_INTERVAL
o A_HOLD_TIME := T_HOLD_TIME o A_HOLD_TIME := T_HOLD_TIME
19.4. Received Message Validity Time Parameters 20.4. Received Message Validity Time Parameters
o RX_HOLD_TIME := 30 seconds o RX_HOLD_TIME := 30 seconds
o P_HOLD_TIME := 30 seconds o P_HOLD_TIME := 30 seconds
o F_HOLD_TIME := 30 seconds o F_HOLD_TIME := 30 seconds
19.5. Jitter Time Parameters 20.5. Jitter Time Parameters
o TP_MAXJITTER := HP_MAXJITTER o TP_MAXJITTER := HP_MAXJITTER
o TT_MAXJITTER := HT_MAXJITTER o TT_MAXJITTER := HT_MAXJITTER
o F_MAXJITTER := TT_MAXJITTER o F_MAXJITTER := TT_MAXJITTER
19.6. Hop Limit Parameter 20.6. Hop Limit Parameter
o TC_HOP_LIMIT := 255 o TC_HOP_LIMIT := 255
19.7. Willingness Parameter and Constants 20.7. Willingness Parameter and Constants
o WILLINGNESS := WILL_DEFAULT o WILLINGNESS := WILL_DEFAULT
o WILL_NEVER := 0 o WILL_NEVER := 0
o WILL_DEFAULT := 7 o WILL_DEFAULT := 7
o WILL_ALWAYS := 15 o WILL_ALWAYS := 15
20. 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.
The term MAXVALUE designates in the following one more than the The term MAXVALUE designates in the following one more than the
skipping to change at page 60, line 45 skipping to change at page 73, line 35
o S2 > S1 AND S2 - S1 > MAXVALUE/2 o S2 > S1 AND S2 - S1 > MAXVALUE/2
When sequence numbers S1 and S2 differ by MAXVALUE/2 their ordering When sequence numbers S1 and S2 differ by MAXVALUE/2 their ordering
cannot be determined. In this case, which should not occur, either cannot be determined. In this case, which should not occur, either
ordering may be assumed. ordering may be assumed.
Thus when comparing two messages, it is possible - even in the Thus when comparing two messages, it is possible - even in the
presence of wrap-around - to determine which message contains the presence of wrap-around - to determine which message contains the
most recent information. most recent information.
21. Extensions 22. Extensions
An extension to this protocol will need to interact with this An extension to this protocol will need to interact with this
specification, and possibly also with [NHDP]. This protocol is specification, and possibly also with [RFC6130]. This protocol is
designed to permit such interactions, in particular: designed to permit such interactions, in particular:
o Through accessing, and possibly extending, the information in the o Through accessing, and possibly extending, the information in the
Information Bases. All updates to the elements specified in this Information Bases. All updates to the elements specified in this
document are subject to the constraints specified in [NHDP] and specification are subject to the constraints specified in
Appendix D. [RFC6130] and Appendix D.
o Through accessing an outgoing message prior to it being o Through accessing an outgoing message prior to it being
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 22, 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 22 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. This may, in particular, 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 [NHDP] and Section 5.4. constraints in [RFC6130] and Section 5.4.3.
22. Security Considerations 23. Security Considerations
Currently, this protocol does not specify any special security Currently, this protocol does not specify any special security
measures. As a proactive routing protocol, this protocol is a measures. As a proactive routing protocol, this protocol is a
potential target for various attacks. Various possible potential target for various attacks. Various possible
vulnerabilities are discussed in this section. vulnerabilities are discussed in this section.
22.1. Confidentiality 23.1. Confidentiality
This protocol periodically MPR floods topological information to all This protocol periodically MPR floods topological information to all
routers in the network. Hence, if used in an unprotected wireless routers in the network. Hence, if used in an unprotected wireless
network, the network topology is revealed to anyone who listens to network, the network topology is revealed to anyone who listens to
the control messages. the control messages.
In situations where the confidentiality of the network topology is of In situations where the confidentiality of the network topology is of
importance, regular cryptographic techniques, such as exchange of importance, regular cryptographic techniques, such as exchange of
OLSRv2 control traffic messages encrypted by PGP [RFC4880] or OLSRv2 control traffic messages encrypted by PGP [RFC4880] or
encrypted by some shared secret key, can be applied to ensure that encrypted by some shared secret key, can be applied to ensure that
control traffic can be read and interpreted by only those authorized control traffic can be read and interpreted by only those authorized
to do so. to do so.
22.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
skipping to change at page 63, line 22 skipping to change at page 76, line 12
transmitted either to all routers in the neighborhood (HELLO transmitted either to all routers in the neighborhood (HELLO
messages) or broadcast to all routers in the network (TC messages). messages) or broadcast to all routers in the network (TC messages).
For example, a control message in this protocol is always a point-to- For example, 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.
22.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
protocol's domain. Routing information can be extracted from the protocol's domain. Routing information can be extracted from the
protocol's Information Bases, in particular the Routing Set, of this protocol's Information Bases, in particular the Routing Set, of this
protocol and, potentially, injected into an external domain, if the protocol and, potentially, injected into an external domain, if the
routing protocol governing that domain permits this. routing protocol governing that domain permits this.
When operating routers connecting a MANET using this protocol to an When operating routers connecting a MANET using this protocol to an
external routing domain, care MUST be taken not to allow potentially external routing domain, care MUST be taken not to allow potentially
skipping to change at page 63, line 45 skipping to change at page 76, line 35
validate the correctness of information prior to it being injected as validate the correctness of information prior to it being injected as
to avoid polluting routing tables with invalid information. to avoid polluting routing tables with invalid information.
A recommended way of extending connectivity from an existing routing A recommended way of extending connectivity from an existing routing
domain to a MANET routed using this protocol is to assign an IP domain to a MANET routed using this protocol is to assign an IP
prefix (under the authority of the routers/gateways connecting the prefix (under the authority of the routers/gateways connecting the
MANET with the exiting routing domain) exclusively to that MANET MANET with the exiting routing domain) exclusively to that MANET
area, and to statically configure the gateways to advertise routes area, and to statically configure the gateways to advertise routes
for that IP sequence to routers in the existing routing domain. for that IP sequence to routers in the existing routing domain.
23. IANA Considerations 24. IANA Considerations
This specification defines one Message Type, which must be allocated This specification defines one Message Type, which must be allocated
from the "Message Types" repository of [RFC5444], two Message TLV from the "Message Types" repository of [RFC5444], two Message TLV
Types, which must be allocated from the "Message TLV Types" Types, which must be allocated from the "Message TLV Types"
repository of [RFC5444], and three Address Block TLV Types, which repository of [RFC5444], and four Address Block TLV Types, which must
must be allocated from the "Address Block TLV Types" repository of be allocated from the "Address Block TLV Types" repository of
[RFC5444]. [RFC5444].
23.1. Expert Review: Evaluation Guidelines 24.1. Expert Review: Evaluation Guidelines
For the registries where an Expert Review is required, the designated For the registries where an Expert Review is required, the designated
expert SHOULD take the same general recommendations into expert SHOULD take the same general recommendations into
consideration as are specified by [RFC5444]. consideration as are specified by [RFC5444].
23.2. Message Types 24.2. Message Types
This specification defines one Message Type, to be allocated from the This specification defines one Message Type, to be allocated from the
0-223 range of the "Message Types" namespace defined in [RFC5444], as 0-223 range of the "Message Types" namespace defined in [RFC5444], as
specified in Table 6. specified in Table 8.
+------+----------------------------------------------+ +------+----------------------------------------------+
| Type | Description | | Type | Description |
+------+----------------------------------------------+ +------+----------------------------------------------+
| TBD1 | TC : Topology Control (MANET-wide signaling) | | TBD1 | TC : Topology Control (MANET-wide signaling) |
+------+----------------------------------------------+ +------+----------------------------------------------+
Table 6: Message Type assignment Table 8: Message Type assignment
23.3. Message-Type-specific TLV Type Registries 24.3. Message-Type-specific TLV Type Registries
IANA is requested to create a registry for Message-Type-specific IANA is requested to create a registry for Message-Type-specific
Message TLVs for TC messages, in accordance with Section 6.2.1 of Message TLVs for TC messages, in accordance with Section 6.2.1 of
[RFC5444], and with initial assignments and allocation policies as [RFC5444], and with initial assignments and allocation policies as
specified in Table 7. specified in Table 9.
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| Type | Description | Allocation Policy | | Type | Description | Allocation Policy |
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| 128-223 | Unassigned | Expert Review | | 128-223 | Unassigned | Expert Review |
+---------+-------------+-------------------+ +---------+-------------+-------------------+
Table 7: TC Message-Type-specific Message TLV Types Table 9: TC Message-Type-specific Message TLV Types
IANA is requested to create a registry for Message-Type-specific IANA is requested to create a registry for Message-Type-specific
Address Block TLVs for TC messages, in accordance with Section 6.2.1 Address Block TLVs for TC messages, in accordance with Section 6.2.1
of [RFC5444], and with initial assignments and allocation policies as of [RFC5444], and with initial assignments and allocation policies as
specified in Table 8. specified in Table 10.
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| Type | Description | Allocation Policy | | Type | Description | Allocation Policy |
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| 128-223 | Unassigned | Expert Review | | 128-223 | Unassigned | Expert Review |
+---------+-------------+-------------------+ +---------+-------------+-------------------+
Table 8: TC Message-Type-specific Address Block TLV Types Table 10: TC Message-Type-specific Address Block TLV Types
23.4. Message TLV Types 24.4. Message TLV Types
This specification defines two Message TLV Types, which must be This specification defines two Message TLV Types, which must be
allocated from the "Message TLV Types" namespace defined in allocated from the "Message TLV Types" namespace defined in
[RFC5444]. IANA is requested to make allocations in the 0-127 range [RFC5444]. IANA is requested to make allocations in the 0-127 range
for these types. This will create two new Type Extension registries for these types. This will create two new Type Extension registries
with assignments as specified in Table 9 and Table 10. with assignments as specified in Table 11 and Table 12.
Specifications of these TLVs are in Section 14.2.1 and Specifications of these TLVs are in Section 13.3.1. Each of these
Section 15.2.1, respectively. Each of these TLVs MUST NOT be TLVs MUST NOT be included more than once in a Message TLV Block.
included more than once in a Message TLV Block.
+-------------+------+-----------+---------------------+------------+ +-------------+------+-----------+---------------------+------------+
| Name | Type | Type | Description | Allocation | | Name | Type | Type | Description | Allocation |
| | | Extension | | Policy | | | | Extension | | Policy |
+-------------+------+-----------+---------------------+------------+ +-------------+------+-----------+---------------------+------------+
| MPR_WILLING | TBD2 | 0 | Specifies the | | | MPR_WILLING | TBD2 | 0 | Bits 0-3 encode | |
| | | | specify the | |
| | | | originating | | | | | | originating | |
| | | | router's | | | | | | router's | |
| | | | willingness to act | | | | | | willingness to act | |
| | | | as a relay and to | | | | | | as a flooding | |
| | | | partake in network | | | | | | relay; bits 4-7 | |
| | | | formation (maximum | | | | | | encode specify the | |
| | | | value is | | | | | | originating | |
| | | | WILL_ALWAYS = 15) | | | | | | router's | |
| | | | willingness to act | |
| | | | as a routing relay | |
| MPR_WILLING | TBD2 | 1-255 | Unassigned | Expert | | MPR_WILLING | TBD2 | 1-255 | Unassigned | Expert |
| | | | | Review | | | | | | Review |
+-------------+------+-----------+---------------------+------------+ +-------------+------+-----------+---------------------+------------+
Table 9: 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 message | |
| CONT_SEQ_NUM | TBD3 | 2-255 | Unassigned | Expert | | CONT_SEQ_NUM | TBD3 | 2-255 | Unassigned | Expert |
| | | | | Review | | | | | | Review |
+--------------+------+-----------+--------------------+------------+ +--------------+------+-----------+--------------------+------------+
Table 10: 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].
23.5. Address Block TLV Types 24.5. Address Block TLV Types
This specification defines three Address Block TLV Types, which must This specification defines four Address Block TLV Types, which must
be allocated from the "Address Block TLV Types" namespace defined in be allocated from the "Address Block TLV Types" namespace defined in
[RFC5444]. IANA are requested to make allocations in the 8-127 range [RFC5444]. IANA are requested to make allocations in the 8-127 range
for these types. This will create three new Type Extension for these types. This will create four new Type Extension registries
registries with assignments as specified in Table 11, Table 12 and with assignments as specified in Table 13, Table 14, Table 15 and
Table 13, respectively. Specifications of these TLVs are in Table 16. Specifications of these TLVs are in Section 13.3.2.
Section 14.2.2 and Section 15.2.2.
+-------------+------+-----------+-------------------+--------------+
| Name | Type | Type | Description | Allocation |
| | | Extension | | Policy |
+-------------+------+-----------+-------------------+--------------+
| LINK_METRIC | TBD4 | 0 | Link metric | |
| | | | meaning assigned | |
| | | | by administrative | |
| | | | action | |
| LINK_METRIC | TBD4 | 1-223 | Unassigned | Expert |
| | | | | Review |
| LINK_METRIC | TBD4 | 224-255 | Unassigned | Experimental |
| | | | | Use |
+-------------+------+-----------+-------------------+--------------+
Table 13: Address Block TLV Type assignment: LINK_METRIC
All LINK_METRIC TLVs, whatever their type extension, MUST use their
value field to encode the kind and value (in the interval
MINIMUM_METRIC, to MAXIMUM_METRIC, inclusive) of a link metric as
specified in Section 6 and Section 13.3.2. An assignment of a
LINK_METRIC TLV type extension MUST specify the physical meaning, and
mapping of that physical meaning to the representable values in the
indicated interval, of the link metric.
+------+------+-----------+----------------------------+------------+ +------+------+-----------+----------------------------+------------+
| Name | Type | Type | Description | Allocation | | Name | Type | Type | Description | Allocation |
| | | Extension | | Policy | | | | Extension | | Policy |
+------+------+-----------+----------------------------+------------+ +------+------+-----------+----------------------------+------------+
| MPR | TBD4 | 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 an MPR | | | | | | router selected as a | |
| MPR | TBD4 | 1-255 | Unassigned | Expert | | | | | flooding MPR (FLOODING = | |
| | | | 1), that a given network | |
| | | | address is of a router | |
| | | | selected as a routing MPR | |
| | | | (ROUTING = 2), or both | |
| | | | (FLOOD_ROUTE = 3) | |
| MPR | TBD5 | 1-255 | Unassigned | Expert |
| | | | | Review | | | | | | Review |
+------+------+-----------+----------------------------+------------+ +------+------+-----------+----------------------------+------------+
Table 11: 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 | TBD5 | 0 | Specifies that a | | | NBR_ADDR_TYPE | TBD6 | 0 | Specifies that a | |
| | | | given network | | | | | | given network | |
| | | | address is of a | | | | | | address is of a | |
| | | | neighbor reached | | | | | | neighbor reached | |
| | | | via the | | | | | | via the | |
| | | | 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 | TBD5 | 1-255 | Unassigned | Expert | | NBR_ADDR_TYPE | TBD6 | 1-255 | Unassigned | Expert |
| | | | | Review | | | | | | Review |
+---------------+------+-----------+-------------------+------------+ +---------------+------+-----------+-------------------+------------+
Table 12: 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 | TBD6 | 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 | TBD6 | 1-255 | | Expert | | GATEWAY | TBD7 | 1-255 | | Expert |
| | | | | Review | | | | | | Review |
+---------+------+-----------+-------------------------+------------+ +---------+------+-----------+-------------------------+------------+
Table 13: 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].
23.6. NBR_ADDR_TYPE Values 24.6. NBR_ADDR_TYPE Values
Note: This section does not require any IANA action, as the required Note: This section does not require any IANA action, as the required
information is included in the descriptions of the NBR_ADDR_TYPE information is included in the descriptions of the MPR and
Address Block TLV allocated in Section 23.5. This information is NBR_ADDR_TYPE Address Block TLVs allocated in Section 24.5. This
recorded here for clarity, and for use elsewhere in this information is recorded here for clarity, and for use elsewhere in
specification. this specification.
The Values which the MPR Address Block TLV can use are the following:
o FLOODING := 1;
o ROUTING := 2;
o FLOOD_ROUTE := 3.
The Values which the NBR_ADDR_TYPE Address Block TLV can use are the The Values which the NBR_ADDR_TYPE Address Block TLV can use are the
following: following:
o ORIGINATOR := 1; o ORIGINATOR := 1;
o ROUTABLE := 2; o ROUTABLE := 2;
o ROUTABLE_ORIG := 3. o ROUTABLE_ORIG := 3.
24. Contributors 25. Contributors
This specification is the result of the joint efforts of the This specification is the result of the joint efforts of the
following contributors -- listed alphabetically. following contributors -- listed alphabetically.
o Cedric Adjih, INRIA, France, <Cedric.Adjih@inria.fr> o Cedric Adjih, INRIA, France, <Cedric.Adjih@inria.fr>
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>
skipping to change at page 68, line 48 skipping to change at page 82, line 31
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, INRIA, France, <Philippe.Jacquet@inria.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>
25. 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 (LIX), Alan
Cullen (BAE Systems), Louise Lamont (CRC), Li Li (CRC), Joe Macker Cullen (BAE Systems), Louise Lamont (CRC), Li Li (CRC), Joe Macker
(NRL), Richard Ogier (SRI), Charles E. Perkins (WiChorus), Henning (NRL), Richard Ogier (SRI), Charles E. Perkins (WiChorus), Henning
Rogge (FGAN), and the entire IETF MANET working group. Rogge (FGAN), and the entire IETF MANET working group.
26. References 27. References
26.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 MANETs", RFC 5148, February 2008. Considerations in Mobile Ad Hoc Networks (MANETs)",
RFC 5148, February 2008.
[RFC5226] Narten, T. and H. Alvestrand, "Guidelines for Writing an [RFC5226] Narten, T. and H. Alvestrand, "Guidelines for Writing an
IANA Considerations Section in RFCs", RFC 5226, BCP 26, IANA Considerations Section in RFCs", RFC 5226, BCP 26,
May 2008. May 2008.
[RFC5444] Clausen, T., Dean, J., Dearlove, C., and C. Adjih, [RFC5444] Clausen, T., Dean, J., Dearlove, C., and C. Adjih,
"Generalized MANET Packet/Message Format", RFC 5444, "Generalized Mobile Ad Hoc Network (MANET) Packet/
February 2009. Message Format", RFC 5444, February 2009.
[RFC5497] Clausen, T. and C. Dearlove, "Representing multi-value [RFC5497] Clausen, T. and C. Dearlove, "Representing Multi-Value
time in MANETs", RFC 5497, March 2009. Time in Mobile Ad Hoc Networks (MANETs)", RFC 5497,
March 2009.
[RFC5498] Chakeres, I., "IANA Allocations for MANET Protocols", [RFC5498] Chakeres, I., "IANA Allocations for Mobile Ad Hoc
RFC 5498, March 2009. Network (MANET) Protocols", RFC 5498, March 2009.
[NHDP] Clausen, T., Dean, J., and C. Dearlove, "MANET [RFC6130] Clausen, T., Dean, J., and C. Dearlove, "Mobile Ad Hoc
Neighborhood Discovery Protocol (NHDP)", work in Network (MANET) Neighborhood Discovery Protocol (NHDP)",
progress draft-ietf-manet-nhdp-12.txt, March 2010. RFC 6130, April 2011.
26.2. Informative References 27.2. Informative References
[RFC2501] Macker, J. and S. Corson, "Mobile Ad hoc Networking [RFC2501] Macker, J. and S. Corson, "Mobile Ad hoc Networking
(MANET): Routing Protocol Performance Issues and (MANET): Routing Protocol Performance Issues and
Evaluation Considerations", RFC 2501, January 1999. Evaluation Considerations", RFC 2501, January 1999.
[RFC3626] Clausen, T. and P. Jacquet, "The Optimized Link State [RFC3626] Clausen, T. and P. Jacquet, "The Optimized Link State
Routing Protocol", RFC 3626, October 2003. Routing Protocol", RFC 3626, October 2003.
[RFC4880] Callas, J., Donnerhacke, L., Finney, H., and R. Thayer, [RFC4880] Callas, J., Donnerhacke, L., Finney, H., and R. Thayer,
"OpenPGP message format", RFC 4880, November 2007. "OpenPGP message format", RFC 4880, November 2007.
skipping to change at page 70, line 27 skipping to change at page 84, line 12
[FSR] Pei, G., Gerla, M., and T. Chen, "Fisheye state routing [FSR] Pei, G., Gerla, M., and T. Chen, "Fisheye state routing
in mobile ad hoc networks", 2000. in mobile ad hoc networks", 2000.
[FSLS] Santivanez, C., Ramanathan, R., and I. Stavrakakis, [FSLS] Santivanez, C., Ramanathan, R., and I. Stavrakakis,
"Making link-state routing scale for ad hoc networks", "Making link-state routing scale for ad hoc networks",
2000. 2000.
Appendix A. Example Algorithm for Calculating MPRs Appendix A. Example Algorithm for Calculating MPRs
Note: This appendix has not yet been updated to use link metrics and
separate sets of flooding and routing MPRs.
The following specifies an algorithm which MAY be used to select The following specifies an algorithm which MAY be used to select
MPRs. MPRs are calculated per OLSRv2 interface, but then a single MPRs. MPRs are calculated per OLSRv2 interface, but then a single
set of MPRs is formed from the union of the MPRs for all OLSRv2 set of MPRs is formed from the union of the MPRs for all OLSRv2
interfaces. (As noted in Section 17 a router MAY improve on this, by interfaces. (As noted in Section 18 a router MAY improve on this, by
coordination between OLSRv2 interfaces.) A router's MPRs are coordination between OLSRv2 interfaces.) A router's MPRs are
recorded using the element N_mpr in Neighbor Tuples. recorded using the element N_mpr in Neighbor Tuples.
If using this example algorithm then the following steps MUST be If using this example algorithm then the following steps MUST be
executed in order for a router to select its MPRs: executed in order for a router to select its MPRs:
1. Set N_mpr := false in all Neighbor Tuples; 1. Set N_mpr := false in all Neighbor Tuples;
2. For each Neighbor Tuple with N_symmetric = true and N_willingness 2. For each Neighbor Tuple with N_symmetric = true and N_willingness
= WILL_ALWAYS, set N_mpr := true; = WILL_ALWAYS, set N_mpr := true;
skipping to change at page 72, line 49 skipping to change at page 86, line 36
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, the selected 3. For each Neighbor Tuple with N_symmetric = true, select a Link
local address is defined as the selected local address of the Tuple with L_status = SYMMETRIC for which this is the
selected Link Tuple for that Neighbor Tuple. corresponding Neighbor Tuple and has L_out_metric = N_out_metric.
This is defined as the selected 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 with L_status = SYMMETRIC whose true, select a Link Tuple (the "selected Link Tuple") from those
corresponding Neighbor Tuple is this Neighbor Tuple and where, if for which this is the corresponding Neighbor Tuple, have L_status
possible, L_neighbor_iface_addr_list contains the neighbor = SYMMETRIC, and have L_out_metric = N_out_metric, by:
address. This is defined as the selected Link Tuple for that
neighbor address.
5. For each network address (N_orig_addr or in N_neighbor_addr_list, 1. If there is such a Link Tuple whose
the "neighbor address") from a Neighbor Tuple with N_symmetric = L_neighbor_iface_addr_list contains the neighbor address,
true, a selected address from the L_neighbor_iface_addr_list of select that Link Tuple.
the selected Link Tuple for the neighbor address, if possible
equal to the neighbor address, is defined as the selected link
address for that neighbor address.
6. Routing Tuple preference is decided by preference for 2. Otherwise select the selected Link Tuple for this Neighbor
corresponding Neighbor Tuples in this order: Tuple.
Then for this neighbor address:
3. The selected local address is defined as the selected local
address for the selected Link Tuple.
4. The selected link address is defined as an address from the
L_neighbor_iface_addr_list of the selected Link Tuple, if
possible equal to this neighbor address.
5. Routing Tuple preference is decided by preference for minimum
R_dist, and then for preference for corresponding Neighbor Tuples
in this order:
* For greater N_willingness. * For greater N_willingness.
* For N_mpr_selector = true over N_mpr_selector = false. * For N_mpr_selector = true over N_mpr_selector = false.
Note that preferred Routing Tuples SHOULD be used. Routing
Tuples with minimum R_metric MUST be used, this is specified
outside the definition of preference. An implementation MAY
modify this definition of preference 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, add a Routing
Tuple with: Tuple with:
* R_dest_addr := N_orig_addr; * R_dest_addr := N_orig_addr;
* R_next_iface_addr := selected link address; * R_next_iface_addr := selected link address for N_orig_addr;
* R_local_iface_addr := selected local address; * R_local_iface_addr := selected local address for N_orig_addr;
* R_metric := N_out_metric;
* R_dist := 1. * R_dist := 1.
B.3. Add Remote Routers B.3. Add Remote Routers
The following procedure is executed for each value of h, starting The following procedure is executed for each value of h, starting
with h := 1 and incrementing by 1 for each iteration. The execution with h := 1 and incrementing by 1 for each iteration. The execution
MUST stop if no new Routing Tuples are added in an iteration. MUST stop if no Routing Tuples are added or modified in an iteration.
1. For each Router Topology Tuple, if: 1. For each Router Topology Tuple, if:
* TR_to_orig_addr is not equal to the R_dest_addr of any Routing
Tuple added in an earlier stage, AND;
* TR_from_orig_addr is equal to the R_dest_addr of a Routing * TR_from_orig_addr is equal to the R_dest_addr of a Routing
Tuple with R_dist = h (the "previous Routing Tuple"), Tuple with R_dist = h (the "previous Routing Tuple"),
then add a new Routing Tuple, with: then consider the candidate Routing Tuple with:
* R_dest_addr := TR_to_orig_addr; * R_dest_addr := TR_to_orig_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;
* R_local_iface_addr := R_local_iface_addr of the previous * R_local_iface_addr := R_local_iface_addr of the previous
Routing Tuple; Routing Tuple;
* R_metric := R_metric of the previous Routing Tuple +
TR_metric;
* R_dist := h+1. * R_dist := h+1.
There may be more than one possible Routing Tuple that may be This candidate Routing Tuple MUST be added to the Routing Set if
added for an R_dest_addr in this stage. If so, then, for each there is no existing Routing Tuple with the same R_dest_addr.
such R_dest_addr, a Routing Tuple which is preferred SHOULD be Otherwise this candidate Routing Tuple MUST replace the existing
added. Routing Tuple with the same R_dest_addr if this candidate Routing
Tuple has a smaller R_metric, this candidate Routing Tuple SHOULD
replace the existing Routing Tuple with the same R_dest_addr if
this candidate Routing Tuple has an equal R_metric and is
preferred to the existing Routing Tuple.
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:
1. For each network address (the "current address") in 1. For each network address (the "neighbor address") in
N_neighbor_addr_list, if the current 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 := current address; + R_dest_addr := neighbor address;
+ R_next_iface_addr := selected link address; + R_next_iface_addr := selected link address for the
neighbor address;
+ R_local_iface_addr := selected local address; + R_local_iface_addr := selected local address for the
neighbor address;
+ R_metric := N_out_metric;
+ 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;
* TR_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;
* R_local_iface_addr := R_local_iface_addr of the previous * R_local_iface_addr := R_local_iface_addr of the previous
Routing Tuple; Routing Tuple;
* R_metric := R_metric of the previous Routing Tuple +
TA_metric.
* R_dist := R_dist of the previous Routing Tuple + 1. * R_dist := R_dist of the previous Routing Tuple + 1.
There may be more than one possible Routing Tuple that may be There may be more than one Routing Tuple that may be added for an
added for an R_dest_addr in this stage. If so, then, for each R_dest_addr in this stage. If so, then, for each such
such R_dest_addr, a Routing Tuple which is preferred SHOULD be R_dest_addr, a Routing Tuple with minimum R_metric MUST 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;
skipping to change at page 75, line 47 skipping to change at page 90, line 15
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;
* R_local_iface_addr := R_local_iface_addr of the previous * R_local_iface_addr := R_local_iface_addr of the previous
Routing Tuple; Routing Tuple;
* R_metric := R_metric of the previous Routing Tuple +
AN_metric;
* R_dist := R_dist of the previous Routing Tuple + AN_dist. * R_dist := R_dist of the previous Routing Tuple + AN_dist.
There may be more than one possible Routing Tuple that may be There may be more than one Routing Tuple that may be added for an
added for an R_dest_addr in this stage. If so, then, for each R_dest_addr in this stage. If so, then, for each such
such R_dest_addr, a Routing Tuple with minimum R_dist 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, 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, Tuple added in an earlier stage, AND;
then define the "previous Routing Tuple" as that with R_dest_addr * the Routing Tuple with R_dest_addr = N_orig_addr of the
= N_orig_addr of the corresponding Neighbor Tuple, and add a new corresponding Neighbor Tuple (the "previous Routing Tuple")
Routing Tuple, with: has R_dist = 1,
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
Tuple; Tuple;
* R_local_iface_addr := R_local_iface_addr of the previous * R_local_iface_addr := R_local_iface_addr of the previous
Routing Tuple; Routing Tuple;
* R_metric := R_metric of the previous Routing Tuple +
N_out_metric of the corresponding Neighbor Tuple;
* R_dist := 2. * R_dist := 2.
There may be more than one possible Routing Tuple that may be There may be more than one Routing Tuple that may be added for an
added for an R_dest_addr in this stage. If so, then, for each R_dest_addr in this stage. If so, then, for each such
such R_dest_addr, a Routing Tuple which is preferred SHOULD be R_dest_addr, a Routing Tuple with minimum R_metric MUST 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 protocol TC messages are instances of [RFC5444] messages. This specification
requires that TC messages contains <msg-hop-limit> and <msg-orig- requires that TC messages contains <msg-hop-limit> and <msg-orig-
addr> fields. It supports TC messages with any combination of addr> fields. It supports TC messages with any combination of
remaining message header options and address encodings, enabled by remaining message header options and address encodings, enabled by
[RFC5444] that convey the required information. As a consequence, [RFC5444] that convey the required information. As a consequence,
there is no single way to represent how all TC messages look. This there is no single way to represent how all TC messages look. This
appendix illustrates a TC message, the exact values and content appendix illustrates a TC message, the exact values and content
included are explained in the following text. included are explained in the following text.
The message has full Message Header (four bit Flags field value is The TC message's four bit Message Flags (MF) field has value 15
15). Its four bit Message Address Length field has value 3 and hence indicating that the message header contains originaor address, hop
addresses in the message have length four octets, here being IPv4 limit, hop count, and message sequence number fields. Its four bit
addresses. The overall message length is 57 octets. Message Address Length (MAL) field has value 3, indicating addresses
in the message have a length of four octets, here being IPv4
addresses. The overall message length is 71 octets.
The message has a Message TLV Block with content length 13 octets The message has a Message TLV Block with content length 13 octets
containing three TLVs. The first two TLVs are interval and validity containing three 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 value 16, indicating that it has Each TLV uses a TLV with Flags octet (MTLVF) value 16, indicating
a Value, but no type extension or start and stop indexes. The first that it has a Value, but no type extension or start and stop indexes.
two TLVs have a Value Length of 1 octet, the last has a Value Length The first two TLVs have a Value Length of 1 octet, the last has a
of 2 octets. 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 value The first Address Block contains 3 addresses, with Flags octet
128, hence with a Head section, (with length 2 octets) but no Tail (ATLVF) value 128, hence with a Head section (with length 2 octets),
section, and hence Mid sections with length two octets. The but no Tail section, and hence with Mid sections with length two
following TLV Block (content length 6 octets) contains a single octets. The following TLV Block (content length 13 octets) contains
NBR_ADDR_TYPE TLV (Flags octet value 16, includes a Value but no two TLVs. The first TLV is a NBR_ADDR_TYPE TLV with Flags octet
indexes) indicating that these addresses are associated with the (ATLVF) value 16, indicating a single Value but no indexes. Thus all
Value (with Value Length 1 octet) ROUTABLE_ORIG, i.e., they are three addresses are associated with the Value (with Value Length 1
originator addresses of advertised neighbors that are also routable octet) ROUTABLE_ORIG, i.e., they are originator addresses of
addresses. advertised neighbors that are also routable addresses. The second
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
is 6 octets, each address is associated with a Value with length two
octets. These Value fields are each shown as having four bits
indicating that they are outgoing neighbor metric values, and as
having twelve bits that represent the metric value (the first four
bits being the exponent, the remaining twelve bits the mantissa).
The second Address Block contains 1 address, with Flags octet 176 The second Address Block contains 1 address, with Flags octet (ATLVF)
indicating that there is a Head section (with length 2 octets), that 176, indicating that there is a Head section (with length 2 octets),
the Tail section (length 2 octets) consists of zero valued octets that the Tail section (with length 2 octets) consists of zero valued
(not included), and that there is a single prefix length, which is octets (not included), and that there is a single prefix length,
16. The network address is thus Head.0.0/16. The following TLV which is 16. The network address is thus Head.0.0/16. The following
Block (content length 8 octets) includes one TLV that indicates that TLV Block (content length 8 octets) includes two TLVs. The first has
the originating router is a gateway to this network, at a given a Flags octet (ATLVF) of 16, again indicating that no indexes are
number of hops distance (Value Length 1 octet). The TLV Flags octet needed, but that a Value (with Value Length 1 octet) is present,
value of 16 again indicates that a Value, but no indexes are needed. 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
with a Flags octet (ATLVF) value 16, indicating that a single Value
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 |1 1 1 1 0 0 1 1|0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1| | TC | MF=15 | MAL=3 | Message Length = 71 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Originator Address | | Originator Address |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Hop Limit | Hop Count | Message Sequence Number | | Hop Limit | Hop Count | Message Sequence Number |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1| INTERVAL_TIME |0 0 0 1 0 0 0 0| | Message TLV Block Length = 13 | VALIDITY_TIME | MTLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1| Value | VALIDITY_TIME |0 0 0 1 0 0 0 0| | Value Len = 1 | Value (Time) | INTERVAL_TIME | MTLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1| Value | CONT_SEQ_NUM |0 0 0 1 0 0 0 0| | Value Len = 1 | Value (Time) | CONT_SEQ_NUM | MTLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 1 0| Value (ANSN) |0 0 0 0 0 0 1 1| | Value Len = 2 | Value (ANSN) | Num Addrs = 3 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|1 0 0 0 0 0 0 0|0 0 0 0 0 0 1 0| Head | | ABF = 128 | Head Len = 2 | Head |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Mid | | Mid | Mid |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid |0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0| | Mid | Address TLV Block Length = 13 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| NBR_ADDR_TYPE |0 0 0 1 0 0 0 0|0 0 0 0 0 0 0 1| ROUTABLE_ORIG | | NBR_ADDR_TYPE | ATLVF = 16 | Value Len = 1 | ROUTABLE_ORIG |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1|1 0 1 1 0 0 0 0|0 0 0 0 0 0 1 0| Head | | LINK_METRIC | ATLVF = 20 | Value Len = 6 |0|0|0|1|Metric |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Head (cont) |0 0 0 0 0 0 1 0|0 0 0 1 0 0 0 0|0 0 0 0 0 0 0 0| | Metric (cont) |0|0|0|1| Metric |0|0|0|1|Metric |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 1 0 0| GATEWAY |0 0 0 1 0 0 0 0|0 0 0 0 0 0 0 1| | Metric (cont) | Num Addrs = 1 | ABF = 176 | Head Len = 2 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Number Hops | | Head | Tail Len = 2 | Pref Len = 16 |
+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Address TLV Block Length = 9 | GATEWAY | ATLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Value Len = 1 | Value (Hops) | LINK_METRIC | ATLVF = 16 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Value Len = 2 |0|0|0|1| Metric |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Appendix D. Constraints Appendix D. Constraints
Any process which updates the Local Information Base, the Any process which updates the Local Information Base, the
Neighborhood Information Base or the Topology Information Base MUST Neighborhood Information Base or the Topology Information Base MUST
ensure that all constraints specified in this appendix are ensure that all constraints specified in this appendix are
maintained, as well as those specified in [NHDP]. maintained, as well as those specified in [RFC6130].
In each Originator Tuple: In each Originator Tuple:
o O_orig_addr MUST NOT equal any other O_orig_addr. o O_orig_addr MUST NOT equal any other O_orig_addr.
o O_orig_addr MUST NOT equal this router's originator address. o O_orig_addr MUST NOT equal this router's originator address.
In each Local Attached Network Tuple: In each Local Attached Network Tuple:
o AL_net_addr MUST NOT equal any other AL_net_addr. o AL_net_addr MUST NOT equal any other AL_net_addr.
skipping to change at page 79, line 22 skipping to change at page 94, line 28
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
representable in the defined compressed form.
o if L_out_metric != UNKNOWN_METRIC then L_out_metric MUST be
representable in the defined compressed form.
o If L_mpr_selector = true, then L_status = SYMMETRIC.
In each Neighbor Tuple: In each Neighbor Tuple:
o N_orig_addr MUST NOT be changed to unknown. o N_orig_addr MUST NOT be changed to unknown.
o N_orig_addr MUST NOT equal this router's originator address, or o N_orig_addr MUST NOT equal this router's originator address, or
equal O_orig_addr in any Originator Tuple. equal O_orig_addr in any Originator Tuple.
o N_orig_addr MUST NOT equal the AL_net_addr in any Local Attached o N_orig_addr MUST NOT equal the AL_net_addr in any Local Attached
Network Tuple. Network Tuple.
skipping to change at page 79, line 43 skipping to change at page 95, line 13
N_orig_addr in any other Neighbor Tuple. N_orig_addr in any other Neighbor Tuple.
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_willingness = WILL_NEVER, N_mpr = o If N_orig_addr = unknown, then N_willingness = WILL_NEVER, N_mpr =
false, N_mpr_selector = false, and N_advertised = false. false, N_mpr_selector = false, and N_advertised = false.
o N_willingness MUST be in the range from WILL_NEVER to WILL_ALWAYS, o N_in_metric MUST equal the minimum value of the L_in_metric values
inclusive. of all corrsponding Link Tuples, if any, otherwise N_in_metric =
UNKNOWN_METRIC.
o If N_mpr = true, then N_symmetric MUST be true and N_willingness o N_out_metric MUST equal the minimum value of the L_out_metric
MUST NOT equal WILL_NEVER. values of all corrsponding Link Tuples, if any, otherwise
N_out_metric = UNKNOWN_METRIC.
o If N_symmetric = true and N_mpr = false, then N_willingness MUST o N_will_flooding and N_will_routing MUST be in the range from
NOT equal WILL_ALWAYS. WILL_NEVER to WILL_ALWAYS, inclusive.
o If N_flooding_mpr = true, then N_symmetric MUST be true and
N_will_flooding MUST NOT equal WILL_NEVER.
o If N_routing_mpr = true, then N_symmetric MUST be true and
N_will_routing MUST NOT equal WILL_NEVER.
o If N_symmetric = true and N_mpr_flooding = false, then
N_will_flooding MUST NOT equal WILL_ALWAYS.
o If N_symmetric = true and N_mpr_routing = false, then
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.
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
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.
o AR_orig_addr MUST NOT be in the AL_net_addr in any Local Attached o AR_orig_addr MUST NOT be in the AL_net_addr in any Local Attached
skipping to change at page 81, line 12 skipping to change at page 96, line 45
o TR_to_orig_addr MUST NOT be in the AL_net_addr in any Local o TR_to_orig_addr MUST NOT be in the AL_net_addr in any Local
Attached Network Tuple. Attached Network Tuple.
o The ordered pair (TR_from_orig_addr, TR_to_orig_addr) MUST NOT o The ordered pair (TR_from_orig_addr, TR_to_orig_addr) MUST NOT
equal the corresponding pair for any other Router Topology Tuple. equal the corresponding pair for any other Router Topology Tuple.
o TR_seq_number MUST NOT be greater than AR_seq_number in the o TR_seq_number MUST NOT be greater than AR_seq_number in the
Advertising Remote Router Tuple with AR_orig_addr = Advertising Remote Router Tuple with AR_orig_addr =
TR_from_orig_addr. TR_from_orig_addr.
o TR_metric MUST be representable in the defined compressed form.
In each Routable Address Topology Tuple: In each Routable Address Topology Tuple:
o There MUST be an Advertising Remote Router Tuple with AR_orig_addr o There MUST be an Advertising Remote Router Tuple with AR_orig_addr
= TA_from_orig_addr. = TA_from_orig_addr.
o TA_dest_addr MUST be routable. o TA_dest_addr MUST be routable.
o TA_dest_addr MUST NOT overlap any network address in the o TA_dest_addr MUST NOT overlap any network address in the
I_local_iface_addr_list in any Local Interface Tuple or overlap I_local_iface_addr_list in any Local Interface Tuple or overlap
the IR_local_iface_addr in any Removed Interface Address Tuple. the IR_local_iface_addr in any Removed Interface Address Tuple.
skipping to change at page 81, line 36 skipping to change at page 97, line 24
o TA_dest_addr MUST NOT equal or have as a sub-range the AL_net_addr o TA_dest_addr MUST NOT equal or have as a sub-range the AL_net_addr
in any Local Attached Network Tuple. in any Local Attached Network Tuple.
o The ordered pair (TA_from_orig_addr, TA_dest_addr) MUST NOT equal o The ordered pair (TA_from_orig_addr, TA_dest_addr) MUST NOT equal
the corresponding pair for any other Attached Network Tuple. the corresponding pair for any other Attached Network Tuple.
o TA_seq_number MUST NOT be greater than AR_seq_number in the o TA_seq_number MUST NOT be greater than AR_seq_number in the
Advertising Remote Router Tuple with AR_orig_addr = Advertising Remote Router Tuple with AR_orig_addr =
TA_from_orig_addr. TA_from_orig_addr.
o TA_metric MUST be representable in the defined compressed form.
In each Attached Network Tuple: In each Attached Network Tuple:
o There MUST be an Advertising Remote Router Tuple with AR_orig_addr o There MUST be an Advertising Remote Router Tuple with AR_orig_addr
= AN_orig_addr. = AN_orig_addr.
o AN_net_addr MUST NOT equal or be a sub-range of any network o AN_net_addr MUST NOT equal or be a sub-range of any network
address in the I_local_iface_addr_list in any Local Interface address in the I_local_iface_addr_list in any Local Interface
Tuple or be a sub-range of the IR_local_iface_addr in any Removed Tuple or be a sub-range of the IR_local_iface_addr in any Removed
Interface Address Tuple. Interface Address Tuple.
skipping to change at page 82, line 13 skipping to change at page 97, line 50
Network Tuple. Network Tuple.
o The ordered pair (AN_orig_addr, AN_net_addr) MUST NOT equal the o The ordered pair (AN_orig_addr, AN_net_addr) MUST NOT equal the
corresponding pair for any other Attached Network Tuple. corresponding pair for any other Attached Network Tuple.
o AN_seq_number MUST NOT be greater than AR_seq_number in the o AN_seq_number MUST NOT be greater than AR_seq_number in the
Advertising Remote Router Tuple with AR_orig_addr = AN_orig_addr. Advertising Remote Router Tuple with AR_orig_addr = AN_orig_addr.
o AN_dist MUST NOT be less than zero. o AN_dist MUST NOT be less than zero.
o AN_metric MUST be representable in the defined compressed form.
Appendix E. Flow and Congestion Control Appendix E. Flow and Congestion Control
Due to its proactive nature, this protocol has a natural control over Due to its proactive nature, this protocol has a natural control over
the flow of its control traffic. Routers transmit control messages the flow of its control traffic. Routers transmit control messages
at predetermined rates specified and bounded by message intervals. at predetermined rates specified and bounded by message intervals.
This protocol employs [NHDP] 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 [NHDP]. 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 classic
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
skipping to change at page 83, line 26 skipping to change at line 4625
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 Project Hipercom, INRIA
Phone: +33 1 3963 5263 Phone: +33 1 3963 5263
EMail: philippe.jacquet@inria.fr EMail: philippe.jacquet@inria.fr
The OLSRv2 Design Team
MANET Working Group
 End of changes. 385 change blocks. 
844 lines changed or deleted 1595 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/