draft-ietf-manet-olsrv2-07.txt   draft-ietf-manet-olsrv2-08.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
Intended status: Standards Track C. Dearlove Intended status: Standards Track C. Dearlove
Expires: January 11, 2009 BAE Systems Advanced Technology Expires: September 11, 2009 BAE Systems ATC
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
July 10, 2008 March 10, 2009
The Optimized Link State Routing Protocol version 2 The Optimized Link State Routing Protocol version 2
draft-ietf-manet-olsrv2-07 draft-ietf-manet-olsrv2-08
Status of This Memo Status of This Memo
By submitting this Internet-Draft, each author represents that any This Internet-Draft is submitted to IETF in full conformance with the
applicable patent or other IPR claims of which he or she is aware provisions of BCP 78 and BCP 79. This document may contain material
have been or will be disclosed, and any of which he or she becomes from IETF Documents or IETF Contributions published or made publicly
aware will be disclosed, in accordance with Section 6 of BCP 79. available before November 10, 2008. The person(s) controlling the
copyright in some of this material may not have granted the IETF
Trust the right to allow modifications of such material outside the
IETF Standards Process. Without obtaining an adequate license from
the person(s) controlling the copyright in such materials, this
document may not be modified outside the IETF Standards Process, and
derivative works of it may not be created outside the IETF Standards
Process, except to format it for publication as an RFC or to
translate it into languages other than English.
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.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
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 January 11, 2009. This Internet-Draft will expire on September 11, 2009.
Copyright Notice
Copyright (c) 2009 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents in effect on the date of
publication of this document (http://trustee.ietf.org/license-info).
Please review these documents carefully, as they describe your rights
and restrictions with respect to this document.
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. The protocol embodies an optimization of the (OLSRv2) protocol. The protocol embodies an optimization of the
classical link state algorithm tailored to the requirements of a classical link state algorithm tailored to the requirements of a
Mobile Ad hoc NETwork (MANET). Mobile Ad hoc NETwork (MANET).
The key optimization in OLSRv2 is that of multipoint relays (MPRs),
providing an efficient mechanism for network-wide broadcast of link
state information (i.e. reducing the cost of performing a network-
wide link state broadcast). A secondary optimization is that OLSRv2
employs partial link state information; each node maintains
information about all destinations, but only a subset of links.
Consequently, only selected nodes flood link state advertisements
(thus reducing the number of network-wide link state broadcasts) and
these advertisements contain only a subset of links (thus reducing
the size of network-wide link state broadcasts). The partial link
state information thus obtained still allows each OLSRv2 node to at
all times maintain optimal (in terms of number of hops) routes to all
destinations in the network.
OLSRv2 imposes minimum requirements on the network by not requiring
sequenced or reliable transmission of control traffic. Furthermore,
the only interaction between OLSRv2 and the IP stack is routing table
management.
OLSRv2 is particularly suitable for large and dense networks as the
technique of MPRs works best in this context.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 5 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 5
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6
3. Applicability Statement . . . . . . . . . . . . . . . . . . . 8 3. Applicability Statement . . . . . . . . . . . . . . . . . . . 7
4. Protocol Overview and Functioning . . . . . . . . . . . . . . 10 4. Protocol Overview and Functioning . . . . . . . . . . . . . . 8
5. Protocol Parameters and Constants . . . . . . . . . . . . . . 13 5. Protocol Parameters and Constants . . . . . . . . . . . . . . 10
5.1. Local History Times . . . . . . . . . . . . . . . . . . . 13 5.1. Local History Times . . . . . . . . . . . . . . . . . . . 11
5.2. Message Intervals . . . . . . . . . . . . . . . . . . . . 14 5.2. Message Intervals . . . . . . . . . . . . . . . . . . . . 11
5.3. Advertised Information Validity Times . . . . . . . . . . 14 5.3. Advertised Information Validity Times . . . . . . . . . . 12
5.4. Received Message Validity Times . . . . . . . . . . . . . 15 5.4. Received Message Validity Times . . . . . . . . . . . . . 13
5.5. Jitter . . . . . . . . . . . . . . . . . . . . . . . . . . 16 5.5. Jitter . . . . . . . . . . . . . . . . . . . . . . . . . . 13
5.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 16 5.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 14
5.7. Willingness . . . . . . . . . . . . . . . . . . . . . . . 17 5.7. Willingness . . . . . . . . . . . . . . . . . . . . . . . 14
5.8. Parameter Change Constraints . . . . . . . . . . . . . . . 17 5.8. Parameter Change Constraints . . . . . . . . . . . . . . . 15
6. Information Bases . . . . . . . . . . . . . . . . . . . . . . 19 6. Information Bases . . . . . . . . . . . . . . . . . . . . . . 16
6.1. Local Information Base . . . . . . . . . . . . . . . . . . 19 6.1. Local Information Base . . . . . . . . . . . . . . . . . . 17
6.1.1. Originator Set . . . . . . . . . . . . . . . . . . . . 19 6.1.1. Originator Set . . . . . . . . . . . . . . . . . . . . 17
6.1.2. Local Attached Network Set . . . . . . . . . . . . . . 20 6.1.2. Local Attached Network Set . . . . . . . . . . . . . . 17
6.2. Node Information Base . . . . . . . . . . . . . . . . . . 20 6.2. Neighbor Information Base . . . . . . . . . . . . . . . . 18
6.3. Topology Information Base . . . . . . . . . . . . . . . . 21 6.3. Topology Information Base . . . . . . . . . . . . . . . . 18
6.3.1. Advertised Neighbor Set . . . . . . . . . . . . . . . 21 6.3.1. Advertised Neighbor Set . . . . . . . . . . . . . . . 19
6.3.2. Advertising Remote Node Set . . . . . . . . . . . . . 21 6.3.2. Advertising Remote Router Set . . . . . . . . . . . . 19
6.3.3. Topology Set . . . . . . . . . . . . . . . . . . . . . 22 6.3.3. Topology Set . . . . . . . . . . . . . . . . . . . . . 20
6.3.4. Attached Network Set . . . . . . . . . . . . . . . . . 22 6.3.4. Attached Network Set . . . . . . . . . . . . . . . . . 20
6.3.5. Routing Set . . . . . . . . . . . . . . . . . . . . . 23 6.3.5. Routing Set . . . . . . . . . . . . . . . . . . . . . 21
6.4. Processing and Forwarding Information Base . . . . . . . . 23 6.4. Processing and Forwarding Information Base . . . . . . . . 21
6.4.1. Received Set . . . . . . . . . . . . . . . . . . . . . 24 6.4.1. Received Set . . . . . . . . . . . . . . . . . . . . . 22
6.4.2. Processed Set . . . . . . . . . . . . . . . . . . . . 24 6.4.2. Processed Set . . . . . . . . . . . . . . . . . . . . 22
6.4.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . 24 6.4.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . 22
6.4.4. Relay Set . . . . . . . . . . . . . . . . . . . . . . 25 6.4.4. Relay Set . . . . . . . . . . . . . . . . . . . . . . 23
7. Packet Processing and Message Forwarding . . . . . . . . . . . 26 7. Message Processing and Forwarding . . . . . . . . . . . . . . 23
7.1. Actions when Receiving an OLSRv2 Packet . . . . . . . . . 26 7.1. Actions when Receiving a Message . . . . . . . . . . . . . 24
7.2. Actions when Receiving an OLSRv2 Message . . . . . . . . . 26 7.2. Message Considered for Processing . . . . . . . . . . . . 25
7.3. Message Considered for Processing . . . . . . . . . . . . 27 7.3. Message Considered for Forwarding . . . . . . . . . . . . 25
7.4. Message Considered for Forwarding . . . . . . . . . . . . 28 8. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 27
8. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 31 8.1. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . 28
8.1. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . 31 8.1.1. HELLO Message TLVs . . . . . . . . . . . . . . . . . . 28
8.1.1. HELLO Message TLVs . . . . . . . . . . . . . . . . . . 32 8.1.2. HELLO Message Address Block TLVs . . . . . . . . . . . 29
8.1.2. HELLO Message Address Block TLVs . . . . . . . . . . . 32 8.2. TC Messages . . . . . . . . . . . . . . . . . . . . . . . 29
8.2. TC Messages . . . . . . . . . . . . . . . . . . . . . . . 32 8.2.1. TC Message TLVs . . . . . . . . . . . . . . . . . . . 30
8.2.1. TC Message TLVs . . . . . . . . . . . . . . . . . . . 33 8.2.2. TC Message Address Block TLVs . . . . . . . . . . . . 31
8.2.2. TC Message Address Block TLVs . . . . . . . . . . . . 34 9. HELLO Message Generation . . . . . . . . . . . . . . . . . . . 31
9. HELLO Message Generation . . . . . . . . . . . . . . . . . . . 35 9.1. HELLO Message: Transmission . . . . . . . . . . . . . . . 32
9.1. HELLO Message: Transmission . . . . . . . . . . . . . . . 35 10. HELLO Message Processing . . . . . . . . . . . . . . . . . . . 32
10. HELLO Message Processing . . . . . . . . . . . . . . . . . . . 36 10.1. Updating Willingness . . . . . . . . . . . . . . . . . . . 32
10.1. Updating Willingness . . . . . . . . . . . . . . . . . . . 36 10.2. Updating MPR Selectors . . . . . . . . . . . . . . . . . . 33
10.2. Updating MPR Selectors . . . . . . . . . . . . . . . . . . 36 10.3. Symmetric 1-Hop and 2-Hop Neighborhood Changes . . . . . . 33
10.3. Symmetric 1-Hop and 2-Hop Neighborhood Changes . . . . . . 36 11. TC Message Generation . . . . . . . . . . . . . . . . . . . . 34
11. TC Message Generation . . . . . . . . . . . . . . . . . . . . 38 11.1. TC Message: Transmission . . . . . . . . . . . . . . . . . 35
11.1. TC Message: Transmission . . . . . . . . . . . . . . . . . 39 12. TC Message Processing . . . . . . . . . . . . . . . . . . . . 36
12. TC Message Processing . . . . . . . . . . . . . . . . . . . . 40 12.1. Invalid Message . . . . . . . . . . . . . . . . . . . . . 36
12.1. Initial TC Message Processing . . . . . . . . . . . . . . 40 12.2. Initial TC Message Processing . . . . . . . . . . . . . . 37
12.1.1. Populating the Advertising Remote Node Set . . . . . . 41 12.3. Initial TC Message Processing . . . . . . . . . . . . . . 38
12.1.2. Populating the Topology Set . . . . . . . . . . . . . 42 12.3.1. Populating the Advertising Remote Router Set . . . . . 38
12.1.3. Populating the Attached Network Set . . . . . . . . . 42 12.3.2. Populating the Topology Set . . . . . . . . . . . . . 39
12.2. Completing TC Message Processing . . . . . . . . . . . . . 43 12.3.3. Populating the Attached Network Set . . . . . . . . . 40
12.2.1. Purging the Topology Set . . . . . . . . . . . . . . . 43 12.4. Completing TC Message Processing . . . . . . . . . . . . . 40
12.2.2. Purging the Attached Network Set . . . . . . . . . . . 43 12.4.1. Purging the Topology Set . . . . . . . . . . . . . . . 40
13. Information Base Changes . . . . . . . . . . . . . . . . . . . 44 12.4.2. Purging the Attached Network Set . . . . . . . . . . . 41
14. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 45 13. Information Base Changes . . . . . . . . . . . . . . . . . . . 41
15. Populating Derived Sets . . . . . . . . . . . . . . . . . . . 47 14. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 42
15.1. Populating the Relay Set . . . . . . . . . . . . . . . . . 47 15. Populating Derived Sets . . . . . . . . . . . . . . . . . . . 43
15.2. Populating the Advertised Neighbor Set . . . . . . . . . . 47 15.1. Populating the Relay Set . . . . . . . . . . . . . . . . . 43
16. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 48 15.2. Populating the Advertised Neighbor Set . . . . . . . . . . 44
16.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 48 16. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 44
16.2. Populating the Routing Set . . . . . . . . . . . . . . . . 49 16.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 44
16.3. Routing Set Updates . . . . . . . . . . . . . . . . . . . 50 16.2. Populating the Routing Set . . . . . . . . . . . . . . . . 46
17. Proposed Values for Parameters and Constants . . . . . . . . . 51 16.3. Routing Set Updates . . . . . . . . . . . . . . . . . . . 46
17.1. Local History Time Parameters . . . . . . . . . . . . . . 51 17. Proposed Values for Parameters and Constants . . . . . . . . . 47
17.2. Message Interval Parameters . . . . . . . . . . . . . . . 51 17.1. Local History Time Parameters . . . . . . . . . . . . . . 47
17.3. Advertised Information Validity Time Parameters . . . . . 51 17.2. Message Interval Parameters . . . . . . . . . . . . . . . 47
17.4. Received Message Validity Time Parameters . . . . . . . . 51 17.3. Advertised Information Validity Time Parameters . . . . . 47
17.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 51 17.4. Received Message Validity Time Parameters . . . . . . . . 47
17.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 51 17.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 48
17.7. Willingness Parameter and Constants . . . . . . . . . . . 52 17.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 48
18. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 53 17.7. Willingness Parameter and Constants . . . . . . . . . . . 48
19. Security Considerations . . . . . . . . . . . . . . . . . . . 54 18. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 48
19.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 54 19. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 49
19.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 54 19.1. Message Types . . . . . . . . . . . . . . . . . . . . . . 49
19.3. Interaction with External Routing Domains . . . . . . . . 55 19.2. Message TLV Types . . . . . . . . . . . . . . . . . . . . 49
20. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 57 19.3. Address Block TLV Types . . . . . . . . . . . . . . . . . 50
20.1. Message Types . . . . . . . . . . . . . . . . . . . . . . 57 20. Security Considerations . . . . . . . . . . . . . . . . . . . 51
20.2. Message TLV Types . . . . . . . . . . . . . . . . . . . . 57 20.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 51
20.3. Address Block TLV Types . . . . . . . . . . . . . . . . . 58 20.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 51
21. References . . . . . . . . . . . . . . . . . . . . . . . . . . 60 20.3. Interaction with External Routing Domains . . . . . . . . 53
21.1. Normative References . . . . . . . . . . . . . . . . . . . 60 21. Contributors . . . . . . . . . . . . . . . . . . . . . . . . . 53
21.2. Informative References . . . . . . . . . . . . . . . . . . 60 22. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 54
Appendix A. Node Configuration . . . . . . . . . . . . . . . . . 62 23. References . . . . . . . . . . . . . . . . . . . . . . . . . . 54
Appendix B. Example Algorithm for Calculating MPRs . . . . . . . 63 23.1. Normative References . . . . . . . . . . . . . . . . . . . 54
B.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 63 23.2. Informative References . . . . . . . . . . . . . . . . . . 55
B.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 64 Appendix A. Router Configuration . . . . . . . . . . . . . . . . 55
Appendix C. Example Algorithm for Calculating the Routing Set . . 65 Appendix B. Example Algorithm for Calculating MPRs . . . . . . . 56
C.1. Add Local Symmetric Links . . . . . . . . . . . . . . . . 65 B.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 56
C.2. Add Remote Symmetric Links . . . . . . . . . . . . . . . . 66 B.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 57
C.3. Add Attached Networks . . . . . . . . . . . . . . . . . . 67 Appendix C. Example Algorithm for Calculating the Routing Set . . 58
Appendix D. Example Message Layout . . . . . . . . . . . . . . . 68 C.1. Add Local Symmetric Links . . . . . . . . . . . . . . . . 58
Appendix E. Constraints . . . . . . . . . . . . . . . . . . . . . 70 C.2. Add Remote Symmetric Links . . . . . . . . . . . . . . . . 59
Appendix F. Flow and Congestion Control . . . . . . . . . . . . . 74 C.3. Add Attached Networks . . . . . . . . . . . . . . . . . . 60
Appendix G. Contributors . . . . . . . . . . . . . . . . . . . . 75 Appendix D. Example Message Layout . . . . . . . . . . . . . . . 61
Appendix H. Acknowledgements . . . . . . . . . . . . . . . . . . 76 Appendix E. Constraints . . . . . . . . . . . . . . . . . . . . . 62
Appendix F. Flow and Congestion Control . . . . . . . . . . . . . 66
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]. 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 routers in the network regularly. Each router
selects a set of its neighbor nodes as "MultiPoint Relays" (MPRs). selects a set of its neighbor routers 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 router only needs to forward control traffic
directly received from its MPR selectors (nodes which have selected directly received from its MPR selectors (routers 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 information distribution within the MANET by efficient mechanism for information distribution within the MANET by
reducing the number of transmissions required. reducing the number of transmissions required.
Nodes selected as MPRs also have a special responsibility when Routers 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 routers 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 routers in multi-hop routes.
A node selects MPRs from among its one hop neighbors connected by A router 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 [packetbb], (Parts of OLSRv2 have been published separately as [RFC5444],
[timetlv], [RFC5148] and [nhdp] for wider use.) Likewise, OLSRv2 [timetlv], [RFC5148] and [NHDP] for wider use.) Likewise, OLSRv2
makes no assumptions about the underlying link layer. However, makes no assumptions about the underlying link layer. However,
OLSRv2 may use link layer information and notifications when OLSRv2 may use link layer information and notifications when
available and applicable, as described in [nhdp]. 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
[HIPERLAN], [HIPERLAN2]. [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", "NOT RECOMMENDED", "MAY", and "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
"OPTIONAL" in this document are to be interpreted as described in "OPTIONAL" in this document are to be interpreted as described in
[RFC2119]. [RFC2119].
MANET specific terminology is to be interpreted as described in MANET specific terminology is to be interpreted as described in
[packetbb] and [nhdp]. [RFC5444] 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 Router - 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.
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 [nhdp] refer to OLSRv2 references to MANET interfaces in [NHDP] refer to OLSRv2
interfaces when using [nhdp] as part of OLSRv2. interfaces when using [NHDP] as part of OLSRv2.
Address - An address, as recorded in the Information Bases specified Address - An address, as recorded in the Information Bases specified
by this protocol, and included in HELLO and TC messages generated by this protocol, and included in HELLO and TC messages generated
by this protocol, may be either an address or an address prefix. by this protocol, may be either an address or an address prefix.
These can be represented as a single address object in a HELLO or These can be represented as a single address object in a HELLO or
TC message, as defined by [packetbb]. An address so represented TC message, as defined by [RFC5444]. An address so represented is
is considered to have a prefix length equal to its length (in considered to have a prefix length equal to its length (in bits)
bits) when considered as an address object, and a similar when considered as an address object, and a similar convention is
convention is used in the Information Bases specified by this used in the Information Bases specified by this protocol. Two
protocol. Two addresses (address objects) are considered equal addresses (address objects) are considered equal only if their
only if their prefix lengths are also equal. prefix lengths are also equal.
Willingness - The willingness of a node is a numerical value between Willingness - The willingness of a router is a numerical value
WILL_NEVER and WILL_ALWAYS (both inclusive), which represents the between WILL_NEVER and WILL_ALWAYS (both inclusive), which
node's willingness to be selected as an MPR. represents the router's willingness to be selected as an MPR.
Willing symmetric 1-hop neighbor - A symmetric 1-hop neighbor of Willing symmetric 1-hop neighbor - A symmetric 1-hop neighbor of
this node which has willingness not equal to WILL_NEVER. this router which has willingness not equal to WILL_NEVER.
Symmetric strict 2-hop neighbor - A symmetric 2-hop neighbor of this 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 router which is not a symmetric 1-hop neighbor of this router, and
a symmetric 1-hop neighbor of a willing symmetric 1-hop neighbor is a symmetric 1-hop neighbor of a willing symmetric 1-hop
of this node. neighbor of this router.
Symmetric strict 2-hop neighbor through OLSRv2 interface I - A Symmetric strict 2-hop neighbor through OLSRv2 interface I - A
symmetric strict 2-hop neighbor of this node which is a symmetric symmetric strict 2-hop neighbor of this router which is a
1-hop neighbor of a willing symmetric 1-hop neighbor of this node symmetric 1-hop neighbor of a willing symmetric 1-hop neighbor of
by a symmetric link including OLSRv2 interface I. This node MAY this router via a symmetric link including OLSRv2 interface I.
elect to consider only information received over OLSRv2 interface This router MAY elect to consider only information received over
I in making this determination. 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 router.
Multipoint relay (MPR) - A node which is selected by its symmetric Multipoint relay (MPR) - A router which is selected by its symmetric
1-hop neighbor, node X, to "re-transmit" all the broadcast 1-hop neighbor, router X, to "re-transmit" all the broadcast
messages that it receives from node X, provided that the message messages that it receives from router 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 router which has selected its symmetric 1-hop
neighbor, node X, as one of its MPRs is an MPR selector of node X. neighbor, router X, as one of its MPRs is an MPR selector of
router X.
MPR flooding - The optimized MANET-wide information distribution MPR flooding - The optimized MANET-wide information distribution
mechanism, employed by this protocol, in which a message is mechanism, employed by this protocol, in which a message is
relayed by only a reduced subset of the nodes in the network. relayed by only a reduced subset of the routers in the network.
This document employs the same notational conventions as in [RFC5444]
and [NHDP].
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) [RFC2501]. 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. router 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 routers, 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, and consequently no
data traffic buffering is imposed.
OLSRv2 supports nodes which have multiple interfaces which OLSRv2 supports routers which have multiple interfaces which
participate in the MANET using OLSRv2. As described in [nhdp], 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 routers which
have non-OLSRv2 interfaces which may be local or can serve as have non-OLSRv2 interfaces which may be local to a router or which
gateways towards other networks. can serve as gateways towards other networks.
OLSRv2 uses the format specified in [packetbb] for all messages and OLSRv2 uses the format specified in [RFC5444] for all messages and
packets. OLSRv2 is thereby able to allow for extensions via packets. OLSRv2 is thereby able to allow for extensions via
"external" and "internal" extensibility. External extensibility "external" and "internal" extensibility. External extensibility
allows a protocol extension to specify and exchange new message allows a protocol extension to specify and exchange new Message
types, which can be forwarded and delivered correctly even by nodes Types, which can be forwarded and delivered correctly even by routers
which do not support that extension. Internal extensibility allows a which do not support that extension. Internal extensibility allows a
protocol extension to define additional attributes to be carried protocol extension to define additional attributes to be carried
embedded in the standard OLSRv2 control messages detailed in this embedded in the standard OLSRv2 control messages detailed in this
specification (or any new message types defined by other protocol specification (or any new Message Types defined by other protocol
extensions) using the TLV mechanism specified in [packetbb], while extensions) using the TLV mechanism specified in [RFC5444], while
still allowing nodes not supporting that extension to forward still allowing routers not supporting that extension to forward
messages including the extension, and to process messages ignoring messages including the extension, and to process messages ignoring
the extension. the extension.
The OLSRv2 neighborhood discovery protocol using HELLO messages is The OLSRv2 neighborhood discovery protocol using HELLO messages is
specified in [nhdp]. 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 router has available continuously updated
Information Bases describing the node's 1-hop and symmetric 2-hop Information Bases describing the router's 1-hop and symmetric 2-hop
neighbors. This neighborhood discovery protocol, which also uses neighbors. This neighborhood discovery protocol, which also uses
[packetbb], is extended in this document by the addition of MPR [RFC5444], is extended in this document by the addition of MPR
information. information.
OLSRv2 does not make any assumption about node addresses, other than OLSRv2 does not make any assumption about router addresses, other
that each node is assumed to have at least one unique and routable IP than that each router is assumed to have at least one unique and
address for each interface that it has which participates in the routable IP address for each interface that it has which participates
MANET. in the MANET.
OLSRv2 can, as does [nhdp], use the link local multicast address "LL- OLSRv2 can, as does [NHDP], use the link local multicast address "LL-
MANET-Routers", and either the "manet" UDP port or the "manet" IP MANET-Routers", and either the "manet" UDP port or the "manet" IP
protocol number, all as specified in [manet-iana]. protocol number, all as specified in [manet-iana].
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 Unacknowledged transmission of all control messages; control o Unacknowledged transmission of all control messages; control
messages are sent periodically, but may also be sent in response messages are sent periodically, but may also be sent in response
to changes in the local neighborhood. to changes in the local neighborhood.
o MPR flooding for MANET-wide link state information distribution. 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 router 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 of MultiPoint Relays (MPRs), selected independently by nodes concept of MultiPoint Relays (MPRs), selected independently by
based on the symmetric 1-hop and 2-hop neighbor information routers based on the symmetric 1-hop and 2-hop neighbor information
maintained using [nhdp]. maintained using [NHDP].
Using the message exchange format [packetbb] and the neighborhood Using the message exchange format [RFC5444] and the neighborhood
discovery protocol [nhdp], OLSRv2 also contains the following main discovery protocol [NHDP], OLSRv2 also contains the following main
components: components:
o A TLV, to be included within the HELLO messages of [nhdp], o A TLV, to be included within the HELLO messages of [NHDP],
allowing a node to signal MPR selection. allowing a router to signal MPR selection.
o The optimized mechanism for MANET-wide information distribution, o The optimized mechanism for MANET-wide information distribution,
denoted "MPR flooding". denoted "MPR flooding".
o A specification of MANET-wide signaling, denoted TC (Topology o A specification of MANET-wide signaling, denoted TC (Topology
Control) messages. TC messages in OLSRv2 serve to: Control) messages. TC messages in OLSRv2 serve to:
* inject link state information into the entire MANET; * 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 routers to
continuously track changes in the network. Incomplete TC messages continuously track changes in the network. Incomplete TC messages
may be used to report additions to advertised information without may be used to report additions to advertised information without
repeating unchanged information. Some TC messages may be MPR repeating unchanged information. Some TC messages may be MPR
flooded over only part of the network, allowing a node to ensure flooded over only part of the network, allowing a router to ensure
that nearer nodes are kept more up to date than distant nodes, that nearer routers are kept more up to date than distant routers,
such as is used in Fisheye State Routing [FSR] and Fuzzy Sighted such as is used in Fisheye State Routing [FSR] and Fuzzy Sighted
Link State routing [FSLS]. Link State routing [FSLS].
Each node in the network selects a set of MPRs. The MPRs of a node X Each router in the network selects a set of MPRs. The MPRs of a
may be any subset of node X's willing symmetric 1-hop neighbors, such router X may be any subset of router X's willing symmetric 1-hop
that every node in the symmetric strict 2-hop neighborhood of node X neighbors, such that every router in the symmetric strict 2-hop
has a symmetric link to at least one of node X's MPRs. The MPRs of a neighborhood of router X has a symmetric link to at least one of
node may thus be said to "cover" the node's symmetric strict 2-hop router X's MPRs. The MPRs of a router may thus be said to "cover"
neighborhood. Each node also maintains information about the set of the router's symmetric strict 2-hop neighborhood. Each router also
symmetric 1-hop neighbors that have selected it as an MPR, its MPR maintains information about the set of symmetric 1-hop neighbors that
selectors. have selected it as an MPR, its MPR 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 [MPR]. selection algorithms is given in [MPR].
A node may independently determine and advertise its willingness to A router 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 router may advertise that it always should
selected as an MPR or that it should never be selected as an MPR. In be selected as an MPR or that it should never be selected as an MPR.
the latter case, the node will neither relay control messages, nor In the latter case, the router will neither relay control messages,
will that node be included as an intermediate node in any routing nor will that router be included as an intermediate router in any
table calculations. Use of variable willingness is most effective in routing table calculations. Use of variable willingness is most
dense networks. effective in 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 router'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 routers. If the Advertised Neighbor Set is empty, TC messages are
generated by that node, unless needed for gateway reporting, or for a not generated by that router, unless needed for gateway reporting, or
short period to accelerate the removal of outdated link state for a short period to accelerate the removal of outdated link state
information. 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 router 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 [RFC5148]. 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 only interacts with IP through routing table management. OLSRv2 only interacts with IP through routing table management.
OLSRv2 sends its control messages as described in [packetbb] and OLSRv2 sends its control messages as described in [RFC5444] and
[nhdp]. [NHDP].
5. Protocol Parameters and Constants 5. Protocol Parameters and Constants
The parameters and constants used in this specification are those The parameters and constants used in this specification are those
defined in [nhdp] plus those defined in this section. The separation defined in [NHDP] plus those defined in this section. The separation
in [nhdp] into interface parameters, node parameters and constants is in [NHDP] into interface parameters, router parameters and constants
also used in OLSRv2, however all but one (RX_HOLD_TIME) of the is also used in OLSRv2, however all but one (RX_HOLD_TIME) of the
parameters added by OLSRv2 are node parameters. Parameters may be parameters added by OLSRv2 are router parameters. Parameters may be
classified into the 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 In addition, constants for particular cases of a router's willingness
to be an MPR are defined. These parameters and constants are to be an MPR are defined. These parameters and constants are
detailed in the following sections. As for the parameters in [nhdp], detailed in the following sections. As for the parameters in [NHDP],
parameters defined in this document may be changed dynamically by a parameters defined in this document may be changed dynamically by a
node, and need not be the same on different nodes, even in the same router, and need not be the same on different routers, even in the
MANET, or on different interfaces of the same node (for interface same MANET, or on different interfaces of the same router (for
parameters). interface parameters).
5.1. Local History Times 5.1. Local History Times
The following parameter manages the time for which local information The following router parameter manages the time for which local
is retained: information is retained:
O_HOLD_TIME - is used to define the time for which a recently used O_HOLD_TIME - is used to define the time for which a recently used
and replaced originator address is used to recognize the node's and replaced originator address is used to recognize the router's
own messages. own messages.
The following constraint applies to this parameter: The following constraint applies to this parameter:
o O_HOLD_TIME >= 0 o O_HOLD_TIME >= 0
5.2. Message Intervals 5.2. Message Intervals
The following interface parameters regulate TC message transmissions The following router parameters regulate TC message transmissions by
by a node. TC messages are usually sent periodically, but MAY also a router. TC messages are usually sent periodically, but MAY also be
be sent in response to changes in the node's Advertised Neighbor Set sent in response to changes in the router's Advertised Neighbor Set
and Local Attached Network Set. With a larger value of the parameter and Local Attached Network Set. With a larger value of the parameter
TC_INTERVAL, and a smaller value of the 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 router has no knowledge
for example, nodes remote to it joining the network, TC messages MUST of, for example, routers remote to it (i.e. beyond 2 hops away)
NOT be sent purely responsively. joining the network, TC messages MUST 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 router. When no TC messages are
in response to local network changes (by design, or because the sent in response to local network changes (by design, or because
local network is not changing) then TC messages SHOULD be sent at the local network is not changing) then TC messages SHOULD be sent
a regular interval TC_INTERVAL, possibly modified by jitter as at a regular interval TC_INTERVAL, possibly modified by jitter as
specified in [RFC5148]. 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 router. (This minimum interval
MAY be modified by jitter, as specified in [RFC5148].) 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 [timetlv] 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
[timetlv]. [timetlv].
5.3. Advertised Information Validity Times 5.3. Advertised Information Validity Times
The following parameters manage the validity time of information The following router parameters manage the validity time of
advertised in TC messages: information 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 router.
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.
A_HOLD_TIME - is the period during which TC messages are sent after A_HOLD_TIME - is the period during which TC messages are sent after
they no longer have any advertised information to report, but are they no longer have any advertised information to report, but are
sent in order to accelerate outdated information removal by other sent in order to accelerate outdated information removal by other
nodes. routers.
The following constraints apply to these parameters: The following constraints apply to these parameters:
o T_HOLD_TIME > 0 o T_HOLD_TIME > 0
o A_HOLD_TIME >= 0 o A_HOLD_TIME >= 0
o T_HOLD_TIME >= TC_INTERVAL o T_HOLD_TIME >= TC_INTERVAL
o If TC messages can be lost, then both T_HOLD_TIME and A_HOLD_TIME o If TC messages can be lost, then both T_HOLD_TIME and A_HOLD_TIME
skipping to change at page 15, line 31 skipping to change at page 13, line 15
o T_HOLD_TIME MUST be representable as described in [timetlv]. 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 router 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
OLSRv2 interface. OLSRv2 interface.
P_HOLD_TIME - is the period after receipt of a message which is P_HOLD_TIME - is a router parameter, and is the period after receipt
processed by this node for which that information is recorded, in of a message which is processed by this router for which that
order that the message is not processed again if received again. information is recorded, in order that the message is not
processed again if received again.
F_HOLD_TIME - is the period after receipt of a message which is F_HOLD_TIME - is a router parameter, and is the period after receipt
forwarded by this node for which that information is recorded, in of a message which is forwarded by this router for which that
order that the message is not forwarded again if received again. information is recorded, in order that the message is not
forwarded again if received again.
The following constraints apply to these parameters: The following constraints apply to these parameters:
o RX_HOLD_TIME > 0 o RX_HOLD_TIME > 0
o P_HOLD_TIME > 0 o P_HOLD_TIME > 0
o F_HOLD_TIME > 0 o F_HOLD_TIME > 0
o All of these parameters SHOULD be greater than the maximum o 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 [RFC5148], is used then these parameters are If jitter, as defined in [RFC5148], is used then these parameters are
as follows: as follows:
TP_MAXJITTER - represents the value of MAXJITTER used in [RFC5148] TP_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
for periodically generated TC messages sent by this node. for periodically generated TC messages sent by this router.
TT_MAXJITTER - represents the value of MAXJITTER used in [RFC5148] TT_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
for externally triggered TC messages sent by this node. for externally triggered TC messages sent by this router.
F_MAXJITTER - represents the default value of MAXJITTER used in F_MAXJITTER - represents the default value of MAXJITTER used in
[RFC5148] for messages forwarded by this node. However before [RFC5148] for messages forwarded by this router. However before
using F_MAXJITTER a node MAY attempt to deduce a more appropriate using F_MAXJITTER a router MAY attempt to deduce a more
value of MAXJITTER, for example based on any INTERVAL_TIME or appropriate value of MAXJITTER, for example based on any
VALIDITY_TIME TLVs contained in the message to be forwarded. INTERVAL_TIME or VALIDITY_TIME TLVs contained in the message to be
forwarded.
For constraints on these parameters see [RFC5148]. 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, at any hop messages sent by the same router. However each other router, at any
count distance, SHOULD see a regular pattern of TC messages, in order hop count distance, SHOULD see a regular pattern of TC messages, in
that meaningful values of INTERVAL_TIME and VALIDITY_TIME TLVs at order that meaningful values of INTERVAL_TIME and VALIDITY_TIME TLVs
each hop count distance can be included as defined in [timetlv]. at each hop count distance can be included as defined in [timetlv].
Thus the pattern of TC_HOP_LIMIT SHOULD be defined to have this Thus the pattern of TC_HOP_LIMIT SHOULD be defined to have this
property. For example the repeating pattern (255 4 4) satisfies this property. For example the repeating pattern (255 4 4) satisfies this
property (having period TC_INTERVAL at hop counts up to 4, inclusive, property (having period TC_INTERVAL at hop counts up to 4, inclusive,
and 3 x TC_INTERVAL at hop counts greater than 4), but the repeating and 3 x TC_INTERVAL at hop counts greater than 4), but the repeating
pattern (255 255 4 4) does not satisfy this property because at hop pattern (255 255 4 4) does not satisfy this property because at hop
counts greater than 4, message intervals are alternately TC_INTERVAL counts greater than 4, message intervals are alternately TC_INTERVAL
and 3 x 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
Each node has a WILLINGNESS parameter, which MUST be in the range Each router has a WILLINGNESS parameter, which MUST be in the range
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 router on routes. If a router has WILLINGNESS =
it does not perform these tasks. A MANET using OLSRv2 with too many WILL_NEVER it does not perform these tasks. A MANET using OLSRv2
nodes with WILLINGNESS == WILL_NEVER will not function; it MUST be with too many routers with WILLINGNESS = WILL_NEVER will not
ensured, by administrative or other means, that this does not happen. function; it MUST be ensured, by administrative or other means, that
this does not happen.
Nodes MAY have different WILLINGNESS values; however the three Routers 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 an MPR_WILLING TLV in its TC allows a router 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 router 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 >= WILL_NEVER o WILLINGNESS >= WILL_NEVER
o WILLINGNESS <= 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 O_HOLD_TIME
* If O_HOLD_TIME for a node changes, then O_time for all * If O_HOLD_TIME for a router changes, then O_time for all
Originator Tuples MAY be changed. 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 router increases, then the next TC
message generated by this node MUST be generated according to message generated by this router MUST be generated according to
the previous, shorter, TC_INTERVAL. Additional subsequent TC the previous, shorter, TC_INTERVAL. Additional subsequent TC
messages MAY be generated according to the previous, shorter, messages MAY be generated according to the previous, shorter,
TC_INTERVAL. TC_INTERVAL.
* If the TC_INTERVAL for a node decreases, then the following TC * If the TC_INTERVAL for a router decreases, then the following
messages from this node MUST be generated according to the TC messages from this router MUST be generated according to the
current, shorter, TC_INTERVAL. current, shorter, TC_INTERVAL.
RX_HOLD_TIME RX_HOLD_TIME
* If RX_HOLD_TIME for an OLSRv2 interface changes, then RX_time * If RX_HOLD_TIME for an OLSRv2 interface changes, then RX_time
for all Received Tuples for that OLSRv2 interface MAY be for all Received Tuples for that OLSRv2 interface MAY be
changed. changed.
P_HOLD_TIME P_HOLD_TIME
skipping to change at page 18, line 24 skipping to change at page 16, line 13
MAY be changed. MAY be changed.
F_HOLD_TIME F_HOLD_TIME
* If F_HOLD_TIME changes, then F_time for all Forwarded Tuples * If F_HOLD_TIME changes, then F_time for all Forwarded Tuples
MAY be changed. MAY be changed.
TP_MAXJITTER TP_MAXJITTER
* If TP_MAXJITTER changes, then the periodic TC message schedule * If TP_MAXJITTER changes, then the periodic TC message schedule
on this node MAY be changed immediately. on this router MAY be changed immediately.
TT_MAXJITTER TT_MAXJITTER
* If TT_MAXJITTER changes, then externally triggered TC messages * If TT_MAXJITTER changes, then externally triggered TC messages
on this node MAY be rescheduled. on this router MAY be rescheduled.
F_MAXJITTER F_MAXJITTER
* If F_MAXJITTER changes, then TC messages waiting to be * If F_MAXJITTER changes, then TC messages waiting to be
forwarded with a delay based on this parameter MAY be forwarded with a delay based on this parameter MAY be
rescheduled. rescheduled.
TC_HOP_LIMIT TC_HOP_LIMIT
* If TC_HOP_LIMIT changes, and the node uses multiple values * If TC_HOP_LIMIT changes, and the router uses multiple values
after the change, then message intervals and validity times after the change, then message intervals and validity times
included in TC messages MUST be respected. The simplest way to included in TC messages MUST be respected. The simplest way to
do this is to start any new repeating pattern of TC_HOP_LIMIT do this is to start any new repeating pattern of TC_HOP_LIMIT
values with its largest value. values with its largest value.
6. Information Bases 6. Information Bases
Each node maintains the Information Bases described in the following Each router maintains the Information Bases described in the
sections. These are used for describing the protocol in this following sections. These are used for describing the protocol in
document. An implementation of this protocol MAY maintain this 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. In particular note that it is not offers access to this information. In particular note that it is not
necessary to remove Tuples from Sets at the exact time indicated, necessary to remove Tuples from Sets at the exact time indicated,
only to behave as if the Tuples were removed at that time. only to behave as if the Tuples were removed at that time.
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 [nhdp], extended by the Local Information Base - as defined in [NHDP], extended by the
addition of an Originator Set, defined in Section 6.1.1 and a addition of an Originator Set, defined in Section 6.1.1 and a
Local Attached Network Set, defined in Section 6.1.2. Local Attached Network Set, defined in Section 6.1.2.
Interface Information Bases - as defined in [nhdp], 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 [nhdp], extended by the Neighbor Information Base - as defined in [NHDP], extended by the
addition 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.
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 [nhdp] 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 router's Originator Set records addresses that were recently used
originator addresses. If a node's originator address is immutable as originator addresses by this router. If a router's originator
then this set is always empty and MAY be omitted. It consists of address is immutable then this set is always empty and MAY be
Originator Tuples: omitted. It consists of Originator Tuples:
(O_orig_addr, O_time) (O_orig_addr, O_time)
where: where:
O_orig_addr is a recently used originator address; O_orig_addr is a recently used originator address;
O_time specifies the time at which this Tuple expires and MUST be O_time specifies the time at which this Tuple expires and MUST be
removed. removed.
6.1.2. Local Attached Network Set 6.1.2. Local Attached Network Set
A node's Local Attached Network Set records its local non-OLSRv2 A router's Local Attached Network Set records its local non-OLSRv2
interfaces that can act as gateways to other networks. The Local interfaces via which it can act as gateways to other networks. The
Attached Network Set is not modified by this protocol. This protocol Local Attached Network Set is not modified by this protocol. This
MAY respond to changes to the Local Attached Network Set, which MUST protocol MAY respond to changes to the Local Attached Network Set,
reflect corresponding changes in the node's status. It consists of which MUST reflect corresponding changes in the router's status. It
Local Attached Network Tuples: consists of Local Attached Network Tuples:
(AL_net_addr, AL_dist) (AL_net_addr, AL_dist)
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 router.
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 router.
Attached networks local to this node SHOULD be treated as local non- Attached networks local to this router SHOULD be treated as local
MANET interfaces, and added to the Local Interface Set, as specified non-MANET interfaces, and added to the Local Interface Set, as
in [nhdp], rather than being added to the Local Attached Network Set. specified 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 routers.
It is not the responsibility of OLSRv2 to maintain routes from this It is not the responsibility of OLSRv2 to maintain routes from this
node to networks recorded in the Local Attached Network Set. router to networks recorded in the Local Attached Network Set.
6.2. Node Information Base Local Attached Neighbor Tuples are removed from the Local Attached
Network Set only when the routers' local attached network
configuration changes, i.e. they are not subject to timer-based
expiration or changes due to received messages.
Each Neighbor Tuple in the Neighbor Set, defined in [nhdp], has these 6.2. Neighbor Information Base
Each Neighbor Tuple in the Neighbor Set, defined in [NHDP], has these
additional elements: additional elements:
N_willingness is the node's willingness to be selected as an MPR, in N_willingness is the router's willingness to be selected as an MPR,
the range from WILL_NEVER to WILL_ALWAYS, both inclusive; in 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 this neighbor is selected as
an MPR by this node; an MPR by this router;
N_mpr_selector is a boolean flag, describing if this neighbor has N_mpr_selector is a boolean flag, describing if this neighbor has
selected this node as an MPR, i.e. is an MPR selector of this selected this router as an MPR, i.e. is an MPR selector of this
node. router.
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 information received in generation and processing of TC messages, and information received in
TC messages. The Advertised Neighbor Set contains interface TC messages. The Advertised Neighbor Set contains interface
addresses of symmetric 1-hop neighbors which are to be reported in TC addresses of symmetric 1-hop neighbors which are to be reported in TC
messages. The Advertising Remote Node Set, the Topology Set and the messages. The Advertising Remote Router Set, the Topology Set and
Attached Network Set record information received in TC messages. the 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 Router Set.
6.3.1. Advertised Neighbor Set 6.3.1. Advertised Neighbor Set
A node's Advertised Neighbor Set contains interface addresses of A router'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. It consists of Advertised Neighbor Tuples:
{A_neighbor_iface_addr} (A_neighbor_iface_addr)
In addition, an Advertised Neighbor Set Sequence Number (ANSN) is In addition, an Advertised Neighbor Set Sequence Number (ANSN) is
maintained. Each time the Advertised Neighbor Set is updated, the maintained. Each time the Advertised Neighbor Set is updated, the
ANSN MUST be incremented. The ANSN MUST also be incremented if there ANSN MUST be incremented. The ANSN MUST also be incremented if there
is a change to the set of Local Attached Network Tuples that are to is a change to the set of Local Attached Network Tuples that are to
be advertised in the node's TC messages. be advertised in the router's TC messages.
6.3.2. Advertising Remote Node Set The Advertised Neighbor Set for a router is derived from the Neighbor
Set of that same router, and so Advertised Neighbor Tuples are
removed when, for example, the corresponding Neighbor Tuples in the
Neighbor Set are removed. Advertised Neighbor Tuples are not subject
to timer-based expiration.
A node's Advertising Remote Node Set records information describing 6.3.2. Advertising Remote Router Set
each remote node in the network that transmits TC messages. It
consists of Advertising Remote Node Tuples: A router's Advertising Remote Router Set records information
describing each remote router in the network that transmits TC
messages. It consists of Advertising Remote Router 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 router with originator address AR_orig_addr
(i.e. which contributed to the information contained in this (i.e. which contributed to the information contained in this
Tuple); Tuple);
AR_iface_addr_list is an unordered list of the interface addresses AR_iface_addr_list is an unordered list of the interface addresses
of the node with originator address AR_orig_addr; of the router 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 router's Topology Set records topology information about the
It consists of Topology Tuples: network. 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)
where: where:
T_dest_iface_addr is an interface address of a destination node, T_dest_iface_addr is an interface address of a destination router,
which may be reached in one hop from the node with originator which may be reached in one hop from the router 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 router which is the last
hop on a path towards the node with interface address hop on a path towards the router 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 ANSN in any TC message received which T_seq_number is the greatest ANSN in any TC message received which
originated from the node with originator address T_orig_addr (i.e. originated from the router with originator address T_orig_addr
which contributed to the information contained in this Tuple); (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 router's Attached Network Set records information about networks
attached to other nodes. It consists of Attached Network Tuples: attached to other routers. 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)
where: where:
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 router 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 router 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 router with originator address AN_orig_addr;
AN_seq_number is the greatest ANSN in any TC message received which AN_seq_number is the greatest ANSN in any TC message received which
originated from the node with originator address AN_orig_addr originated from the router with originator address AN_orig_addr
(i.e. which contributed to the information contained in this (i.e. which contributed to the information contained in this
Tuple); 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 router'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)
where: where:
R_dest_addr is the address of the destination, either the address of R_dest_addr is the address of the destination, either the address of
an interface of a destination node, or the network address of an an interface of a destination router, or the network address of an
attached network; attached network;
R_next_iface_addr is the OLSRv2 interface address of the "next hop" R_next_iface_addr is the OLSRv2 interface address of the "next hop"
on the selected path to the destination; on the selected path to the destination;
R_dist is the number of hops on the selected path to the R_dist is the number of hops on the selected path to the
destination; destination;
R_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.
The Routing Set for a router is derived from the contents of the
other sets of the router, and is updated (Routing Tuples added or
removed) when routing paths are calculated. Routing Tuples are not
subject to timer-based expiration.
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, using MPR forwarded at most once per OLSRv2 interface of a router, using MPR
flooding. flooding.
6.4.1. Received Set 6.4.1. Received Set
A node has a Received Set per local OLSRv2 interface. Each Received A router has a Received Set per local OLSRv2 interface. Each
Set records the signatures of messages which have been received over Received Set records the signatures of messages which have been
that OLSRv2 interface. Each consists of Received Tuples: received over 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:
RX_type is the received message type, or zero if the received RX_type is the received Message Type;
message sequence number is not type-specific;
RX_orig_addr is the originator address of the received message; RX_orig_addr is the originator address of the received message;
RX_seq_number is the message sequence number of the received RX_seq_number is the message sequence number of the received
message; message;
RX_time specifies the time at which this Tuple expires and MUST be RX_time specifies the time at which this Tuple expires and MUST be
removed. removed.
6.4.2. Processed Set 6.4.2. Processed Set
A node's Processed Set records signatures of messages which have been A router's Processed Set records signatures of messages which have
processed by the node. It consists of Processed Tuples: been processed by the router. It consists of Processed Tuples:
(P_type, P_orig_addr, P_seq_number, P_time) (P_type, P_orig_addr, P_seq_number, P_time)
where: where:
P_type is the processed message type, or zero if the processed P_type is the processed Message Type;
message sequence number is not type-specific;
P_orig_addr is the originator address of the processed message; P_orig_addr is the originator address of the processed message;
P_seq_number is the message sequence number of the processed P_seq_number is the message sequence number of the processed
message; message;
P_time specifies the time at which this Tuple expires and MUST be P_time specifies the time at which this Tuple expires and MUST be
removed. removed.
6.4.3. Forwarded Set 6.4.3. Forwarded Set
A node's Forwarded Set records signatures of messages which have been A router's Forwarded Set records signatures of messages which have
processed by the node. It consists of Forwarded Tuples: been processed by the router. It consists of Forwarded Tuples:
(F_type, F_orig_addr, F_seq_number, F_time) (F_type, F_orig_addr, F_seq_number, F_time)
where: where:
F_type is the forwarded message type, or zero if the forwarded F_type is the forwarded Message Type;
message sequence number is not type-specific;
F_orig_addr is the originator address of the forwarded message; F_orig_addr is the originator address of the forwarded message;
F_seq_number is the message sequence number of the forwarded F_seq_number is the message sequence number of the forwarded
message; message;
F_time specifies the time at which this Tuple expires and MUST be F_time specifies the time at which this Tuple expires and MUST be
removed. removed.
6.4.4. Relay Set 6.4.4. Relay Set
A node has a Relay Set per local OLSRv2 interface. Each Relay Set A router has a Relay Set per local OLSRv2 interface. Each Relay Set
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 router 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). It consists of Relay Tuples:
{RY_neighbor_iface_addr}
7. Packet Processing and Message Forwarding
On receiving a packet, as defined in [packetbb], a node examines the
packet header and each of the message headers. If the message type
is known to the node, the message is processed locally according to
the specification for that message type. The message is also
independently evaluated for forwarding.
7.1. Actions when Receiving an OLSRv2 Packet (RY_neighbor_iface_addr)
On receiving a packet, a node MUST perform the following tasks: The Relay Set for an interface is derived from the Link Set for the
same interface, and so Relay Tuples are removed when the
corresponding Link Tuples in the Link Set of this interface are
removed, or when processing otherwise suggests their removal. Relay
Tuples are not subject to timer-based expiration.
1. The packet MAY be fully parsed on reception, or the packet and 7. Message Processing and Forwarding
its messages MAY be parsed only as required. (It is possible to
parse the packet header, or determine its absence, without
parsing any messages. It is possible to divide the packet into
messages without fully parsing the message headers. It is
possible to determine whether a message is to be forwarded, and
to forward it, without parsing its body. It is possible to
determine whether a message is to be processed without parsing
its body.)
2. If parsing fails at any point the relevant entity (packet or On receiving a packet, as defined in [RFC5444], a router divides the
message) MUST be silently discarded, other parts of the packet packet into the Packet Header and messages. OLSRv2 defines, and
(up to the whole packet) MAY be silently discarded. hence owns, the TC Message Type, and hence receives all TC messages.
OLSRv2 is responsible for determining whether a TC message is to be
processed (updating Information Bases) and/or forwarded.
3. Otherwise: OLSRv2 also receives HELLO messages, which are defined, and hence
owned, by [NHDP]. Received HELLO messages MUST be made available to
OLSRv2 when received on an OLSRv2 interface and after NHDP has
completed its processing thereof. OLSRv2 also processes HELLO
messages, OLSRv2 does not forward HELLO messages.
1. If the packet header is present and it contains a packet TLV Extensions to OLSRv2 which define, and hence own, other Messages
block, then each TLV in it is processed according to its type Types, MAY manage the processing and/or forwarding of these messages
if recognized, otherwise the TLV is ignored. using the same mechanism as for TC messages. These mechanisms
contain elements (P_type, RX_type, F_type) required only for such
usage.
2. Otherwise each message in the packet, if any, is treated The processing selection and forwarding mechanisms are designed to
according to Section 7.2. only need to parse the Message Header in order to determine whether a
message is to be processed and/or forwarded, and not to have to parse
the Message Body even if the message is forwarded (but not
processed). An implementation MAY either only parse the Message Body
if necessary, or MAY always parse the Message Body. An
implementation MUST discard the message silently if it is unable to
parse the Message Header or (if attempted) the Message Body.
7.2. Actions when Receiving an OLSRv2 Message OLSRv2 does not require any part of the Packet Header.
A node MUST perform the following tasks for each received message: 7.1. Actions when Receiving a Message
1. If the message header cannot be correctly parsed according to the If the router receives a HELLO message from NHDP, then the message is
specification in [packetbb], or if the node recognizes from the processed according to Section 10.
originator address of the message that the message is one which
the receiving node itself originated (i.e. is the current
originator address of the node, or is an O_orig_addr in an
Originator Tuple) then the message MUST be silently discarded.
2. Otherwise: A router MUST perform the following tasks for each received TC
message or other Message Type defined by an extension to OLSRv2 and
specified to use this process:
1. If the message is a HELLO message, then the message is 1. If the router recognizes from the originator address of the
processed according to Section 10. message that the message is one which the receiving router itself
originated (i.e. is the current originator address of the router,
or is an O_orig_addr in an Originator Tuple) then the message
MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. Define the "dependent message type" of the message to 1. Otherwise:
equal the message type if the mistypedep flag bit in the
message header is set ('1'), or otherwise to equal a
value "type-independent" which is not in the range 0 to
255.
2. If the message is of a known type, including being a TC 1. If the message is of a type which may be processed,
message, then the message is considered for processing including being a TC message, then the message is
according to Section 7.3, AND; considered for processing according to Section 7.2, AND;
3. If for the message: 2. If for the message is of a type which may be forwarded,
including being a TC message, AND:
- <hop-limit> is present and <hop-limit> > 1, AND; - <msg-hop-limit> is present and <msg-hop-limit> > 1,
AND;
- <hop-count> is not present or <hop-count> < 255 - <msg-hop-count> is not present or <msg-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.3.
7.3. Message Considered for Processing 7.2. Message Considered for Processing
If a message (the "current message") is considered for processing, If a message (the "current message") is considered for processing,
then the following tasks MUST be performed: then the following tasks MUST be performed:
1. If a Processed Tuple exists with: 1. If a Processed Tuple exists with:
* P_type == the dependent message type of the current message, * P_type = the Message Type of the current message, AND;
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 dependent message type of the current + P_type := the Message Type of the current message;
message;
+ P_orig_addr = the originator address of the current
message;
+ P_seq_number = the sequence number of the current message; + P_orig_addr := the originator address of the current
message;
+ P_time = current time + P_HOLD_TIME. + P_seq_number := the sequence number of the current
message;
2. Process the current message according to its type. + P_time := current time + P_HOLD_TIME.
7.4. Message Considered for Forwarding 2. Process the current message according to its type. For a TC
message this is as defined in Section 12.
If a message is considered for forwarding, and it is either of a 7.3. Message Considered for Forwarding
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
message of a message type not defined in this document MAY, in an
extension to this protocol, specify the use of this, or another
algorithm. (Such an other algorithm MAY use the Received Set for the
receiving interface, it SHOULD use the Forwarded Set similarly to the
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: then 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) an OLSRv2 interface address in into account any address prefix) an OLSRv2 interface address 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 the SYMMETRIC, in the Link Set for the OLSRv2 interface on which the
current message was received (the "receiving interface") then the current message was received (the "receiving interface") then the
current message MUST be silently discarded. current message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. If a Received Tuple exists in the Received Set for the 1. If a Received Tuple exists in the Received Set for the
receiving interface, with: receiving interface, with:
+ RX_type == the dependent message type of the current + RX_type = the Message Type of the current message, AND;
message, AND;
+ RX_orig_addr == the originator address of the current + RX_orig_addr = the originator address of the current
message, AND; message, AND;
+ RX_seq_number == the sequence number of the current + RX_seq_number = the sequence number of the current
message; message;
then the current message MUST be silently discarded. then the current message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. Create a Received Tuple in the Received Set for the 1. Create a Received Tuple in the Received Set for the
receiving interface with: receiving interface with:
- RX_type = the dependent message type of the current - RX_type := the Message Type of the current message;
message;
- 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 dependent message type of the current - F_type = the Message Type of the current message, AND;
message, AND;
- F_orig_addr == the originator address of the current - F_orig_addr = the originator address of the current
message, AND; message, AND;
- F_seq_number == the sequence number of the current - F_seq_number = the sequence number of the current
message. message.
then the current message MUST be silently discarded. then the current message MUST be silently discarded.
3. Otherwise if the sending interface address matches 3. Otherwise if the sending interface address matches
(taking account of any address prefix) 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 dependent message type of the current o F_type := the Message Type of the current message;
message;
o F_orig_addr = originator address of the current o F_orig_addr := originator address of the current
message; message;
o F_seq_number = sequence number of the current o F_seq_number := sequence number of the current
message; message;
o F_time = current time + F_HOLD_TIME. o F_time := current time + F_HOLD_TIME.
2. The message header of the current message is modified 2. The Message Header of the current message is modified
by: by:
o decrement <hop-limit> in the message header by 1; o if present, decrement <msg-hop-limit> in the
Message Header by 1, AND;
o increment <hop-count> in the message header by 1. o if present, increment <msg-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 router, 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 router, including by other
protocols using [RFC5444]. Forwarded messages MAY be
jittered as described in [RFC5148]. The value of jittered as described in [RFC5148]. The value of
MAXJITTER used in jittering a forwarded message MAY MAXJITTER used in jittering a forwarded message MAY
be based on information in that message (in be based on information in that message (in
particular any INTERVAL_TIME or VALIDITY_TIME TLVs in particular any INTERVAL_TIME or VALIDITY_TIME TLVs in
that message) or otherwise SHOULD be with a maximum that message) or otherwise SHOULD be with a maximum
delay of F_MAXJITTER. A node MAY modify the jitter delay of F_MAXJITTER. A router MAY modify the jitter
applied to a message in order to more efficiently applied to a message in order to more efficiently
combine messages in packets, as long as the maximum combine messages in packets, as long as the maximum
jitter is not exceeded. jitter is not exceeded.
8. Packets and Messages 8. Packets and Messages
Nodes using OLSRv2 exchange information through messages. One or The packet and message format used by OLSRv2 is defined in [RFC5444].
more messages sent by a node at the same time SHOULD be combined into Except as otherwise noted, options defined in [RFC5444] may be freely
a single packet. These messages may have originated at the sending used, in particular alternative formats defined by packet, message,
node, or have originated at another node and are forwarded by the Address Block and TLV flags.
sending node. Messages with different originating nodes MAY be
combined in the same packet. Messages from other protocols defined
using [packetbb] MAY be combined in the same packet.
The packet and message format used by OLSRv2 is defined in
[packetbb], where:
o OLSRv2 packets MAY include packet TLVs, however OLSRv2 itself does
not specify any packet TLVs.
o All references in this specification to TLVs that do not indicate OLSRv2 defines and owns the TC Message Type. OLSRv2 also modifies
a type extension, assume Type Extension == 0. TLVs in processed HELLO messages (owned by [NHDP]) by adding TLVs to these messages
messages with a type extension which is neither zero as so when sent over OLSRv2 interfaces, and processes these HELLO messages,
assumed, nor a specifically indicated non-zero type extension, are subsequent to their processing by NHDP. Extensions to OLSRv2 MAY
ignored. define additional Message Types to be handled similarly to TC
messages.
Other options defined in [packetbb] may be freely used, in particular Routers using OLSRv2 exchange information through messages. One or
any other values of <pkt-flags>, <msg-flags>, <addr-flags> or <tlv- more messages sent by a router at the same time SHOULD be combined
flags> consistent with their specifications. into a single packet. These messages may have originated at the
sending router, or have originated at another router and are
forwarded by the sending router. Messages with different originating
routers MAY be combined for transmission within the same packet.
Messages from other protocols defined using [RFC5444] MAY be combined
for transmission within the same packet.
The remainder of this section defines, within the framework of The remainder of this section defines, within the framework of
[packetbb], message types and TLVs specific to OLSRv2. [RFC5444], Message Types and TLVs specific to OLSRv2. All references
in this specification to TLVs that do not indicate a type extension,
assume Type Extension = 0. TLVs in processed messages with a type
extension which is neither zero as so assumed, nor a specifically
indicated non-zero type extension, are ignored.
8.1. HELLO Messages 8.1. HELLO Messages
A HELLO message in OLSRv2 is generated as specified in [nhdp]. A HELLO message in OLSRv2 is generated as specified in [NHDP]. In
Additionally, an OLSRv2 node: addition, an OLSRv2 router MUST be able to modify such messages,
prior to these being sent on an OLSRv2 interface, so that such HELLO
messages:
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 that: interface addresses that:
* are included in the HELLO message associated with a TLV with * are included in the HELLO message associated with a TLV with
Type == LINK_STATUS and Value == SYMMETRIC; AND Type = LINK_STATUS and Value = SYMMETRIC; AND
* are included in a Neighbor Tuple with N_mpr == true.
If there is more than one copy of such an address in the HELLO * are included in a Neighbor Tuple with N_mpr = true.
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 == MPR_WILLING, indicating the o MAY include a message TLV with Type := MPR_WILLING, indicating the
node's willingness to be selected as an MPR. router's willingness to be selected as an MPR.
An OLSRv2 router MUST also be able to process any HELLO message
received on an OLSRv2 interface, subsequent to the processing
specified in [NHDP].
8.1.1. HELLO Message TLVs 8.1.1. HELLO Message TLVs
In a HELLO message, a node MUST include an MPR_WILLING message TLV as In a HELLO message, a router MUST include an MPR_WILLING Message TLV
specified in Table 1, unless WILLINGNESS == WILL_DEFAULT (in which as specified in Table 1, unless WILLINGNESS = WILL_DEFAULT (in which
case it MAY be included). A node MUST NOT include more than one case it MAY be included). A router MUST NOT include more than one
MPR_WILLING message TLV. MPR_WILLING Message TLV.
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| MPR_WILLING | 1 octet | Node parameter WILLINGNESS; unused | | MPR_WILLING | 1 octet | Router parameter WILLINGNESS; unused |
| | | bits (based on the maximum | | | | bits (based on the maximum |
| | | willingness value WILL_ALWAYS) are | | | | willingness value WILL_ALWAYS) are |
| | | RESERVED and SHOULD be set to zero. | | | | RESERVED and SHOULD be set to zero. |
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
Table 1 Table 1
If a node does not advertise an MPR_WILLING TLV in a HELLO message, If a router does not advertise an MPR_WILLING TLV in a HELLO message,
then the node MUST be assumed to have WILLINGNESS equal to then the router MUST be assumed to have WILLINGNESS equal to
WILL_DEFAULT. 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 router MAY include MPR Address Block TLV(s) as
specified in Table 2. specified in Table 2.
+------+--------------+-------+ +------+--------------+-------+
| Type | Value Length | Value | | Type | Value Length | Value |
+------+--------------+-------+ +------+--------------+-------+
| MPR | 0 octets | None. | | MPR | 0 octets | 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 [packetbb]. Message Header, as specified in [RFC5444].
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
contains either a VALIDITY_TIME or an INTERVAL_TIME TLV indicating contains a TLV with either Type = VALIDITY_TIME or Type =
more than one time value according to distance. INTERVAL_TIME indicating 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 (for complete and incomplete TC messages, Section 8.2.1 (for complete and incomplete TC messages,
respectively). respectively).
o A message TLV with Type == VALIDITY_TIME, as specified in o A Message TLV with Type := VALIDITY_TIME, as specified in
[timetlv]. The options included in [timetlv] for representing [timetlv]. The options included in [timetlv] for representing
zero and infinite 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 router's interface addresses. These MUST be included
the message's address blocks, unless: in the message's Address Blocks, unless:
* the node has a single interface, with a single interface * the router 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 router'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, and MAY be omitted from the message's originator address, and MAY be omitted from the
message's address blocks. 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 router's interface addresses.
o If the TC message is complete, all addresses in the Advertised o If the TC message is complete, all addresses in the Advertised
Address Set and all addresses in the Local Attached Network Set, Address Set and all addresses in the Local Attached Network Set,
the latter (only) with associated GATEWAY address block TLV(s), as the latter (only) with associated GATEWAY Address Block 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-flags>, as
defined in [packetbb], cleared ('0').
A TC message MAY contain: A TC message MAY contain:
o If the TC message is incomplete, any addresses in the Advertised o If the TC message is incomplete, any addresses in the Advertised
Address Set and any addresses in the Local Attached Network Set, Address Set and any addresses in the Local Attached Network Set,
the latter (only) with associated GATEWAY address block TLV(s), as the latter (only) with associated GATEWAY Address Block TLV(s), as
specified in Section 8.2.2. specified in Section 8.2.2.
o A message TLV with Type == INTERVAL_TIME, as specified in o A Message TLV with Type := INTERVAL_TIME, as specified in
[timetlv]. The options included in [timetlv] for representing [timetlv]. The options included in [timetlv] for representing
zero and infinite times MUST NOT be used. 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 router 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, according to whether the TC message is Type Extension = INCOMPLETE, according to whether the TC message is
complete or incomplete. complete or incomplete.
+--------------+--------------+-------------------------------------+ +--------------+--------------+-------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+--------------+--------------+-------------------------------------+ +--------------+--------------+-------------------------------------+
| CONT_SEQ_NUM | 1 octet | The ANSN contained in the | | CONT_SEQ_NUM | 2 octets | The ANSN contained in the |
| | | Advertised Neighbor Set. | | | | Advertised 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 router MAY include GATEWAY Address Block TLV(s) as
specified in Table 4. specified in Table 4.
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
| GATEWAY | 1 octet | Number of hops to attached network. | | GATEWAY | 1 octet | Number of hops to attached network. |
+---------+--------------+-------------------------------------+ +---------+--------------+-------------------------------------+
Table 4 Table 4
GATEWAY address block TLV(s) MUST be associated with all attached GATEWAY Address Block TLV(s) MUST be associated with all attached
network addresses, and MUST NOT be associated with any other network addresses, and MUST NOT be associated with any other
addresses. addresses.
9. HELLO Message Generation 9. HELLO Message Generation
An OLSRv2 HELLO message is composed and generated as defined in An OLSRv2 HELLO message is composed and generated as defined in
[nhdp], with the following additions: [NHDP], with the following additions:
o A message TLV with Type == MPR_WILLING and Value == the node o A Message TLV with Type := MPR_WILLING and Value := WILLINGNESS
parameter WILLINGNESS MUST be included, unless WILLINGNESS == MUST be included, unless WILLINGNESS = WILL_DEFAULT (in which case
WILL_DEFAULT (in which case it MAY be included). 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
and is of an MPR (i.e. the address is in the 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),
true), an address block TLV with Type == MPR MUST be included. that address (including a different copy of that address, in the
This TLV MUST be associated with the same copy of the address as same or a different Address Block) MUST be associated with an
is the TLV with Type == LINK_STATUS. Address Block TLV with Type := MPR.
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),
true), an address block TLV with Type == MPR MUST NOT be that address (including different copies of that address, in the
associated with any copy of this address. same or different Address Blocks) MUST NOT be associated with an
Address Block TLV with Type := MPR.
o An additional HELLO message MAY be sent when the node's set of o An additional HELLO message MAY be sent when the router's set of
MPRs changes, in addition to the cases specified in [nhdp], and MPRs changes, in addition to the cases specified in [NHDP], and
subject to the same constraints. subject to the same constraints.
9.1. HELLO Message: Transmission 9.1. HELLO Message: Transmission
HELLO messages are included in packets as specified in [packetbb]. HELLO messages are included in packets as specified in [RFC5444].
These 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 All HELLO message processing, including determination of whether a
[nhdp], the node MUST identify the Neighbor Tuple which was created message is invalid, considers only TLVs with Type Extension = 0.
or updated by the processing specified in [nhdp] (the "current TLVs with any other type extension are ignored. All references to,
Neighbor Tuple") and update N_willingness as described in for example, a TLV with Type = MPR_WILLING refer to a TLV with Type =
Section 10.1 and N_mpr_selector as described in Section 10.2. MPR_WILLING and Type Extension = 0.
Following these, the node MUST also perform the processing defined in
Section 10.3. In addition to the reasons specified in [NHDP], a HELLO message MUST
NOT:
o Have more than one TLV with Type = MPR_WILLING in its Message TLV
Block, where TLVs have different Values.
o Contain any address associated with a TLV with Type = MPR, where
that address (including a different copy of that address, in the
same or a different Address Block) which is not also associated
with the single value SYMMETRIC by a TLV with Type = LINK_STATUS
or Type = OTHER_NEIGHB.
Such a HELLO message MAY be discarded before processing. If it is
not then all TLVs with the type(s) for which an error was indicated
MUST be ignored (treated as not present) in the following processing.
HELLO messages are first processed as specified in [NHDP]. The
router MUST identify the Neighbor Tuple corresponding to the
originator of the HELLO message (the "current Neighbor Tuple") and
update its N_willingness as described in Section 10.1 and its
N_mpr_selector as described in Section 10.2. Following these, the
router 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 =
MPR_WILLING then N_willingness is set to the value of that TLV; MPR_WILLING then N_willingness := the value of that TLV;
2. Otherwise, N_willingness is set to WILL_DEFAULT. 2. Otherwise, N_willingness := 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 any of its local OLSRv2 interface addresses with 1. If a router finds any of its local OLSRv2 interface addresses
an associated TLV with Type == MPR in the HELLO message with an associated TLV with Type = MPR in the HELLO message
(indicating that the originator node has selected the receiving (indicating that the originator router has selected the receiving
node as an MPR), then N_mpr_selector in the current Neighbor router as an MPR) then, for the current Neighbor Tuple:
Tuple is set true.
2. Otherwise, if a node finds any of its own interface addresses * N_mpr_selector := true
with an associated TLV with Type == LINK_STATUS and Value ==
SYMMETRIC in the HELLO message, then N_mpr_selector in the 2. Otherwise, if a router finds any of its own interface addresses
current Neighbor Tuple is set false. with an associated TLV with Type = LINK_STATUS and Value =
SYMMETRIC in the HELLO message, then for the current Neighbor
Tuple:
* N_mpr_selector := 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 router 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. for that Neighbor Tuple:
2. The set of MPRs of a node MUST be recalculated if: * N_mpr_selector := false
* a Link Tuple is added with L_status == SYMMETRIC, OR; 2. The set of MPRs of a router MUST be recalculated if:
* a Link Tuple with L_status == SYMMETRIC is removed, OR; * a Link Tuple is added with L_status = SYMMETRIC, OR;
* a Link Tuple with L_status == SYMMETRIC changes to having
L_status == HEARD or L_status == LOST, OR;
* a Link Tuple with L_status == HEARD or L_status == LOST * a Link Tuple with L_status = SYMMETRIC is removed, OR;
changes to having L_status == SYMMETRIC, OR;
* a Link Tuple with L_status = SYMMETRIC changes to having
L_status = HEARD or L_status = LOST, OR;
* a Link Tuple with L_status = HEARD or L_status = LOST changes
to having L_status = SYMMETRIC, OR;
* a 2-Hop Tuple is added or removed, OR; * a 2-Hop Tuple is added or removed, OR;
* the N_willingness of a Neighbor Tuple with N_symmetric == true * the N_willingness of a Neighbor Tuple with N_symmetric = true
changes from WILL_NEVER to any other value, OR; changes from WILL_NEVER to any other value, OR;
* the N_willingness of a Neighbor Tuple with N_symmetric == true * the N_willingness of a Neighbor Tuple with N_symmetric = true
and N_mpr == true changes to WILL_NEVER from any other value, and N_mpr = true changes to WILL_NEVER from any other value,
OR; OR;
* the N_willingness of a Neighbor Tuple with N_symmetric = true
and N_mpr = false changes to WILL_ALWAYS from any other value.
* the N_willingness of a Neighbor Tuple with N_symmetric == true 3. Otherwise the set of MPRs of a router MAY be recalculated if the
and N_mpr == false changes to WILL_ALWAYS from any other N_willingness of a Neighbor Tuple with N_symmetric = true changes
value. in any other way; it SHOULD be recalculated if N_mpr = false and
this is an increase in N_willingness or if N_mpr = true and this
3. Otherwise the set of MPRs of a node MAY be recalculated if the is a decrease in N_willingness.
N_willingness of a Neighbor Tuple with N_symmetric == true
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 ==
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 router 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.
11. TC Message Generation 11. TC Message Generation
A node with one or more OLSRv2 interfaces, and with a non-empty A router 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 router with an empty Advertised
Set and empty Local Attached Network Set SHOULD also generate "empty" Neighbor Set and empty Local Attached Network Set SHOULD also
TC messages for a period A_HOLD_TIME after it last generated a non- generate "empty" TC messages for a period A_HOLD_TIME after it last
empty TC message. TC messages (non-empty and empty) are generated generated a non-empty TC message. TC messages (non-empty and empty)
according to the following: are generated 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 use the same hop limit TC_HOP_LIMIT in all TC messages, router MAY use the same hop limit TC_HOP_LIMIT in all TC
or use different values of the hop limit TC_HOP_LIMIT in TC messages, or use different values of the hop limit TC_HOP_LIMIT
messages, see Section 5.6. in TC messages, see Section 5.6.
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 [timetlv]. If all TC messages are VALIDITY_TIME, as specified in [timetlv]. If all TC messages are
sent 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 the chosen pattern of TC message hop limits, as specified in
[timetlv], these times SHOULD be appropriate multiples of [timetlv], these times SHOULD be appropriate multiples of
T_HOLD_TIME. 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 [timetlv]. If all TC messages are sent with the as specified in [timetlv]. If all TC messages are sent with the
same hop limit then this TLV MUST have Value == TC_INTERVAL. If same hop limit then this TLV MUST have Value := TC_INTERVAL. If
TC messages are sent with different hop limits, then this TLV TC messages are sent with different hop limits, then this TLV
MUST 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 [timetlv], these times SHOULD be appropriate specified in [timetlv], these times SHOULD be appropriate
multiples of TC_INTERVAL. multiples of TC_INTERVAL.
6. Unless the node has a single interface, with a single interface 6. Unless the router 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 router's originator address, the message MUST contain all of the
node's interface addresses (i.e. all addresses in an router'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 that are included in an 7. All addresses of the router's interfaces that are included in an
address block MUST be associated with a TLV with Type == LOCAL_IF Address Block MUST each be associated with a TLV with Type :=
and Value == UNSPEC_IF. LOCAL_IF and Value := UNSPEC_IF.
8. A complete message MUST include, and an incomplete message MAY 8. A complete message MUST include, and an incomplete message MAY
include, in its address blocks: include, in its Address Blocks:
1. Each A_neighbor_iface_addr from the Advertised Neighbor Set; 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 router 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 router 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 at least Alternatively a router MAY send an incomplete TC message with at
the new content in its address blocks. Note that a node cannot least the new content in its Address Blocks. Note that a router
report removal of advertised content using an incomplete TC message. cannot 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
must respect a minimum interval of TC_MIN_INTERVAL between generated router must respect a minimum interval of TC_MIN_INTERVAL between
TC messages. Sending an incomplete TC message MUST NOT cause the generated TC messages. Sending an incomplete TC message MUST NOT
interval between complete TC messages to be increased, and thus a cause the interval between complete TC messages to be increased, and
node MUST NOT send an incomplete TC message if within TC_MIN_INTERVAL thus a router MUST NOT send an incomplete TC message if within
of the next scheduled complete TC message. TC_MIN_INTERVAL 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 [RFC5148]. The change of contents MAY be jittered as described in [RFC5148]. The
values of MAXJITTER used SHOULD be: values of MAXJITTER used SHOULD be:
o TP_MAXJITTER for periodic TC message generation; o TP_MAXJITTER for periodic TC message generation;
o TT_MAXJITTER for responsive TC message generation. o TT_MAXJITTER for responsive TC message generation.
TC messages are included in packets as specified in [packetbb]. TC messages are included in packets as specified in [RFC5444]. These
These packets MAY contain other messages, including HELLO messages packets MAY contain other messages, including HELLO messages and TC
and TC messages with different originator addresses. TC messages are 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.3.
12. TC Message Processing 12. TC Message Processing
When, according to Section 7.3, a TC message is to be "processed On receiving a TC message, a router MUST first check if the message
according to its type", this means that: is invalid for processing by this router, as defined in Section 12.1.
Otherwise the receiving router MUST update its appropriate Interface
Information Base and its Router Information Base as specified in
Section 12.2.
o If any address associated with a TLV with Type == LOCAL_IF is one All TC message processing, including determination of whether a
of the receiving node's current or recently used interface message is invalid, unless otherwise noted considers only TLVs with
Type Extension = 0. TLVs with any other type extension (or any
unmentioned type extension when other type extensions are considered)
are ignored. All references to, for example, a TLV with Type =
VALIDITY_TIME refer to a TLV with Type = VALIDITY_TIME and Type
Extension = 0.
12.1. Invalid Message
A received TC message is invalid for processing by this router if any
of the following conditions are true.
o The Message Header does not include an originator address, a
message sequence number, and at least one of a hop limit and a hop
count.
o The message does not have a TLV with Type = VALIDITY_TIME in its
Message TLV Block.
o The message has more than one TLV with Type = VALIDITY_TIME in its
Message TLV Block, and these TLVs indicate different validity
times, as specified by [timetlv].
o The message has more than one TLV with Type = INTERVAL_TIME in its
Message TLV Block, and these TLVs indicate different interval
times, as specified by [timetlv].
o The message does not have a TLV with Type = CONT_SEQ_NUM and Type
Extension = COMPLETE or Type Extension = INCOMPLETE in its Message
TLV Block.
o The message has more than one TLV with Type = CONT_SEQ_NUM and
Type Extension = COMPLETE or Type Extension = INCOMPLETE in its
Message TLV Block, and these do not have the same type extension
and the same Value.
o The message has any Address Block TLV(s) with Type = LOCAL_IF and
any single value(s) which are not equal to UNSPEC_IF.
o Any address associated with a TLV with Type = LOCAL_IF is one of
the receiving router'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).
discarded.
o If the TC message does not contain exactly one message TLV with o Any address (including different copies of an address, in the same
Type == CONT_SEQ_NUM and Type Extension == COMPLETE or Type or different Address Blocks) is associated with more than one
Extension == INCOMPLETE, then the TC message MUST be discarded. single value by one or more TLV(s) with Type = GATEWAY.
o If the TC message contains a message TLV with Type == CONT_SEQ_NUM An invalid message MUST be silently discarded, without updating the
and Type Extension == COMPLETE, then processing according to router's Information Bases. A router MAY recognize additional
Section 12.1 and then according to Section 12.2 is carried out. reasons for identifying that a message is badly formed and discard
such messages.
o If the TC message contains a message TLV with Type == CONT_SEQ_NUM 12.2. Initial TC Message Processing
and Type Extension == INCOMPLETE, then only processing according
to Section 12.1 is carried out.
12.1. Initial TC Message Processing When, according to Section 7.2, a TC message is to be "processed
according to its type", this means that:
o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM
and Type Extension = COMPLETE, then processing according to
Section 12.3 and then according to Section 12.4 is carried out.
o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM
and Type Extension = INCOMPLETE, then only processing according to
Section 12.3 is carried out.
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 a VALIDITY_TIME Message TLV in
in the TC message according to the specification in [timetlv]. the TC message according to the specification in [timetlv]. All
All information in the TC message has the same validity time. 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 a 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(s) with Type == LOCAL_IF Address Blocks which have associated TLV(s) with Type = LOCAL_IF
and 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.
12.3. Initial TC Message Processing
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 Router Set is updated according to
Section 12.1.1; if the TC message is indicated as discarded in Section 12.3.1; if the TC message is indicated as discarded in
that processing then the following steps are not carried out. that processing then the following steps are not carried out.
2. The Topology Set is updated according to Section 12.1.2. 2. The Topology Set is updated according to Section 12.3.2.
3. The Attached Network Set is updated according to Section 12.1.3. 3. The Attached Network Set is updated according to Section 12.3.3.
12.1.1. Populating the Advertising Remote Node Set 12.3.1. Populating the Advertising Remote Router Set
The node MUST update its Advertising Remote Node Set as follows: The router MUST update its Advertising Remote Router Set as follows:
1. If there is an Advertising Remote Node Tuple with: 1. If there is an Advertising Remote Router Tuple with:
* AR_orig_addr == originator address; AND * AR_orig_addr = originator address; AND
* AR_seq_number > ANSN * AR_seq_number > ANSN
then the TC message MUST be discarded. then the TC message MUST be discarded.
2. Otherwise: 2. Otherwise:
1. If there is no Advertising Remote Node Tuple such that: 1. If there is no Advertising Remote Router Tuple such that:
+ AR_orig_addr == originator address; + AR_orig_addr = originator address;
then create an Advertising Remote Node Tuple with: then create an Advertising Remote Router Tuple with:
+ AR_orig_addr = originator address. + AR_orig_addr := originator address.
2. This Advertising Remote Node Tuple (existing or new, the 2. This Advertising Remote Router Tuple (existing or new, the
"current tuple") is then modified as follows: "current tuple") is then modified as follows:
+ AR_seq_number = ANSN; + AR_seq_number := ANSN;
+ AR_time = current time + validity time. + AR_time := current time + validity time.
+ AR_iface_addr_list = sending address list + AR_iface_addr_list := sending address list
3. For each other Advertising Remote Node Tuple (with a 3. For each other Advertising Remote Router Tuple (with a
different AR_orig_addr, the "other tuple") whose different AR_orig_addr, the "other tuple") whose
AR_iface_addr_list contains any address in the AR_iface_addr_list contains any address in the
AR_iface_addr_list of the current tuple: AR_iface_addr_list of the current tuple:
1. remove all Topology Tuples with T_orig_addr == 1. remove all Topology Tuples with T_orig_addr =
AR_orig_addr of the other tuple; AR_orig_addr of the other tuple;
2. remove all Attached Network Tuples with AN_orig_addr ==
2. remove all Attached Network Tuples with AN_orig_addr =
AR_orig_addr of the other tuple; AR_orig_addr of the other tuple;
3. remove the other tuple. 3. remove the other tuple.
12.1.2. Populating the Topology Set 12.3.2. Populating the Topology Set
The node MUST update its Topology Set as follows: The router MUST update its Topology Set as follows:
1. For each address (henceforth advertised address) in an address 1. For each address (henceforth advertised address) in an Address
block which does not have an associated TLV with Type == Block that does not have an associated TLV with Type = LOCAL_IF,
LOCAL_IF, or an associated TLV with Type == GATEWAY: or an associated TLV with Type = GATEWAY:
1. If there is no Topology Tuple such that: 1. If there is no Topology Tuple such that:
+ T_dest_iface_addr == advertised address; AND + T_dest_iface_addr = advertised address; AND
+ T_orig_addr == originator address + T_orig_addr = originator address
then create a new Topology Tuple with: then create a new Topology Tuple with:
+ T_dest_iface_addr = advertised address; + T_dest_iface_addr := advertised address;
+ T_orig_addr = originator address. + T_orig_addr := originator address.
2. This Topology Tuple (existing or new) is then modified as 2. This Topology Tuple (existing or new) is then modified as
follows: follows:
+ T_seq_number = ANSN; + T_seq_number := ANSN;
+ T_time := current time + validity time.
+ T_time = current time + validity time.
12.1.3. Populating the Attached Network Set 12.3.3. Populating the Attached Network Set
The node MUST update its Attached Network Set as follows: The router MUST update its Attached Network Set as follows:
1. For each address (henceforth network address) in an address block 1. For each address (henceforth network address) in an Address Block
which does not have an associated TLV with Type == LOCAL_IF, and that does not have an associated TLV with Type = LOCAL_IF, and
does have an associated TLV with Type == GATEWAY: does have an associated TLV with Type = GATEWAY:
1. If there is no Attached Network Tuple such that: 1. If there is no Attached Network Tuple such that:
+ AN_net_addr == network address; AND + AN_net_addr = network address; AND
+ AN_orig_addr == originator address + AN_orig_addr = originator address
then create a new Attached Network Tuple with: then create a new Attached Network Tuple with:
+ AN_net_addr = network address; + AN_net_addr := network address;
+ AN_orig_addr = originator address + AN_orig_addr := originator address
2. This Attached Network Tuple (existing or new) is then 2. This Attached Network Tuple (existing or new) is then
modified as follows: modified as follows:
+ AN_dist = the value of the associated GATEWAY TLV; + AN_dist := the value of the associated GATEWAY TLV;
+ AN_seq_number = ANSN; + AN_seq_number := ANSN;
+ AN_time = current time + validity time. + AN_time := current time + validity time.
12.2. Completing TC Message Processing 12.4. Completing TC Message Processing
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.4.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.4.2.
12.2.1. Purging the Topology Set 12.4.1. Purging the Topology Set
The Topology Set MUST be updated as follows: The Topology Set MUST be updated as follows:
1. Any Topology Tuples with: 1. Any Topology Tuples with:
* T_orig_addr == originator address; AND * T_orig_addr = originator address; AND
* T_seq_number < ANSN * T_seq_number < ANSN
MUST be removed. MUST be removed.
12.2.2. Purging the Attached Network Set 12.4.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
1. The Originator Set in the Local Information Base MUST be updated 1. The Originator Set in the Local Information Base MUST be updated
when the node changes originator address. If there is no when the router changes originator address. If there is no
Originator Tuple with: Originator Tuple with:
* O_orig_addr == old originator address * O_orig_addr = old originator address
then create an Originator Tuple with: then create an Originator Tuple with:
* O_orig_addr = old originator address * O_orig_addr := old originator address
This Originator Tuple (existing or new) is then modified as This Originator Tuple (existing or new) is then modified as
follows: follows:
* O_time = current time + O_HOLD_TIME * O_time := current time + O_HOLD_TIME
2. 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 Router 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 Router Tuple
removed: is 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
Tuple Router 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 + AN_orig_addr = AR_orig_addr of the Advertising Remote
Node Tuple Router Tuple
are removed. are removed.
14. Selecting MPRs 14. Selecting MPRs
Each node MUST select, from among its willing symmetric 1-hop Each router MUST select, from among its willing symmetric 1-hop
neighbors, a subset of nodes as MPRs. MPRs are used to flood control neighbors, a subset of routers as MPRs. MPRs are used to flood
messages from a node into the network, while reducing the number of control messages from a router into the network, while reducing the
retransmissions that will occur in a region. Thus, the concept of number of retransmissions that will occur in a region. Thus, the
MPR flooding is an optimization of a classical flooding mechanism. concept of MPR flooding is an optimization of a classical flooding
MPRs MAY also be used to reduce the shared topology information in mechanism. MPRs MAY also be used to reduce the shared topology
the network. Consequently, while it is not essential that the set of information in the network. Consequently, while it is not essential
MPRs is minimal, keeping the number of MPRs small ensures that the that the set of MPRs is minimal, keeping the number of MPRs small
overhead of OLSRv2 is kept at a minimum. ensures that the overhead of OLSRv2 is kept at a minimum.
A node MUST select MPRs for each of its OLSRv2 interfaces, but then A router 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, the recorded WILL_ALWAYS. Only this overall set of MPRs is relevant, the recorded
and used MPR relationship is one of nodes, not interfaces. Nodes MAY and used MPR relationship is one of routers, not interfaces. Routers
select their MPRs by any process which satisfies the conditions which MAY select their MPRs by any process which satisfies the conditions
follow. Nodes can freely interoperate whether they use the same or which follow. Routers can freely interoperate whether they use the
different MPR selection algorithms. same or different MPR selection algorithms.
For each OLSRv2 interface a node MUST select a set of MPRs. This set For each OLSRv2 interface a router MUST select a set of MPRs. This
MUST have the properties that: set MUST have the properties that:
o All of the selected MPRs are willing symmetric 1-hop neighbors, o All of the selected MPRs are willing symmetric 1-hop neighbors,
AND; AND;
o If the selecting node sends a message on that OLSRv2 interface, o If the selecting router sends a message on that OLSRv2 interface,
and that message is successfully forwarded by all of the selected and that message is successfully forwarded by all of the selected
MPRs for that interface, then all symmetric strict 2-hop neighbors MPRs for that interface, then all symmetric strict 2-hop neighbors
of the selecting node through that OLSRv2 interface will receive of the selecting router through that OLSRv2 interface will receive
that message on a symmetric link. that message on a symmetric link.
Note that it is always possible to select a valid set of MPRs. The 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) set of all willing symmetric 1-hop neighbors of a router is a
valid set of MPRs for that node. However a node SHOULD NOT select a (maximal) valid set of MPRs for that router. However a router SHOULD
symmetric 1-hop neighbor with willingness not equal to WILL_ALWAYS as NOT select a symmetric 1-hop neighbor with Willingness != WILL_ALWAYS
an MPR if there are no symmetric strict 2-hop neighbors with a 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 link to that symmetric 1-hop neighbor. Thus a router with
symmetric 1-hop neighbors with willingness WILL_ALWAYS and with no no symmetric 1-hop neighbors with willingness WILL_ALWAYS and with no
symmetric strict 2-hop neighbors SHOULD NOT select any MPRs. symmetric strict 2-hop neighbors SHOULD NOT select any MPRs.
A node MAY select its MPRs for each OLSRv2 interface independently, A router 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 router MAY select its MPRs independently from the
selection by other nodes, or it MAY, for example, give preference to MPR selection by other routers, or it MAY, for example, give
nodes that either are, or are not, already selected as MPRs by other preference to routers that either are, or are not, already selected
nodes. as MPRs by other routers.
When selecting MPRs for each OLSRv2 interface independently, this MAY When selecting MPRs for each OLSRv2 interface independently, this MAY
be done using information from the Link Set and 2-Hop Set of that be done using information from the Link Set and 2-Hop Set of that
OLSRv2 interface, and the Neighbor Set of the node (specifically the OLSRv2 interface, and the Neighbor Set of the router (specifically
N_willingness elements). the N_willingness elements).
The selection of MPRs (overall, not per OLSRv2 interface) is recorded The selection of MPRs (overall, not per OLSRv2 interface) is recorded
in the Neighbor Set of the node (using the N_mpr elements). A in the Neighbor Set of the router (using the N_mpr elements). A
selected MPR MUST be a willing symmetric 1-hop neighbor (i.e. the selected MPR MUST be a willing symmetric 1-hop neighbor (i.e. the
corresponding N_symmetric == true, and the corresponding corresponding N_symmetric = true, and the corresponding N_willingness
N_willingness is not equal to WILL_NEVER). != WILL_NEVER).
A node MUST recalculate its MPRs whenever the currently selected set A router MUST recalculate its MPRs whenever the currently selected
of MPRs does not still satisfy the required conditions. It MAY set of MPRs does not still satisfy the required conditions. It MAY
recalculate its MPRs if the current set of MPRs is still valid, but recalculate its MPRs if the current set of MPRs is still valid, but
could be more efficient. It is sufficient to recalculate a node's could be more efficient. It is sufficient to recalculate a router'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 router's Link Sets
the symmetry of any link (addition or removal of a Link Tuple with affecting the symmetry of any link (addition or removal of a Link
L_status == SYMMETRIC, or change of any L_status to or from Tuple with 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 router'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
sufficient) of any Neighbor Tuple with N_symmetric == true. sufficient) of any Neighbor Tuple with N_symmetric = true.
An algorithm that creates a set of MPRs that satisfies the required An algorithm that creates a set of MPRs that satisfies the required
conditions is given in Appendix B. conditions is given in Appendix B.
15. Populating Derived Sets 15. Populating Derived Sets
The Relay Sets and the Advertised Neighbor Set of a node are denoted The Relay Sets and the Advertised Neighbor Set of a router are
derived sets, since updates to these sets are not directly a function denoted derived sets, since updates to these sets are not directly a
of message exchanges, but rather are derived from updates to other function of message exchanges, but rather are derived from updates to
sets, in particular to the MPR selector status of other nodes other sets, in particular to the MPR selector status of other routers
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 routers which are MPR
selectors of this node. selectors of this router.
The Relay Set for an OLSRv2 interface of this node is thus created The Relay Set for an OLSRv2 interface of this router is thus created
by: 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 router contains all interface
addresses of those symmetric 1-hop neighbors to which the node addresses of those symmetric 1-hop neighbors to which the router
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. addresses in all MPR selector of this router.
The Advertised Neighbor Set for this node is thus created by: The Advertised Neighbor Set for this router 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 router is populated with Routing Tuples that
represent paths from that node to all destinations in the network. represent paths from that router to all destinations in the network.
These paths are calculated based on the Network Topology Graph, which These paths are calculated based on the Network Topology Graph, which
is constructed from information in the Information Bases, obtained is constructed from information in the Information Bases, obtained
via HELLO and TC message exchange. via HELLO and TC message exchange.
16.1. Network Topology Graph 16.1. Network Topology Graph
The Network Topology Graph is formed from information from the node's The Network Topology Graph is formed from information from the
Link Sets, Neighbor Set, Topology Set and Attached Network Set. The router's Link Sets, Neighbor Set, Topology Set and Attached Network
Network Topology Graph SHOULD also use information from the node's Set. The Network Topology Graph SHOULD also use information from the
2-Hop Sets. The Network Topology Graph forms that node's topological router's 2-Hop Sets. The Network Topology Graph forms that router's
view of the network in form of a directed graph, containing the topological view of the network in form of a directed graph,
following arcs: containing the 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 router, 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.
o 2-hop symmetric links - all arcs Y -> Z such that: o 2-hop symmetric links - all arcs Y -> Z such that:
* 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 any of the node's Link Sets, which has L_status == Tuple, in any of the router's Link Sets, which has L_status =
SYMMETRIC, AND; SYMMETRIC, AND;
* the Neighbor Tuple with Y in its N_neighbor_iface_addr_list has * the Neighbor Tuple with Y in its N_neighbor_iface_addr_list has
N_willingness not equal to WILL_NEVER, AND; N_willingness not equal to WILL_NEVER, AND;
* Z is the N2_2hop_iface_addr of a 2-Hop Tuple in the 2-Hop Set * Z is the N2_2hop_iface_addr of a 2-Hop Tuple in the 2-Hop Set
corresponding to the OLSRv2 interface of the chosen Link Set. corresponding to the OLSRv2 interface of the chosen Link Set.
o Advertised symmetric links - all arcs U -> V such that there o Advertised symmetric links - all arcs U -> V such that there
exists a Topology Tuple and a corresponding Advertising Remote exists a Topology Tuple and a corresponding Advertising Remote
Node Tuple (i.e. with AR_orig_addr == T_orig_addr) with: Router Tuple (i.e. with AR_orig_addr = T_orig_addr) with:
* U is in the AR_iface_addr_list of the Advertising Remote Node * U is in the AR_iface_addr_list of the Advertising Remote Router
Tuple, AND; Tuple, AND;
* V is the T_dest_iface_addr of the Topology Tuple. * V is the T_dest_iface_addr of the Topology Tuple.
o Symmetric 1-hop neighbor addresses - all arcs Y -> W such that: o Symmetric 1-hop neighbor addresses - all arcs Y -> W such that:
* Y is, and W is not, an address in the * Y is, and W is not, an address in the
L_neighbor_iface_addr_list of a Link Tuple, in any of the L_neighbor_iface_addr_list of a Link Tuple, in any of the
node's Link Sets, which has L_status == SYMMETRIC, AND; router's Link Sets, which has L_status = SYMMETRIC, AND;
* W and Y are included in the same N_neighbor_iface_addr_list * W and Y are included in the same N_neighbor_iface_addr_list
(i.e. the one in the Neighbor Tuple whose (i.e. the one in the Neighbor Tuple whose
N_neighbor_iface_addr_list contains the N_neighbor_iface_addr_list contains the
L_neighbor_iface_addr_list that includes Y). L_neighbor_iface_addr_list that includes Y).
o Attached network addresses - all arcs U -> T such that there o Attached network addresses - all arcs U -> T such that there
exists an Attached Network Tuple and a corresponding Advertising exists an Attached Network Tuple and a corresponding Advertising
Remote Node Tuple (i.e. with AR_orig_addr == AN_orig_addr) with: Remote Router Tuple (i.e. with AR_orig_addr = AN_orig_addr) with:
* U is in the AR_iface_addr_list of the Advertising Remote Node * U is in the AR_iface_addr_list of the Advertising Remote Router
Tuple, AND; Tuple, AND;
* T is the AN_net_addr of the Attached Network Tuple. * T is the AN_net_addr of the Attached Network Tuple.
All links in the first three cases above have a hop count of one, the All links in the first three cases above have a hop count of one, the
symmetric 1-hop neighbor addresses have a hop count of zero, and the symmetric 1-hop neighbor addresses have a hop count of zero, and the
attached network addresses have a hop count given by the appropriate attached network addresses have a hop count given by the appropriate
value of AN_dist. value of AN_dist.
16.2. Populating the Routing Set 16.2. Populating the Routing Set
The Routing Set MUST contain the shortest paths for all destinations The Routing Set MUST contain the shortest paths for all destinations
skipping to change at page 49, line 43 skipping to change at page 46, line 24
from all local OLSRv2 interfaces using the Network Topology Graph. from all local OLSRv2 interfaces using the Network Topology Graph.
This calculation MAY use any algorithm, including any means of This calculation MAY use any algorithm, including any means of
choosing between paths of equal length. choosing between paths of equal length.
Using the notation of Section 16.1, each path will have as its first Using the notation of Section 16.1, each path will have as its first
arc a local symmetric link X -> Y. There will be a path for each arc a local symmetric link X -> Y. There will be a path for each
terminating Y, Z, V, W and T which can be connected to local OLSRv2 terminating Y, Z, V, W and T which can be connected to local OLSRv2
interface address X using the indicated arcs. The corresponding interface address X using the indicated arcs. The corresponding
Routing Tuple for this path will have: Routing Tuple for this path will have:
o R_dest_addr = the terminating Y, Z, V, W or T; o R_dest_addr := the terminating Y, Z, V, W or T;
o R_next_iface_addr = the first arc's Y; o R_next_iface_addr := the first arc's Y;
o R_dist = the total hop count of the path; o R_dist := the total hop count of the path;
o R_local_iface_addr = the first arc's X. o R_local_iface_addr := the first arc's X.
An example algorithm for calculating the Routing Set of a node is An example algorithm for calculating the Routing Set of a router is
given in Appendix C. given in Appendix C.
16.3. Routing Set Updates 16.3. Routing Set Updates
The Routing Set MUST be updated when changes in the Neighborhood The Routing Set MUST be updated when changes in the Neighborhood
Information Base or the Topology Information Base indicate a change Information Base or the Topology Information Base indicate a change
of the known symmetric links and/or attached networks in the MANET. of the known symmetric links and/or attached networks in the MANET.
It is sufficient to consider only changes which affect at least one It is sufficient to consider only changes which affect at least one
of: of:
o The Link Set of any OLSRv2 interface, and to consider only Link o The Link Set of any OLSRv2 interface, and to consider only Link
Tuples which have, or just had, L_status == SYMMETRIC (including Tuples which have, or just had, L_status = SYMMETRIC (including
removal of such Link Tuples). removal of such Link Tuples).
o The Neighbor Set of the node, and to consider only Neighbor Tuples o The Neighbor Set of the router, and to consider only Neighbor
that have, or just had, N_symmetric == true. Tuples that have, or just had, N_symmetric = true.
o The 2-Hop Set of any OLSRv2 interface. o The 2-Hop Set of any OLSRv2 interface.
o The Advertising Remote Node Set of the node. o The Advertising Remote Router Set of the router.
o The Topology Set of the node. o The Topology Set of the router.
o The Attached Network Set of the node. o The Attached Network Set of the router.
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 [nhdp] 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 router
parameters as defined in [nhdp]. 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 [nhdp]) have a single value. parameters (including those defined in [NHDP]) have a single value.
Proposed values for parameters defined in [nhdp] 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
o TC_MIN_INTERVAL = TC_INTERVAL/4 o TC_MIN_INTERVAL := TC_INTERVAL/4
17.3. Advertised Information Validity Time Parameters 17.3. Advertised Information Validity Time Parameters
o T_HOLD_TIME = 3 x TC_INTERVAL o T_HOLD_TIME := 3 x TC_INTERVAL
o A_HOLD_TIME = T_HOLD_TIME o A_HOLD_TIME := T_HOLD_TIME
17.4. Received Message Validity Time Parameters 17.4. Received Message Validity Time Parameters
o RX_HOLD_TIME = 30 seconds o RX_HOLD_TIME := 30 seconds
o P_HOLD_TIME = 30 seconds o P_HOLD_TIME := 30 seconds
o F_HOLD_TIME = 30 seconds o F_HOLD_TIME := 30 seconds
17.5. Jitter Time Parameters 17.5. Jitter Time Parameters
o TP_MAXJITTER = HP_MAXJITTER o TP_MAXJITTER := HP_MAXJITTER
o TT_MAXJITTER = HT_MAXJITTER o TT_MAXJITTER := HT_MAXJITTER
o F_MAXJITTER = TT_MAXJITTER o F_MAXJITTER := TT_MAXJITTER
17.6. Hop Limit Parameter 17.6. Hop Limit Parameter
o TC_HOP_LIMIT = 255 o TC_HOP_LIMIT := 255
17.7. Willingness Parameter and Constants 17.7. Willingness Parameter and Constants
o WILLINGNESS = WILL_DEFAULT o WILLINGNESS := WILL_DEFAULT
o WILL_NEVER = 0 o WILL_NEVER := 0
o WILL_DEFAULT = 3 o WILL_DEFAULT := 3
o WILL_ALWAYS = 7 o WILL_ALWAYS := 7
18. Sequence Numbers 18. Sequence Numbers
Sequence numbers are used in OLSRv2 with the purpose of discarding Sequence numbers are used in OLSRv2 with the purpose of discarding
"old" information, i.e. messages received out of order. However with "old" information, i.e. messages received out of order. However with
a limited number of bits for representing sequence numbers, wrap- a limited number of bits for representing sequence numbers, wrap-
around (that the sequence number is incremented from the maximum around (that the sequence number is incremented from the maximum
possible value to zero) will occur. To prevent this from interfering possible value to zero) will occur. To prevent this from interfering
with the operation of OLSRv2, the following MUST be observed when with the operation of OLSRv2, the following MUST be observed when
determining the ordering of sequence numbers. determining the ordering of sequence numbers.
skipping to change at page 54, line 5 skipping to change at page 49, line 9
o S2 > S1 AND S2 - S1 > MAXVALUE/2 o S2 > S1 AND S2 - S1 > MAXVALUE/2
When sequence numbers S1 and S2 differ by MAXVALUE/2 their ordering When sequence numbers S1 and S2 differ by MAXVALUE/2 their ordering
cannot be determined. In this case, which should not occur, either cannot be determined. In this case, which should not occur, either
ordering may be assumed. ordering may be assumed.
Thus when comparing two messages, it is possible - even in the Thus when comparing two messages, it is possible - even in the
presence of wrap-around - to determine which message contains the presence of wrap-around - to determine which message contains the
most recent information. most recent information.
19. Security Considerations 19. IANA Considerations
19.1. Message Types
This specification defines one Message Type, to be allocated from the
0-223 range of the "Message Types" namespace defined in [RFC5444], as
specified in Table 5.
+------+------+-----------------------------------------+
| Name | Type | Description |
+------+------+-----------------------------------------+
| TC | TBD1 | Topology Control (MANET-wide signaling) |
+------+------+-----------------------------------------+
Table 5
19.2. Message TLV Types
This specification defines two Message TLV Types, which must be
allocated from the "Message TLV Types" namespace defined in
[RFC5444]. IANA are requested to make allocations in the 8-127 range
for these types. This will create two new type extension registries
with assignments as specified in Table 6 and Table 7. Specifications
of these TLVs are in Section 8.1.1 and Section 8.2.1.
+-------------+------+-----------+----------------------------------+
| Name | Type | Type | Description |
| | | extension | |
+-------------+------+-----------+----------------------------------+
| MPR_WILLING | TBD2 | 0 | Specifies the originating |
| | | | router's willingness to act as a |
| | | | relay and to partake in network |
| | | | formation |
| | | 1-255 | Expert Review |
+-------------+------+-----------+----------------------------------+
Table 6
+--------------+------+----------------+----------------------------+
| Name | Type | Type extension | Description |
+--------------+------+----------------+----------------------------+
| CONT_SEQ_NUM | TBD3 | 0 (COMPLETE) | Specifies a content |
| | | | sequence number for this |
| | | | complete message |
| | | 1 (INCOMPLETE) | Specifies a content |
| | | | sequence number for this |
| | | | incomplete message |
| | | 2-255 | Expert Review |
+--------------+------+----------------+----------------------------+
Table 7
Type extensions indicated as Expert Review SHOULD be allocated as
described in [RFC5444], based on Expert Review as defined in
[RFC5226].
19.3. Address Block TLV Types
This specification defines two Address Block TLV Types, which must be
allocated from the "Address Block TLV Types" namespace defined in
[RFC5444]. IANA are requested to make allocations in the 8-127 range
for these types. This will create two new type extension registries
with assignments as specified in Table 8 and Table 9. Specifications
of these TLVs are in Section 8.1.2 and Section 8.2.2.
+------+------+-----------+-----------------------------------------+
| Name | Type | Type | Description |
| | | extension | |
+------+------+-----------+-----------------------------------------+
| MPR | TBD4 | 0 | Specifies that a given address is of a |
| | | | router selected as an MPR |
| | | 1-255 | Expert Review |
+------+------+-----------+-----------------------------------------+
Table 8
+---------+------+-----------+--------------------------------------+
| Name | Type | Type | Description |
| | | extension | |
+---------+------+-----------+--------------------------------------+
| GATEWAY | TBD5 | 0 | Specifies that a given address is |
| | | | reached via a gateway on the |
| | | | originating router |
| | | 1-255 | Expert Review |
+---------+------+-----------+--------------------------------------+
Table 9
Type extensions indicated as Expert Review SHOULD be allocated as
described in [RFC5444], based on Expert Review as defined in
[RFC5226].
The Address Block TLV with Type = LOCAL_IF defined in [NHDP] is
extended to also permit inclusion of the value UNSPEC_IF = 2,
representing a local interface address which may or may not be that
on which this message is transmitted.
20. Security Considerations
Currently, OLSRv2 does not specify any special security measures. As Currently, OLSRv2 does not specify any special security measures. As
a proactive routing protocol, OLSRv2 makes a target for various a proactive routing protocol, OLSRv2 makes a target for various
attacks. The various possible vulnerabilities are discussed in this attacks. The various possible vulnerabilities are discussed in this
section. section.
19.1. Confidentiality 20.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 routers in the network. Hence, if
in an unprotected wireless network, the network topology is revealed used in an unprotected wireless network, the network topology is
to anyone who listens to OLSRv2 control messages. revealed 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 [RFC4880] or OLSRv2 control traffic messages encrypted by PGP [RFC4880] or
encrypted by some shared secret key, can be applied to ensure that encrypted by some shared secret key, can be applied to ensure that
control traffic can be read and interpreted by only those authorized control traffic can be read and interpreted by only those authorized
to do so. to do so.
19.2. Integrity 20.2. Integrity
In OLSRv2, each node is injecting topological information into the In OLSRv2, each router is injecting topological information into the
network through transmitting HELLO messages and, for some nodes, TC network through transmitting HELLO messages and, for some routers, TC
messages. If some nodes for some reason, malicious or malfunction, messages. If some routers for some reason, malicious or malfunction,
inject invalid control traffic, network integrity may be compromised. inject invalid control traffic, network integrity may be compromised.
Therefore, message authentication is recommended. Therefore, message authentication is recommended.
Different such situations may occur, for instance: Different such situations may occur, for instance:
1. a node generates TC messages, advertising links to non-neighbor 1. a router generates TC messages, advertising links to non-neighbor
nodes; routers;
2. a node generates TC messages, pretending to be another node;
3. a node generates HELLO messages, advertising non-neighbor nodes; 2. a router generates TC messages, pretending to be another router;
3. a router generates HELLO messages, advertising non-neighbor
routers;
4. a node generates HELLO messages, pretending to be another node; 4. a router generates HELLO messages, pretending to be another
router;
5. a node forwards altered control messages; 5. a router forwards altered control messages;
6. a node does not forward control messages; 6. a router does not forward control messages;
7. a node does not select multipoint relays correctly; 7. a router does not select multipoint relays correctly;
8. a node forwards broadcast control messages unaltered, but does 8. a router forwards broadcast control messages unaltered, but does
not forward unicast data traffic; not forward unicast data traffic;
9. a node "replays" previously recorded control traffic from another
node.
Authentication of the originator node for control messages (for 9. a router "replays" previously recorded control traffic from
another router.
Authentication of the originator router for control messages (for
situations 2, 4 and 5) and on the individual links announced in the situations 2, 4 and 5) and on the individual links announced in the
control messages (for situations 1 and 3) may be used as a control messages (for situations 1 and 3) may be used as a
countermeasure. However to prevent nodes from repeating old (and countermeasure. However to prevent routers from repeating old (and
correctly authenticated) information (situation 9) temporal correctly authenticated) information (situation 9) temporal
information is required, allowing a node to positively identify such information is required, allowing a router to positively identify
delayed messages. such delayed messages.
In general, digital signatures and other required security In general, digital signatures and other required security
information may be transmitted as a separate OLSRv2 message type, or information may be transmitted as a separate OLSRv2 Message Type, or
signatures and security information may be transmitted within the signatures and security information may be transmitted within the
OLSRv2 HELLO and TC messages, using the TLV mechanism. Either option OLSRv2 HELLO and TC messages, using the TLV mechanism. Either option
permits that "secured" and "unsecured" nodes can coexist in the same permits that "secured" and "unsecured" routers can coexist in the
network, if desired, same network, if desired,
Specifically, the authenticity of entire OLSRv2 control packets can Specifically, the authenticity of entire OLSRv2 control packets can
be established through employing IPsec authentication headers, be established through employing IPsec authentication headers,
whereas authenticity of individual links (situations 1 and 3) require whereas authenticity of individual links (situations 1 and 3) require
additional security information to be distributed. additional security information to be distributed.
An important consideration is that all control messages in OLSRv2 are An important consideration is that all control messages in OLSRv2 are
transmitted either to all nodes in the neighborhood (HELLO messages) transmitted either to all routers in the neighborhood (HELLO
or broadcast to all nodes in the network (TC messages). messages) or broadcast to all routers in the network (TC messages).
For example, a control message in OLSRv2 is always a point-to- For example, a control message in OLSRv2 is always a point-to-
multipoint transmission. It is therefore important that the multipoint transmission. It is therefore important that the
authentication mechanism employed permits that any receiving node can authentication mechanism employed permits that any receiving router
validate the authenticity of a message. As an analogy, given a block can validate the authenticity of a message. As an analogy, given a
of text, signed by a PGP private key, then anyone with the block of text, signed by a PGP private key, then anyone with the
corresponding public key can verify the authenticity of the text. corresponding public key can verify the authenticity of the text.
19.3. Interaction with External Routing Domains 20.3. Interaction with External Routing Domains
OLSRv2 does, through the use of TC messages, provide a basic OLSRv2 does, through the use of TC messages, provide a basic
mechanism for injecting external routing information to the OLSRv2 mechanism for injecting external routing information to the OLSRv2
domain. Appendix A also specifies that routing information can be domain. Appendix A also specifies that routing information can be
extracted from the topology table or the routing table of OLSRv2 and, extracted from the topology table or the routing table of OLSRv2 and,
potentially, injected into an external domain if the routing protocol potentially, injected into an external domain if the routing protocol
governing that domain permits. governing that domain permits.
Other than as described in Appendix A, when operating nodes Other than as described in Appendix A, when operating routers
connecting OLSRv2 to an external routing domain, care MUST be taken connecting OLSRv2 to an external routing domain, care MUST be taken
not to allow potentially insecure and untrustworthy information to be not to allow potentially insecure and untrustworthy information to be
injected from the OLSRv2 domain to external routing domains. Care injected from the OLSRv2 domain to external routing domains. Care
MUST be taken to validate the correctness of information prior to it MUST be taken to validate the correctness of information prior to it
being injected as to avoid polluting routing tables with invalid being injected as to avoid polluting routing tables with invalid
information. information.
A recommended way of extending connectivity from an existing routing A recommended way of extending connectivity from an existing routing
domain to an OLSRv2 routed MANET is to assign an IP prefix (under the domain to an OLSRv2 routed MANET is to assign an IP prefix (under the
authority of the nodes/gateways connecting the MANET with the exiting authority of the routers/gateways connecting the MANET with the
routing domain) exclusively to the OLSRv2 MANET area, and to exiting 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 routers in the existing routing domain.
20. IANA Considerations
20.1. Message Types
This specification defines one message type, to be allocated from the
0-223 range of the "Message Types" namespace defined in [packetbb],
as specified in Table 5.
+------+------+-----------------------------------------+ 21. Contributors
| Name | Type | Description |
+------+------+-----------------------------------------+
| TC | TBD1 | Topology Control (MANET-wide signaling) |
+------+------+-----------------------------------------+
Table 5 This specification is the result of the joint efforts of the
following contributors -- listed alphabetically.
20.2. Message TLV Types o Cedric Adjih, INRIA, France, <Cedric.Adjih@inria.fr>
This specification defines two message TLV types, which must be o Emmanuel Baccelli, INRIA , France, <Emmanuel.Baccelli@inria.fr>
allocated from the "Message TLV Types" namespace defined in
[packetbb]. IANA are requested to make allocations in the 8-127
range for these types. This will create two new type extension
registries with assignments as specified in Table 6 and Table 7.
Specifications of these TLVs are in Section 8.1.1 and Section 8.2.1.
+-------------+------+-----------+----------------------------------+ o Thomas Heide Clausen, LIX, France, <T.Clausen@computer.org>
| Name | Type | Type | Description |
| | | extension | |
+-------------+------+-----------+----------------------------------+
| MPR_WILLING | TBD2 | 0 | Specifies the originating node's |
| | | | willingness to act as a relay |
| | | | and to partake in network |
| | | | formation |
| | | | |
| | | 1-255 | Expert Review |
+-------------+------+-----------+----------------------------------+
Table 6 o Justin Dean, NRL, USA, <jdean@itd.nrl.navy.mil>
+--------------+------+----------------+----------------------------+
| Name | Type | Type extension | Description |
+--------------+------+----------------+----------------------------+
| CONT_SEQ_NUM | TBD3 | 0 (COMPLETE) | Specifies a content |
| | | | sequence number for this |
| | | | complete message |
| | | | |
| | | 1 (INCOMPLETE) | Specifies a content |
| | | | sequence number for this |
| | | | incomplete message |
| | | | |
| | | 2-255 | Expert Review |
+--------------+------+----------------+----------------------------+
Table 7 o Christopher Dearlove, BAE Systems, UK,
<chris.dearlove@baesystems.com>
Type extensions indicated as Expert Review SHOULD be allocated as o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com>
described in [packetbb], based on Expert Review as defined in
[RFC5226].
20.3. Address Block TLV Types o Philippe Jacquet, INRIA, France, <Philippe.Jacquet@inria.fr>
This specification defines two address block TLV types, which must be o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com>
allocated from the "Address Block TLV Types" namespace defined in
[packetbb]. IANA are requested to make allocations in the 8-127
range for these types. This will create two new type extension
registries with assignments as specified in Table 8 and Table 9.
Specifications of these TLVs are in Section 8.1.2 and Section 8.2.2.
+------+------+-----------+-----------------------------------------+ o Kenichi Mase, Niigata University, Japan, <mase@ie.niigata-u.ac.jp>
| Name | Type | Type | Description | o Ryuji Wakikawa, KEIO University, Japan, <ryuji@sfc.wide.ad.jp>
| | | extension | |
+------+------+-----------+-----------------------------------------+
| MPR | TBD4 | 0 | Specifies that a given address is of a |
| | | | node selected as an MPR |
| | | | |
| | | 1-255 | Expert Review |
+------+------+-----------+-----------------------------------------+
Table 8 22. Acknowledgments
+---------+------+-----------+--------------------------------------+
| Name | Type | Type | Description |
| | | extension | |
+---------+------+-----------+--------------------------------------+
| GATEWAY | TBD5 | 0 | Specifies that a given address is |
| | | | reached via a gateway on the |
| | | | originating node |
| | | | |
| | | 1-255 | Expert Review |
+---------+------+-----------+--------------------------------------+
Table 9 The authors would like to acknowledge the team behind OLSRv1,
specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale
Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir
Qayyum (M.A. Jinnah University, Islamabad) for their contributions.
Type extensions indicated as Expert Review SHOULD be allocated as The authors would like to gratefully acknowledge the following people
described in [packetbb], based on Expert Review as defined in for intense technical discussions, early reviews and comments on the
[RFC5226]. specification and its components (listed alphabetically): Khaldoun Al
Agha (LRI), Song-Yean Cho (LIX), Alan Cullen (BAE Systems), Louise
Lamont (CRC), Li Li (CRC), Joe Macker (NRL), Richard Ogier (SRI),
Charles E. Perkins (WiChorus), Shubhranshu Singh (Samsung AIT), and
the entire IETF MANET working group.
21. References 23. References
21.1. Normative References 23.1. Normative References
[packetbb] Clausen, T., Dean, J., Dearlove, C., and C. Adjih, [RFC5444] Clausen, T., Dean, J., Dearlove, C., and C. Adjih,
"Generalized MANET Packet/Message Format", work in "Generalized MANET Packet/Message Format", RFC 5444,
progress draft-ietf-manet-packetbb-13.txt, June 2008. February 2009.
[timetlv] Clausen, T. and C. Dearlove, "Representing multi-value [timetlv] Clausen, T. and C. Dearlove, "Representing multi-value
time in MANETs", Work In time in MANETs", Work In
Progress draft-ietf-manet-timetlv-05.txt, July 2008. Progress draft-ietf-manet-timetlv-08.txt,
September 2008.
[RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter [RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter
considerations in MANETs", RFC 5148, February 2008. considerations in MANETs", RFC 5148, February 2008.
[nhdp] Clausen, T., Dean, J., and C. Dearlove, "MANET [NHDP] Clausen, T., Dean, J., and C. Dearlove, "MANET
Neighborhood Discovery Protocol (NHDP)", work in Neighborhood Discovery Protocol (NHDP)", work in
progress draft-ietf-manet-nhdp-07.txt, July 2008. progress draft-ietf-manet-nhdp-08.txt, February 2009.
[manet-iana] Chakeres, I., "IANA Allocations for MANET Protocols", [manet-iana] Chakeres, I., "IANA Allocations for MANET Protocols",
Work In Progress draft-ietf-manet-iana-07.txt, Work In Progress draft-ietf-manet-iana-07.txt,
November 2007. November 2007.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", RFC 2119, BCP 14, March 1997. Requirement Levels", RFC 2119, BCP 14, March 1997.
[RFC5226] Narten, T. and H. Alvestrand, "Guidelines for Writing [RFC5226] Narten, T. and H. Alvestrand, "Guidelines for Writing
an IANA Considerations Section in RFCs", RFC 5226, an IANA Considerations Section in RFCs", RFC 5226,
BCP 26, May 2008. BCP 26, May 2008.
21.2. Informative References 23.2. Informative References
[RFC2501] Macker, J. and S. Corson, "Mobile Ad hoc Networking [RFC2501] Macker, J. and S. Corson, "Mobile Ad hoc Networking
(MANET): Routing Protocol Performance Issues and (MANET): Routing Protocol Performance Issues and
Evaluation Considerations", RFC 2501, January 1999. Evaluation Considerations", RFC 2501, January 1999.
[RFC3626] Clausen, T. and P. Jacquet, "The Optimized Link State [RFC3626] Clausen, T. and P. Jacquet, "The Optimized Link State
Routing Protocol", RFC 3626, October 2003. Routing Protocol", RFC 3626, October 2003.
[RFC4880] Callas, J., Donnerhacke, L., Finney, H., and R. Thayer, [RFC4880] Callas, J., Donnerhacke, L., Finney, H., and R. Thayer,
"OpenPGP message format", RFC 4880, November 2007. "OpenPGP message format", RFC 4880, November 2007.
skipping to change at page 62, line 5 skipping to change at page 55, line 36
relaying: An efficient technique for flooding in mobile relaying: An efficient technique for flooding in mobile
wireless networks.", 2001. wireless networks.", 2001.
[FSR] Pei, G., Gerla, M., and T. Chen, "Fisheye state routing [FSR] Pei, G., Gerla, M., and T. Chen, "Fisheye state routing
in mobile ad hoc networks", 2000. in mobile ad hoc networks", 2000.
[FSLS] Santivanez, C., Ramanathan, R., and I. Stavrakakis, [FSLS] Santivanez, C., Ramanathan, R., and I. Stavrakakis,
"Making link-state routing scale for ad hoc networks", "Making link-state routing scale for ad hoc networks",
2000. 2000.
Appendix A. Node Configuration Appendix A. Router Configuration
OLSRv2 does not make any assumption about node addresses, other than OLSRv2 does not make any assumption about router addresses, other
that each node is assumed to have at least one unique and routable IP than that each router is assumed to have at least one unique and
address for each interface that it has which participates in the routable IP address for each interface that it has which participates
MANET. in the 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 routers/gateways connecting the MANET with the
domain) exclusively to the OLSRv2 area, and to configure the gateways routing domain) exclusively to the OLSRv2 area, and to configure the
statically to advertise routes to that IP sequence to nodes in the gateways statically to advertise routes to that IP sequence to
existing routing domain. routers in the 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. (As noted in Section 14 a node MAY improve on this, by interfaces. (As noted in Section 14 a router MAY improve on this, by
coordination between OLSRv2 interfaces.) A node's MPRs are recorded coordination between OLSRv2 interfaces.) A router's MPRs are
using the element N_mpr in Neighbor Tuples. 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 router to select its MPRs:
1. Set N_mpr = false in all Neighbor Tuples; 1. Set N_mpr := false in all Neighbor Tuples;
2. For each Neighbor Tuple with N_symmetric == true and 2. For each Neighbor Tuple with N_symmetric = true and N_willingness
N_willingness == WILL_ALWAYS, set N_mpr = true; = 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 router, use the algorithm in
Appendix B.2. Note that this sets N_mpr = true for some Neighbor Appendix B.2. Note that this sets N_mpr := true for some
Tuples, these nodes are already selected as MPRs when using the Neighbor Tuples, these routers are already selected as MPRs when
algorithm for following OLSRv2 interfaces. using the algorithm for following OLSRv2 interfaces.
4. OPTIONALLY, consider each selected MPR in turn, and if the set of 4. OPTIONALLY, consider each selected MPR in turn, and if the set of
selected MPRs without that node still satisfies the necessary selected MPRs without that router still satisfies the necessary
conditions, for all OLSRv2 interfaces, then that node MAY be conditions, for all OLSRv2 interfaces, then that router MAY be
removed from the set of MPRs. This process MAY be repeated until removed from the set of MPRs. This process MAY be repeated until
no MPRs are removed. Nodes MAY be considered in order of no MPRs are removed. Routers MAY be considered in order of
increasing N_willingness. increasing N_willingness.
Symmetric 1-hop neighbor nodes with N_willingness == WILL_NEVER MUST Symmetric 1-hop neighbor routers with N_willingness = WILL_NEVER MUST
NOT be selected as MPRs, and MUST be ignored in the following NOT be selected as MPRs, and MUST be ignored in the following
algorithm, as MUST be symmetric 2-hop neighbor nodes which are also algorithm, as MUST be symmetric 2-hop neighbor routers which are also
symmetric 1-hop neighbor nodes (i.e. when considering 2-Hop Tuples, symmetric 1-hop neighbor routers (i.e. when considering 2-Hop Tuples,
ignore any 2-Hop Tuples whose N2_2hop_iface_addr is in the ignore any 2-Hop Tuples whose N2_2hop_iface_addr is in the
N_neighbor_iface_addr_list of any Neighbor Tuple, or whose N_neighbor_iface_addr_list of any Neighbor Tuple, or whose
N2_neighbor_iface_addr_list is included in the N2_neighbor_iface_addr_list is included in the
N_neighbor_iface_addr_list of any Neighbor Tuple with N_willingness N_neighbor_iface_addr_list of any Neighbor Tuple with N_willingness =
== WILL_NEVER). WILL_NEVER).
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 router with a
symmetric link to a node in N(I); this MAY be restricted to symmetric link to a router in N(I); this MAY be restricted to
considering only information received over I (in which case N2(I) considering only information received over I (in which case N2(I)
is the set of N2_2hop_iface_addr in 2-Hop Tuples in the 2-Hop Set is the set of N2_2hop_iface_addr in 2-Hop Tuples in the 2-Hop Set
for OLSRv2 interface I). 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 router 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 router 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.
R(Y, I): - For a node Y in N(I), the number of addresses in N2(I) R(Y, I): - For a router Y in N(I), the number of addresses in N2(I)
which are connected to I via Y, but are not connected to I via any which are connected to I via Y, but are not connected to I via any
node which has already been selected as an MPR. router which has already been selected as an MPR.
B.2. MPR Selection Algorithm for each OLSRv2 Interface B.2. MPR Selection Algorithm for each OLSRv2 Interface
When selecting MPRs for the OLSRv2 interface I: When selecting MPRs for the OLSRv2 interface I:
1. For each address A in N2(I) for which there is only one node Y in 1. For each address A in N2(I) for which there is only one router Y
N(I) such that A is connected to I via Y, select that node Y as in N(I) such that A is connected to I via Y, select that router Y
an MPR (i.e. set N_mpr = true in the Neighbor Tuple corresponding as an MPR (i.e. set N_mpr := true in the Neighbor Tuple
to Y). corresponding to Y).
2. While there exists any node Y in N(I) with R(Y, I) > 0: 2. While there exists any router Y in N(I) with R(Y, I) > 0:
1. Select a node Y in N(I) with R(Y, I) > 0 in the following 1. Select a router Y in N(I) with R(Y, I) > 0 in the following
order of priority: order of priority:
+ greatest N_willingness in the Neighbor Tuple corresponding + greatest N_willingness in the Neighbor Tuple corresponding
to Y, THEN; to Y, THEN;
+ greatest R(Y, I), THEN; + greatest R(Y, I), THEN;
+ greatest D(Y, I), THEN; + greatest D(Y, I), THEN;
+ N_mpr_selector is equal to true, if possible, THEN; + N_mpr_selector is equal to true, if possible, THEN;
+ any choice. + any choice.
2. Select Y as an MPR (i.e. set N_mpr = true in the Neighbor 2. Select Y as an MPR (i.e. set N_mpr := true in the Neighbor
Tuple corresponding to Y). Tuple corresponding to Y).
Appendix C. Example Algorithm for Calculating the Routing Set Appendix C. Example Algorithm for Calculating the Routing Set
The following procedure is given as an example for calculating the The following procedure is given as an example for calculating the
Routing Set using a variation of Dijkstra's algorithm. First all Routing Set using a variation of Dijkstra's algorithm. First all
Routing Tuples are removed, and then the procedures in the following Routing Tuples are removed, and then the procedures in the following
sections are applied in turn. sections are applied in turn.
C.1. Add Local Symmetric Links C.1. Add Local Symmetric Links
1. For each Local Interface Tuple in the Local Interface Set: 1. For each Local Interface Tuple:
1. For each address A in I_local_iface_addr_list: 1. Select an address (the "local address") in
I_local_iface_addr_list.
1. For each Link Tuple in the Link Set for this local 2. For each Link Tuple for this local interface with L_status =
interface, with L_status == SYMMETRIC: SYMMETRIC:
1. For each address, B, in that Link Tuple's 1. For each address (the "current address") in
L_neighbor_iface_addr_list, add a new Routing Tuple L_neighbor_iface_addr_list, if there is no Routing Tuple
with: with R_dest_addr = current address, then add a Routing
Tuple with:
o R_dest_addr = B; - R_dest_addr := current address;
o R_next_iface_addr = B; - R_next_iface_addr := current address;
o R_dist = 1; - R_dist := 1;
o R_local_iface_addr = A. - R_local_iface_addr := local address.
2. For each Neighbor Tuple, for which there is an address B in 2. For each Neighbor Tuple whose N_neighbor_iface_addr_list contains
N_neighbor_iface_addr_list, for which there is a Routing Tuple the R_dest_addr of a Routing Tuple (the "previous Tuple"):
(the "previous Routing Tuple") with R_dest_addr == B:
1. For each address C in N_neighbor_iface_addr_list for which 1. For each address (the "current address") in
there is no Routing Tuple with R_dest_addr == C, add a N_neighbor_iface_addr_list, if there is no Routing Tuple with
Routing Tuple with: R_dest_addr = current address, then add a Routing Tuple with:
+ R_dest_addr = C; + R_dest_addr := current address;
+ R_next_iface_addr = B; + R_next_iface_addr := R_dest_addr of the previous Tuple;
+ R_dist = 1; + R_dist := 1;
+ R_local_iface_addr = R_local_iface_addr of the previous + R_local_iface_addr := R_local_iface_addr of the previous
Routing Tuple. Tuple.
C.2. Add Remote Symmetric Links C.2. Add Remote Symmetric Links
The following procedure, which adds Routing Tuples for destination The following procedure, which adds Routing Tuples for destination
nodes h+1 hops away, MUST be executed for each value of h, starting routers h+1 hops away, MUST be executed for each value of h, starting
with h = 1 and incrementing by 1 for each iteration. The execution with h := 1 and incrementing by 1 for each iteration. The execution
MUST stop if no new Routing Tuples are added in an iteration. MUST stop if no new Routing Tuples are added in an iteration.
1. For each Topology Tuple, if: 1. For each Topology Tuple, if:
* T_dest_iface_addr is not equal to R_dest_addr of any Routing * T_dest_iface_addr is not equal to R_dest_addr of any Routing
Tuple, AND; Tuple, AND;
* for the Advertising Remote Node Tuple with AR_orig_addr == * for the Advertising Remote Router Tuple with AR_orig_addr =
T_orig_addr, there is an address in the AR_iface_addr_list T_orig_addr, there is an address in the AR_iface_addr_list
which is equal to the R_dest_addr of a Routing Tuple (the which is equal to the R_dest_addr of a Routing Tuple (the
"previous Routing Tuple") whose R_dist == h "previous Routing Tuple") whose R_dist = h
then add a new Routing Tuple, with: then add a new Routing Tuple, with:
* R_dest_addr = T_dest_iface_addr; * R_dest_addr := T_dest_iface_addr;
* R_next_iface_addr = R_next_iface_addr of the previous Routing * R_next_iface_addr := R_next_iface_addr of the previous Routing
Tuple; Tuple;
* R_dist = h+1; * R_dist := h+1;
* 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.
More than one Topology Tuple may be usable to select the next hop More than one Topology Tuple may be usable to select the next hop
R_next_iface_addr for reaching the address R_dest_addr. Ties R_next_iface_addr for reaching the address R_dest_addr. Ties
should be broken such that nodes with greater willingness are should be broken such that routers with greater willingness are
preferred, and between nodes of equal willingness, MPR selectors preferred, and between routers of equal willingness, MPR
are preferred over non-MPR selectors. selectors are preferred over non-MPR selectors.
2. After the above iteration has completed, if h == 1, for each 2. After the above iteration has completed, if h = 1, for each 2-Hop
2-Hop Neighbor Tuple where: Neighbor Tuple where:
* N2_2hop_iface_addr is not equal to R_dest_addr of any Routing * N2_2hop_iface_addr is not equal to R_dest_addr of any Routing
Tuple, AND; Tuple, AND;
* The Neighbor Tuple whose N_neighbor_iface_addr_list contains * The Neighbor Tuple whose N_neighbor_iface_addr_list contains
N2_neighbor_iface_addr_list has N_willingness not equal to N2_neighbor_iface_addr_list has N_willingness not equal to
WILL_NEVER WILL_NEVER
select a Routing Tuple (the "previous Routing Tuple") whose select a Routing Tuple (the "previous Routing Tuple") whose
R_dest_addr is contained in N2_neighbor_iface_addr_list, and add R_dest_addr is contained in N2_neighbor_iface_addr_list, and add
a new Routing Tuple with: a new Routing Tuple with:
* R_dest_addr = N2_2hop_iface_addr; * R_dest_addr := N2_2hop_iface_addr;
* R_next_iface_addr = R_next_iface_addr of the previous Routing * R_next_iface_addr := R_next_iface_addr of the previous Routing
Tuple; Tuple;
* R_dist = 2; * R_dist := 2;
* 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.
More than one 2-Hop Neighbor Tuple may be usable to select the More than one 2-Hop Neighbor Tuple may be usable to select the
next hop R_next_iface_addr for reaching the address R_dest_addr. next hop R_next_iface_addr for reaching the address R_dest_addr.
Ties should be broken such that nodes with greater willingness Ties should be broken such that routers with greater willingness
are preferred, and between nodes of equal willingness, MPR are preferred, and between routers of equal willingness, MPR
selectors are preferred over non-MPR selectors. selectors are preferred over non-MPR selectors.
C.3. Add Attached Networks C.3. Add Attached Networks
1. For each Attached Network Tuple, if for the Advertising Remote 1. For each Attached Network Tuple, if for the Advertising Remote
Node Tuple with AR_orig_addr == AN_orig_addr, there is an address Router Tuple with AR_orig_addr = AN_orig_addr, there is an
in the AR_iface_addr_list which is equal to the R_dest_addr of a address in the AR_iface_addr_list which is equal to the
Routing Tuple (the "previous Routing Tuple"), then: R_dest_addr of a Routing Tuple (the "previous Routing Tuple"),
then:
1. If there is no Routing Tuple with R_dest_addr == AN_net_addr, 1. If there is no Routing Tuple with R_dest_addr = AN_net_addr,
then add a new Routing Tuple with: then add a new Routing Tuple with:
+ R_dest_addr = AN_net_addr; + R_dest_addr := AN_net_addr;
+ R_next_iface_addr = R_next_iface_addr of the previous + R_next_iface_addr := R_next_iface_addr of the previous
Routing Tuple; Routing Tuple;
+ 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.
2. Otherwise if the Routing Tuple with R_dest_addr == 2. Otherwise if the Routing Tuple with R_dest_addr = AN_net_addr
AN_net_addr (the "current Routing Tuple") has R_dist > (the "current Routing Tuple") has R_dist > (R_dist of the
(R_dist of the previous Routing Tuple) + AN_dist, then modify previous Routing Tuple) + AN_dist, then modify the current
the current Routing Tuple by: Routing Tuple by:
+ R_next_iface_addr = R_next_iface_addr of the previous + R_next_iface_addr := R_next_iface_addr of the previous
Routing Tuple; Routing Tuple;
+ 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 is as follows. The message has full Message
follows. The overall message length is 65 octets. Header (four bit flags field value is 15). Its four bit Message
Address Length field has value 3 and hence addresses in the message
have length four octets, here being IPv4 addresses. The overall
message length is 65 octets.
The message has flags octet value 240, and hence a complete message The message has a Message TLV Block with content length 13 octets
header. It has a message TLV block with content length 13 octets containing three TLVs. The first two TLVs are interval and validity
containing three TLVs. The first two TLVs are validity and interval
times for the message. The third TLV is the content sequence number times for the message. The third TLV is the content sequence number
TLV used to carry the 2 octet ANSN, and (with default type extension TLV used to carry the 2 octet ANSN, and (with default type extension
zero, i.e. COMPLETE) indicating that the TC message is complete. zero, i.e. COMPLETE) indicating that the TC message is complete.
Each TLV uses a TLV with flags octet value 16, indicating that it has Each TLV uses a TLV with flags octet value 16, indicating that it has
a value, but no type extension or start and stop indexes. The first a value, but no type extension or start and stop indexes. The first
two TLVs have a value length of 1 octet, the last has a value length two TLVs have a value length of 1 octet, the last has a value length
of 2 octets. 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 flags octet value 128, hence with a head section, 6 addresses, with flags octet value 128, hence with a Head section,
(with length 2 octets) but no tail section, and hence mid sections (with length 2 octets) but no Tail section, and hence Mid sections
with length two octets. The following TLV block (content length 6 with length two octets. The following TLV Block (content length 6
octets) contains a single LOCAL_IF TLV (flags octet value 48) octets) contains a single LOCAL_IF TLV (flags octet value 48)
indicating that the first three addresses (indexes 0 to 2) are indicating that the first three addresses (indexes 0 to 2) are
associated with the value (length 1 octet) UNSPEC_IF, i.e. they are associated with the value (length 1 octet) UNSPEC_IF, i.e. they are
the originating node's local interface addresses. The remaining the originating router's local interface addresses. The remaining
three addresses have no associated TLV, they are the interface three addresses have no associated TLV, they are the interface
addresses of advertised neighbors. addresses of advertised neighbors.
The second address block contains 1 address, with flags octet 176 The second Address Block contains 1 address, with flags octet 176
indicating that there is a head section (with length 2 octets), that indicating that there is a Head section (with length 2 octets), that
the tail section (length 2 octets) consists of zero valued octets the Tail section (length 2 octets) consists of zero valued octets
(not included), and that there is a single prefix length, which is (not included), and that there is a single prefix length, which is
16. The network address is thus Head.0.0/16. The following TLV 16. The network address is thus Head.0.0/16. The following TLV
block (content length 8 octets) includes one TLV that indicates that Block (content length 8 octets) includes one TLV that indicates that
the originating node is a gateway to this network, at a given number the originating router is a gateway to this network, at a given
of hops distance (value length 1 octet). The TLV flags octet value number of hops distance (value length 1 octet). The TLV flags octet
of 16 indicates that no indexes are needed. value of 16 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 |1 1 1 1 0 0 0 0|0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1| | TC |1 1 1 1 0 0 1 1|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 1 0 0 0 0| |0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1| INTERVAL_TIME |0 0 0 1 0 0 0 0|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1| Value | INTERVAL_TIME |0 0 0 1 0 0 0 0| |0 0 0 0 0 0 0 1| Value | VALIDITY_TIME |0 0 0 1 0 0 0 0|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0 0 0 0 0 1| Value | CONT_SEQ_NUM |0 0 0 1 0 0 0 0| |0 0 0 0 0 0 0 1| Value | CONT_SEQ_NUM |0 0 0 1 0 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|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|1 0 0 0 0 0 0 0|0 0 0 0 0 0 1 0| Head | |1 0 0 0 0 0 0 0|0 0 0 0 0 0 1 0| Head |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Mid | | Mid | Mid |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Mid | Mid | | Mid | Mid |
skipping to change at page 70, line 10 skipping to change at page 62, line 48
|0 0 0 0 0 1 0 0| GATEWAY |0 0 0 1 0 0 0 0|0 0 0 0 0 0 0 1| |0 0 0 0 0 1 0 0| GATEWAY |0 0 0 1 0 0 0 0|0 0 0 0 0 0 0 1|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| 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 [nhdp]. 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 router's originator address.
In each Local Attached Network Tuple: In each Local Attached Network Tuple:
o AL_net_addr MUST NOT equal any other AL_net_addr. o AL_net_addr MUST NOT equal any other AL_net_addr.
o AL_net_addr MUST NOT be in the I_local_iface_addr_list of any o AL_net_addr MUST NOT be in the I_local_iface_addr_list of any
Local Interface Tuple or be equal to the IR_local_iface_addr of Local Interface Tuple or be equal to the IR_local_iface_addr of
any Removed Interface Address Tuple. any Removed Interface Address Tuple.
o AL_dist MUST NOT be less than zero. o AL_dist MUST NOT be less than zero.
In each Link Tuple: In each Link Tuple:
o L_neighbor_iface_addr_list MUST NOT contain the AL_net_addr of any o L_neighbor_iface_addr_list MUST NOT contain the AL_net_addr of any
Local Attached Network Tuple. Local Attached Network Tuple.
o If L_status == SYMMETRIC and the Neighbor Tuple whose o If L_status = SYMMETRIC and the Neighbor Tuple whose
N_neighbor_iface_addr_list contains L_neighbor_iface_addr_list has N_neighbor_iface_addr_list contains L_neighbor_iface_addr_list has
N_mpr_selector == true, then, for each address in this N_mpr_selector = true, then, for each address in this
L_neighbor_iface_addr_list, there MUST be an equal L_neighbor_iface_addr_list, there MUST be an equal
RY_neighbor_iface_addr in the Relay Set associated with the same RY_neighbor_iface_addr in the Relay Set associated with the same
OLSRv2 interface. OLSRv2 interface.
In each Neighbor Tuple: In each Neighbor Tuple:
o N_neighbor_iface_addr_list MUST NOT contain the AL_net_addr of any o N_neighbor_iface_addr_list MUST NOT contain the AL_net_addr of any
Local Attached Network Tuple. Local Attached Network Tuple.
o If N_willingness MUST be in the range from WILL_NEVER to o If N_willingness MUST be in the range from WILL_NEVER to
WILL_ALWAYS, inclusive. WILL_ALWAYS, inclusive.
o If N_mpr == true, then N_symmetric MUST be true and N_willingness o If N_mpr = true, then N_symmetric MUST be true and N_willingness
MUST NOT equal WILL_NEVER. MUST NOT equal WILL_NEVER.
o If N_symmetric == true and N_mpr == false, then N_willingness MUST o If N_symmetric = true and N_mpr = false, then N_willingness MUST
NOT equal WILL_ALWAYS. NOT equal WILL_ALWAYS.
o If N_mpr_selector == true, then N_symmetric MUST be true. o If N_mpr_selector = true, then N_symmetric MUST be true.
o If N_mpr_selector == true, then, for each address in this o If N_mpr_selector = true, then, for each address in this
N_neighbor_iface_addr_list, there MUST be an equal N_neighbor_iface_addr_list, there MUST be an equal
A_neighbor_iface_addr in the Advertised Neighbor Set. A_neighbor_iface_addr in the Advertised Neighbor Set.
In each Lost Neighbor Tuple: In each Lost Neighbor Tuple:
o NL_neighbor_iface_addr MUST NOT equal the AL_net_addr of any Local o NL_neighbor_iface_addr MUST NOT equal the AL_net_addr of any Local
Attached Network Tuple. Attached Network Tuple.
In each 2-Hop Tuple: In each 2-Hop Tuple:
o N2_2hop_iface_addr MUST NOT equal the AL_net_addr of any Local o N2_2hop_iface_addr MUST NOT equal the AL_net_addr of any Local
Attached Network Tuple. Attached Network Tuple.
In each Received Tuple: In each Received Tuple:
o RX_orig_addr MUST NOT equal this node's originator address or any o RX_orig_addr MUST NOT equal this router's originator address or
O_orig_addr. any O_orig_addr.
o Each ordered triple (RX_type, RX_orig_addr, RX_seq_number) MUST o Each ordered triple (RX_type, RX_orig_addr, RX_seq_number) MUST
NOT equal the corresponding triple in any other Received Tuple in NOT equal the corresponding triple in any other Received Tuple in
the same Received Set. the same Received Set.
In each Processed Tuple: In each Processed Tuple:
o P_orig_addr MUST NOT equal this node's originator address or any o P_orig_addr MUST NOT equal this router's originator address or any
O_orig_addr. O_orig_addr.
o Each ordered triple (P_type, P_orig_addr, P_seq_number) MUST NOT o Each ordered triple (P_type, P_orig_addr, P_seq_number) MUST NOT
equal the corresponding triple in any other Processed Tuple. equal the corresponding triple in any other Processed Tuple.
In each Forwarded Tuple: In each Forwarded Tuple:
o F_orig_addr MUST NOT equal this node's originator address or any o F_orig_addr MUST NOT equal this router's originator address or any
O_orig_addr. O_orig_addr.
o Each ordered triple (F_type, F_orig_addr, F_seq_number) MUST NOT o Each ordered triple (F_type, F_orig_addr, F_seq_number) MUST NOT
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 the Advertised Neighbor Set: In the Advertised Neighbor Set:
o Each A_neighbor_iface_addr MUST NOT equal any other o Each A_neighbor_iface_addr MUST NOT equal any other
A_neighbor_iface_addr. A_neighbor_iface_addr.
o Each A_neighbor_iface_addr MUST be in the o Each A_neighbor_iface_addr MUST be in the
N_neighbor_iface_addr_list of a Neighbor Tuple with N_symmetric == N_neighbor_iface_addr_list of a Neighbor Tuple with N_symmetric =
true. true.
In each Advertising Remote Node Tuple: In each Advertising Remote Router Tuple:
o AR_orig_addr MUST NOT equal this node's originator address or any o AR_orig_addr MUST NOT equal this router's originator address or
O_orig_addr. any 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.
o AR_iface_addr_list MUST NOT contain any duplicated addresses. o AR_iface_addr_list MUST NOT contain any duplicated addresses.
o AR_iface_addr_list MUST NOT contain any address which is in the o AR_iface_addr_list MUST NOT contain any address which is in the
I_local_iface_addr_list of any Local Interface Tuple or be equal I_local_iface_addr_list of any Local Interface Tuple or be equal
skipping to change at page 72, line 42 skipping to change at page 65, line 34
In each Topology Tuple: In each Topology Tuple:
o T_dest_iface_addr MUST NOT be in the I_local_iface_addr_list of o T_dest_iface_addr MUST NOT be in the I_local_iface_addr_list of
any Local Interface Tuple or be equal to the IR_local_iface_addr any Local Interface Tuple or be equal to the IR_local_iface_addr
of any Removed Interface Address Tuple. of any Removed Interface Address Tuple.
o T_dest_iface_addr MUST NOT equal the AL_net_addr of any Local o T_dest_iface_addr MUST NOT equal the AL_net_addr of any Local
Attached Network Tuple. Attached Network Tuple.
o There MUST be an Advertising Remote Node Tuple with AR_orig_addr o There MUST be an Advertising Remote Router Tuple with AR_orig_addr
== T_orig_addr. = T_orig_addr.
o T_dest_iface_addr MUST NOT be in the AR_iface_addr_list of the o T_dest_iface_addr MUST NOT be in the AR_iface_addr_list of the
Advertising Remote Node Tuple with AR_orig_addr == T_orig_addr. Advertising Remote Router Tuple with AR_orig_addr = T_orig_addr.
o T_seq_number MUST NOT be greater than AR_seq_number of the o T_seq_number MUST NOT be greater than AR_seq_number of the
Advertising Remote Node Tuple with AR_orig_addr == T_orig_addr. Advertising Remote Router Tuple with AR_orig_addr = T_orig_addr.
o The ordered pair (T_dest_iface_addr, T_orig_addr) MUST NOT equal o The ordered pair (T_dest_iface_addr, T_orig_addr) MUST NOT equal
the corresponding pair in any other Topology Tuple. the corresponding pair in any other Topology Tuple.
In each Attached Network Tuple: In each Attached Network Tuple:
o AN_net_addr MUST NOT be in the I_local_iface_addr_list of any o AN_net_addr MUST NOT be in the I_local_iface_addr_list of any
Local Interface Tuple or be equal to the IR_local_iface_addr of Local Interface Tuple or be equal to the IR_local_iface_addr of
any Removed Interface Address Tuple. any Removed Interface Address Tuple.
o AN_net_addr MUST NOT equal the AL_net_addr of any Local Attached o AN_net_addr MUST NOT equal the AL_net_addr of any Local Attached
Network Tuple. Network Tuple.
o There MUST be an Advertising Remote Node Tuple with AR_orig_addr o There MUST be an Advertising Remote Router Tuple with AR_orig_addr
== AN_orig_addr. = AN_orig_addr.
o AN_seq_number MUST NOT be greater than AR_seq_number of the o AN_seq_number MUST NOT be greater than AR_seq_number of the
Advertising Remote Node Tuple with AR_orig_addr == AN_orig_addr. Advertising Remote Router Tuple with AR_orig_addr = AN_orig_addr.
o AN_dist MUST NOT be less than zero. o AN_dist MUST NOT be less than zero.
o 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. Routers transmit
messages at predetermined rates specified and bounded by message control messages at predetermined rates specified and bounded by
intervals. message intervals.
OLSRv2 employs [nhdp] 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 router
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 [nhdp]. constraints of [NHDP].
Furthermore, MPR flooding greatly reduces signaling overhead from Furthermore, MPR flooding greatly reduces signaling overhead from
from link state information dissemination in two ways. First, the from link state information dissemination in two ways. First, the
amount of link state information for a node to declare is reduced to amount of link state information for a router to declare is reduced
only contain that node's MPR selectors. This reduces the size of a to only contain that router's MPR selectors. This reduces the size
link state declaration as compared to declaring full link state of a 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 routers may not need to declare any
such information. Second, using MPR flooding, the cost of such information. Second, using MPR flooding, the cost of
distributing link state information throughout the network is greatly distributing link state information throughout the network is greatly
reduced, as compared to when using classic flooding, since only MPRs reduced, as compared to when using classic flooding, since only MPRs
need to forward link state declaration messages. In dense networks, need to forward link state declaration messages. In dense networks,
the reduction of control traffic can be of several orders of the reduction of control traffic can be of several orders of
magnitude compared to routing protocols using classical flooding magnitude compared to routing protocols using classical flooding
[MPR]. This feature naturally provides more bandwidth for useful [MPR]. This feature naturally provides more bandwidth for useful
data traffic and pushes further the frontier of congestion. data traffic and pushes further the frontier of congestion.
Since the control traffic is continuous and periodic, it keeps the Since the control traffic is continuous and periodic, it keeps the
quality of the links used in routing more stable. However, using quality of the links used in routing more stable. However, using
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.
Appendix G. Contributors
This specification is the result of the joint efforts of the
following contributors -- listed alphabetically.
o Cedric Adjih, INRIA, France, <Cedric.Adjih@inria.fr>
o Emmanuel Baccelli, INRIA , France, <Emmanuel.Baccelli@inria.fr>
o Thomas Heide Clausen, LIX, France, <T.Clausen@computer.org>
o Justin Dean, NRL, USA, <jdean@itd.nrl.navy.mil>
o Christopher Dearlove, BAE Systems, UK,
<chris.dearlove@baesystems.com>
o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com>
o Philippe Jacquet, INRIA, France, <Philippe.Jacquet@inria.fr>
o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com>
o Kenichi Mase, Niigata University, Japan, <mase@ie.niigata-u.ac.jp>
o Ryuji Wakikawa, KEIO University, Japan, <ryuji@sfc.wide.ad.jp>
Appendix H. Acknowledgements
The authors would like to acknowledge the team behind OLSRv1,
specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale
Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir
Qayyum (M.A. Jinnah University, Islamabad) for their contributions.
The authors would like to gratefully acknowledge the following people
for intense technical discussions, early reviews and comments on the
specification and its components (listed alphabetically): Khaldoun Al
Agha (LRI), Song-Yean Cho (LIX), Alan Cullen (BAE Systems), Louise
Lamont (CRC), Li Li (CRC), Joe Macker (NRL), Richard Ogier (SRI),
Charles E. Perkins (WiChorus), Shubhranshu Singh (Samsung AIT), and
the entire IETF MANET working group.
Authors' Addresses Authors' Addresses
Thomas Heide Clausen Thomas Heide Clausen
LIX, Ecole Polytechnique, France LIX, Ecole Polytechnique
Phone: +33 6 6058 9349 Phone: +33 6 6058 9349
EMail: T.Clausen@computer.org EMail: T.Clausen@computer.org
URI: http://www.ThomasClausen.org/ URI: http://www.ThomasClausen.org/
Christopher Dearlove Christopher Dearlove
BAE Systems Advanced Technology Centre BAE Systems ATC
Phone: +44 1245 242194 Phone: +44 1245 242194
EMail: chris.dearlove@baesystems.com EMail: chris.dearlove@baesystems.com
URI: http://www.baesystems.com/ URI: http://www.baesystems.com/
Philippe Jacquet Philippe Jacquet
Project Hipercom, INRIA 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
Copyright (C) The IETF Trust (2008).
This document is subject to the rights, licenses and restrictions
contained in BCP 78, and except as set forth therein, the authors
retain all their rights.
This document and the information contained herein are provided on an
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Intellectual Property
The IETF takes no position regarding the validity or scope of any
Intellectual Property Rights or other rights that might be claimed to
pertain to the implementation or use of the technology described in
this document or the extent to which any license under such rights
might or might not be available; nor does it represent that it has
made any independent effort to identify any such rights. Information
on the procedures with respect to rights in RFC documents can be
found in BCP 78 and BCP 79.
Copies of IPR disclosures made to the IETF Secretariat and any
assurances of licenses to be made available, or the result of an
attempt made to obtain a general license or permission for the use of
such proprietary rights by implementers or users of this
specification can be obtained from the IETF on-line IPR repository at
http://www.ietf.org/ipr.
The IETF invites any interested party to bring to its attention any
copyrights, patents or patent applications, or other proprietary
rights that may cover technology that may be required to implement
this standard. Please address the information to the IETF at
ietf-ipr@ietf.org.
 End of changes. 526 change blocks. 
1153 lines changed or deleted 1253 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/