draft-ietf-manet-olsrv2-05.txt   draft-ietf-manet-olsrv2-06.txt 
Mobile Ad hoc Networking (MANET) T. Clausen Mobile Ad hoc Networking (MANET) T. Clausen
Internet-Draft LIX, Ecole Polytechnique, France Internet-Draft LIX, Ecole Polytechnique, France
Intended status: Standards Track C. Dearlove Intended status: Standards Track C. Dearlove
Expires: August 28, 2008 BAE Systems Advanced Technology Expires: December 8, 2008 BAE Systems Advanced Technology
Centre Centre
P. Jacquet P. Jacquet
Project Hipercom, INRIA Project Hipercom, INRIA
The OLSRv2 Design Team The OLSRv2 Design Team
MANET Working Group MANET Working Group
February 25, 2008 June 6, 2008
The Optimized Link State Routing Protocol version 2 The Optimized Link State Routing Protocol version 2
draft-ietf-manet-olsrv2-05 draft-ietf-manet-olsrv2-06
Status of this Memo Status of This Memo
By submitting this Internet-Draft, each author represents that any By submitting this Internet-Draft, each author represents that any
applicable patent or other IPR claims of which he or she is aware applicable patent or other IPR claims of which he or she is aware
have been or will be disclosed, and any of which he or she becomes have been or will be disclosed, and any of which he or she becomes
aware will be disclosed, in accordance with Section 6 of BCP 79. aware will be disclosed, in accordance with Section 6 of BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet- other groups may also distribute working documents as Internet-
Drafts. Drafts.
skipping to change at page 1, line 40 skipping to change at page 1, line 40
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt. http://www.ietf.org/ietf/1id-abstracts.txt.
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html. http://www.ietf.org/shadow.html.
This Internet-Draft will expire on August 28, 2008. This Internet-Draft will expire on December 8, 2008.
Copyright Notice
Copyright (C) The IETF Trust (2008).
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. The protocol embodies (OLSRv2) protocol. The protocol embodies an optimization of the
an optimization of the classical link state algorithm tailored to the classical link state algorithm tailored to the requirements of a
requirements of a mobile ad hoc network (MANET). Mobile Ad hoc NETwork (MANET).
The key optimization of OLSRv2 is that of multipoint relays, The key optimization in OLSRv2 is that of multipoint relays (MPRs),
providing an efficient mechanism for network-wide broadcast of link providing an efficient mechanism for network-wide broadcast of link
state information (i.e. reducing the cost of performing a network- state information (i.e. reducing the cost of performing a network-
wide link state broadcast). A secondary optimization is that OLSRv2 wide link state broadcast). A secondary optimization is that OLSRv2
employs partial link state information: each node maintains employs partial link state information; each node maintains
information about all destinations, but only a subset of links. information about all destinations, but only a subset of links.
Consequently, only selected nodes diffuse link state advertisements Consequently, only selected nodes flood link state advertisements
(thus reducing the number of network-wide link state broadcasts) and (thus reducing the number of network-wide link state broadcasts) and
these advertisements contain only a subset of links (thus reducing these advertisements contain only a subset of links (thus reducing
the size of network-wide link state broadcasts). The partial link the size of network-wide link state broadcasts). The partial link
state information thus obtained still allows each OLSRv2 node to at state information thus obtained still allows each OLSRv2 node to at
all times maintain optimal (in terms of number of hops) routes to all all times maintain optimal (in terms of number of hops) routes to all
destinations in the network. destinations in the network.
OLSRv2 imposes minimum requirements on the network by not requiring OLSRv2 imposes minimum requirements on the network by not requiring
sequenced or reliable transmission of control traffic. Furthermore, sequenced or reliable transmission of control traffic. Furthermore,
the only interaction between OLSRv2 and the IP stack is routing table the only interaction between OLSRv2 and the IP stack is routing table
management. management.
OLSRv2 is particularly suitable for large and dense networks as the OLSRv2 is particularly suitable for large and dense networks as the
technique of MPRs works well in this context. technique of MPRs works best in this context.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 6 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 5
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 7 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6
3. Applicability Statement . . . . . . . . . . . . . . . . . . . 9 3. Applicability Statement . . . . . . . . . . . . . . . . . . . 8
4. Protocol Overview and Functioning . . . . . . . . . . . . . . 10 4. Protocol Overview and Functioning . . . . . . . . . . . . . . 10
5. Protocol Parameters and Constants . . . . . . . . . . . . . . 13 5. Protocol Parameters and Constants . . . . . . . . . . . . . . 13
5.1. Local History Times . . . . . . . . . . . . . . . . . . . 13 5.1. Local History Times . . . . . . . . . . . . . . . . . . . 13
5.2. Message Intervals . . . . . . . . . . . . . . . . . . . . 13 5.2. Message Intervals . . . . . . . . . . . . . . . . . . . . 14
5.3. Advertised Information Validity Times . . . . . . . . . . 14 5.3. Advertised Information Validity Times . . . . . . . . . . 14
5.4. Received Message Validity Times . . . . . . . . . . . . . 15 5.4. Received Message Validity Times . . . . . . . . . . . . . 15
5.5. Jitter . . . . . . . . . . . . . . . . . . . . . . . . . . 16 5.5. Jitter . . . . . . . . . . . . . . . . . . . . . . . . . . 16
5.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 16 5.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 16
5.7. Willingness . . . . . . . . . . . . . . . . . . . . . . . 16 5.7. Willingness . . . . . . . . . . . . . . . . . . . . . . . 17
5.8. Parameter Change Constraints . . . . . . . . . . . . . . . 17 5.8. Parameter Change Constraints . . . . . . . . . . . . . . . 17
6. Information Bases . . . . . . . . . . . . . . . . . . . . . . 19 6. Information Bases . . . . . . . . . . . . . . . . . . . . . . 19
6.1. Local Information Base . . . . . . . . . . . . . . . . . . 19 6.1. Local Information Base . . . . . . . . . . . . . . . . . . 19
6.1.1. Originator Set . . . . . . . . . . . . . . . . . . . . 20 6.1.1. Originator Set . . . . . . . . . . . . . . . . . . . . 19
6.1.2. Local Attached Network Set . . . . . . . . . . . . . . 20 6.1.2. Local Attached Network Set . . . . . . . . . . . . . . 20
6.2. Node Information Base . . . . . . . . . . . . . . . . . . 20 6.2. Node Information Base . . . . . . . . . . . . . . . . . . 20
6.3. Topology Information Base . . . . . . . . . . . . . . . . 21 6.3. Topology Information Base . . . . . . . . . . . . . . . . 21
6.3.1. Advertised Neighbor Set . . . . . . . . . . . . . . . 21 6.3.1. Advertised Neighbor Set . . . . . . . . . . . . . . . 21
6.3.2. Advertising Remote Node Set . . . . . . . . . . . . . 21 6.3.2. Advertising Remote Node Set . . . . . . . . . . . . . 21
6.3.3. Topology Set . . . . . . . . . . . . . . . . . . . . . 22 6.3.3. Topology Set . . . . . . . . . . . . . . . . . . . . . 22
6.3.4. Attached Network Set . . . . . . . . . . . . . . . . . 22 6.3.4. Attached Network Set . . . . . . . . . . . . . . . . . 22
6.3.5. Routing Set . . . . . . . . . . . . . . . . . . . . . 23 6.3.5. Routing Set . . . . . . . . . . . . . . . . . . . . . 23
6.4. Processing and Forwarding Information Base . . . . . . . . 23 6.4. Processing and Forwarding Information Base . . . . . . . . 23
6.4.1. Received Set . . . . . . . . . . . . . . . . . . . . . 23 6.4.1. Received Set . . . . . . . . . . . . . . . . . . . . . 24
6.4.2. Processed Set . . . . . . . . . . . . . . . . . . . . 24 6.4.2. Processed Set . . . . . . . . . . . . . . . . . . . . 24
6.4.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . 24 6.4.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . 24
6.4.4. Relay Set . . . . . . . . . . . . . . . . . . . . . . 25 6.4.4. Relay Set . . . . . . . . . . . . . . . . . . . . . . 25
7. Packet Processing and Message Forwarding . . . . . . . . . . . 26 7. Packet Processing and Message Forwarding . . . . . . . . . . . 26
7.1. Actions when Receiving an OLSRv2 Packet . . . . . . . . . 26 7.1. Actions when Receiving an OLSRv2 Packet . . . . . . . . . 26
7.2. Actions when Receiving an OLSRv2 Message . . . . . . . . . 26 7.2. Actions when Receiving an OLSRv2 Message . . . . . . . . . 26
7.3. Message Considered for Processing . . . . . . . . . . . . 27 7.3. Message Considered for Processing . . . . . . . . . . . . 27
7.4. Message Considered for Forwarding . . . . . . . . . . . . 28 7.4. Message Considered for Forwarding . . . . . . . . . . . . 28
8. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 31 8. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 31
8.1. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . 31 8.1. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . 31
8.1.1. HELLO Message TLVs . . . . . . . . . . . . . . . . . . 32 8.1.1. HELLO Message TLVs . . . . . . . . . . . . . . . . . . 32
8.1.2. HELLO Message Address Block TLVs . . . . . . . . . . . 32 8.1.2. HELLO Message Address Block TLVs . . . . . . . . . . . 32
8.2. TC Messages . . . . . . . . . . . . . . . . . . . . . . . 32 8.2. TC Messages . . . . . . . . . . . . . . . . . . . . . . . 32
8.2.1. TC Message TLVs . . . . . . . . . . . . . . . . . . . 33 8.2.1. TC Message TLVs . . . . . . . . . . . . . . . . . . . 34
8.2.2. TC Message Address Block TLVs . . . . . . . . . . . . 34 8.2.2. TC Message Address Block TLVs . . . . . . . . . . . . 34
9. HELLO Message Generation . . . . . . . . . . . . . . . . . . . 35 9. HELLO Message Generation . . . . . . . . . . . . . . . . . . . 35
9.1. HELLO Message: Transmission . . . . . . . . . . . . . . . 35 9.1. HELLO Message: Transmission . . . . . . . . . . . . . . . 35
10. HELLO Message Processing . . . . . . . . . . . . . . . . . . . 36 10. HELLO Message Processing . . . . . . . . . . . . . . . . . . . 36
10.1. Updating Willingness . . . . . . . . . . . . . . . . . . . 36 10.1. Updating Willingness . . . . . . . . . . . . . . . . . . . 36
10.2. Updating MPR Selectors . . . . . . . . . . . . . . . . . . 36 10.2. Updating MPR Selectors . . . . . . . . . . . . . . . . . . 36
10.3. Symmetric 1-Hop and 2-Hop Neighborhood Changes . . . . . . 36 10.3. Symmetric 1-Hop and 2-Hop Neighborhood Changes . . . . . . 36
11. TC Message Generation . . . . . . . . . . . . . . . . . . . . 38 11. TC Message Generation . . . . . . . . . . . . . . . . . . . . 38
11.1. TC Message: Transmission . . . . . . . . . . . . . . . . . 39 11.1. TC Message: Transmission . . . . . . . . . . . . . . . . . 39
12. TC Message Processing . . . . . . . . . . . . . . . . . . . . 41 12. TC Message Processing . . . . . . . . . . . . . . . . . . . . 40
12.1. Initial TC Message Processing . . . . . . . . . . . . . . 41 12.1. Initial TC Message Processing . . . . . . . . . . . . . . 40
12.1.1. Populating the Advertising Remote Node Set . . . . . . 42 12.1.1. Populating the Advertising Remote Node Set . . . . . . 41
12.1.2. Populating the Topology Set . . . . . . . . . . . . . 43 12.1.2. Populating the Topology Set . . . . . . . . . . . . . 42
12.1.3. Populating the Attached Network Set . . . . . . . . . 43 12.1.3. Populating the Attached Network Set . . . . . . . . . 42
12.2. Completing TC Message Processing . . . . . . . . . . . . . 44 12.2. Completing TC Message Processing . . . . . . . . . . . . . 43
12.2.1. Purging the Topology Set . . . . . . . . . . . . . . . 44 12.2.1. Purging the Topology Set . . . . . . . . . . . . . . . 43
12.2.2. Purging the Attached Network Set . . . . . . . . . . . 44 12.2.2. Purging the Attached Network Set . . . . . . . . . . . 43
13. Information Base Changes . . . . . . . . . . . . . . . . . . . 45 13. Information Base Changes . . . . . . . . . . . . . . . . . . . 44
14. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 46 14. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 45
15. Populating Derived Sets . . . . . . . . . . . . . . . . . . . 48 15. Populating Derived Sets . . . . . . . . . . . . . . . . . . . 47
15.1. Populating the Relay Set . . . . . . . . . . . . . . . . . 48 15.1. Populating the Relay Set . . . . . . . . . . . . . . . . . 47
15.2. Populating the Advertised Neighbor Set . . . . . . . . . . 48 15.2. Populating the Advertised Neighbor Set . . . . . . . . . . 47
16. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 49 16. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 48
16.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 49 16.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 48
16.2. Populating the Routing Set . . . . . . . . . . . . . . . . 50 16.2. Populating the Routing Set . . . . . . . . . . . . . . . . 49
16.3. Routing Set Updates . . . . . . . . . . . . . . . . . . . 51 16.3. Routing Set Updates . . . . . . . . . . . . . . . . . . . 50
17. Proposed Values for Parameters and Constants . . . . . . . . . 52 17. Proposed Values for Parameters and Constants . . . . . . . . . 51
17.1. Local History Time Parameters . . . . . . . . . . . . . . 52 17.1. Local History Time Parameters . . . . . . . . . . . . . . 51
17.2. Message Interval Parameters . . . . . . . . . . . . . . . 52 17.2. Message Interval Parameters . . . . . . . . . . . . . . . 51
17.3. Advertised Information Validity Time Parameters . . . . . 52 17.3. Advertised Information Validity Time Parameters . . . . . 51
17.4. Received Message Validity Time Parameters . . . . . . . . 52 17.4. Received Message Validity Time Parameters . . . . . . . . 51
17.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 52 17.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 51
17.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 52 17.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 51
17.7. Willingness Parameter and Constants . . . . . . . . . . . 53 17.7. Willingness Parameter and Constants . . . . . . . . . . . 52
18. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 54 18. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 53
19. Security Considerations . . . . . . . . . . . . . . . . . . . 55 19. Security Considerations . . . . . . . . . . . . . . . . . . . 54
19.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 55 19.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 54
19.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 55 19.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 54
19.3. Interaction with External Routing Domains . . . . . . . . 56 19.3. Interaction with External Routing Domains . . . . . . . . 55
20. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 58 20. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 57
20.1. Message Types . . . . . . . . . . . . . . . . . . . . . . 58 20.1. Message Types . . . . . . . . . . . . . . . . . . . . . . 57
20.2. TLV Types . . . . . . . . . . . . . . . . . . . . . . . . 58 20.2. TLV Types . . . . . . . . . . . . . . . . . . . . . . . . 57
21. References . . . . . . . . . . . . . . . . . . . . . . . . . . 60 21. References . . . . . . . . . . . . . . . . . . . . . . . . . . 59
21.1. Normative References . . . . . . . . . . . . . . . . . . . 60 21.1. Normative References . . . . . . . . . . . . . . . . . . . 59
21.2. Informative References . . . . . . . . . . . . . . . . . . 60 21.2. Informative References . . . . . . . . . . . . . . . . . . 59
Appendix A. Node Configuration . . . . . . . . . . . . . . . . . 62 Appendix A. Node Configuration . . . . . . . . . . . . . . . . . 61
Appendix B. Example Algorithm for Calculating MPRs . . . . . . . 63 Appendix B. Example Algorithm for Calculating MPRs . . . . . . . 62
B.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 63 B.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 62
B.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 64 B.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 63
Appendix C. Example Algorithm for Calculating the Routing Set . . 65 Appendix C. Example Algorithm for Calculating the Routing Set . . 64
C.1. Add Local Symmetric Links . . . . . . . . . . . . . . . . 65 C.1. Add Local Symmetric Links . . . . . . . . . . . . . . . . 64
C.2. Add Remote Symmetric Links . . . . . . . . . . . . . . . . 66 C.2. Add Remote Symmetric Links . . . . . . . . . . . . . . . . 65
C.3. Add Attached Networks . . . . . . . . . . . . . . . . . . 67 C.3. Add Attached Networks . . . . . . . . . . . . . . . . . . 66
Appendix D. Example Message Layout . . . . . . . . . . . . . . . 68 Appendix D. Example Message Layout . . . . . . . . . . . . . . . 67
Appendix E. Constraints . . . . . . . . . . . . . . . . . . . . . 70 Appendix E. Constraints . . . . . . . . . . . . . . . . . . . . . 69
Appendix F. Flow and Congestion Control . . . . . . . . . . . . . 74 Appendix F. Flow and Congestion Control . . . . . . . . . . . . . 73
Appendix G. Contributors . . . . . . . . . . . . . . . . . . . . 75 Appendix G. Contributors . . . . . . . . . . . . . . . . . . . . 74
Appendix H. Acknowledgements . . . . . . . . . . . . . . . . . . 76 Appendix H. Acknowledgements . . . . . . . . . . . . . . . . . . 75
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 77
Intellectual Property and Copyright Statements . . . . . . . . . . 78
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 OLSRv1 as published in RFC3626 [7]. Compared to RFC3626, update to OLSRv1 as published in [RFC3626]. Compared to RFC3626,
OLSRv2 retains the same basic mechanisms and algorithms, while OLSRv2 retains the same basic mechanisms and algorithms, while
providing a more flexible signaling framework and some simplification providing a more flexible signaling framework and some simplification
of the messages being exchanged. Also, OLSRv2 accommodates either of the messages being exchanged. Also, OLSRv2 accommodates either
IPv4 and IPv6 addresses in a compact manner. IPv4 and IPv6 addresses in a compact manner.
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 nodes in the network regularly. Each node information with other nodes in the network regularly. Each node
selects a set of its neighbor nodes as "MultiPoint Relays" (MPRs). selects a set of its neighbor nodes as "MultiPoint Relays" (MPRs).
Control traffic may be flooded through the network using hop by hop Control traffic may be flooded through the network using hop by hop
forwarding, but where a node only needs to forward control traffic forwarding, but where a node only needs to forward control traffic
directly received from its MPR selectors (nodes which have selected directly received from its MPR selectors (nodes which have selected
it as an MPR). This mechanism, denoted "MPR flooding", provides an it as an MPR). This mechanism, denoted "MPR flooding", provides an
efficient mechanism for global information exchange within the MANET efficient mechanism for information distribution within the MANET by
by reducing the number of transmissions required. reducing the number of transmissions required.
Nodes selected as MPRs also have a special responsibility when Nodes selected as MPRs also have a special responsibility when
declaring link state information in the network. A sufficient declaring link state information in the network. A sufficient
requirement for OLSRv2 to provide shortest (lowest hop count) path requirement for OLSRv2 to provide shortest (lowest hop count) path
routes to all destinations is that nodes declare link state routes to all destinations is that nodes declare link state
information for their MPR selectors, if any. Additional available information for their MPR selectors, if any. Additional available
link state information may be transmitted, e.g. for redundancy. link state information may be transmitted, e.g. for redundancy.
Thus, as well as being used to facilitate MPR flooding, use of MPRs Thus, as well as being used to facilitate MPR flooding, use of MPRs
allows the reduction of the number and size of link state messages, allows the reduction of the number and size of link state messages,
and MPRs are used as intermediate nodes in multi-hop routes. and MPRs are used as intermediate nodes in multi-hop routes.
A node selects MPRs from among its one hop neighbors connected by A node selects MPRs from among its one hop neighbors connected by
"symmetric", i.e. bi-directional, links. Therefore, selecting routes "symmetric", i.e. bi-directional, links. Therefore, selecting routes
through MPRs automatically avoids the problems associated with data through MPRs automatically avoids the problems associated with data
packet transfer over uni-directional links (such as the problem of packet transfer over uni-directional links (such as the problem of
not getting link layer acknowledgments at each hop, for link layers not getting link layer acknowledgments at each hop, for link layers
employing this technique). employing this technique).
OLSRv2 is developed to work independently from other protocols. OLSRv2 is developed to work independently from other protocols.
(Parts of OLSRv2 have been published separately as [1], [2], [3] and (Parts of OLSRv2 have been published separately as [packetbb],
[4] for wider use.) Likewise, OLSRv2 makes no assumptions about the [timetlv], [RFC5148] and [nhdp] for wider use.) Likewise, OLSRv2
underlying link layer. However, OLSRv2 may use link layer makes no assumptions about the underlying link layer. However,
information and notifications when available and applicable, as OLSRv2 may use link layer information and notifications when
described in [4]. available and applicable, as described in [nhdp].
OLSRv2, as OLSRv1, inherits its concept of forwarding and relaying OLSRv2, as OLSRv1, inherits its concept of forwarding and relaying
from HIPERLAN (a MAC layer protocol) which is standardized by ETSI from HIPERLAN (a MAC layer protocol) which is standardized by ETSI
[9], [10]. [HIPERLAN], [HIPERLAN2].
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", "MAY", and "OPTIONAL" in this "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in RFC2119 [5]. document are to be interpreted as described in [RFC2119].
MANET specific terminology is to be interpreted as described in [1] MANET specific terminology is to be interpreted as described in
and [4]. [packetbb] and [nhdp].
Additionally, this document uses the following terminology: Additionally, this document uses the following terminology:
Node - A MANET router which implements the Optimized Link State Node - A MANET router which implements the Optimized Link State
Routing protocol version 2 as specified in this document. Routing protocol version 2 as specified in this document.
Willingness - The willingness of a node is a nummerical value
between WILL_NEVER and WILL_ALWAYS (both inclusive), which
represents the nodes willingess to be selected as an MPR. A node
with willingness greater than WILL_NEVER is said to be a "willing
node".
OLSRv2 interface - A MANET interface, running OLSRv2. Note that all OLSRv2 interface - A MANET interface, running OLSRv2. Note that all
references to MANET interfaces in [4] refer to OLSRv2 interfaces references to MANET interfaces in [nhdp] refer to OLSRv2
when using [4] as part of OLSRv2. interfaces when using [nhdp] as part of OLSRv2.
Symmetric strict 2-hop neighbor - A symmetric 2-hop neighbor which Address - An address, as recorded in the Information Bases specified
is not a symmetric 1-hop neighbor and is not a 2-hop neighbor only by this protocol, and included in HELLO and TC messages generated
through a symmetric 1-hop neighbor with willingness WILL_NEVER. A by this protocol, may be either an address or an address prefix.
node Z is a symmetric strict 2-hop neighbor of a node X if it is These can be represented as a single address object in a HELLO or
not a symmetric 1-hop neighbor of node X and if there is a node Y TC message, as defined by [packetbb]. An address so represented
with willingness not equal to WILL_NEVER and such that there is a is considered to have a prefix length equal to its length (in
symmetric link from node X to node Y, and a symmetric link from bits) when considered as an address object, and a similar
node Y to node Z. A node Z is a symmetric strict 2-hop neighbor of convention is used in the Information Bases specified by this
a node X by an OLSRv2 interface I of node X if in addition the protocol. Two addresses (address objects) are considered equal
link from node X to node Y uses interface I. only if their prefix lengths are also equal.
Willingness - The willingness of a node is a numerical value between
WILL_NEVER and WILL_ALWAYS (both inclusive), which represents the
node's willingness to be selected as an MPR.
Willing symmetric 1-hop neighbor - A symmetric 1-hop neighbor of
this node which has willingness not equal to WILL_NEVER.
Symmetric strict 2-hop neighbor - A symmetric 2-hop neighbor of this
node which is not a symmetric 1-hop neighbor of this node, and is
a symmetric 1-hop neighbor of a willing symmetric 1-hop neighbor
of this node.
Symmetric strict 2-hop neighbor through OLSRv2 interface I - A
symmetric strict 2-hop neighbor of this node which is a symmetric
1-hop neighbor of a willing symmetric 1-hop neighbor of this node
by a symmetric link including OLSRv2 interface I. This node MAY
elect to consider only information received over OLSRv2 interface
I in making this determination.
Symmetric strict 2-hop neighborhood - The set of the symmetric Symmetric strict 2-hop neighborhood - The set of the symmetric
strict 2-hop neighbors of a node. strict 2-hop neighbors of a node.
Multipoint relay (MPR) - A node which is selected by its symmetric Multipoint relay (MPR) - A node which is selected by its symmetric
1-hop neighbor, node X, to "re-transmit" all the broadcast 1-hop neighbor, node X, to "re-transmit" all the broadcast
messages that it receives from node X, provided that the message messages that it receives from node X, provided that the message
is not a duplicate, and that the hop limit field of the message is is not a duplicate, and that the hop limit field of the message is
greater than one. greater than one.
MPR selector - A node which has selected its symmetric 1-hop MPR selector - A node which has selected its symmetric 1-hop
neighbor, node X, as one of its MPRs is an MPR selector of node X. neighbor, node X, as one of its MPRs is an MPR selector of node X.
MPR flooding - The optimized global information exchange mechanism, MPR flooding - The optimized MANET-wide information distribution
employed by this protocol, in which a message is relayed by only a mechanism, employed by this protocol, in which a message is
reduced subset of the nodes in the network. relayed by only a reduced subset of the nodes in the network.
3. Applicability Statement 3. Applicability Statement
OLSRv2 is a proactive routing protocol for mobile ad hoc networks OLSRv2 is a proactive routing protocol for mobile ad hoc networks
(MANETs) [12]. The larger and more dense a network, the more (MANETs) [RFC2501]. The larger and more dense a network, the more
optimization can be achieved by using MPRs compared to the classic optimization can be achieved by using MPRs compared to the classic
link state algorithm. OLSRv2 enables hop-by-hop routing, i.e. each link state algorithm. OLSRv2 enables hop-by-hop routing, i.e. each
node using its local information provided by OLSRv2 to route packets. node using its local information provided by OLSRv2 to route packets.
As OLSRv2 continuously maintains routes to all destinations in the As OLSRv2 continuously maintains routes to all destinations in the
network, the protocol is beneficial for traffic patterns where the network, the protocol is beneficial for traffic patterns where the
traffic is random and sporadic between a large subset of nodes, and traffic is random and sporadic between a large subset of nodes, and
where the [source, destination] pairs are changing over time. No where the (source, destination) pairs are changing over time. No
additional control traffic need be generated in this case since additional control traffic need be generated in this case since
routes are maintained for all known destinations at all times. Also, routes are maintained for all known destinations at all times. Also,
since routes are maintained continuously, traffic is subject to no since routes are maintained continuously, traffic is subject to no
delays due to buffering or to route discovery. delays due to buffering or to route discovery.
OLSRv2 supports nodes which have multiple interfaces which OLSRv2 supports nodes which have multiple interfaces which
participate in the MANET using OLSRv2. As described in [4], each participate in the MANET using OLSRv2. As described in [nhdp], each
OLSRv2 interface may have one or more network addresses (which may OLSRv2 interface may have one or more network addresses (which may
have prefix lengths). OLSRv2, additionally, supports nodes which have prefix lengths). OLSRv2, additionally, supports nodes which
have non-OLSRv2 interfaces which may be local or can serve as have non-OLSRv2 interfaces which may be local or can serve as
gateways towards other networks. gateways towards other networks.
OLSRv2 uses the format specified in [1] for all messages and packets. OLSRv2 uses the format specified in [packetbb] for all messages and
OLSRv2 is thereby able to allow for extensions via "external" and packets. OLSRv2 is thereby able to allow for extensions via
"internal" extensibility. External extensibility allows a protocol "external" and "internal" extensibility. External extensibility
extension to specify and exchange new message types, which can be allows a protocol extension to specify and exchange new message
forwarded and delivered correctly even by nodes which do not support types, which can be forwarded and delivered correctly even by nodes
that extension. Internal extensibility allows a protocol extension which do not support that extension. Internal extensibility allows a
to define additional attributes to be carried embedded in the protocol extension to define additional attributes to be carried
standard OLSRv2 control messages detailed in this specification (or embedded in the standard OLSRv2 control messages detailed in this
any new message types defined by other protocol extensions) using the specification (or any new message types defined by other protocol
TLV mechanism specified in [1], while still allowing nodes not extensions) using the TLV mechanism specified in [packetbb], while
supporting that extension to forward messages including the extension still allowing nodes not supporting that extension to forward
and to process messages ignoring the extension. messages including the extension, and to process messages ignoring
the extension.
The OLSRv2 neighborhood discovery protocol using HELLO messages is The OLSRv2 neighborhood discovery protocol using HELLO messages is
specified in [4]. This neighborhood discovery protocol serves to specified in [nhdp]. This neighborhood discovery protocol serves to
ensure that each OLSRv2 node has available continuously updated ensure that each OLSRv2 node has available continuously updated
Information Bases describing the node's 1-hop and symmetric 2-hop Information Bases describing the node's 1-hop and symmetric 2-hop
neighbors. This neighborhood discovery protocol, which also uses neighbors. This neighborhood discovery protocol, which also uses
[1], is extended in this document by the addition of MPR information. [packetbb], is extended in this document by the addition of MPR
information.
OLSRv2 does not make any assumption about node addresses, other than OLSRv2 does not make any assumption about node addresses, other than
that each node is assumed to have at least one unique and routable IP that each node is assumed to have at least one unique and routable IP
address for each interface that it has which participates in the address for each interface that it has which participates in the
MANET. MANET.
4. Protocol Overview and Functioning 4. Protocol Overview and Functioning
OLSRv2 is a proactive routing protocol for mobile ad hoc networks. OLSRv2 is a proactive routing protocol for mobile ad hoc networks.
The protocol inherits the stability of a link state algorithm and has The protocol inherits the stability of a link state algorithm and has
the advantage of having routes immediately available when needed due the advantage of having routes immediately available when needed due
to its proactive nature. OLSRv2 is an optimization of the classical to its proactive nature. OLSRv2 is an optimization of the classical
link state protocol, tailored for mobile ad hoc networks. The main link state protocol, tailored for mobile ad hoc networks. The main
tailoring and optimizations of OLSRv2 are: tailoring and optimizations of OLSRv2 are:
o periodic, unacknowledged transmission of all control messages; o Unacknowledged transmission of all control messages; control
messages are sent periodically, but may also be sent in response
to changes in the local neighborhood.
o MPR flooding for global link state information declaration; o MPR flooding for MANET-wide link state information distribution.
o partial topology maintenance - each node knows only a subset of o Partial topology maintenance - each node knows only a subset of
the links in the network, sufficient for a minimum hop route to the links in the network, sufficient for a minimum hop route to
all destinations. all destinations.
The MPR flooding and partial topology maintenance are based on the The MPR flooding and partial topology maintenance are based on the
concept on MultiPoint Relays (MPRs), selected independently by nodes concept of MultiPoint Relays (MPRs), selected independently by nodes
based on the symmetric 1-hop and 2-hop neighbor information based on the symmetric 1-hop and 2-hop neighbor information
maintained using [4]. maintained using [nhdp].
Using the message exchange format [1] and the neighborhood discovery Using the message exchange format [packetbb] and the neighborhood
protocol [4], OLSRv2 also contains the following main components: discovery protocol [nhdp], OLSRv2 also contains the following main
components:
o A TLV, to be included within the HELLO messages of [4], allowing a o A TLV, to be included within the HELLO messages of [nhdp],
node to signal MPR selection. allowing a node to signal MPR selection.
o The optimized mechanism for global information exchange, denoted o The optimized mechanism for MANET-wide information distribution,
"MPR flooding". denoted "MPR flooding".
o A specification of global signaling, denoted TC (Topology Control) o A specification of MANET-wide signaling, denoted TC (Topology
messages. TC messages in OLSRv2 serve to: Control) messages. TC messages in OLSRv2 serve to:
* inject link state information into the entire network; * inject link state information into the entire MANET;
* inject addresses of hosts and networks for which they may serve * inject addresses of hosts and networks for which they may serve
as a gateway into the entire network. as a gateway into the entire network.
TC messages are emitted periodically, thereby allowing nodes to TC messages are emitted periodically, thereby allowing nodes to
continuously track global changes in the network. Incomplete TC continuously track changes in the network. Incomplete TC messages
messages may be used to report additions to advertised information may be used to report additions to advertised information without
without repeating unchanged information. Some TC messages may be repeating unchanged information. Some TC messages may be MPR
MPR flooded over only part of the network, allowing a node to flooded over only part of the network, allowing a node to ensure
ensure that nearer nodes are kept more up to date than distant that nearer nodes are kept more up to date than distant nodes,
nodes, such as is used in Fisheye State Routing [13] and Fuzzy- such as is used in Fisheye State Routing [FSR] and Fuzzy Sighted
sighted link-state routing [14]. Link State routing [FSLS].
Each node in the network selects a set of MPRs. The MPRs of a node X Each node in the network selects a set of MPRs. The MPRs of a node X
may be any subset of the willing nodes in node X's symmetric 1-hop may be any subset of node X's willing symmetric 1-hop neighbors, such
neighborhood such that every node in the symmetric strict 2-hop that every node in the symmetric strict 2-hop neighborhood of node X
neighborhood of node X has a symmetric link to at least one of node has a symmetric link to at least one of node X's MPRs. The MPRs of a
X's MPRs. The MPRs of a node may thus be said to "cover" the node's node may thus be said to "cover" the node's symmetric strict 2-hop
symmetric strict 2-hop neighborhood. Each node also maintains neighborhood. Each node also maintains information about the set of
information about the set of symmetric 1-hop neighbors that have symmetric 1-hop neighbors that have selected it as an MPR, its MPR
selected it as an MPR, its MPR selectors. selectors.
As long as the condition above is satisfied, any algorithm selecting As long as the condition above is satisfied, any algorithm selecting
MPRs is acceptable in terms of implementation interoperability. MPRs is acceptable in terms of implementation interoperability.
However if smaller sets of MPRs are selected then the greater the However if smaller sets of MPRs are selected then the greater the
efficiency gains that are possible. An analysis and examples of MPR efficiency gains that are possible. An analysis and examples of MPR
selection algorithms is given in [11]. selection algorithms is given in [MPR].
A node may independently determine and advertise its willingness to A node may independently determine and advertise its willingness to
be selected as an MPR. A node may advertise that it always should be be selected as an MPR. A node may advertise that it always should be
selected as an MPR or that it should never be selected as an MPR. In selected as an MPR or that it should never be selected as an MPR. In
the latter case, the node will neither relay control messages, nor the latter case, the node will neither relay control messages, nor
will that node be included as an intermediate node in any routing will that node be included as an intermediate node in any routing
table calculations. Use of variable willingness is most effective in table calculations. Use of variable willingness is most effective in
dense networks. dense networks.
In OLSRv2, actual efficiency gains are based on the sizes of each In OLSRv2, actual efficiency gains are based on the sizes of each
node's Relay Set, the set of symmetric 1-hop neighbors for which it node's Relay Set, the set of symmetric 1-hop neighbors for which it
is to relay broadcast traffic, and its Advertised Neighbor Set, the is to relay broadcast traffic, and its Advertised Neighbor Set, the
set of symmetric 1-hop neighbors for which it is to advertise link set of symmetric 1-hop neighbors for which it is to advertise link
state information into the network in TC messages. Each of these state information into the network in TC messages. Each of these
sets MUST contain all MPR selectors, and MAY contain additional sets MUST contain all MPR selectors, and MAY contain additional
nodes. If the Advertised Neighbor Set is empty, TC messages are not nodes. If the Advertised Neighbor Set is empty, TC messages are not
generated by that node, unless needed for gateway reporting, or for a generated by that node, unless needed for gateway reporting, or for a
short period to accelerate the removal of unwanted links. short period to accelerate the removal of outdated link state
information.
OLSRv2 is designed to work in a completely distributed manner and OLSRv2 is designed to work in a completely distributed manner and
does not depend on any central entity. The protocol does not require does not depend on any central entity. The protocol does not require
reliable transmission of control messages: each node sends control reliable transmission of control messages; each node sends control
messages periodically, and can therefore sustain a reasonable loss of messages periodically, and can therefore sustain a reasonable loss of
some such messages. Such losses may occur frequently in radio some such messages. Such losses may occur frequently in radio
networks due to collisions or other transmission problems. OLSRv2 networks due to collisions or other transmission problems. OLSRv2
MAY use "jitter", randomized adjustments to message transmission MAY use "jitter", randomized adjustments to message transmission
times, to reduce the incidence of collisions [3]. times, to reduce the incidence of collisions [RFC5148].
OLSRv2 does not require sequenced delivery of messages. Each TC OLSRv2 does not require sequenced delivery of messages. Each TC
message contains a sequence number which is incremented for each message contains a sequence number which is incremented for each
message. Thus the recipient of a TC message can, if required, easily message. Thus the recipient of a TC message can, if required, easily
identify which information is more recent - even if messages have identify which information is more recent - even if messages have
been re-ordered while in transmission. been re-ordered while in transmission.
OLSRv2 does not require any changes to the format of IP packets, any OLSRv2 only interacts with IP through routing table management.
existing IP stack can be used as is: OLSRv2 only interacts with OLSRv2 sends its control messages as described in [packetbb] and
routing table management. OLSR sends its control messages as [nhdp].
described in [1] and [4].
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 [4] plus those defined in this section. The separation in defined in [nhdp] plus those defined in this section. The separation
[4] into interface parameters, node parameters and constants is also in [nhdp] into interface parameters, node parameters and constants is
used in OLSRv2, however all but one (RX_HOLD_TIME) of the parameters also used in OLSRv2, however all but one (RX_HOLD_TIME) of the
added by OLSRv2 are node parameters. They may be classified into the parameters added by OLSRv2 are node parameters. Parameters may be
following categories: classified into the following categories:
o Local history times o Local history times
o Message intervals o Message intervals
o Advertised information validity times o Advertised information validity times
o Received message validity times o Received message validity times
o Jitter times o Jitter times
o Hop limits o Hop limits
o Willingness o Willingness
In addition constants for particular cases of a node's willingness to In addition, constants for particular cases of a node's willingness
be an MPR are defined. These parameters and constants are detailed to be an MPR are defined. These parameters and constants are
in the following sections. As for the parameters in [4], parameters detailed in the following sections. As for the parameters in [nhdp],
defined in this document may be changed dynamically by a node, and parameters defined in this document may be changed dynamically by a
need not be the same on different nodes, or on different interfaces node, and need not be the same on different nodes, even in the same
(for interface parameters). MANET, or on different interfaces of the same node (for interface
parameters).
5.1. Local History Times 5.1. Local History Times
The following parameter manages the time for which local information The following parameter manages the time for which local information
is retained: 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 recognise the node's and replaced originator address is used to recognize the node'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.2. Message Intervals 5.2. Message Intervals
The following interface parameters regulate TC message transmissions The following interface parameters regulate TC message transmissions
by a node. TC messages are usually sent periodically, but MAY also by a node. TC messages are usually sent periodically, but MAY also
be sent in response to changes in the node's Advertised Neighbor Set be sent in response to changes in the node's Advertised Neighbor Set
and Local Attached Network Set. With a larger value of parameter and Local Attached Network Set. With a larger value of the parameter
TC_INTERVAL, and a smaller value of parameter TC_MIN_INTERVAL, TC TC_INTERVAL, and a smaller value of the parameter TC_MIN_INTERVAL, TC
messages may more often be transmitted in response to changes in a messages may more often be transmitted in response to changes in a
highly dynamic network. However because a node has no knowledge of, highly dynamic network. However because a node has no knowledge of,
for example, nodes remote to it joining the network, TC messages MUST for example, nodes remote to it joining the network, TC messages MUST
NOT be sent purely responsively. NOT be sent purely responsively.
TC_INTERVAL - is the maximum time between the transmission of two TC_INTERVAL - is the maximum time between the transmission of two
successive TC messages by this node. When no TC messages are sent successive TC messages by this node. When no TC messages are sent
in response to local network changes (by design, or because the in response to local network changes (by design, or because the
local network is not changing) then TC messages SHOULD be sent at local network is not changing) then TC messages SHOULD be sent at
a regular interval TC_INTERVAL, possibly modified by jitter as a regular interval TC_INTERVAL, possibly modified by jitter as
specified in [3]. specified in [RFC5148].
TC_MIN_INTERVAL - is the minimum interval between transmission of TC_MIN_INTERVAL - is the minimum interval between transmission of
two successive TC messages by this node. (This minimum interval two successive TC messages by this node. (This minimum interval
MAY be modified by jitter, as specified in [3].) MAY be modified by jitter, as specified in [RFC5148].)
The following constraints apply to these parameters: The following constraints apply to these parameters:
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 INTERVAL_TIME TLVs as defined in [2] are included in TC o If INTERVAL_TIME TLVs as defined in [timetlv] are included in TC
messages, then TC_INTERVAL MUST be representable as described in messages, then TC_INTERVAL MUST be representable as described in
[2]. [timetlv].
5.3. Advertised Information Validity Times 5.3. Advertised Information Validity Times
The following parameters manage the validity time of information The following parameters manage the validity time of information
advertised in TC messages: advertised in TC messages:
T_HOLD_TIME - is used to define the minimum value in the T_HOLD_TIME - is used to define the minimum value in the
VALIDITY_TIME TLV included in all TC messages sent by this node. VALIDITY_TIME TLV included in all TC messages sent by this node.
If a single value of parameter TC_HOP_LIMIT (see Section 5.6) is If a single value of parameter TC_HOP_LIMIT (see Section 5.6) is
used then this will be the only value in that TLV. used then this will be the only value in that TLV.
skipping to change at page 15, line 11 skipping to change at page 15, line 18
nodes. nodes.
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* 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 [2]. o T_HOLD_TIME MUST be representable as described in [timetlv].
5.4. Received Message Validity Times 5.4. Received Message Validity Times
The following parameters manage the validity time of recorded The following parameters manage the validity time of recorded
received message information: received message information:
RX_HOLD_TIME - is an interface parameter, and is the period after RX_HOLD_TIME - is an interface parameter, and is the period after
receipt of a message by the appropriate OLSRv2 interface of this receipt of a message by the appropriate OLSRv2 interface of this
node for which that information is recorded, in order that the node for which that information is recorded, in order that the
message is recognized as having been previously received on this message is recognized as having been previously received on this
skipping to change at page 16, line 7 skipping to change at page 16, line 9
o F_HOLD_TIME > 0 o F_HOLD_TIME > 0
o All of these parameters SHOULD be greater than the maximum o All 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.5. Jitter 5.5. Jitter
If jitter, as defined in [3], is used then these parameters are as If jitter, as defined in [RFC5148], is used then these parameters are
follows: as follows:
TP_MAXJITTER - represents the value of MAXJITTER used in [3] for TP_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
periodically generated TC messages sent by this node. for periodically generated TC messages sent by this node.
TT_MAXJITTER - represents the value of MAXJITTER used in [3] for TT_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
externally triggered TC messages sent by this node. for externally triggered TC messages sent by this node.
F_MAXJITTER - represents the default value of MAXJITTER used in [3] F_MAXJITTER - represents the default value of MAXJITTER used in
for messages forwarded by this node. However before using [RFC5148] for messages forwarded by this node. However before
F_MAXJITTER a node MAY attempt to deduce a more appropriate value using F_MAXJITTER a node MAY attempt to deduce a more appropriate
of MAXJITTER, for example based on any INTERVAL_TIME or value of MAXJITTER, for example based on any INTERVAL_TIME or
VALIDITY_TIME TLVs contained in the message to be forwarded. VALIDITY_TIME TLVs contained in the message to be forwarded.
For constraints on these parameters see [3]. For constraints on these parameters see [RFC5148].
5.6. Hop Limit Parameter 5.6. Hop Limit Parameter
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 node. However each other node SHOULD see a messages sent by the same node. However each other node, at any hop
regular pattern of TC messages, in order that meaningful values of count distance, SHOULD see a regular pattern of TC messages, in order
INTERVAL_TIME and VALIDITY_TIME TLVs at each hop count distance can that meaningful values of INTERVAL_TIME and VALIDITY_TIME TLVs at
be included as defined in [2]. Thus the pattern of TC_HOP_LIMIT each hop count distance can be included as defined in [timetlv].
SHOULD be defined to have this property. For example the repeating Thus the pattern of TC_HOP_LIMIT SHOULD be defined to have this
pattern (255 4 4) satisfies this property (having period TC_INTERVAL property. For example the repeating pattern (255 4 4) satisfies this
at hop counts up to 4, inclusive, and 3 x TC_INTERVAL at hop counts property (having period TC_INTERVAL at hop counts up to 4, inclusive,
greater than 4), but the repeating pattern (255 255 4 4) does not and 3 x TC_INTERVAL at hop counts greater than 4), but the repeating
satisfy this property. pattern (255 255 4 4) does not satisfy this property because at hop
counts greater than 4, message intervals are alternately TC_INTERVAL
and 3 x TC_INTERVAL.
The following constraints apply to this parameter: The following constraints apply to this parameter:
o The maximum value of TC_HOP_LIMIT >= the network diameter in hops, o The maximum value of TC_HOP_LIMIT >= the network diameter in hops,
a value of 255 is RECOMMENDED. a value of 255 is RECOMMENDED.
o All values of TC_HOP_LIMIT >= 2. o All values of TC_HOP_LIMIT >= 2.
5.7. Willingness 5.7. Willingness
skipping to change at page 17, line 9 skipping to change at page 17, line 18
WILL_NEVER to WILL_ALWAYS, inclusive, and represents its willingness WILL_NEVER to WILL_ALWAYS, inclusive, and represents its willingness
to be an MPR, and hence its willingness to forward messages and be an to be an MPR, and hence its willingness to forward messages and be an
intermediate node on routes. If a node has WILLINGNESS == WILL_NEVER intermediate node on routes. If a node has WILLINGNESS == WILL_NEVER
it does not perform these tasks. A MANET using OLSRv2 with too many it does not perform these tasks. A MANET using OLSRv2 with too many
nodes with WILLINGNESS == WILL_NEVER will not function; it MUST be nodes with WILLINGNESS == WILL_NEVER will not function; it MUST be
ensured, by administrative or other means, that this does not happen. ensured, by administrative or other means, that this does not happen.
Nodes MAY have different WILLINGNESS values; however the three Nodes MAY have different WILLINGNESS values; however the three
constants WILL_NEVER, WILL_DEFAULT and WILL_ALWAYS MUST have the constants WILL_NEVER, WILL_DEFAULT and WILL_ALWAYS MUST have the
values defined in Section 5.7. (Use of WILLINGNESS == WILL_DEFAULT values defined in Section 5.7. (Use of WILLINGNESS == WILL_DEFAULT
allows a node to avoid including a WILLINGNESS TLV in its TC allows a node to avoid including an MPR_WILLING TLV in its TC
messages, use of WILLINGNESS == WILL_ALWAYS means that a node will messages, use of WILLINGNESS == WILL_ALWAYS means that a node will
always be selected as an MPR by all symmetric 1-hop neighbors.) always be selected as an MPR by all symmetric 1-hop neighbors.)
The following constraints apply to this parameter: The following constraints apply to this parameter:
o WILLINGNESS &gt=; WILL_NEVER o WILLINGNESS >= WILL_NEVER
o WILLINGNESS &lt=; WILL_ALWAYS o WILLINGNESS <= WILL_ALWAYS
5.8. Parameter Change Constraints 5.8. Parameter Change Constraints
This section presents guidelines, applicable if protocol parameters This section presents guidelines, applicable if protocol parameters
are changed dynamically. are changed dynamically.
O_HOLD_TIME
* If O_HOLD_TIME for a node changes, then O_time for all
Originator Tuples MAY be changed.
TC_INTERVAL TC_INTERVAL
* If the TC_INTERVAL for a node increases, then the next TC * If the TC_INTERVAL for a node increases, then the next TC
message generated by this node MUST be generated according to message generated by this node 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 node decreases, then the following TC * If the TC_INTERVAL for a node decreases, then the following TC
messages from this node MUST be generated according to the messages from this node MUST be generated according to the
skipping to change at page 19, line 11 skipping to change at page 19, line 11
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. Information Bases 6. Information Bases
Each node maintains the Information Bases described in the following Each node maintains the Information Bases described in the following
sections. These are used for describing the protocol in this sections. These are used for describing the protocol in this
document. An implementation of this protocol MAY maintain this document. An implementation of this protocol MAY maintain this
information in the indicated form, or in any other organization which information in the indicated form, or in any other organization which
offers access to this information. Regardless of how information is offers access to this information. In particular note that it is not
organised, from the time at which a tuple is indicated to be expired, necessary to remove Tuples from Sets at the exact time indicated,
the information contained herein MUST be ignored in any further only to behave as if the Tuples were removed at that time.
processing.
The purpose of OLSRv2 is to determine the Routing Set, which may be The purpose of OLSRv2 is to determine the Routing Set, which may be
used to update IP's Routing Table, providing "next hop" routing used to update IP's Routing Table, providing "next hop" routing
information for IP datagrams. OLSRv2 maintains the following information for IP datagrams. OLSRv2 maintains the following
Information Bases: Information Bases:
Local Information Base - as defined in [4], extended by the addition Local Information Base - as defined in [nhdp], extended by the
of a Local Attached Network Set, defined in Section 6.1.2. addition of an Originator Set, defined in Section 6.1.1 and a
Local Attached Network Set, defined in Section 6.1.2.
Interface Information Bases - as defined in [4], one Interface Interface Information Bases - as defined in [nhdp], one Interface
Information Base for each OLSRv2 interface. Information Base for each OLSRv2 interface.
Node Information Base - as defined in [4], extended by the addition Node Information Base - as defined in [nhdp], extended by the
of three elements to each Neighbor Tuple, as defined in addition of three elements to each Neighbor Tuple, as defined in
Section 6.2. Section 6.2.
Topology Information Base - this information base is specific to Topology Information Base - this Information Base is specific to
OLSRv2, and is defined in Section 6.3. OLSRv2, and is defined in Section 6.3.
Processing and Forwarding Information Base - this information base Processing and Forwarding Information Base - this Information Base
is specific to OLSRv2, and is defined in Section 6.4. is specific to OLSRv2, and is defined in Section 6.4.
All addresses, other than originator addresses, recorded in the
Information Bases MUST all be recorded with prefix lengths, in order
to allow comparison with addresses received in HELLO and TC messages.
The ordering of sequence numbers, when considering which is the The ordering of sequence numbers, when considering which is the
greater, is as defined in Section 18. greater, is as defined in Section 18.
6.1. Local Information Base 6.1. Local Information Base
The Local Information Base as defined in [4] is extended by the The Local Information Base as defined in [nhdp] is extended by the
addition of an Originator Set, defined in Section 6.1.1, and a Local addition of an Originator Set, defined in Section 6.1.1, and a Local
Attached Network Set, defined in Section 6.1.2. Attached Network Set, defined in Section 6.1.2.
6.1.1. Originator Set 6.1.1. Originator Set
A node's Originator Set records addresses that were recently A node's Originator Set records addresses that were recently
originator addresses. If a node's originator address is immutable originator addresses. If a node's originator address is immutable
then this set is always empty and MAY be omitted. It consists of then this set is always empty and MAY be omitted. It consists of
Originator Tuples: Originator Tuples:
skipping to change at page 20, line 42 skipping to change at page 20, line 35
where: where:
AL_net_addr is the network address of an attached network which can AL_net_addr is the network address of an attached network which can
be reached via this node. be reached via this node.
AL_dist is the number of hops to the network with address AL_dist is the number of hops to the network with address
AL_net_addr from this node. AL_net_addr from this node.
Attached networks local to this node SHOULD be treated as local non- Attached networks local to this node SHOULD be treated as local non-
MANET interfaces, and added to the Local Interface Set, as specified MANET interfaces, and added to the Local Interface Set, as specified
in [4], rather than being added to the Local Attached Network Set. in [nhdp], rather than being added to the Local Attached Network Set.
An attached network MAY also be attached to other nodes. An attached network MAY also be attached to other nodes.
It is not the responsibility of OLSRv2 to maintain routes to networks It is not the responsibility of OLSRv2 to maintain routes from this
recorded in the Local Attached Network Set. node to networks recorded in the Local Attached Network Set.
6.2. Node Information Base 6.2. Node Information Base
Each Neighbor Tuple in the Neighbor Set has these additional Each Neighbor Tuple in the Neighbor Set, defined in [nhdp], has these
elements: additional elements:
N_willingness is the node's willingness to be selected as an MPR, in N_willingness is the node's willingness to be selected as an MPR, in
the range from WILL_NEVER to WILL_ALWAYS, both inclusive; the range from WILL_NEVER to WILL_ALWAYS, both inclusive;
N_mpr is a boolean flag, describing if this neighbor is selected as
N_mpr is a boolean flag, describing if the neighbor is selected as
an MPR by this node; an MPR by this node;
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 node as an MPR, i.e. is an MPR selector of this selected this node as an MPR, i.e. is an MPR selector of this
node. node.
6.3. Topology Information Base 6.3. Topology Information Base
The Topology Information Base stores information required for the The Topology Information Base stores information required for the
generation and processing of TC messages, and received in TC generation and processing of TC messages, and information received in
messages. The Advertised Neighbor Set contains interface addresses TC messages. The Advertised Neighbor Set contains interface
of symmetric 1-hop neighbors which are to be reported in TC messages. addresses of symmetric 1-hop neighbors which are to be reported in TC
The Advertising Remote Node Set, the Topology Set and the Attached messages. The Advertising Remote Node Set, the Topology Set and the
Network Set record information received in TC messages. Attached Network Set record information received in TC messages.
Additionally, a Routing Set is maintained, derived from the Additionally, a Routing Set is maintained, derived from the
information recorded in the Neighborhood Information Base, Topology information recorded in the Neighborhood Information Base, Topology
Set, Attached Network Set and Advertising Remote Node Set. Set, Attached Network Set and Advertising Remote Node Set.
6.3.1. Advertised Neighbor Set 6.3.1. Advertised Neighbor Set
A node's Advertised Neighbor Set contains interface addresses of A node's Advertised Neighbor Set contains interface addresses of
symmetric 1-hop neighbors which are to be advertised through TC symmetric 1-hop neighbors which are to be advertised through TC
messages: messages:
skipping to change at page 22, line 7 skipping to change at page 22, line 4
A node's Advertising Remote Node Set records information describing A node's Advertising Remote Node Set records information describing
each remote node in the network that transmits TC messages. It each remote node in the network that transmits TC messages. It
consists of Advertising Remote Node Tuples: consists of Advertising Remote Node Tuples:
(AR_orig_addr, AR_seq_number, AR_iface_addr_list, AR_time) (AR_orig_addr, AR_seq_number, AR_iface_addr_list, AR_time)
where: where:
AR_orig_addr is the originator address of a received TC message, AR_orig_addr is the originator address of a received TC message,
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 which AR_seq_number is the greatest ANSN in any TC message received which
originated from the node with originator address AR_orig_addr; originated from the node with originator address AR_orig_addr
(i.e. which contributed to the information contained in this
Tuple);
AR_iface_addr_list is the list of the interface addresses of the AR_iface_addr_list is an unordered list of the interface addresses
node with originator address AR_orig_addr; of the node with originator address AR_orig_addr;
AR_time is the time at which this Tuple expires and MUST be removed. AR_time is the time at which this Tuple expires and MUST be removed.
6.3.3. Topology Set 6.3.3. Topology Set
A node's Topology Set records topology information about the network. A node's Topology Set records topology information about the network.
It consists of Topology Tuples: It consists of Topology Tuples:
(T_dest_iface_addr, T_orig_addr, T_seq_number, T_time) (T_dest_iface_addr, T_orig_addr, T_seq_number, T_time)
skipping to change at page 22, line 34 skipping to change at page 22, line 32
T_dest_iface_addr is an interface address of a destination node, T_dest_iface_addr is an interface address of a destination node,
which may be reached in one hop from the node with originator which may be reached in one hop from the node with originator
address T_orig_addr; address T_orig_addr;
T_orig_addr is the originator address of a node which is the last T_orig_addr is the originator address of a node which is the last
hop on a path towards the node with interface address hop on a path towards the node with interface address
T_dest_iface_addr, note that this does not include a prefix T_dest_iface_addr, note that this does not include a prefix
length; length;
T_seq_number is the greatest received ANSN associated with the T_seq_number is the greatest ANSN in any TC message received which
information contained in this Tuple; originated from the node with originator address T_orig_addr (i.e.
which contributed to the information contained in this Tuple);
T_time specifies the time at which this Tuple expires and MUST be T_time specifies the time at which this Tuple expires and MUST be
removed. removed.
6.3.4. Attached Network Set 6.3.4. Attached Network Set
A node's Attached Network Set records information about networks A node's Attached Network Set records information about networks
attached to other nodes. It consists of Attached Network Tuples: attached to other nodes. It consists of Attached Network Tuples:
(AN_net_addr, AN_orig_addr, AN_dist, AN_seq_number, AN_time) (AN_net_addr, AN_orig_addr, AN_dist, AN_seq_number, AN_time)
skipping to change at page 23, line 11 skipping to change at page 23, line 11
AN_net_addr is the network address of an attached network, which may AN_net_addr is the network address of an attached network, which may
be reached via the node with originator address AN_orig_addr; be reached via the node with originator address AN_orig_addr;
AN_orig_addr is the originator address of a node which can act as AN_orig_addr is the originator address of a node which can act as
gateway to the network with address AN_net_addr, note that this gateway to the network with address AN_net_addr, note that this
does not include a prefix length; does not include a prefix length;
AN_dist is the number of hops to the network with address AN_dist is the number of hops to the network with address
AN_net_addr from the node with originator address AN_orig_addr; AN_net_addr from the node with originator address AN_orig_addr;
AN_seq_number is the greatest received ANSN associated with the AN_seq_number is the greatest ANSN in any TC message received which
information contained in this Tuple; originated from the node with originator address AN_orig_addr
(i.e. which contributed to the information contained in this
Tuple);
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.
6.3.5. Routing Set 6.3.5. Routing Set
A node's Routing Set records the selected path to each destination A node's Routing Set records the selected path to each destination
for which a route is known. It consists of Routing Tuples: for which a route is known. It consists of Routing Tuples:
(R_dest_addr, R_next_iface_addr, R_dist, R_local_iface_addr) (R_dest_addr, R_next_iface_addr, R_dist, R_local_iface_addr)
skipping to change at page 23, line 44 skipping to change at page 23, line 46
destination; destination;
R_local_iface_addr is the address of the local OLSRv2 interface over R_local_iface_addr is the address of the local OLSRv2 interface over
which a packet MUST be sent to reach the destination by the which a packet MUST be sent to reach the destination by the
selected path. selected path.
6.4. Processing and Forwarding Information Base 6.4. Processing and Forwarding Information Base
The Processing and Forwarding Information Base records information The Processing and Forwarding Information Base records information
required to ensure that a message is processed at most once and is required to ensure that a message is processed at most once and is
forwarded at most once per OLSRv2 interface of a node. forwarded at most once per OLSRv2 interface of a node, using MPR
flooding.
6.4.1. Received Set 6.4.1. Received Set
A node has a Received Set per local OLSRv2 interface. Each Received A node has a Received Set per local OLSRv2 interface. Each Received
Set records the signatures of messages which have been received over Set records the signatures of messages which have been received over
that OLSRv2 interface. Each consists of Received Tuples: that OLSRv2 interface. Each consists of Received Tuples:
(RX_type, RX_orig_addr, RX_seq_number, RX_time) (RX_type, RX_orig_addr, RX_seq_number, RX_time)
where: where:
skipping to change at page 26, line 7 skipping to change at page 26, line 7
records the OLSRv2 interface addresses of symmetric 1-hop neighbors, records the OLSRv2 interface addresses of symmetric 1-hop neighbors,
such that the node is to forward messages received from those such that the node is to forward messages received from those
neighbors' OLSRv2 interfaces, on that local OLSRv2 interface, if not neighbors' OLSRv2 interfaces, on that local OLSRv2 interface, if not
otherwise excluded from forwarding that message (e.g. by it having otherwise excluded from forwarding that message (e.g. by it having
been previously forwarded): been previously forwarded):
{RY_neighbor_iface_addr} {RY_neighbor_iface_addr}
7. Packet Processing and Message Forwarding 7. Packet Processing and Message Forwarding
On receiving a packet, as defined in [1], a node examines the packet On receiving a packet, as defined in [packetbb], a node examines the
header and each of the message headers. If the message type is known packet header and each of the message headers. If the message type
to the node, the message is processed locally according to the is known to the node, the message is processed locally according to
specifications for that message type. The message is also the specification for that message type. The message is also
independently evaluated for forwarding. independently evaluated for forwarding.
7.1. Actions when Receiving an OLSRv2 Packet 7.1. Actions when Receiving an OLSRv2 Packet
On receiving a packet, a node MUST perform the following tasks: On receiving a packet, a node MUST perform the following tasks:
1. The packet MAY be fully parsed on reception, or the packet and 1. The packet MAY be fully parsed on reception, or the packet and
its messages MAY be parsed only as required. (It is possible to its messages MAY be parsed only as required. (It is possible to
parse the packet header, or determine its absence, without parse the packet header, or determine its absence, without
parsing any messages. It is possible to divide the packet into parsing any messages. It is possible to divide the packet into
messages without even fully parsing their headers. It is messages without fully parsing the message headers. It is
possible to determine whether a message is to be forwarded, and possible to determine whether a message is to be forwarded, and
to forward it, without parsing its body. It is possible to to forward it, without parsing its body. It is possible to
determine whether a message is to be processed without parsing determine whether a message is to be processed without parsing
its body.) its body.)
2. If parsing fails at any point the relevant entity (packet or 2. If parsing fails at any point the relevant entity (packet or
message) MUST be silently discarded, other parts of the packet message) MUST be silently discarded, other parts of the packet
(up to the whole packet) MAY be silently discarded. (up to the whole packet) MAY be silently discarded.
3. Otherwise if the packet header is present and it contains a 3. Otherwise:
packet TLV block, then each TLV in it is processed according to
its type if recognized, otherwise the TLV is ignored.
4. Otherwise each message in the packet, if any, is treated 1. If the packet header is present and it contains a packet TLV
block, then each TLV in it is processed according to its type
if recognized, otherwise the TLV is ignored.
2. Otherwise each message in the packet, if any, is treated
according to Section 7.2. according to Section 7.2.
7.2. Actions when Receiving an OLSRv2 Message 7.2. Actions when Receiving an OLSRv2 Message
A node MUST perform the following tasks for each received message: A node MUST perform the following tasks for each received message:
1. If the message header cannot be correctly parsed according to the 1. If the message header cannot be correctly parsed according to the
specification in [1], or if the node recognizes from the specification in [packetbb], or if the node recognizes from the
originator address of the message that the message is one which originator address of the message that the message is one which
the receiving node itself originated (i.e. is the current the receiving node itself originated (i.e. is the current
originator address of the node, or is an O_orig_addr in an originator address of the node, 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 a HELLO message, then the message is 1. If the message is a HELLO message, then the message is
processed according to Section 10. processed according to Section 10.
2. Otherwise: 2. Otherwise:
1. If the message is of a known type, including being a TC 1. Define the "dependent message type" of the message to
equal the message type if the mistypedep bit of the
message semantics octet in the message header is set
('1'), or to equal 0 otherwise.
2. If the message is of a known type, including being a TC
message, then the message is considered for processing message, then the message is considered for processing
according to Section 7.3, AND; according to Section 7.3, AND;
2. If for the message: 3. If for the message:
- <hop-limit> is present and <hop-limit> > 1, AND; - <hop-limit> is present and <hop-limit> > 1, AND;
- <hop-count> is not present or <hop-count> < 255 - <hop-count> is not present or <hop-count> < 255
then the message is considered for forwarding according then the message is considered for forwarding according
to Section 7.4. to Section 7.4.
7.3. Message Considered for Processing 7.3. 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 a Processed Tuple exists with: 1. If a Processed Tuple exists with:
* P_type == the message type of the current message, or 0 if the * P_type == the dependent message type of the current message,
typedep bit in the message semantics octet in the message AND;
header of the current message is cleared ('0'), AND;
* P_orig_addr == the originator address of the current message, * P_orig_addr == the originator address of the current message,
AND; AND;
* P_seq_number == the message sequence number of the current * P_seq_number == the message sequence number of the current
message; message;
then the current message MUST NOT be processed. then the current message MUST NOT be processed.
2. Otherwise: 2. Otherwise:
1. Create a Processed Tuple with: 1. Create a Processed Tuple with:
+ P_type = the message type of the current message, or 0 if + P_type = the dependent message type of the current
the typedep bit in the message semantics octet in the message;
message header of the current message is cleared ('0');
+ 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 message; + P_seq_number = the sequence number of the current message;
+ P_time = current time + P_HOLD_TIME. + P_time = current time + P_HOLD_TIME.
2. Process the current message according to its type. 2. Process the current message according to its type.
7.4. Message Considered for Forwarding 7.4. Message Considered for Forwarding
If a message is considered for forwarding, and it is either of a If a message is considered for forwarding, and it is either of a
message type defined in this document (i.e. is a TC message) or of an message type defined in this document (i.e. is a TC message) or of an
unknown message type, then it MUST use the following algorithm. A unknown message type, then it MUST use the following algorithm. A
message of a message type not defined in this document MAY, in an message of a message type not defined in this document MAY, in an
skipping to change at page 28, line 24 skipping to change at page 28, line 29
extension to this protocol, specify the use of this, or another extension to this protocol, specify the use of this, or another
algorithm. (Such an other algorithm MAY use the Received Set for the algorithm. (Such an other algorithm MAY use the Received Set for the
receiving interface, it SHOULD use the Forwarded Set similarly to the receiving interface, it SHOULD use the Forwarded Set similarly to the
following algorithm.) following algorithm.)
If a message (the "current message") is considered for forwarding If a message (the "current message") is considered for forwarding
according to this algorithm, the following tasks MUST be performed: according to this algorithm, the following tasks MUST be performed:
1. If the sending interface address (the source address of the IP 1. If the sending interface address (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 of) an OLSRv2 interface address into account any address prefix) an OLSRv2 interface address in
in an L_neighbor_iface_addr_list of a Link Tuple, with L_status an L_neighbor_iface_addr_list of a Link Tuple, with L_status ==
== SYMMETRIC, in the Link Set for the OLSRv2 interface on which SYMMETRIC, in the Link Set for the OLSRv2 interface on which the
the current message was received (the "receiving interface") then current message was received (the "receiving interface") then the
the current message MUST be silently discarded. current message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. If a Received Tuple exists in the Received Set for the 1. If a Received Tuple exists in the Received Set for the
receiving interface, with: receiving interface, with:
+ RX_type == the message type of the current message, or 0 + RX_type == the dependent message type of the current
if the typedep bit in the message semantics octet in the message, AND;
message header of the current message is cleared ('0'),
AND;
+ RX_orig_addr == the originator address of the current + RX_orig_addr == the originator address of the current
message, AND; message, AND;
+ RX_seq_number == the sequence number of the current + RX_seq_number == the sequence number of the current
message; message;
then the current message MUST be silently discarded. then the current message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. Create a Received Tuple in the Received Set for the 1. Create a Received Tuple in the Received Set for the
receiving interface with: receiving interface with:
- RX_type = the message type of the current message, or - RX_type = the dependent message type of the current
0 if the typedep bit in the message semantics octet in message;
the message header of the current message is cleared
('0');
- RX_orig_addr = originator address of the current - RX_orig_addr = originator address of the current
message; message;
- RX_seq_number = sequence number of the current - RX_seq_number = sequence number of the current
message; message;
- RX_time = current time + RX_HOLD_TIME. - RX_time = current time + RX_HOLD_TIME.
2. If a Forwarded Tuple exists with: 2. If a Forwarded Tuple exists with:
- F_type == the message type of the current message, or - F_type == the dependent message type of the current
0 if the typedep bit in the message semantics octet in message, AND;
the message header of the current message is cleared
('0');
- F_orig_addr == the originator address of the current - F_orig_addr == the originator address of the current
message, AND; message, AND;
- F_seq_number == the sequence number of the current - F_seq_number == the sequence number of the current
message. message.
then the current message MUST be silently discarded. then the current message MUST be silently discarded.
3. Otherwise if the sending interface address matches 3. Otherwise if the sending interface address matches
(taking account of any address prefix of) an (taking account of any address prefix) an
RY_neighbor_iface_addr in the Relay Set for the receiving RY_neighbor_iface_addr in the Relay Set for the receiving
interface, then: interface, then:
1. Create a Forwarded Tuple with: 1. Create a Forwarded Tuple with:
o F_type = the message type of the current message, o F_type = the dependent message type of the current
or 0 if the typedep bit in the message semantics message;
octet in the message header of the current message
is cleared ('0');
o F_orig_addr = originator address of the current o F_orig_addr = originator address of the current
message; message;
o F_seq_number = sequence number of the current o F_seq_number = sequence number of the current
message; message;
o F_time = current time + F_HOLD_TIME. o F_time = current time + F_HOLD_TIME.
2. The message header of the current message is modified 2. The message header of the current message is modified
skipping to change at page 30, line 17 skipping to change at page 30, line 17
o decrement <hop-limit> in the message header by 1; o decrement <hop-limit> in the message header by 1;
o increment <hop-count> in the message header by 1. o increment <hop-count> in the message header by 1.
3. For each OLSRv2 interface of the node, include the 3. For each OLSRv2 interface of the node, include the
message in a packet to be transmitted on that OLSRv2 message in a packet to be transmitted on that OLSRv2
interface, as described in Section 8. This packet interface, as described in Section 8. This packet
may contain other forwarded messages and/or messages may contain other forwarded messages and/or messages
generated by this node. Forwarded messages may be generated by this node. Forwarded messages may be
jittered as described in [3]. The value of MAXJITTER jittered as described in [RFC5148]. The value of
used in jittering a forwarded message MAY be based on MAXJITTER used in jittering a forwarded message MAY
information in that message (in particular any be based on information in that message (in
INTERVAL_TIME or VALIDITY_TIME TLVs in that message) particular any INTERVAL_TIME or VALIDITY_TIME TLVs in
or otherwise SHOULD be with maximum delay of that message) or otherwise SHOULD be with a maximum
F_MAXJITTER. A node MAY reduce the jitter applied to delay of F_MAXJITTER. A node MAY modify the jitter
a message in order to more efficiently combine applied to a message in order to more efficiently
messages in packets. combine messages in packets, as long as the maximum
jitter is not exceeded.
8. Packets and Messages 8. Packets and Messages
Nodes using OLSRv2 exchange information through messages. One or Nodes using OLSRv2 exchange information through messages. One or
more messages sent by a node at the same time SHOULD be combined into more messages sent by a node at the same time SHOULD be combined into
a single packet. These messages may have originated at the sending a single packet. These messages may have originated at the sending
node, or have originated at another node and are forwarded by the node, or have originated at another node and are forwarded by the
sending node. Messages with different originating nodes MAY be sending node. Messages with different originating nodes MAY be
combined in the same packet. Messages from other protocols defined combined in the same packet. Messages from other protocols defined
using [1] MAY be combined in the same packet. using [packetbb] MAY be combined in the same packet.
The packet and message format used by OLSRv2 is defined in [1], The packet and message format used by OLSRv2 is defined in
where: [packetbb], where:
o OLSRv2 packets MAY include packet TLVs, however OLSRv2 itself does o OLSRv2 packets MAY include packet TLVs, however OLSRv2 itself does
not specify any packet TLVs. not specify any packet TLVs.
o All references in this specification to TLVs that do not indicate o All references in this specification to TLVs that do not indicate
a type extension, assume Type Extension == 0. TLVs in processed a type extension, assume Type Extension == 0. TLVs in processed
messages with a non-zero type extension, or with a type extension messages with a type extension which is neither zero as so
which is not specifically indicated, as appropriate, are ignored. assumed, nor a specifically indicated non-zero type extension, are
ignored.
Other options defined in [1] may be freely used, in particular any Other options defined in [packetbb] may be freely used, in particular
other values of <pkt-semantics>, <msg-semantics>, <addr-semantics> or any other values of <pkt-semantics>, <msg-semantics>, <addr-
<tlv-semantics> consistent with their specifications. semantics> or <tlv-semantics> consistent with their specifications.
The remainder of this section defines, within the framework of [1], The remainder of this section defines, within the framework of
message types and TLVs specific to OLSRv2. [packetbb], message types and TLVs specific to OLSRv2.
8.1. HELLO Messages 8.1. HELLO Messages
A HELLO message in OLSRv2 is generated as specified in [4]. A HELLO message in OLSRv2 is generated as specified in [nhdp].
Additionally, an OLSRv2 node: Additionally, an OLSRv2 node:
o MUST include TLV(s) with Type == MPR associated with all OLSRv2 o MUST include TLV(s) with Type == MPR associated with all OLSRv2
interface addresses included in the HELLO message with a TLV with interface addresses that:
Type == LINK_STATUS and Value == SYMMETRIC if that address is also
included in Neighbor Tuple with N_mpr == true. (If there is more * are included in the HELLO message associated with a TLV with
than one copy of such an address in the HELLO message, then this Type == LINK_STATUS and Value == SYMMETRIC; AND
applies to the specific copy of the address with which the
LINK_STATUS TLV is associated.) * are included in a Neighbor Tuple with N_mpr == true.
If there is more than one copy of such an address in the HELLO
message, then this applies to the specific copy of the address
with which the LINK_STATUS TLV is associated.
o MUST NOT include any TLVs with Type == MPR associated with any o MUST NOT include any TLVs with Type == MPR associated with any
other addresses. other addresses.
o MAY include a message TLV with Type == WILLINGNESS, indicating the o MAY include a message TLV with Type == MPR_WILLING, indicating the
node's willingness to be selected as an MPR. node's willingness to be selected as an MPR.
8.1.1. HELLO Message TLVs 8.1.1. HELLO Message TLVs
In a HELLO message, a node MAY include a WILLINGNESS message TLV as In a HELLO message, a node MUST include an MPR_WILLING message TLV as
specified in Table 1. A node MUST NOT include more than one specified in Table 1, unless WILLINGNESS == WILL_DEFAULT (in which
WILLINGNESS message TLV. case it MAY be included). A node MUST NOT include more than one
MPR_WILLING message TLV.
+-------------+--------+--------------------------------------------+ +-------------+--------+--------------------------------------------+
| Name | Value | Value | | Type | Value | Value |
| | Length | | | | Length | |
+-------------+--------+--------------------------------------------+ +-------------+--------+--------------------------------------------+
| WILLINGNESS | 8 bits | The node's willingness to be selected as | | MPR_WILLING | 8 bits | Node parameter WILLINGNESS; unused bits |
| | | MPR; unused bits (based on the maximum | | | | (based on the maximum willingness value |
| | | willingness value WILL_ALWAYS) are | | | | WILL_ALWAYS) are RESERVED and SHOULD be |
| | | RESERVED and SHOULD be set to zero. | | | | set to zero. |
+-------------+--------+--------------------------------------------+ +-------------+--------+--------------------------------------------+
Table 1 Table 1
A node's willingness to be selected as MPR ranges from WILL_NEVER If a node does not advertise an MPR_WILLING TLV in a HELLO message,
(indicating that a node MUST NOT be selected as MPR by any node) to then the node MUST be assumed to have WILLINGNESS equal to
WILL_ALWAYS (indicating that a node MUST always be selected as MPR). WILL_DEFAULT.
If a node does not advertise a Willingness TLV in HELLO messages,
then the node MUST be assumed to have a willingness of WILL_DEFAULT.
8.1.2. HELLO Message Address Block TLVs 8.1.2. HELLO Message Address Block TLVs
In a HELLO message, a node MAY include MPR address block TLV(s) as In a HELLO message, a node MAY include MPR address block TLV(s) as
specified in Table 2. specified in Table 2.
+------+--------------+-------+ +------+--------------+-------+
| Name | Value Length | Value | | Type | Value Length | Value |
+------+--------------+-------+ +------+--------------+-------+
| MPR | 0 bits | None. | | MPR | 0 bits | None. |
+------+--------------+-------+ +------+--------------+-------+
Table 2 Table 2
8.2. TC Messages 8.2. TC Messages
A TC message MUST contain: A TC message MUST contain:
o <msg-orig-addr>, <msg-seq-num> and <msg-hop-limit> elements in its o <msg-orig-addr>, <msg-seq-num> and <msg-hop-limit> elements in its
message header, as specified in [1]. message header, as specified in [packetbb].
o A <msg-hop-count> element in its message header if the message o A <msg-hop-count> element in its message header if the message
contsins either a VALIDITY_TIME or an INTERVAL_TIME TLV indicating contains either a VALIDITY_TIME or an INTERVAL_TIME TLV indicating
more than one time value according to distance. more than one time value according to distance.
o A single message TLV with Type == CONT_SEQ_NUM, and Type Extension o A single message TLV with Type == CONT_SEQ_NUM, and Type Extension
== COMPLETE or Type Extension == INCOMPLETE, as specified in == COMPLETE or Type Extension == INCOMPLETE, as specified in
Section 8.2.1. Section 8.2.1 (for complete and incomplete TC messages,
respectively).
o A message TLV with Type == VALIDITY_TIME, as specified in [2]. o A message TLV with Type == VALIDITY_TIME, as specified in
The options included in [2] for representing zero and infinite [timetlv]. The options included in [timetlv] for representing
times MUST NOT be used. zero and infinite times MUST NOT be used.
o All of the node's interface addresses. These MUST be included in o All of the node's interface addresses. These MUST be included in
the message's address blocks, unless: the message's address blocks, unless:
* the node has a single interface, with a single interface * the node has a single interface, with a single interface
address with maximum prefix length, and address with maximum prefix length, and
* that address is the node's originator address. * that address is the node's originator address.
In this exceptional case, the address will be included as the In this exceptional case, the address will be included as the
message's originator address. message's originator address, and MAY be omitted from the
message's address blocks.
o TLV(s) with Type == LOCAL_IF and Value == UNSPEC_IF associated o TLV(s) with Type == LOCAL_IF and Value == UNSPEC_IF associated
with all of the node's interface addresses. with all of the node's interface addresses.
o A complete TC message MUST include all addresses in the Advertised o If the TC message is complete, all addresses in the Advertised
Address Set and selected addresses in the Local Attached Network Address Set and all addresses in the Local Attached Network Set,
Set, the latter (only) with associated GATEWAY address block the latter (only) with associated GATEWAY address block TLV(s), as
TLV(s), as specified in Section 8.2.2. specified in Section 8.2.2.
A TC message SHOULD have the mistypedep bit of <msg-semantics>, as A TC message SHOULD have the mistypedep bit of <msg-semantics>, as
defined in [1] cleared ('0'). defined in [packetbb], cleared ('0').
A TC message MAY contain: A TC message MAY contain:
o A message TLV with Type == INTERVAL_TIME, as specified in [2]. o If the TC message is incomplete, any addresses in the Advertised
The options included in [2] for representing zero and infinite Address Set and any addresses in the Local Attached Network Set,
times MUST NOT be used. the latter (only) with associated GATEWAY address block TLV(s), as
specified in Section 8.2.2.
o A message TLV with Type == INTERVAL_TIME, as specified in
[timetlv]. The options included in [timetlv] for representing
zero and infinite times MUST NOT be used.
8.2.1. TC Message TLVs 8.2.1. TC Message TLVs
In a TC message, a node MUST include a single CONT_SEQ_NUM message In a TC message, a node MUST include a single CONT_SEQ_NUM message
TLV, as specified in Table 3, and with Type Extension == COMPLETE or TLV, as specified in Table 3, and with Type Extension == COMPLETE or
Type Extension == INCOMPLETE. Type Extension == INCOMPLETE, according to whether the TC message is
complete or incomplete.
+--------------+------------+---------------------------------------+ +--------------+------------+---------------------------------------+
| Name | Value | Value | | Type | Value | Value |
| | Length | | | | Length | |
+--------------+------------+---------------------------------------+ +--------------+------------+---------------------------------------+
| CONT_SEQ_NUM | 8 bits | The ANSN contained in the Advertised | | CONT_SEQ_NUM | 8 bits | The ANSN contained in the Advertised |
| | | Neighbor Set. | | | | Neighbor Set. |
+--------------+------------+---------------------------------------+ +--------------+------------+---------------------------------------+
Table 3 Table 3
8.2.2. TC Message Address Block TLVs 8.2.2. TC Message Address Block TLVs
In a TC message, a node MAY include GATEWAY address block TLV(s) as In a TC message, a node MAY include GATEWAY address block TLV(s) as
specified in Table 4. specified in Table 4.
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
| Name | Value Length | Value | | Type | Value Length | Value |
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
| GATEWAY | 8 bits | Number of hops to attached network. | | GATEWAY | 8 bits | Number of hops to attached network. |
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
Table 4 Table 4
GATEWAY address block TLV(s) MUST be associated with all attached
network addresses, and MUST NOT be associated with any other
addresses.
9. HELLO Message Generation 9. HELLO Message Generation
An OLSRv2 HELLO message is composed as defined in [4], with the An OLSRv2 HELLO message is composed and generated as defined in
following additions: [nhdp], with the following additions:
o A message TLV with Type == WILLINGNESS and Value == the node's o A message TLV with Type == MPR_WILLING and Value == the node
willingness to act as an MPR, MAY be included. parameter WILLINGNESS MUST be included, unless WILLINGNESS ==
WILL_DEFAULT (in which case it MAY be included).
o For each address which is included in the message with an o For each address which is included in the message with an
associated TLV with Type == LINK_STATUS and Value == SYMMETRIC, associated TLV with Type == LINK_STATUS and Value == SYMMETRIC,
and is of an MPR (i.e. the address is in the and is of an MPR (i.e. the address is in the
N_neighbor_iface_addr_list of a Neighbor Tuple with N_mpr == N_neighbor_iface_addr_list of a Neighbor Tuple with N_mpr ==
true), an address block TLV with Type == MPR MUST be included; true), an address block TLV with Type == MPR MUST be included.
this TLV MUST be associated with the same copy of the address as This TLV MUST be associated with the same copy of the address as
is the TLV with Type == LINK_STATUS. is the TLV with Type == LINK_STATUS.
o For each address which is included in the message and is not o For each address which is included in the message and is not
associated with a TLV with Type == LINK_STATUS and Value == associated with a TLV with Type == LINK_STATUS and Value ==
SYMMETRIC, or is not of an MPR (i.e. the address is not in the SYMMETRIC, or is not of an MPR (i.e. the address is not in the
N_neighbor_iface_addr_list of a Neighbor Tuple with N_mpr == N_neighbor_iface_addr_list of a Neighbor Tuple with N_mpr ==
true), an address block TLV with Type == MPR MUST NOT be true), an address block TLV with Type == MPR MUST NOT be
associated with this address. associated with any copy of this address.
o An additional HELLO message MAY be sent when the node's set of
MPRs changes, in addition to the cases specified in [nhdp], and
subject to the same constraints.
9.1. HELLO Message: Transmission 9.1. HELLO Message: Transmission
HELLO messages are included in packets as specified in [1]. These HELLO messages are included in packets as specified in [packetbb].
packets may contain other messages, including TC messages. These packets may contain other messages, including TC messages.
10. HELLO Message Processing 10. HELLO Message Processing
Subsequent to the processing of HELLO messages, as specified in [4], Subsequent to the processing of HELLO messages, as specified in
the node MUST identify the Neighbor Tuple which was created or [nhdp], the node MUST identify the Neighbor Tuple which was created
updated by the processing specified in [4] (the "current Neighbor or updated by the processing specified in [nhdp] (the "current
Tuple") and update N_willingness as described in Section 10.1 and Neighbor Tuple") and update N_willingness as described in
N_mpr_selector as described in Section 10.2. Section 10.1 and N_mpr_selector as described in Section 10.2.
Following these, the node MUST also perform the processing defined in
Section 10.3.
10.1. Updating Willingness 10.1. Updating Willingness
N_willingness in the current Neighbor Tuple is updated as follows: N_willingness in the current Neighbor Tuple is 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 ==
WILLINGNESS then N_willingness is set to the value of that TLV; MPR_WILLING then N_willingness is set to the value of that TLV;
2. otherwise, N_willingness is set to WILL_DEFAULT. 2. Otherwise, N_willingness is set to WILL_DEFAULT.
10.2. Updating MPR Selectors 10.2. Updating MPR Selectors
N_mpr_selector is updated as follows: N_mpr_selector is updated as follows:
1. If a node finds one of its local OLSRv2 interface addresses with 1. If a node finds any of its local OLSRv2 interface addresses with
an associated TLV with Type == MPR in the HELLO message an associated TLV with Type == MPR in the HELLO message
(indicating that the originator node has selected the receiving (indicating that the originator node has selected the receiving
node as an MPR), then N_mpr_selector in the current Neighbor node as an MPR), then N_mpr_selector in the current Neighbor
Tuple is set true. Tuple is set true.
2. Otherwise, if a node finds one of its own interface addresses 2. Otherwise, if a node finds any of its own interface addresses
with an associated TLV with Type == LINK_STATUS and Value == with an associated TLV with Type == LINK_STATUS and Value ==
SYMMETRIC in the HELLO message, then N_mpr_selector in the SYMMETRIC in the HELLO message, then N_mpr_selector in the
current Neighbor Tuple is set false. current Neighbor Tuple is set false.
10.3. Symmetric 1-Hop and 2-Hop Neighborhood Changes 10.3. Symmetric 1-Hop and 2-Hop Neighborhood Changes
A node MUST also perform the following: A node MUST also perform the following:
1. If N_symmetric of a Neighbor Tuple changes from true to false, 1. If N_symmetric of a Neighbor Tuple changes from true to false,
then N_mpr_selector of that Neighbor Tuple MUST be set false. then N_mpr_selector of that Neighbor Tuple MUST be set false.
skipping to change at page 37, line 27 skipping to change at page 37, line 30
and N_mpr == false changes to WILL_ALWAYS from any other and N_mpr == false changes to WILL_ALWAYS from any other
value. value.
3. Otherwise the set of MPRs of a node MAY be recalculated if the 3. Otherwise the set of MPRs of a node MAY be recalculated if the
N_willingness of a Neighbor Tuple with N_symmetric == true N_willingness of a Neighbor Tuple with N_symmetric == true
changes in any other way; it SHOULD be recalculated if N_mpr == changes in any other way; it SHOULD be recalculated if N_mpr ==
false and this is an increase in N_willingness or if N_mpr == false and this is an increase in N_willingness or if N_mpr ==
true and this is a decrease in N_willingness. true and this is a decrease in N_willingness.
If the set of MPRs of a node is recalculated, this MUST be as If the set of MPRs of a node is recalculated, this MUST be as
described in Section 14. Before that calculation the N_mpr of all described in Section 14. Before that calculation, the N_mpr of all
Neighbor Tuples are set false, after that calculation the N_mpr of Neighbor Tuples are set false. After that calculation the N_mpr of
all Neighbor Tuples representing symmetric 1-hop neighbors which are all Neighbor Tuples representing symmetric 1-hop neighbors which are
chosen as MPRs, are set true. chosen as MPRs, are set true.
A node MAY recognize the previous set of MPRs in the calculation of a
new set of MPRs in order to minimise unnecessary changes to this set.
An additional HELLO message MAY be sent when the node's set of MPRs
changes, in addition to the cases specified in [4], and subject to
the same constraints.
11. TC Message Generation 11. TC Message Generation
A node with one or more OLSRv2 interfaces, and with a non-empty A node with one or more OLSRv2 interfaces, and with a non-empty
Advertised Neighbor Set or a non-empty Local Attached Network Set Advertised Neighbor Set or a non-empty Local Attached Network Set
MUST generate TC messages. A node with an empty Advertised Neighbor MUST generate TC messages. A node with an empty Advertised Neighbor
Set and and empty Local Attached Network Set SHOULD also generate Set and empty Local Attached Network Set SHOULD also generate "empty"
"empty" TC messages for a period A_HOLD_TIME after it last generated TC messages for a period A_HOLD_TIME after it last generated a non-
a non-empty TC message. TC messages (non-empty and empty) are empty TC message. TC messages (non-empty and empty) are generated
generated according to the following: according to the following:
1. The message hop count, if included, MUST be set to zero. 1. The message hop count, if included, MUST be set to zero.
2. The message hop limit MUST be set to a value greater than 1. A 2. The message hop limit MUST be set to a value greater than 1. A
node MAY: node MAY use the same hop limit TC_HOP_LIMIT in all TC messages,
or use different values of the hop limit TC_HOP_LIMIT in TC
* use the same hop limit TC_HOP_LIMIT in all TC messages, this messages, see Section 5.6.
MUST be at least equal to the network diameter in hops; OR
* use different values of the hop limit TC_HOP_LIMIT in TC
messages, this MUST regularly include messages with hop limit
as defined above, other, lower, hop limits SHOULD use a
regular pattern with a regular message interval at any given
number of hops distance.
3. The message MUST contain a message TLV with Type == CONT_SEQ_NUM 3. The message MUST contain a message TLV with Type == CONT_SEQ_NUM
and Value == ANSN from the Advertised Neighbor Set. If the TC and Value == ANSN from the Advertised Neighbor Set. If the TC
message is complete then this message TLV MUST have Type message is complete then this message TLV MUST have Type
Extension == COMPLETE, otherwise it MUST have Type Extension == Extension == COMPLETE, otherwise it MUST have Type Extension ==
INCOMPLETE. INCOMPLETE.
4. The message MUST contain a message TLV with Type == 4. The message MUST contain a message TLV with Type ==
VALIDITY_TIME, as specified in [2]. If all TC messages are sent VALIDITY_TIME, as specified in [timetlv]. If all TC messages are
with the same hop limit then this TLV MUST have Value == sent with the same hop limit then this TLV MUST have Value ==
T_HOLD_TIME. If TC messages are sent with different hop limits T_HOLD_TIME. If TC messages are sent with different hop limits
(more than one value of TC_HOP_LIMIT) then this TLV MUST specify (more than one value of TC_HOP_LIMIT) then this TLV MUST specify
times which vary with the number of hops distance appropriate to times which vary with the number of hops distance appropriate to
the chosen pattern of TC message hop limits, as specified in [2], the chosen pattern of TC message hop limits, as specified in
these times SHOULD be appropriate multiples of T_HOLD_TIME. [timetlv], these times SHOULD be appropriate multiples of
T_HOLD_TIME.
5. The message MAY contain a message TLV with Type == INTERVAL_TIME, 5. The message MAY contain a message TLV with Type == INTERVAL_TIME,
as specified in [2]. If all TC messages are sent with the same as specified in [timetlv]. If all TC messages are sent with the
hop limit then this TLV MUST have Value == TC_INTERVAL. If TC same hop limit then this TLV MUST have Value == TC_INTERVAL. If
messages are sent with different hop limits, then this TLV MUST TC messages are sent with different hop limits, then this TLV
specify times which vary with the number of hops distance MUST specify times which 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 [2], these times SHOULD be appropriate multiples of specified in [timetlv], these times SHOULD be appropriate
TC_INTERVAL. multiples of TC_INTERVAL.
6. Unless the node has a single interface, with a single interface 6. Unless the node has a single interface, with a single interface
address with maximum prefix length, and that address is the address with maximum prefix length, and that address is the
node's originator address, the message MUST contain all of the node's originator address, the message MUST contain all of the
node's interface addresses (i.e. all addresses in an node's interface addresses (i.e. all addresses in an
I_local_iface_addr_list) in its address blocks. I_local_iface_addr_list) in its address blocks.
7. All addresses of the node's interfaces included in an address 7. All addresses of the node's interfaces that are included in an
block MUST be associated with a TLV with Type == LOCAL_IF and address block MUST be associated with a TLV with Type == LOCAL_IF
Value == UNSPEC_IF. and Value == UNSPEC_IF.
8. The message MUST include in its address blocks: 8. A complete message MUST include, and an incomplete message MAY
include, in its address blocks:
1. A_neighbor_iface_addr from each Advertised Neighbor Tuple; 1. Each A_neighbor_iface_addr from the Advertised Neighbor Set;
2. AL_net_addr from each Local Attached Neighbor Tuple, each 2. AL_net_addr from each Local Attached Neighbor Tuple, each
associated with a TLV with Type == GATEWAY and Value == associated with a TLV with Type == GATEWAY and Value ==
AL_dist. AL_dist.
11.1. TC Message: Transmission 11.1. TC Message: Transmission
Complete TC messages are generated and transmitted periodically on Complete TC messages are generated and transmitted periodically on
all OLSRv2 interfaces, with a default interval between two all OLSRv2 interfaces, with a default interval between two
consecutive TC transmissions by the same node of TC_INTERVAL. consecutive TC transmissions by the same node of TC_INTERVAL.
TC messages MAY be generated in response to a change of contents, TC messages MAY be generated in response to a change of contents,
indicated by a change in ANSN. In this case a node MAY send a indicated by a change in ANSN. In this case a node MAY send a
complete TC message, and if so MAY re-start its TC message schedule. complete TC message, and if so MAY re-start its TC message schedule.
Alternatively a node MAY send an incomplete TC message with only new Alternatively a node MAY send an incomplete TC message with at least
content in its address blocks. Note that a node cannot report the new content in its address blocks. Note that a node cannot
removal of advertised content using an incomplete TC message. report removal of advertised content using an incomplete TC message.
When sending a TC message in response to a change of contents, a node When sending a TC message in response to a change of contents, a node
must respect a minimum interval of TC_MIN_INTERVAL between generated must respect a minimum interval of TC_MIN_INTERVAL between generated
TC messages. Sending an incomplete TC message MUST NOT cause the TC messages. Sending an incomplete TC message MUST NOT cause the
interval between complete TC messages to be increased, and thus a interval between complete TC messages to be increased, and thus a
node MUST NOT send an incomplete TC message if within TC_MIN_INTERVAL node MUST NOT send an incomplete TC message if within TC_MIN_INTERVAL
of the next scheduled complete TC message. of the next scheduled complete TC 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 [3]. The values change of contents MAY be jittered as described in [RFC5148]. The
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 triggered TC message generation. o TT_MAXJITTER for responsive TC message generation.
TC messages are included in packets as specified in [1]. These TC messages are included in packets as specified in [packetbb].
packets MAY contain other messages, including HELLO messages and TC These packets MAY contain other messages, including HELLO messages
messages with different originator addresses. TC messages are and TC messages with different originator addresses. TC messages are
forwarded according to the specification in Section 7.4. forwarded according to the specification in Section 7.4.
12. TC Message Processing 12. TC Message Processing
When according to Section 7.3 a TC message is to be processed When, according to Section 7.3, a TC message is to be "processed
according to its type, this means that: according to its type", this means that:
o If any address associated with a TLV with Type == LOCAL_IF is one o If any address associated with a TLV with Type == LOCAL_IF is one
of the receiving node's current or recently used interface of the receiving node's current or recently used interface
addresses (i.e. is in any I_local_iface_addr_list in the Local addresses (i.e. is in any I_local_iface_addr_list in the Local
Interface Set or is equal to any IR_local_iface_addr in the Interface Set or is equal to any IR_local_iface_addr in the
Removed Interface Address Set), then the TC message MUST be Removed Interface Address Set), then the TC message MUST be
discarded. discarded.
o If the TC message does not contain exactly one message TLV with o If the TC message does not contain exactly one message TLV with
Type == CONT_SEQ_NUM and Type Extension == COMPLETE or Type Type == CONT_SEQ_NUM and Type Extension == COMPLETE or Type
skipping to change at page 41, line 37 skipping to change at page 40, line 37
to Section 12.1 is carried out. to Section 12.1 is carried out.
12.1. Initial TC Message Processing 12.1. Initial TC Message Processing
For the purposes of this section: For the purposes of this section:
o "originator address" refers to the originator address in the TC o "originator address" refers to the originator address in the TC
message header. message header.
o "validity time" is calculated from the VALIDITY_TIME message TLV o "validity time" is calculated from the VALIDITY_TIME message TLV
in the TC message according to the specification in [2]. All in the TC message according to the specification in [timetlv].
information in the TC message has the same validity time. All information in the TC message has the same validity time.
o "ANSN" is defined as being the value of the message TLV with Type o "ANSN" is defined as being the value of the message TLV with Type
== CONT_SEQ_NUM. == CONT_SEQ_NUM.
o "sending address list" refers to the list of addresses in all o "sending address list" refers to the list of addresses in all
address blocks which have associated TLV with Type == LOCAL_IF and address blocks which have associated TLV(s) with Type == LOCAL_IF
Value == UNSPEC_IF. If the sending address list is otherwise and Value == UNSPEC_IF. If the sending address list is otherwise
empty, then the message's originator address is added to the empty, then the message's originator address is added to the
sending address list, with maximum prefix length. sending address list, with maximum prefix length.
o Comparisons of sequence numbers are carried out as specified in o Comparisons of sequence numbers are carried out as specified in
Section 18. Section 18.
The TC message is processed as follows: The TC message is processed as follows:
1. The Advertising Remote Node Set is updated according to 1. The Advertising Remote Node Set is updated according to
Section 12.1.1; if the TC message is indicated as discarded in Section 12.1.1; if the TC message is indicated as discarded in
skipping to change at page 44, line 30 skipping to change at page 43, line 30
The TC message is processed as follows: The TC message is processed as follows:
1. The Topology Set is updated according to Section 12.2.1. 1. The Topology Set is updated according to Section 12.2.1.
2. The Attached Network Set is updated according to Section 12.2.2. 2. The Attached Network Set is updated according to Section 12.2.2.
12.2.1. Purging the Topology Set 12.2.1. Purging the Topology Set
The Topology Set MUST be updated as follows: The Topology Set MUST be updated as follows:
Any Topology Tuples with: 1. Any Topology Tuples with:
o T_orig_addr == originator address; AND * T_orig_addr == originator address; AND
o T_seq_number < ANSN * T_seq_number < ANSN
MUST be removed. MUST be removed.
12.2.2. Purging the Attached Network Set 12.2.2. 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 == originator address; AND * AN_orig_addr == originator address; AND
* AN_seq_number < ANSN * AN_seq_number < ANSN
MUST be removed. MUST be removed.
13. Information Base Changes 13. Information Base Changes
The Originator Set in the Local Information Base MUST be updated when 1. The Originator Set in the Local Information Base MUST be updated
the node changes originator address. If there is no Originator Tuple when the node changes originator address. If there is no
with: Originator Tuple with:
o 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 O_orig_addr = old originator address * O_orig_addr = old originator address
This Originator Tuple (existing or new) is then modified as follows: This Originator Tuple (existing or new) is then modified as
follows:
o O_time = current time + O_HOLD_TIME * O_time = current time + O_HOLD_TIME
The Topology Information Base MUST be changed when an Advertising 2. The Topology Information Base MUST be changed when an Advertising
Remote Node Tuple expires (AR_time is reached). The following Remote Node Tuple expires (AR_time is reached). The following
changes are required before the Advertising Remote Node Tuple is changes are required before the Advertising Remote Node Tuple is
removed: removed:
1. All Topology Tuples with: 1. All Topology Tuples with:
* T_orig_addr == AR_orig_addr of the Advertising Remote Node + T_orig_addr == AR_orig_addr of the Advertising Remote Node
Tuple Tuple
are removed. are removed.
2. All Attached Network Tuples with: 2. All Attached Network Tuples with:
* AN_orig_addr == AR_orig_addr of the Advertising Remote Node + AN_orig_addr == AR_orig_addr of the Advertising Remote
Tuple Node Tuple
are removed. are removed.
14. Selecting MPRs 14. Selecting MPRs
Each node MUST select, from among its symmetric 1-hop neighbors, a Each node MUST select, from among its willing symmetric 1-hop
subset of nodes as MPRs. MPRs are used to flood control messages neighbors, a subset of nodes as MPRs. MPRs are used to flood control
from a node into the network, while reducing the number of messages from a node into the network, while reducing the number of
retransmissions that will occur in a region. Thus, the concept of retransmissions that will occur in a region. Thus, the concept of
MPR flooding is an optimization of a classical flooding mechanism. MPR flooding is an optimization of a classical flooding mechanism.
MPRs MAY also be used to reduce the shared topology information in MPRs MAY also be used to reduce the shared topology information in
the network. Consequently, while it is not essential that the set of the network. Consequently, while it is not essential that the set of
MPRs is minimal, keeping the number of MPRs small ensures that the MPRs is minimal, keeping the number of MPRs small ensures that the
overhead of OLSRv2 is kept at a minimum. overhead of OLSRv2 is kept at a minimum.
A node MUST select MPRs for each of its OLSRv2 interfaces, but then A node MUST select MPRs for each of its OLSRv2 interfaces, but then
forms the union of those sets as its single set of MPRs. This union forms the union of those sets as its single set of MPRs. This union
MUST include all symmetric 1-hop neighbors with willingness MUST include all symmetric 1-hop neighbors with willingness
WILL_ALWAYS. Only this overall set of MPRs is relevant and recorded, WILL_ALWAYS. Only this overall set of MPRs is relevant, the recorded
the MPR relationship is one of nodes, not interfaces. Nodes MAY and used MPR relationship is one of nodes, not interfaces. Nodes MAY
select their MPRs by any process which satisfies the conditions which select their MPRs by any process which satisfies the conditions which
follow. Nodes can freely interoperate whether they use the same or follow. Nodes can freely interoperate whether they use the same or
different MPR selection algorithms. different MPR selection algorithms.
For each OLSRv2 interface a node MUST select a set of MPRs which have For each OLSRv2 interface a node MUST select a set of MPRs. This set
the property that none of them have willingness WILL_NEVER, and that MUST have the properties that:
if the node successfully sends a message on that OLSRv2 interface,
and that message is then successfully forwarded by all of the
selected MPRs, that all symmetric strict 2-hop neighbors of the node
by that OLSRv2 interface will receive that message on a symmetric
link.
Note that it is always possible to select a valid set of MPRs, the o All of the selected MPRs are willing symmetric 1-hop neighbors,
set of all symmetric 1-hop neighbors of a node which do not have AND;
willingness WILL_NEVER is a (maximal) valid set of MPRs. A node
SHOULD NOT select a symmetric 1-hop neighbor with willingness not o If the selecting node sends a message on that OLSRv2 interface,
equal to WILL_ALWAYS as an MPR if there are no symmetric strict 2-hop and that message is successfully forwarded by all of the selected
neighbors with a symmetric link to that symmetric 1-hop neighbor. MPRs for that interface, then all symmetric strict 2-hop neighbors
Thus a node with no symmetric 1-hop neighbors with willingness of the selecting node through that OLSRv2 interface will receive
WILL_ALWAYS and no symmetric strict 2-hop neighbors SHOULD NOT select that message on a symmetric link.
any MPRs.
Note that it is always possible to select a valid set of MPRs. The
set of all willing symmetric 1-hop neighbors of a node is a (maximal)
valid set of MPRs for that node. However a node SHOULD NOT select a
symmetric 1-hop neighbor with willingness not equal to WILL_ALWAYS as
an MPR if there are no symmetric strict 2-hop neighbors with a
symmetric link to that symmetric 1-hop neighbor. Thus a node with no
symmetric 1-hop neighbors with willingness WILL_ALWAYS and with no
symmetric strict 2-hop neighbors SHOULD NOT select any MPRs.
A node MAY select its MPRs for each OLSRv2 interface independently, A node MAY select its MPRs for each OLSRv2 interface independently,
or it MAY coordinate its MPR selections across its OLSRv2 interfaces, or it MAY coordinate its MPR selections across its OLSRv2 interfaces,
as long as the required condition is satisfied for each OLSRv2 as long as the required condition is satisfied for each OLSRv2
interface. Each node MAY select its MPRs independently from the MPR interface. Each node MAY select its MPRs independently from the MPR
selection by other nodes, or it MAY, for example, give preference to selection by other nodes, or it MAY, for example, give preference to
nodes that either are, or are not, already selected as MPRs by other nodes that either are, or are not, already selected as MPRs by other
nodes. nodes.
The set of MPRs for each OLSRv2 interface can be selected using When selecting MPRs for each OLSRv2 interface independently, this MAY
information from the Link Set and 2-Hop Set of that OLSRv2 interface, be done using information from the Link Set and 2-Hop Set of that
and the Neighbor Set of the node (specifically the N_willingness OLSRv2 interface, and the Neighbor Set of the node (specifically the
elements). The selection of MPRs (overall, not per OLSRv2 interface) N_willingness elements).
is recorded in the Neighbor Set of the node (using the N_mpr
elements). A selected MPR MUST be in the node's symmetric 1-hop The selection of MPRs (overall, not per OLSRv2 interface) is recorded
neighborhood (i.e. the corresponding N_symmetric == true) and MUST in the Neighbor Set of the node (using the N_mpr elements). A
NOT have the corresponding N_willingness == WILL_NEVER. selected MPR MUST be a willing symmetric 1-hop neighbor (i.e. the
corresponding N_symmetric == true, and the corresponding
N_willingness is not equal to WILL_NEVER).
A node MUST recalculate its MPRs whenever the currently selected set A node MUST recalculate its MPRs whenever the currently selected set
of MPRs does not still satisfy the required conditions. It MAY 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. It is sufficient to recalculate a node's could be more efficient. It is sufficient to recalculate a node's
MPRs when there is a change to any of the node's Link Sets affecting MPRs when there is a change to any of the node's Link Sets affecting
the symmetry of any link (addition or removal of a Link Tuple with the symmetry of any link (addition or removal of a Link Tuple with
L_status == SYMMETRIC, or change of any L_status to or from L_status == SYMMETRIC, or change of any L_status to or from
SYMMETRIC), any change to any of the node's 2-Hop Sets, or a change SYMMETRIC), any change to any of the node's 2-Hop Sets, or a change
of the N_willingness (to or from WILL_NEVER or to WILL_ALWAYS is of the N_willingness (to or from WILL_NEVER or to WILL_ALWAYS is
skipping to change at page 48, line 21 skipping to change at page 47, line 21
recorded in the Neighbor Set. recorded in the Neighbor Set.
15.1. Populating the Relay Set 15.1. Populating the Relay Set
The Relay Set for an OLSRv2 interface contains the set of OLSRv2 The Relay Set for an OLSRv2 interface contains the set of OLSRv2
interface addresses of those symmetric 1-hop neighbors for which this interface addresses of those symmetric 1-hop neighbors for which this
OLSRv2 interface is to relay broadcast traffic. This set MUST OLSRv2 interface is to relay broadcast traffic. This set MUST
contain only addresses of OLSRv2 interfaces with which this OLSRv2 contain only addresses of OLSRv2 interfaces with which this OLSRv2
interface has a symmetric link. This set MUST include all such interface has a symmetric link. This set MUST include all such
addresses of all such OLSRv2 interfaces of nodes which are MPR addresses of all such OLSRv2 interfaces of nodes which are MPR
selectors of this node. The Relay Set for an OLSRv2 interface of selectors of this node.
this node is thus created by:
The Relay Set for an OLSRv2 interface of this node is thus created
by:
1. For each Link Tuple in the Link Set for this OLSRv2 interface 1. For each Link Tuple in the Link Set for this OLSRv2 interface
with L_status == SYMMETRIC, and the corresponding Neighbor Tuple with L_status == SYMMETRIC, and the corresponding Neighbor Tuple
with N_neighbor_iface_addr_list containing with N_neighbor_iface_addr_list containing
L_neighbor_iface_addr_list: L_neighbor_iface_addr_list:
1. All addresses from L_neighbor_iface_addr_list MUST be 1. All addresses from L_neighbor_iface_addr_list MUST be
included in the Relay Set of this OLSRv2 interface if included in the Relay Set of this OLSRv2 interface if
N_mpr_selector == true, and otherwise MAY be so included. N_mpr_selector == true, and otherwise MAY be so included.
15.2. Populating the Advertised Neighbor Set 15.2. Populating the Advertised Neighbor Set
The Advertised Neighbor Set of a node contains all interface The Advertised Neighbor Set of a node contains all interface
addresses of those symmetric 1-hop neighbors to which the node addresses of those symmetric 1-hop neighbors to which the node
advertises a link in its TC messages. This set MUST include all advertises a link in its TC messages. This set MUST include all
addresses in all MPR selector of this node. The Advertised Neighbor addresses in all MPR selector of this node.
Set for this node is thus created by:
The Advertised Neighbor Set for this node is thus created by:
1. For each Neighbor Tuple with N_symmetric == true: 1. For each Neighbor Tuple with N_symmetric == true:
1. All addresses from N_neighbor_iface_addr_list MUST be 1. All addresses from N_neighbor_iface_addr_list MUST be
included in the Advertised Neighbor Set if N_mpr_selector == included in the Advertised Neighbor Set if N_mpr_selector ==
true, and otherwise MAY be so included. true, and otherwise MAY be so included.
Whenever address(es) are added to or removed from the Advertised Whenever address(es) are added to or removed from the Advertised
Neighbor Set, its ANSN MUST be incremented. Neighbor Set, its ANSN MUST be incremented.
16. Routing Set Calculation 16. Routing Set Calculation
The Routing Set of a node is populated with Routing Tuples that The Routing Set of a node is populated with Routing Tuples that
represent paths from that node to all destinations in the network. represent paths from that node 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.
16.1. Network Topology Graph 16.1. Network Topology Graph
The Network Topology Graph is formed from information taken from the The Network Topology Graph is formed from information from the node's
node's Link Sets, Neighbor Set, Topology Set and Attached Network Link Sets, Neighbor Set, Topology Set and Attached Network Set. The
Set. The Network Topology Graph SHOULD also use information taken Network Topology Graph SHOULD also use information from the node's
from the node's 2-Hop Sets. The Network Topology Graph forms that 2-Hop Sets. The Network Topology Graph forms that node's topological
node's topological view of the network in form of a directed graph, view of the network in form of a directed graph, containing the
containing the following arcs: following arcs:
o Local symmetric links - all arcs X -> Y such that: o Local symmetric links - all arcs X -> Y such that:
* X is an address in the I_local_iface_addr_list of a Local * X is an address in the I_local_iface_addr_list of a Local
Interface Tuple of this node, AND; Interface Tuple of this node, AND;
* Y is an address in the L_neighbor_iface_addr_list of a Link * Y is an address in the L_neighbor_iface_addr_list of a Link
Tuple in the corresponding (to the OLSRv2 interface of that Tuple in the corresponding (to the OLSRv2 interface of that
I_local_iface_addr_list) Link Set which has L_status == I_local_iface_addr_list) Link Set which has L_status ==
SYMMETRIC. SYMMETRIC.
skipping to change at page 52, line 7 skipping to change at page 51, line 7
o The Attached Network Set of the node. o The Attached Network Set of the node.
Updates to the Routing Set do not generate or trigger any messages to Updates to the Routing Set do not generate or trigger any messages to
be transmitted. The state of the Routing Set SHOULD, however, be be transmitted. The state of the Routing Set SHOULD, however, be
reflected in the IP routing table by adding and removing entries from reflected in the IP routing table by adding and removing entries from
the IP routing table as appropriate. the IP routing table as appropriate.
17. Proposed Values for Parameters and Constants 17. Proposed Values for Parameters and Constants
OLSRv2 uses all parameters and constants defined in [4] and OLSRv2 uses all parameters and constants defined in [nhdp] and
additional parameters and constants defined in this document. All additional parameters and constants defined in this document. All
but one (RX_HOLD_TIME) of these additional parameters are node but one (RX_HOLD_TIME) of these additional parameters are node
parameters as defined in [4]. These proposed values of the parameters as defined in [nhdp]. These proposed values of the
additional parameters are appropriate to the case where all additional parameters are appropriate to the case where all
parameters (including those defined in [4]) have a single value. parameters (including those defined in [nhdp]) have a single value.
Proposed values for parameters defined in [4] are given in that Proposed values for parameters defined in [nhdp] are given in that
document. document.
17.1. Local History Time Parameters 17.1. Local History Time Parameters
o O_HOLD_TIME = 30 seconds o O_HOLD_TIME = 30 seconds
17.2. Message Interval Parameters 17.2. Message Interval Parameters
o TC_INTERVAL = 5 seconds o TC_INTERVAL = 5 seconds
skipping to change at page 55, line 21 skipping to change at page 54, line 21
19.1. Confidentiality 19.1. Confidentiality
Being a proactive protocol, OLSRv2 periodically MPR floods Being a proactive protocol, OLSRv2 periodically MPR floods
topological information to all nodes in the network. Hence, if used topological information to all nodes in the network. Hence, if used
in an unprotected wireless network, the network topology is revealed in an unprotected wireless network, the network topology is revealed
to anyone who listens to OLSRv2 control messages. to anyone who listens to OLSRv2 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 [8] or encrypted by OLSRv2 control traffic messages encrypted by PGP [RFC4880] or
some shared secret key, can be applied to ensure that control traffic encrypted by some shared secret key, can be applied to ensure that
can be read and interpreted by only those authorized to do so. control traffic can be read and interpreted by only those authorized
to do so.
19.2. Integrity 19.2. Integrity
In OLSRv2, each node is injecting topological information into the In OLSRv2, each node is injecting topological information into the
network through transmitting HELLO messages and, for some nodes, TC network through transmitting HELLO messages and, for some nodes, TC
messages. If some nodes for some reason, malicious or malfunction, messages. If some nodes 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:
skipping to change at page 58, line 10 skipping to change at page 57, line 10
authority of the nodes/gateways connecting the MANET with the exiting authority of the nodes/gateways connecting the MANET with the exiting
routing domain) exclusively to the OLSRv2 MANET area, and to routing domain) exclusively to the OLSRv2 MANET area, and to
configure the gateways statically to advertise routes to that IP configure the gateways statically to advertise routes to that IP
sequence to nodes in the existing routing domain. sequence to nodes in the existing routing domain.
20. IANA Considerations 20. IANA Considerations
20.1. Message Types 20.1. Message Types
OLSRv2 defines one message type, which must be allocated from the OLSRv2 defines one message type, which must be allocated from the
"Assigned Message Types" repository of [1]. "Assigned Message Types" repository of [packetbb].
+------+-------+-------------------------------------+ +------+------+-----------------------------------------+
| Name | Value | Description | | Name | Type | Description |
+------+-------+-------------------------------------+ +------+------+-----------------------------------------+
| TC | TBD1 | Topology Control (global signaling) | | TC | TBD1 | Topology Control (MANET-wide signaling) |
+------+-------+-------------------------------------+ +------+------+-----------------------------------------+
Table 5 Table 5
20.2. TLV Types 20.2. TLV Types
OLSRv2 defines two message TLV types, which must be allocated from OLSRv2 defines two message TLV types, which must be allocated from
the "Assigned message TLV Types" repository of [1]. the "Assigned message TLV Types" repository of [packetbb].
+--------------+------+----------------+----------------------------+ +--------------+------+----------------+----------------------------+
| Name | Type | Type extension | Description | | Name | Type | Type extension | Description |
+--------------+------+----------------+----------------------------+ +--------------+------+----------------+----------------------------+
| WILLINGNESS | TBD2 | 0 | Specifies the originating | | MPR_WILLING | TBD2 | 0 | Specifies the originating |
| | | | node's willingness to act | | | | | node's willingness to act |
| | | | as a relay and to partake | | | | | as a relay and to partake |
| | | | in network formation | | | | | in network formation |
| | | | | | | | | |
| | | 1-255 | RESERVED | | | | 1-255 | RESERVED |
| | | | | | | | | |
| CONT_SEQ_NUM | TBD3 | 0 (COMPLETE) | Specifies a content | | CONT_SEQ_NUM | TBD3 | 0 (COMPLETE) | Specifies a content |
| | | | sequence number for this | | | | | sequence number for this |
| | | | complete message | | | | | complete message |
| | | | | | | | | |
| | | 1 (INCOMPLETE) | Specifies a content | | | | 1 (INCOMPLETE) | Specifies a content |
| | | | sequence number for this | | | | | sequence number for this |
| | | | incomplete message | | | | | incomplete message |
| | | | | | | | | |
| | | 2-255 | RESERVED | | | | 2-255 | RESERVED |
+--------------+------+----------------+----------------------------+ +--------------+------+----------------+----------------------------+
Table 6 Table 6
Type extensions indicated as RESERVED may be allocated by standards Type extensions indicated as RESERVED may be allocated by standards
action, as specified in [6]. action, as specified in [RFC2434].
OLSRv2 defines two Address Block TLV types, which must be allocated OLSRv2 defines two Address Block TLV types, which must be allocated
from the "Assigned address block TLV Types" repository of [1]. from the "Assigned address block TLV Types" repository of [packetbb].
+---------+------+-----------+--------------------------------------+ +---------+------+-----------+--------------------------------------+
| Name | Type | Type | Description | | Name | Type | Type | Description |
| | | extension | | | | | extension | |
+---------+------+-----------+--------------------------------------+ +---------+------+-----------+--------------------------------------+
| MPR | TBD4 | 0 | Specifies that a given address is of | | MPR | TBD4 | 0 | Specifies that a given address is of |
| | | | a node selected as an MPR | | | | | a node selected as an MPR |
| | | | | | | | | |
| | | 1-255 | RESERVED | | | | 1-255 | RESERVED |
| | | | | | | | | |
| GATEWAY | TBD5 | 0 | Specifies that a given address is | | GATEWAY | TBD5 | 0 | Specifies that a given address is |
| | | | reached via a gateway on the | | | | | reached via a gateway on the |
| | | | originating node | | | | | originating node |
| | | | | | | | | |
| | | 1-255 | RESERVED | | | | 1-255 | RESERVED |
+---------+------+-----------+--------------------------------------+ +---------+------+-----------+--------------------------------------+
Table 7 Table 7
Type extensions indicated as RESERVED may be allocated by standards Type extensions indicated as RESERVED may be allocated by standards
action, as specified in [6]. action, as specified in [RFC2434].
21. References 21. References
21.1. Normative References 21.1. Normative References
[1] Clausen, T., Dean, J., Dearlove, C., and C. Adjih, "Generalized [packetbb] Clausen, T., Dean, J., Dearlove, C., and C. Adjih,
MANET Packet/Message Format", work in "Generalized MANET Packet/Message Format", work in
progress draft-ietf-manet-packetbb-11.txt, November 2007. progress draft-ietf-manet-packetbb-12.txt, March 2008.
[2] Clausen, T. and C. Dearlove, "Representing multi-value time in [timetlv] Clausen, T. and C. Dearlove, "Representing multi-value
MANETs", Work In Progress draft-ietf-manet-timetlv-04.txt, time in MANETs", Work In
November 2007. Progress draft-ietf-manet-timetlv-04.txt, November 2007.
[3] Clausen, T., Dearlove, C., and B. Adamson, "Jitter [RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter
considerations in MANETs", Work In considerations in MANETs", RFC 5148, February 2008.
Progress draft-ietf-manet-jitter-04.txt, December 2007.
[4] Clausen, T., Dean, J., and C. Dearlove, "MANET Neighborhood [nhdp] Clausen, T., Dean, J., and C. Dearlove, "MANET
Discovery Protocol (NHDP)", work in Neighborhood Discovery Protocol (NHDP)", work in
progress draft-ietf-manet-nhdp-05.txt, December 2007. progress draft-ietf-manet-nhdp-06.txt, March 2008.
[5] Bradner, S., "Key words for use in RFCs to Indicate Requirement [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Levels", RFC 2119, BCP 14, March 1997. Requirement Levels", RFC 2119, BCP 14, March 1997.
[6] Narten, T. and H. Alvestrand, "Guidelines for Writing an IANA [RFC2434] Narten, T. and H. Alvestrand, "Guidelines for Writing an
Considerations Section in RFCs", RFC 2434, BCP 26, IANA Considerations Section in RFCs", RFC 2434, BCP 26,
October 1998. October 1998.
21.2. Informative References 21.2. Informative References
[7] Clausen, T. and P. Jacquet, "The Optimized Link State Routing [RFC3626] Clausen, T. and P. Jacquet, "The Optimized Link State
Protocol", RFC 3626, October 2003. Routing Protocol", RFC 3626, October 2003.
[8] 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.
[9] ETSI, "ETSI STC-RES10 Committee. Radio equipment and systems: [HIPERLAN] ETSI, "ETSI STC-RES10 Committee. Radio equipment and
HIPERLAN type 1, functional specifications ETS 300-652", systems: HIPERLAN type 1, functional specifications ETS
June 1996. 300-652", June 1996.
[10] Jacquet, P., Minet, P., Muhlethaler, P., and N. Rivierre,
"Increasing reliability in cable free radio LANs: Low level
forwarding in HIPERLAN.", 1996.
[11] Qayyum, A., Viennot, L., and A. Laouiti, "Multipoint relaying: [HIPERLAN2] Jacquet, P., Minet, P., Muhlethaler, P., and N.
An efficient technique for flooding in mobile wireless Rivierre, "Increasing reliability in cable free radio
networks.", 2001. LANs: Low level forwarding in HIPERLAN.", 1996.
[12] Macker, J. and S. Corson, "Mobile Ad hoc Networking (MANET): [MPR] Qayyum, A., Viennot, L., and A. Laouiti, "Multipoint
relaying: An efficient technique for flooding in mobile
wireless networks.", 2001.
Routing Protocol Performance Issues and Evaluation [RFC2501] Macker, J. and S. Corson, "Mobile Ad hoc Networking
Considerations", RFC 2501, January 1999. (MANET): Routing Protocol Performance Issues and
Evaluation Considerations", RFC 2501, January 1999.
[13] Pei, G., Gerla, M., and T. Chen, "Fisheye state routing in [FSR] Pei, G., Gerla, M., and T. Chen, "Fisheye state routing
mobile ad hoc networks", 2000. in mobile ad hoc networks", 2000.
[14] Santivanez, C., Ramanathan, R., and I. Stavrakakis, "Making [FSLS] Santivanez, C., Ramanathan, R., and I. Stavrakakis,
link-state routing scale for ad hoc networks", 2000. "Making link-state routing scale for ad hoc networks",
2000.
Appendix A. Node Configuration Appendix A. Node Configuration
OLSRv2 does not make any assumption about node addresses, other than OLSRv2 does not make any assumption about node addresses, other than
that each node is assumed to have at least one unique and routable IP that each node is assumed to have at least one unique and routable IP
address for each interface that it has which participates in the address for each interface that it has which participates in the
MANET. MANET.
When applicable, a recommended way of connecting an OLSRv2 network to When applicable, a recommended way of connecting an OLSRv2 network to
an existing IP routing domain is to assign an IP prefix (under the an existing IP routing domain is to assign an IP prefix (under the
authority of the nodes/gateways connecting the MANET with the routing authority of the nodes/gateways connecting the MANET with the routing
domain) exclusively to the OLSRv2 area, and to configure the gateways domain) exclusively to the OLSRv2 area, and to configure the gateways
statically to advertise routes to that IP sequence to nodes in the statically to advertise routes to that IP sequence to nodes in the
existing routing domain. existing routing domain.
Appendix B. Example Algorithm for Calculating MPRs Appendix B. Example Algorithm for Calculating 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. A node's MPRs are recorded using the element N_mpr in interfaces. (As noted in Section 14 a node MAY improve on this, by
Neighbor Tuples. coordination between OLSRv2 interfaces.) A node's MPRs are recorded
using the element N_mpr in Neighbor Tuples.
If using this algorithm then the following steps MUST be executed in If using this algorithm then the following steps MUST be executed in
order for a node to select its MPRs: order for a node 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 2. For each Neighbor Tuple with N_symmetric == true and
N_willingness == WILL_ALWAYS, set N_mpr = true; N_willingness == WILL_ALWAYS, set N_mpr = true;
3. For each OLSRv2 interface of the node, use the algorithm in 3. For each OLSRv2 interface of the node, use the algorithm in
skipping to change at page 64, line 6 skipping to change at page 63, line 6
B.1. Terminology B.1. Terminology
The following terminology will be used when selecting MPRs for the The following terminology will be used when selecting MPRs for the
OLSRv2 interface I: OLSRv2 interface I:
N(I) - The set of symmetric 1-hop neighbors which have a symmetric N(I) - The set of symmetric 1-hop neighbors which have a symmetric
link to I. link to I.
N2(I) - The set of addresses of interfaces of a node with a N2(I) - The set of addresses of interfaces of a node with a
symmetric link to a node in N(I) (i.e. the set of symmetric link to a node in N(I); this MAY be restricted to
N2_2hop_iface_addr in 2-Hop Tuples in the 2-Hop Set for OLSRv2 considering only information received over I (in which case N2(I)
interface I). is the set of N2_2hop_iface_addr in 2-Hop Tuples in the 2-Hop Set
for OLSRv2 interface I).
Connected to I via Y - An address A in N2(I) is connected to I via a Connected to I via Y - An address A in N2(I) is connected to I via a
node Y in N(I) if A is an address of an interface of a symmetric node Y in N(I) if A is an address of an interface of a symmetric
1-hop neighbor of Y (i.e. A is the N2_2hop_iface_addr in a 2-Hop 1-hop neighbor of Y (i.e. A is the N2_2hop_iface_addr in a 2-Hop
Tuple in the 2-Hop Set for OLSRv2 interface I, and whose Tuple in the 2-Hop Set for OLSRv2 interface I, and whose
N2_neighbor_iface_addr_list is contained in the set of interface N2_neighbor_iface_addr_list is contained in the set of interface
addresses of Y). addresses of Y).
D(Y, I) - For a node Y in N(I), the number of addresses in N2(I) D(Y, I) - For a node Y in N(I), the number of addresses in N2(I)
which are connected to I via Y. which are connected to I via Y.
skipping to change at page 68, line 10 skipping to change at page 67, line 10
+ R_dist = (R_dist of the previous Routing Tuple) + AN_dist; + R_dist = (R_dist of the previous Routing Tuple) + AN_dist;
+ 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.
Appendix D. Example Message Layout Appendix D. Example Message Layout
An example TC message, using IPv4 (four octet) addresses, is as An example TC message, using IPv4 (four octet) addresses, is as
follows. The overall message length is 65 octets. follows. The overall message length is 65 octets.
The message has a message TLV block with content length 13 octets The message has semantics octet 30, and hence all required message
containing three TLVs. The first two TLVs are validity and interval header fields. It has a message TLV block with content length 13
times for the message. The third TLV is the content sequence number octets containing three TLVs. The first two TLVs are validity and
TLV used to carry the 2 octet ANSN, and (with default type extension interval times for the message. The third TLV is the content
zero, i.e. COMPLETE) indicating that the TC message is complete. sequence number TLV used to carry the 2 octet ANSN, and (with default
Each TLV uses a TLV with semantics value 8, indicating no type type extension zero, i.e. COMPLETE) indicating that the TC message
extension or start and stop indexes are included. The first two TLVs is complete. Each TLV uses a TLV with semantics value 8, indicating
have a value length of 1 octet, the last has a value length of 2 that it has a value, but no type extension or start and stop indexes.
octets. The first two TLVs have a value length of 1 octet, the last has a
value length of 2 octets.
The message has two address blocks. The first address block contains The message has two address blocks. The first address block contains
6 addresses (with semantics octet 2, hence no tail section, head 6 addresses, with semantics octet 1, hence with a head section, (with
length 2 octets, and hence mid sections with length two octets). The length 2 octets) but no tail section, and hence mid sections with
following TLV block (content length 6 octets) contains a single length two octets. The following TLV block (content length 6 octets)
LOCAL_IF TLV (semantics value 0) indicating that the first three contains a single LOCAL_IF TLV (semantics value 12) indicating that
addresses (indexes 0 to 2) are associated with the value (length 1 the first three addresses (indexes 0 to 2) are associated with the
octet) UNSPEC_IF, i.e. they are the originating node's local value (length 1 octet) UNSPEC_IF, i.e. they are the originating
interface addresses. The remaining three addresses have no node's local interface addresses. The remaining three addresses have
associated TLV, they are the interface addresses of advertised no associated TLV, they are the interface addresses of advertised
neighbors. neighbors.
The second address block contains 1 address, with semantics octet 12 The second address block contains 1 address, with semantics octet 13
indicating that the tail section, length 2 octets, consists of zero indicating that there is a head section (with length 2 octets), that
valued octets (not included), and that there is a single prefix the tail section (length 2 octets) consists of zero valued octets
length, 16. The network address is thus Head.0.0/16. The following (not included), and that there is a single prefix length, which is
TLV block (content length 8 octets) includes one TLV that indicates 16. The network address is thus Head.0.0/16. The following TLV
that the originating node is a gateway to this network, at a given block (content length 8 octets) includes one TLV that indicates that
number of hops distance (value length 1 octet). The TLV semantics the originating node is a gateway to this network, at a given number
value of 8 indicates that no indexes are needed. of hops distance (value length 1 octet). The TLV semantics value of
8 indicates that no indexes are needed.
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 |0 0 0 0 0 0 0 0|0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1| | TC |0 0 0 1 1 1 1 0|0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| 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| VALIDITY_TIME |0 0 0 0 1 0 0 0| |0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1| VALIDITY_TIME |0 0 0 0 1 0 0 0|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1| Value | INTERVAL_TIME |0 0 0 0 1 0 0 0| |0 0 0 0 0 0 0 1| Value | INTERVAL_TIME |0 0 0 0 1 0 0 0|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1| Value | CONT_SEQ_NUM |0 0 0 0 1 0 0 0| |0 0 0 0 0 0 0 1| Value | CONT_SEQ_NUM |0 0 0 0 1 0 0 0|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 1 0| Value (ANSN) |0 0 0 0 0 1 1 0| |0 0 0 0 0 0 1 0| Value (ANSN) |0 0 0 0 0 1 1 0|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 1 0|0 0 0 0 0 0 1 0| Head | |0 0 0 0 0 0 0 1|0 0 0 0 0 0 1 0| Head |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Mid | | Mid | Mid |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Mid | | Mid | Mid |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Mid | | Mid | Mid |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0| LOCAL_IF |0 0 0 0 0 0 0 0| |0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0| LOCAL_IF |0 0 0 0 1 1 0 0|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 0|0 0 0 0 0 0 1 0|0 0 0 0 0 0 0 1| UNSPEC_IF | |0 0 0 0 0 0 0 0|0 0 0 0 0 0 1 0|0 0 0 0 0 0 0 1| UNSPEC_IF |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1|0 0 0 0 1 1 0 0|0 0 0 0 0 0 1 0| Head | |0 0 0 0 0 0 0 1|0 0 0 0 1 1 0 1|0 0 0 0 0 0 1 0| Head |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| 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| | 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|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 1 0 0| GATEWAY |0 0 0 0 1 0 0 0|0 0 0 0 0 0 0 1| |0 0 0 0 0 1 0 0| GATEWAY |0 0 0 0 1 0 0 0|0 0 0 0 0 0 0 1|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Number Hops | | Number Hops |
+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+
Appendix E. Constraints Appendix E. 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 [4]. maintained, as well as those specified in [nhdp].
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 node's originator address. o O_orig_addr MUST NOT equal this node'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 72, line 5 skipping to change at page 71, line 5
equal the corresponding triple in any other Forwarded Tuple. equal the corresponding triple in any other Forwarded Tuple.
In each Relay Tuple: In each Relay Tuple:
o RY_neighbor_iface_addr MUST NOT equal the RY_neighbor_iface_addr o RY_neighbor_iface_addr MUST NOT equal the RY_neighbor_iface_addr
in any other Relay Tuple in the same Relay Set. in any other Relay Tuple in the same Relay Set.
o RY_neighbor_iface_addr MUST be in the L_neighbor_iface_addr_list o RY_neighbor_iface_addr MUST be in the L_neighbor_iface_addr_list
of a Link Tuple with L_status == SYMMETRIC. of a Link Tuple with L_status == SYMMETRIC.
In each Advertised Neighbor Tuple: In the Advertised Neighbor Set:
o A_neighbor_iface_addr MUST NOT equal the A_neighbor_iface_addr of o Each A_neighbor_iface_addr MUST NOT equal any other
any other Advertised Neighbor Tuple. A_neighbor_iface_addr.
o A_neighbor_iface_addr MUST be in the N_neighbor_iface_addr_list of o Each A_neighbor_iface_addr MUST be in the
a Neighbor Tuple with N_symmetric == true. N_neighbor_iface_addr_list of a Neighbor Tuple with N_symmetric ==
true.
In each Advertising Remote Node Tuple: In each Advertising Remote Node Tuple:
o AR_orig_addr MUST NOT equal this node's originator address or any o AR_orig_addr MUST NOT equal this node's originator address or any
O_orig_addr. O_orig_addr.
o AR_orig_addr MUST NOT equal the AR_orig_addr in any other ANSN o AR_orig_addr MUST NOT equal the AR_orig_addr in any other ANSN
History Tuple. History Tuple.
o AR_iface_addr_list MUST NOT be empty. o AR_iface_addr_list MUST NOT be empty.
skipping to change at page 74, line 12 skipping to change at page 73, line 12
o The ordered pair (AN_net_addr, AN_orig_addr) MUST NOT equal the o The ordered pair (AN_net_addr, AN_orig_addr) MUST NOT equal the
corresponding pair in any other Attached Network Tuple. corresponding pair in any other Attached Network Tuple.
Appendix F. Flow and Congestion Control Appendix F. Flow and Congestion Control
Due to its proactive nature, the OLSRv2 protocol has a natural Due to its proactive nature, the OLSRv2 protocol has a natural
control over the flow of its control traffic. Nodes transmit control control over the flow of its control traffic. Nodes transmit control
messages at predetermined rates specified and bounded by message messages at predetermined rates specified and bounded by message
intervals. intervals.
OLSRv2 employs [4] for local signaling, embedding MPR selection OLSRv2 employs [nhdp] for local signaling, embedding MPR selection
advertisement through a simple address block TLV, and node advertisement through a simple address block TLV, and node
willingness advertisement (if any) as a single message TLV. OLSRv2 willingness advertisement (if any) as a single message TLV. OLSRv2
local signaling, therefore, shares the characteristics and local signaling, therefore, shares the characteristics and
constraints of [4]. constraints of [nhdp].
Furthermore, MPR flooding greatly reduces global signaling overhead Furthermore, MPR flooding greatly reduces signaling overhead from
from global link state declaration in two ways. First, the amount of from link state information dissemination in two ways. First, the
link state information for a node to declare is reduced to only amount of link state information for a node to declare is reduced to
contain that node's MPR selectors. This reduces the size of a link only contain that node's MPR selectors. This reduces the size of a
state declaration as compared to declaring full link state link state declaration as compared to declaring full link state
information. In particular some nodes may not need to declare any information. In particular some nodes may not need to declare any
such information. Second, using MPR flooding, the cost of declaring such information. Second, using MPR flooding, the cost of
link state information throughout the network is greatly reduced, as distributing link state information throughout the network is greatly
compared to when using classic flooding, since only MPRs need to reduced, as compared to when using classic flooding, since only MPRs
forward link state declaration messages. In dense networks, the need to forward link state declaration messages. In dense networks,
reduction of control traffic can be of several orders of magnitude the reduction of control traffic can be of several orders of
compared to routing protocols using classical flooding [11]. This magnitude compared to routing protocols using classical flooding
feature naturally provides more bandwidth for useful data traffic and [MPR]. This feature naturally provides more bandwidth for useful
pushes further the frontier of congestion. data traffic and pushes further the frontier of congestion.
Since the control traffic is continuous and periodic, it keeps the Since the control traffic is continuous and periodic, it keeps the
quality of the links used in routing more stable. However, using quality of the links used in routing more stable. However, using
certain OLSRv2 options, some control messages (HELLO messages or TC certain OLSRv2 options, some control messages (HELLO messages or TC
messages) may be intentionally sent in advance of their deadline in messages) may be intentionally sent in advance of their deadline in
order to increase the responsiveness of the protocol to topology order to increase the responsiveness of the protocol to topology
changes. This may cause a small, temporary, and local increase of changes. This may cause a small, temporary, and local increase of
control traffic, however this is at all times bounded by the use of control traffic, however this is at all times bounded by the use of
minimum message intervals. minimum message intervals.
skipping to change at page 77, line 11 skipping to change at page 76, line 11
Joe Macker (NRL), Alan Cullen (BAE Systems), Khaldoun Al Agha (LRI), Joe Macker (NRL), Alan Cullen (BAE Systems), Khaldoun Al Agha (LRI),
Richard Ogier (SRI), Song-Yean Cho (LIX), Shubhranshu Singh (Samsung Richard Ogier (SRI), Song-Yean Cho (LIX), Shubhranshu Singh (Samsung
AIT), Charles E. Perkins, and the entire IETF MANET working group. AIT), Charles E. Perkins, and the entire IETF MANET working group.
Authors' Addresses Authors' Addresses
Thomas Heide Clausen Thomas Heide Clausen
LIX, Ecole Polytechnique, France LIX, Ecole Polytechnique, France
Phone: +33 6 6058 9349 Phone: +33 6 6058 9349
Email: thomas@thomasclausen.org EMail: T.Clausen@computer.org
URI: http://www.ThomasClausen.org/ URI: http://www.ThomasClausen.org/
Christopher Dearlove Christopher Dearlove
BAE Systems Advanced Technology Centre BAE Systems Advanced Technology Centre
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 The OLSRv2 Design Team
MANET Working Group MANET Working Group
Full Copyright Statement Full Copyright Statement
Copyright (C) The IETF Trust (2008). Copyright (C) The IETF Trust (2008).
This document is subject to the rights, licenses and restrictions This document is subject to the rights, licenses and restrictions
contained in BCP 78, and except as set forth therein, the authors contained in BCP 78, and except as set forth therein, the authors
skipping to change at page 78, line 44 skipping to change at line 3023
attempt made to obtain a general license or permission for the use of attempt made to obtain a general license or permission for the use of
such proprietary rights by implementers or users of this such proprietary rights by implementers or users of this
specification can be obtained from the IETF on-line IPR repository at specification can be obtained from the IETF on-line IPR repository at
http://www.ietf.org/ipr. http://www.ietf.org/ipr.
The IETF invites any interested party to bring to its attention any The IETF invites any interested party to bring to its attention any
copyrights, patents or patent applications, or other proprietary copyrights, patents or patent applications, or other proprietary
rights that may cover technology that may be required to implement rights that may cover technology that may be required to implement
this standard. Please address the information to the IETF at this standard. Please address the information to the IETF at
ietf-ipr@ietf.org. ietf-ipr@ietf.org.
Acknowledgment
Funding for the RFC Editor function is provided by the IETF
Administrative Support Activity (IASA).
 End of changes. 224 change blocks. 
579 lines changed or deleted 621 lines changed or added

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