draft-ietf-manet-olsrv2-10.txt   draft-ietf-manet-olsrv2-11.txt 
Mobile Ad hoc Networking (MANET) T. Clausen Mobile Ad hoc Networking (MANET) T. Clausen
Internet-Draft LIX, Ecole Polytechnique Internet-Draft LIX, Ecole Polytechnique
Intended status: Standards Track C. Dearlove Intended status: Standards Track C. Dearlove
Expires: March 29, 2010 BAE Systems ATC Expires: October 22, 2010 BAE Systems ATC
P. Jacquet P. Jacquet
Project Hipercom, INRIA Project Hipercom, INRIA
The OLSRv2 Design Team The OLSRv2 Design Team
MANET Working Group MANET Working Group
September 25, 2009 April 20, 2010
The Optimized Link State Routing Protocol version 2 The Optimized Link State Routing Protocol version 2
draft-ietf-manet-olsrv2-10 draft-ietf-manet-olsrv2-11
Abstract
This document describes version 2 of the Optimized Link State Routing
(OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs).
Status of This Memo Status of This Memo
This Internet-Draft is submitted to IETF in full conformance with the This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79. This document may contain material provisions of BCP 78 and BCP 79.
from IETF Documents or IETF Contributions published or made publicly
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). Note that other groups may also distribute
other groups may also distribute working documents as Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at This Internet-Draft will expire on October 22, 2010.
http://www.ietf.org/ietf/1id-abstracts.txt.
The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html.
This Internet-Draft will expire on March 29, 2010.
Copyright Notice Copyright Notice
Copyright (c) 2009 IETF Trust and the persons identified as the
Copyright (c) 2010 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents in effect on the date of Provisions Relating to IETF Documents
publication of this document (http://trustee.ietf.org/license-info). (http://trustee.ietf.org/license-info) in effect on the date of
Please review these documents carefully, as they describe your rights publication of this document. Please review these documents
and restrictions with respect to this document. carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
Abstract include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
This document describes version 2 of the Optimized Link State Routing This document may contain material from IETF Documents or IETF
(OLSRv2) protocol for Mobile Ad hoc NETworks (MANETs). Contributions published or made publicly 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.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 5 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 5
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6
3. Applicability Statement . . . . . . . . . . . . . . . . . . . 8 3. Applicability Statement . . . . . . . . . . . . . . . . . . . 8
4. Protocol Overview and Functioning . . . . . . . . . . . . . . 9 4. Protocol Overview and Functioning . . . . . . . . . . . . . . 9
4.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . . 9
4.2. Routers and Interfaces . . . . . . . . . . . . . . . . . . 11 4.2. Routers and Interfaces . . . . . . . . . . . . . . . . . . 11
4.3. Information Base Overview . . . . . . . . . . . . . . . . 12 4.3. Information Base Overview . . . . . . . . . . . . . . . . 12
4.3.1. Local Information Base . . . . . . . . . . . . . . . . 12 4.3.1. Local Information Base . . . . . . . . . . . . . . . . 12
4.3.2. Interface Information Bases . . . . . . . . . . . . . 12 4.3.2. Interface Information Bases . . . . . . . . . . . . . 13
4.3.3. Neighbor Information Base . . . . . . . . . . . . . . 13 4.3.3. Neighbor Information Base . . . . . . . . . . . . . . 13
4.3.4. Topology Information Base . . . . . . . . . . . . . . 13 4.3.4. Topology Information Base . . . . . . . . . . . . . . 13
4.3.5. Received Message Information Base . . . . . . . . . . 14 4.3.5. Received Message Information Base . . . . . . . . . . 14
4.4. Signaling Overview . . . . . . . . . . . . . . . . . . . . 15 4.4. Signaling Overview . . . . . . . . . . . . . . . . . . . . 15
4.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 16 4.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 16
5. Protocol Parameters and Constants . . . . . . . . . . . . . . 16 5. Protocol Parameters and Constants . . . . . . . . . . . . . . 16
5.1. Protocol and Port Numbers . . . . . . . . . . . . . . . . 17 5.1. Protocol and Port Numbers . . . . . . . . . . . . . . . . 17
5.2. Multicast Address . . . . . . . . . . . . . . . . . . . . 17 5.2. Multicast Address . . . . . . . . . . . . . . . . . . . . 17
5.3. Local History Times . . . . . . . . . . . . . . . . . . . 17 5.3. Local History Times . . . . . . . . . . . . . . . . . . . 17
5.4. Message Intervals . . . . . . . . . . . . . . . . . . . . 18 5.4. Message Intervals . . . . . . . . . . . . . . . . . . . . 17
5.5. Advertised Information Validity Times . . . . . . . . . . 18 5.5. Advertised Information Validity Times . . . . . . . . . . 18
5.6. Received Message Validity Times . . . . . . . . . . . . . 19 5.6. Received Message Validity Times . . . . . . . . . . . . . 19
5.7. Jitter . . . . . . . . . . . . . . . . . . . . . . . . . . 20 5.7. Jitter . . . . . . . . . . . . . . . . . . . . . . . . . . 20
5.8. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 20 5.8. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 20
5.9. Willingness . . . . . . . . . . . . . . . . . . . . . . . 21 5.9. Willingness . . . . . . . . . . . . . . . . . . . . . . . 21
5.10. Parameter Change Constraints . . . . . . . . . . . . . . . 21 5.10. Parameter Change Constraints . . . . . . . . . . . . . . . 21
6. Information Bases . . . . . . . . . . . . . . . . . . . . . . 22 6. Local Information Base . . . . . . . . . . . . . . . . . . . . 22
6.1. Local Information Base . . . . . . . . . . . . . . . . . . 23 6.1. Originator Set . . . . . . . . . . . . . . . . . . . . . . 23
6.1.1. Originator Set . . . . . . . . . . . . . . . . . . . . 23 6.2. Local Attached Network Set . . . . . . . . . . . . . . . . 23
6.1.2. Local Attached Network Set . . . . . . . . . . . . . . 24 7. Interface Information Base . . . . . . . . . . . . . . . . . . 24
6.2. Neighbor Information Base . . . . . . . . . . . . . . . . 24 8. Neighbor Information Base . . . . . . . . . . . . . . . . . . 24
6.3. Topology Information Base . . . . . . . . . . . . . . . . 25 9. Topology Information Base . . . . . . . . . . . . . . . . . . 25
6.3.1. Advertising Remote Router Set . . . . . . . . . . . . 26 9.1. Advertising Remote Router Set . . . . . . . . . . . . . . 25
6.3.2. Router Topology Set . . . . . . . . . . . . . . . . . 26 9.2. Router Topology Set . . . . . . . . . . . . . . . . . . . 26
6.3.3. Routable Address Topology Set . . . . . . . . . . . . 27 9.3. Routable Address Topology Set . . . . . . . . . . . . . . 26
6.3.4. Attached Network Set . . . . . . . . . . . . . . . . . 27 9.4. Attached Network Set . . . . . . . . . . . . . . . . . . . 27
6.3.5. Routing Set . . . . . . . . . . . . . . . . . . . . . 28 9.5. Routing Set . . . . . . . . . . . . . . . . . . . . . . . 28
6.4. Received Message Information Base . . . . . . . . . . . . 28 10. Received Message Information Base . . . . . . . . . . . . . . 28
6.4.1. Received Set . . . . . . . . . . . . . . . . . . . . . 29 10.1. Received Set . . . . . . . . . . . . . . . . . . . . . . . 28
6.4.2. Processed Set . . . . . . . . . . . . . . . . . . . . 29 10.2. Processed Set . . . . . . . . . . . . . . . . . . . . . . 29
6.4.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . 30 10.3. Forwarded Set . . . . . . . . . . . . . . . . . . . . . . 29
6.5. Corresponding Protocol Tuples . . . . . . . . . . . . . . 30 11. Updating Information Bases . . . . . . . . . . . . . . . . . . 30
7. Message Processing and Forwarding . . . . . . . . . . . . . . 31 12. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 31
7.1. Actions when Receiving a Message . . . . . . . . . . . . . 32 13. Message Processing and Forwarding . . . . . . . . . . . . . . 32
7.2. Message Considered for Processing . . . . . . . . . . . . 32 13.1. Actions when Receiving a Message . . . . . . . . . . . . . 33
7.3. Message Considered for Forwarding . . . . . . . . . . . . 33 13.2. Message Considered for Processing . . . . . . . . . . . . 33
8. Packets and Messages . . . . . . . . . . . . . . . . . . . . . 35 13.3. Message Considered for Forwarding . . . . . . . . . . . . 34
8.1. HELLO Messages . . . . . . . . . . . . . . . . . . . . . . 36 14. HELLO messages . . . . . . . . . . . . . . . . . . . . . . . . 36
8.1.1. HELLO Message TLVs . . . . . . . . . . . . . . . . . . 37 14.1. HELLO Message Generation . . . . . . . . . . . . . . . . . 36
8.1.2. HELLO Message Address Block TLVs . . . . . . . . . . . 37 14.2. HELLO Message TLVs . . . . . . . . . . . . . . . . . . . . 37
8.2. TC Messages . . . . . . . . . . . . . . . . . . . . . . . 37 14.2.1. Message TLVs . . . . . . . . . . . . . . . . . . . . . 37
8.2.1. TC Message TLVs . . . . . . . . . . . . . . . . . . . 39 14.2.2. Address Block TLVs . . . . . . . . . . . . . . . . . . 38
8.2.2. TC Message Address Block TLVs . . . . . . . . . . . . 39 14.3. HELLO Message Transmission . . . . . . . . . . . . . . . . 38
9. HELLO Message Generation . . . . . . . . . . . . . . . . . . . 40 14.4. HELLO Message Processing . . . . . . . . . . . . . . . . . 38
9.1. HELLO Message: Transmission . . . . . . . . . . . . . . . 41 14.4.1. HELLO Message Discarding . . . . . . . . . . . . . . . 38
10. HELLO Message Processing . . . . . . . . . . . . . . . . . . . 41 14.4.2. HELLO Message Usage . . . . . . . . . . . . . . . . . 39
10.1. Updating Willingness . . . . . . . . . . . . . . . . . . . 42 15. TC Messages . . . . . . . . . . . . . . . . . . . . . . . . . 40
10.2. Updating MPR Selectors . . . . . . . . . . . . . . . . . . 42 15.1. TC Message Generation . . . . . . . . . . . . . . . . . . 40
11. TC Message Generation . . . . . . . . . . . . . . . . . . . . 43 15.2. TC Message TLVs . . . . . . . . . . . . . . . . . . . . . 42
11.1. TC Message Transmission . . . . . . . . . . . . . . . . . 44 15.2.1. Message TLVs . . . . . . . . . . . . . . . . . . . . . 42
12. TC Message Processing . . . . . . . . . . . . . . . . . . . . 45 15.2.2. Address Block TLVs . . . . . . . . . . . . . . . . . . 42
12.1. Invalid Message . . . . . . . . . . . . . . . . . . . . . 45 15.3. TC Message Transmission . . . . . . . . . . . . . . . . . 43
12.2. TC Message Processing Definitions . . . . . . . . . . . . 47 15.4. TC Message Processing . . . . . . . . . . . . . . . . . . 44
12.3. Initial TC Message Processing . . . . . . . . . . . . . . 47 15.4.1. Invalid Message . . . . . . . . . . . . . . . . . . . 45
12.3.1. Populating the Advertising Remote Router Set . . . . . 48 15.4.2. TC Message Processing Definitions . . . . . . . . . . 46
12.3.2. Populating the Router Topology Set . . . . . . . . . . 48 15.4.3. Initial TC Message Processing . . . . . . . . . . . . 46
12.3.3. Populating the Routable Address Topology Set . . . . . 49 15.4.4. Completing TC Message Processing . . . . . . . . . . . 49
12.3.4. Populating the Attached Network Set . . . . . . . . . 49 16. Information Base Changes . . . . . . . . . . . . . . . . . . . 50
12.4. Completing TC Message Processing . . . . . . . . . . . . . 50 16.1. Originator Address Changes . . . . . . . . . . . . . . . . 50
12.4.1. Purging the Router Topology Set . . . . . . . . . . . 50 16.2. Neighbor State Changes . . . . . . . . . . . . . . . . . . 51
12.4.2. Purging the Routable Address Topology Set . . . . . . 50 16.3. Advertised Neighbor Changes . . . . . . . . . . . . . . . 51
12.4.3. Purging the Attached Network Set . . . . . . . . . . . 51 16.4. Advertising Remote Router Tuple Expires . . . . . . . . . 51
13. Information Base Changes . . . . . . . . . . . . . . . . . . . 51 16.5. Neighborhood Changes and MPR Updates . . . . . . . . . . . 52
13.1. Originator Address Changes . . . . . . . . . . . . . . . . 51 16.6. Routing Set Updates . . . . . . . . . . . . . . . . . . . 53
13.2. Neighbor State Changes . . . . . . . . . . . . . . . . . . 51 17. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 54
13.3. Advertised Neighbor Changes . . . . . . . . . . . . . . . 52 18. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 55
13.4. Advertising Remote Router Tuple Expires . . . . . . . . . 52 18.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 56
13.5. Neighborhood Changes and MPR Updates . . . . . . . . . . . 53 18.2. Populating the Routing Set . . . . . . . . . . . . . . . . 58
13.6. Routing Set Updates . . . . . . . . . . . . . . . . . . . 54 19. Proposed Values for Parameters and Constants . . . . . . . . . 59
14. Selecting MPRs . . . . . . . . . . . . . . . . . . . . . . . . 54 19.1. Local History Time Parameters . . . . . . . . . . . . . . 59
15. Routing Set Calculation . . . . . . . . . . . . . . . . . . . 56 19.2. Message Interval Parameters . . . . . . . . . . . . . . . 59
15.1. Network Topology Graph . . . . . . . . . . . . . . . . . . 56 19.3. Advertised Information Validity Time Parameters . . . . . 59
15.2. Populating the Routing Set . . . . . . . . . . . . . . . . 58 19.4. Received Message Validity Time Parameters . . . . . . . . 59
16. Proposed Values for Parameters and Constants . . . . . . . . . 59 19.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 59
16.1. Local History Time Parameters . . . . . . . . . . . . . . 59 19.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 59
16.2. Message Interval Parameters . . . . . . . . . . . . . . . 59 19.7. Willingness Parameter and Constants . . . . . . . . . . . 60
16.3. Advertised Information Validity Time Parameters . . . . . 59 20. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 60
16.4. Received Message Validity Time Parameters . . . . . . . . 60 21. Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . 60
16.5. Jitter Time Parameters . . . . . . . . . . . . . . . . . . 60 22. Security Considerations . . . . . . . . . . . . . . . . . . . 61
16.6. Hop Limit Parameter . . . . . . . . . . . . . . . . . . . 60 22.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 61
16.7. Willingness Parameter and Constants . . . . . . . . . . . 60 22.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 62
17. Sequence Numbers . . . . . . . . . . . . . . . . . . . . . . . 60 22.3. Interaction with External Routing Domains . . . . . . . . 63
18. Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . 61 23. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 63
19. Security Considerations . . . . . . . . . . . . . . . . . . . 62 23.1. Expert Review: Evaluation Guidelines . . . . . . . . . . . 64
19.1. Confidentiality . . . . . . . . . . . . . . . . . . . . . 62 23.2. Message Types . . . . . . . . . . . . . . . . . . . . . . 64
19.2. Integrity . . . . . . . . . . . . . . . . . . . . . . . . 62 23.3. Message-Type-specific TLV Type Registries . . . . . . . . 64
19.3. Interaction with External Routing Domains . . . . . . . . 63 23.4. Message TLV Types . . . . . . . . . . . . . . . . . . . . 65
20. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 64 23.5. Address Block TLV Types . . . . . . . . . . . . . . . . . 66
20.1. Expert Review: Evaluation Guidelines . . . . . . . . . . . 64 23.6. NBR_ADDR_TYPE Values . . . . . . . . . . . . . . . . . . . 68
20.2. Message Types . . . . . . . . . . . . . . . . . . . . . . 64 24. Contributors . . . . . . . . . . . . . . . . . . . . . . . . . 68
20.3. Message-Type-specific TLV Type Registries . . . . . . . . 64 25. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 68
20.4. Message TLV Types . . . . . . . . . . . . . . . . . . . . 65 26. References . . . . . . . . . . . . . . . . . . . . . . . . . . 69
20.5. Address Block TLV Types . . . . . . . . . . . . . . . . . 66 26.1. Normative References . . . . . . . . . . . . . . . . . . . 69
21. Contributors . . . . . . . . . . . . . . . . . . . . . . . . . 67 26.2. Informative References . . . . . . . . . . . . . . . . . . 69
22. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 68 Appendix A. Example Algorithm for Calculating MPRs . . . . . . . 70
23. References . . . . . . . . . . . . . . . . . . . . . . . . . . 68 A.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 71
23.1. Normative References . . . . . . . . . . . . . . . . . . . 68
23.2. Informative References . . . . . . . . . . . . . . . . . . 69
Appendix A. Example Algorithm for Calculating MPRs . . . . . . . 69
A.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 70
A.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 71 A.2. MPR Selection Algorithm for each OLSRv2 Interface . . . . 71
Appendix B. Example Algorithm for Calculating the Routing Set . . 71 Appendix B. Example Algorithm for Calculating the Routing Set . . 72
B.1. Local Interfaces and Neighbors . . . . . . . . . . . . . . 72 B.1. Local Interfaces and Neighbors . . . . . . . . . . . . . . 72
B.2. Add Neighbor Routers . . . . . . . . . . . . . . . . . . . 72 B.2. Add Neighbor Routers . . . . . . . . . . . . . . . . . . . 73
B.3. Add Remote Routers . . . . . . . . . . . . . . . . . . . . 73 B.3. Add Remote Routers . . . . . . . . . . . . . . . . . . . . 73
B.4. Add Neighbor Addresses . . . . . . . . . . . . . . . . . . 73 B.4. Add Neighbor Addresses . . . . . . . . . . . . . . . . . . 74
B.5. Add Remote Routable Addresses . . . . . . . . . . . . . . 74 B.5. Add Remote Routable Addresses . . . . . . . . . . . . . . 74
B.6. Add Attached Networks . . . . . . . . . . . . . . . . . . 74 B.6. Add Attached Networks . . . . . . . . . . . . . . . . . . 75
B.7. Add 2-Hop Neighbors . . . . . . . . . . . . . . . . . . . 75 B.7. Add 2-Hop Neighbors . . . . . . . . . . . . . . . . . . . 76
Appendix C. Example Message Layout . . . . . . . . . . . . . . . 76 Appendix C. TC Message Example . . . . . . . . . . . . . . . . . 76
Appendix D. Constraints . . . . . . . . . . . . . . . . . . . . . 77 Appendix D. Constraints . . . . . . . . . . . . . . . . . . . . . 78
Appendix E. Flow and Congestion Control . . . . . . . . . . . . . 81 Appendix E. Flow and Congestion Control . . . . . . . . . . . . . 82
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 OLSR (version 1) as published in [RFC3626]. Compared to
OLSRv2 retains the same basic mechanisms and algorithms, while using [RFC3626], OLSRv2 retains the same basic mechanisms and algorithms,
a more flexible and efficient signaling framework, and includes some while using a more flexible and efficient signaling framework, and
simplification of the messages being exchanged. includes some simplification of the messages being exchanged.
OLSRv2 is developed for mobile ad hoc networks. It operates as a OLSRv2 is developed for mobile ad hoc networks. It operates as a
table driven, proactive protocol, i.e. it exchanges topology table driven, proactive protocol, i.e., it exchanges topology
information with other routers in the network regularly. OLSRv2 is information with other routers in the network regularly. OLSRv2 is
an optimization of the classical link state routing protocol. Its an optimization of the classical link state routing protocol. Its
key concept is that of MultiPoint Relays (MPRs). Each router selects key concept is that of MultiPoint Relays (MPRs). Each router selects
a set of its neighbor routers (which "cover" all of its symmetrically as MPRs a set of its neighbor routers that "cover" all of its
connected 2-hop neighbor routers) as MPRs. MPRs are then used to symmetrically connected 2-hop neighbor routers. MPRs are then used
achieve both flooding reduction and topology reduction. to achieve both flooding reduction and topology reduction.
Flooding reduction is achieved by control traffic being flooded Flooding reduction is achieved by control traffic being flooded
through the network using hop by hop forwarding, but with a router through the network using hop by hop forwarding, but with a router
only needing to forward control traffic which is first received only needing to forward control traffic that is first received
directly from one of the routers which have selected it as an MPR directly from one of the routers that have selected it as an MPR (its
(its "MPR selectors"). This mechanism, denoted "MPR flooding", "MPR selectors"). This mechanism, denoted "MPR flooding", provides
provides an efficient mechanism for information distribution within an efficient mechanism for information distribution within the MANET
the MANET by reducing the number of transmissions required. by reducing the number of transmissions required.
Topology redction is achieved by a mechanism where the routers Topology reduction is achieved by assigning a special responsibility
selected as MPRs have a special responsibility when declaring link to routers selected as MPRs when declaring link state information. A
state information in the network. A sufficient requirement for sufficient requirement for OLSRv2 to provide shortest (lowest hop
OLSRv2 to provide shortest (lowest hop count) routes to all count) routes to all destinations is that routers declare link state
destinations is that routers declare link state information for their information for their MPR selectors, if any. Routers that are not
MPR selectors, if any. Routers which are not selected as MPRs need selected as MPRs need not send any link state information. Thus the
not send any link state information. Additional available link state use of MPRs allows reduction of the number and the size of link state
information may be transmitted, e.g. for redundancy. Thus the use of
MPRs allows reduction of the number and the size of link state
messages, and in the amount of link state information maintained in messages, and in the amount of link state information maintained in
each router. Based on this reduced link state information, MPRs are each router. Based on this reduced link state information, MPRs are
used as intermediate routers in multi-hop routes. used as intermediate routers in multi-hop routes.
A router 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. bidirectional, links. Therefore, selecting routes "symmetric", i.e., bidirectional, links. Therefore, selecting routes
through MPRs avoids the problems associated with data packet transfer through MPRs avoids the problems associated with data packet transfer
over unidirectional links (such as the problem of not getting link over unidirectional links (e.g., the problem of not getting link
layer acknowledgments at each hop, for link layers employing this layer acknowledgments at each hop, for link layers employing this
technique). technique).
OLSRv2 uses and extends [NHDP] and uses [RFC5444], [RFC5497] and, OLSRv2 uses and extends [NHDP] and uses [RFC5444], [RFC5497] and,
optionally, [RFC5148]. These other protocols and specifications were optionally, [RFC5148]. These other protocols and specifications were
all originally created as part of OLSRv2, but have been specified all originally created as part of OLSRv2, but have been specified
separately for wider use. separately for wider use.
OLSRv2 makes no assumptions about the underlying link layer. OLSRv2, OLSRv2 makes no assumptions about the underlying link layer. OLSRv2,
through its use of [NHDP], may use link layer information and through its use of [NHDP], may use link layer information and
notifications when available and applicable. notifications when available and applicable.
OLSRv2, as OLSRv1, inherits its concept of forwarding and relaying OLSRv2, as OLSR [RFC3626], inherits its concept of forwarding and
from HIPERLAN (a MAC layer protocol) which is standardized by ETSI relaying from HIPERLAN (a MAC layer protocol) which is standardized
[HIPERLAN], [HIPERLAN2]. by ETSI [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].
All terms introduced in [RFC5444], including "packet", "message", All terms introduced in [RFC5444], including "packet", "Packet
"Address Block", "TLV Block", and "TLV", are to be interpreted as Header", "message", "Message Header", "Message Body", "Message Type",
"message sequence number", "hop limit", "hop count", "Address Block",
"TLV Block", "TLV", "Message TLV", "Address Block TLV", "type" (of
TLV), "type extension" (of TLV), "value" (of TLV), "address",
"address prefix", and "address object" are to be interpreted as
described there. described there.
All terms introduced in [NHDP], including "interface", "MANET All terms introduced in [NHDP], including "interface", "MANET
interface", "address", "symmetric link", "symmetric 1-hop neighbor", interface", "network address", "link", "symmetric link", "1-hop
"symmetric 2-hop neighbor", "constant", "interface parameter", and neighbor", "symmetric 1-hop neighbor", "symmetric 2-hop neighbor",
"router parameter", are to be interpreted as described there. "constant", "interface parameter", "router parameter", "Information
Base", and "HELLO message" are to be interpreted as described there.
Additionally, this document uses the following terminology: Additionally, this document uses the following terminology:
Router - A MANET router which implements the protocol specified in Router - A MANET router which implements this protocol.
this document.
OLSRv2 interface - A MANET interface running this protocol. OLSRv2 interface - A MANET interface running this protocol.
Routable address - An address which may be used as the destination Routable address - A network address which may be used as the
of a packet. A router MUST be able to distinguish a routable destination of a packet. A router MUST be able to distinguish a
address from a non-routable address by direct inpsection of the routable address from a non-routable address by direct inspection
address, based on global scope address allocations by IANA and/or of the network address, based on global scope address allocations
administrative configuration. Broadcast, multicast and anycast by IANA and/or administrative configuration. Broadcast, multicast
addresses, and addresses which are limited in scope to less than and anycast addresses, and addresses which are limited in scope to
the entire MANET, MUST NOT be considered as routable addresses. less than the entire MANET, MUST NOT be considered as routable
addresses.
Originator address - An address which is unique (within the MANET) Originator address - An address which is unique (within the MANET)
to a router. A router MUST select an originator address; it MAY to a router. A router MUST select an originator address; it MAY
choose one of its interface addresses as its originator address. choose one of its interface addresses as its originator address.
If it selects a routable address then this MUST be one which this If it selects a routable address then this MUST be one which this
router will accept as destination. An originator address MUST NOT router will accept as destination. An originator address MUST NOT
have a prefix length. have a prefix length, except for when included in an Address Block
where it MAY be associated with a prefix of maximum prefix length
(e.g., if the originator address is an IPv6 address, it MUST have
either no prefix length, or have a prefix length of 128). An
originator address may be a routable or non-routable address.
Message originator address - The originator address of the router Message originator address - The originator address of the router
which created a message, as deduced from that message by its which created a message, as deduced from that message by its
recipient. The message originator address will usually be recipient. The message originator address will usually be
included in the message as its <msg-orig-addr> element as defined included in the message as its <msg-orig-addr> element as defined
in [RFC5444]. However an exceptional case in a HELLO message is in [RFC5444]. However an exceptional case in a HELLO message is
also allowed by this specification when a router only uses a also allowed by this specification, when a router only uses a
single address. All messages used in this specification, single address. For all messages used in this specification,
including HELLO messages defined in [NHDP], MUST have a message including HELLO messages defined in [NHDP], the recipient MUST be
originator address. able to deduce an originator address.
Willingness - A numerical value between WILL_NEVER and WILL_ALWAYS Willingness - A numerical value between WILL_NEVER and WILL_ALWAYS
(both inclusive), which represents the router's willingness to be (both inclusive), that represents the router's willingness to be
selected as an MPR. selected as an MPR.
Willing symmetric 1-hop neighbor - A symmetric 1-hop neighbor of Willing symmetric 1-hop neighbor - A symmetric 1-hop neighbor of
this router which has willingness not equal to WILL_NEVER. this router that has willingness not equal to WILL_NEVER.
Symmetric 1-hop neighbor through OLSRv2 interface I - A symmetric Symmetric 1-hop neighbor through OLSRv2 interface I - A symmetric
1-hop neighbor of the router via a symmetric link using OLSRv2 1-hop neighbor of the router via a symmetric link using OLSRv2
interface I of the router. interface I of the router.
Symmetric strict 2-hop neighbor - A router, X, is a symmetric strict Willing symmetric 1-hop neighbor through OLSRv2 interface I - A
2-hop neighbor of a router Y, if router X is a symmetric 2-hop willing symmetric 1-hop neighbor of the router via a symmetric
neighbor of router Y and if router X is not also a willing link using OLSRv2 interface I of the router.
symmetric 1-hop neighbor of router Y.
Symmetric strict 2-hop neighbor - A symmetric 1-hop neighbor of a
willing symmetric 1-hop neighbor that is not a symmetric 1-hop
neighbor.
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 the router which is a symmetric symmetric 1-hop neighbor of a willing symmetric 1-hop neighbor
1-hop neighbor of a willing symmetric 1-hop neighbor through through OLSRv2 interface I that is not a symmetric 1-hop neighbor
OLSRv2 interface I. The router MAY elect to consider only through OLSRv2 interface I. The router MAY elect to use only
information received over OLSRv2 interface I in making this information received over OLSRv2 interface I in making this
determination. determination.
Symmetric strict 2-hop neighborhood - The symmetric strict 2-hop
neighborhood of a router X is the set of symmetric strict 2-hop
neighbors of router X.
Multipoint relay (MPR) - A router, X, is an MPR for a router, Y, if Multipoint relay (MPR) - A router, X, is an MPR for a router, Y, if
router Y has selected router X to "re-transmit" all the broadcast router Y has indicated its selection of router X as an MPR in a
messages that it receives from router X, provided that the message recent HELLO message.
is not a duplicate, and that the hop limit field of the message is
greater than one.
MPR selector - A router, Y, is an MPR selector of router X if router MPR selector - A router, Y, is an MPR selector of router X if router
Y has selected router X as MPR. Y has selected router X as an MPR.
MPR flooding - The optimized MANET-wide information distribution MPR flooding - The optimized MANET-wide information distribution
mechanism, employed by this protocol, in which a message is mechanism, employed by this protocol, in which a message is
relayed by only a reduced subset of the routers in the network. relayed by only a reduced subset of the routers in the network.
MPR flooding is the mechanism by which flooding reduction is MPR flooding is the mechanism by which flooding reduction is
achieved. achieved.
This document employs the same notational conventions as in [RFC5444] This document employs the same notational conventions as in [RFC5444]
and [NHDP]. and [NHDP].
skipping to change at page 8, line 27 skipping to change at page 8, line 30
o Is a proactive routing protocol for mobile ad hoc networks o Is a proactive routing protocol for mobile ad hoc networks
(MANETs) [RFC2501]. (MANETs) [RFC2501].
o Is designed to work in networks with a dynamic topology, and in o Is designed to work in networks with a dynamic topology, and in
which messages may be lost, such as due to collisions in wireless which messages may be lost, such as due to collisions in wireless
networks. networks.
o Supports routers that each have one or more participating OLSRv2 o Supports routers that each have one or more participating OLSRv2
interfaces. The set of a router's interfaces may change over interfaces. The set of a router's interfaces may change over
time. Each OLSRv2 interface may have one or more addresses (which time. Each OLSRv2 interface may have one or more network
may have prefix lengths), and these may also be dynamically addresses (which may have prefix lengths), and these may also be
changing. dynamically changing.
o Enables hop-by-hop routing, i.e., each router can use its local o Enables hop-by-hop routing, i.e., each router can use its local
information provided by this protocol to route packets. information provided by this protocol to route packets.
o Continuously maintains routes to all destinations in the network, o Continuously maintains routes to all destinations in the network,
i.e., routes are instantly available and data traffic is subject i.e., routes are instantly available and data traffic is subject
to no delays due to route discovery. Consequently, no data to no delays due to route discovery. Consequently, no data
traffic buffering is required. traffic buffering is required.
o Supports routers which have non-OLSRv2 interfaces which may be o Supports routers that have non-OLSRv2 interfaces which may be
local to a router or which can serve as gateways towards other local to a router or that can serve as gateways towards other
networks. networks.
o Is optimized for large and dense networks: the larger and more o Is optimized for large and dense networks; the larger and more
dense a network, the more optimization can be achieved by using dense a network, the more optimization can be achieved by using
MPRs, compared to the classic link state algorithm. MPRs, compared to the classic link state algorithm.
o Uses the message format specified in [RFC5444]. This includes the o Uses [RFC5444] as described in its "Intended Usage" appendix and
definition of a TC Message Type, used for MANET wide signaling of by [RFC5498].
network topology information.
o Allows "external" and "internal" extensibility as enabled by o Allows "external" and "internal" extensibility as enabled by
[RFC5444]. [RFC5444].
o Uses [NHDP] for discovering each router's 1-hop and symmetric
2-hop neighbors, and extends [NHDP] by addition of MPR and
willingness information.
o Is designed to work in a completely distributed manner, and does o Is designed to work in a completely distributed manner, and does
not depend on any central entity. not depend on any central entity.
4. Protocol Overview and Functioning 4. Protocol Overview and Functioning
The objective of this protocol is for each router to, independently: The objective of this protocol is for each router to, independently:
o Identify all destinations in the network. o Identify all destinations in the network.
o Identify a sufficient subset of links in the network, in order o Identify a sufficient subset of links in the network, in order
skipping to change at page 9, line 42 skipping to change at page 9, line 41
o Independently selecting MPRs from among its symmetric 1-hop o Independently selecting MPRs from among its symmetric 1-hop
neighbors such that all symmetric 2-hop neighbors are reachable neighbors such that all symmetric 2-hop neighbors are reachable
via at least one symmetric 1-hop neighbor. An analysis and via at least one symmetric 1-hop neighbor. An analysis and
examples of MPR selection algorithms is given in [MPR], a examples of MPR selection algorithms is given in [MPR], a
suggested algorithm is included in this specification. Note that suggested algorithm is included in this specification. Note that
it is not necessary for routers to use the same algorithm in order it is not necessary for routers to use the same algorithm in order
to interoperate in the same MANET. to interoperate in the same MANET.
o Signaling its MPR selection by extending [NHDP] to include this o Signaling its MPR selection by extending [NHDP] to include this
information in outgoing HELLO messages, by the addition of MPR information in outgoing HELLO messages, by the addition of MPR
Address Block TLV(s) associated with appropriate addresses. Address Block TLV(s) associated with the appropriate network
addresses.
o Extracting its MPR selectors from received HELLO messages, using o Extracting its MPR selectors from received HELLO messages, using
the included MPR Address Block TLV(s). the included MPR Address Block TLV(s).
o Reporting its willingness to be an MPR in HELLO messages, by the o Reporting its willingness to be an MPR in HELLO messages, by the
addition on an MPR_WILLING Message TLV. The router's willingness addition on an MPR_WILLING Message TLV. The router's willingness
to be an MPR indicates how willing it is to participate in MPR to be an MPR indicates how willing it is to participate in MPR
flooding and to be an intermediate node for routing. A node can flooding and to be an intermediate node for routing. A node can
absolutely decline to perform either role. absolutely decline to perform either role, while still being able
to be a routing source or destination.
o Periodically signaling links between MPR selectors and itself o Using the message format specified in [RFC5444], specifically
throughout the MANET, by using TC (Topology Control) messages, defining a TC (Topology Control) Message Type, used to
defined in this specification. periodically signal links between MPR selectors and itself
throughout the MANET.
o Diffusing TC messages by using flooding reduction mechanism, o Allowing its TC messages, as well as HELLO messages, to be
denoted "MPR flooding": only the MPRs of a router will retransmit included in packets specified in [RFC5444], using the "manet" IP
protocol or UDP port as specified in [RFC5498].
o Diffusing TC messages by using a flooding reduction mechanism,
denoted "MPR flooding"; only the MPRs of a router will retransmit
messages received from (i.e., originated or last relayed by) that messages received from (i.e., originated or last relayed by) that
router. router.
Note that the indicated extensions to [NHDP] are of forms permitted Note that the indicated extensions to [NHDP] are of forms permitted
by that specification. by that specification.
This specification defines, in turn: This specification defines:
o Parameters and constants used by this protocol, in addition to o Parameters and constants used by this protocol, in addition to
those specified in [NHDP]. Parameters used by this protocol may, those specified in [NHDP]. Parameters used by this protocol may,
where appropriate, be specific to a given OLSRv2 interface, or to where appropriate, be specific to a given OLSRv2 interface, or to
a router. This protocol allows all parameters to be changed a router. This protocol allows all parameters to be changed
dynamically, and to be set independently for each router or each dynamically, and to be set independently for each router or each
OLSRv2 interface, as appropriate. OLSRv2 interface, as appropriate.
o Extensions to the Information Bases specified in [NHDP]. o Extensions to the Information Bases specified in [NHDP].
o Two new Information Bases: the Topology Information Base and the o Two new Information Bases: the Topology Information Base and the
Received Message Information Base. Received Message Information Base.
o A requirement for each router to have an originator address to be o A requirement for each router to have an originator address to be
included in the HELLO messages of [NHDP]. included in, or deducible from, the HELLO messages of [NHDP].
o A Message TLV, to be included in the HELLO messages of [NHDP], o A Message TLV, to be included in the HELLO messages of [NHDP],
allowing a router to indicate its willingness to be an MPR. allowing a router to indicate its willingness to be an MPR.
o An Address Block TLV, to be included in the HELLO messages of o An Address Block TLV, to be included in the HELLO messages of
[NHDP], allowing a router to signal its MPR selection. [NHDP], allowing a router to signal its MPR selection.
o The MPR flooding mechanism, including the inclusion of message o The MPR flooding mechanism, including the inclusion of message
originator address and sequence number to manage duplicate originator address and sequence number to manage duplicate
messages. messages.
o TC messages, which are used for MANET wide signaling (using MPR o TC messages, which are used for MANET wide signaling (using MPR
flooding) of selected topology (link state) information. flooding) of selected topology (link state) information.
o The specification of new Message TLVs and Address Block TLVs which o The specification of new Message TLVs and Address Block TLVs that
are used in TC messages. are used in TC messages.
o The generation of TC messages from the appropriate information in o The generation of TC messages from the appropriate information in
the Information Bases. the Information Bases.
o The updating of the Topology Information Base according to o The updating of the Topology Information Base according to
received TC messages. received TC messages.
o The response to other events, such as the expiration of o The response to other events, such as the expiration of
information in the Information Bases. information in the Information Bases.
This protocol inherits the stability of a link state algorithm and This protocol inherits the stability of a link state algorithm, and
has the advantage of having routes immediately available when needed, has the advantage of having routes immediately available when needed,
due to its proactive nature. due to its proactive nature.
This protocol only interacts with IP through routing table This protocol only interacts with IP through routing table
management, and the use of the sending IP address for IP datagrams management, and the use of the sending IP address for IP datagrams
containing OLSRv2 packets. containing OLSRv2 packets.
4.2. Routers and Interfaces 4.2. Routers and Interfaces
In order for a router to participate in a MANET, it MUST have at In order for a router to participate in a MANET, it MUST have at
least one, and possibly more, OLSRv2 interfaces. Each OLSRv2 least one, and possibly more, OLSRv2 interfaces. Each OLSRv2
interface: interface:
o Is configured with one or more addresses, as specified in [NHDP]. o Is configured with one or more network addresses, as specified in
These addresses MUST each be unique within the MANET and MUST [NHDP]. These addresses MUST each be specific to this router, and
include any address that will be used as the sending address of MUST include any address that will be used as the sending address
any IP packet sent on this OLSRv2 interface. of any IP packet sent on this OLSRv2 interface.
o Has a number of interface parameters, adding to those specified in o Has a number of interface parameters, adding to those specified in
[NHDP]. [NHDP].
o Has an Interface Information Base, extending that specified in o Has an Interface Information Base, extending that specified in
[NHDP]. [NHDP].
o Generates and processes HELLO messages according to [NHDP], o Generates and processes HELLO messages according to [NHDP],
extended as specified in Section 9 and Section 10. extended as specified in Section 14.
In addition to a set of OLSRv2 interfaces as described above, each In addition to a set of OLSRv2 interfaces as described above, each
router: router:
o May have one or more non-OLSRv2 interfaces and/or local attached o May have one or more non-OLSRv2 interfaces and/or local attached
networks which this router can accept packets destined for. All networks for which this router can accept packets. All routable
routable addresses of the router for which it is to accept packets addresses for which the router is to accept packets MUST be used
as destination MUST be used as an (OLSRv2 or non-OLSRv2) interface as an (OLSRv2 or non-OLSRv2) interface network address or as an
address or of a local attached network. address of a local attached network of the router.
o Has a number of router parameters, adding to those specified in o Has a number of router parameters, adding to those specified in
[NHDP]. [NHDP].
o Has a Local Information Base, extending that specified in [NHDP], o Has a Local Information Base, extending that specified in [NHDP],
including selection of an originator address and recording any including selection of an originator address and recording any
locally attached networks. locally attached networks.
o Has a Neighbor Information Base, extending that specified in o Has a Neighbor Information Base, extending that specified in
[NHDP] to record MPR selection and advertisement information. [NHDP] to record MPR selection and advertisement information.
o Has a Topology Information Base, recording information received in o Has a Topology Information Base, recording information received in
TC messages and derived therefrom. TC messages.
o Has a Received Message Information Base, recording information o Has a Received Message Information Base, recording information
about received messages to ensure that each TC message is only about received messages to ensure that each TC message is only
processed once, and forwarded at most once on each OLSRv2 processed once, and forwarded at most once on each OLSRv2
interface, by a router. interface, by a router.
o Generates and processes TC messages. o Generates and processes TC messages.
4.3. Information Base Overview 4.3. Information Base Overview
Each router maintains the Information Bases described in the Each router maintains the Information Bases described in the
following sections. These are used for describing the protocol in following sections. These are used for describing the protocol in
this document. An implementation of this protocol MAY maintain this this 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 offers access to this information. In particular, note that it is
not necessary to remove Tuples from Sets at the exact time indicated, not 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.
4.3.1. Local Information Base 4.3.1. Local Information Base
The Local Information Base is specified in [NHDP] and contains a The Local Information Base is specified in [NHDP], and contains a
router's local configuration. It is extended in this specification router's local configuration. It is extended in this specification
to also record an originator address and to include a router's: to also record an originator address, and to include a router's:
o Originator Set, containing addresses that were recently used as o Originator Set, containing addresses that were recently used as
this router's originator address, and is used to enable a router this router's originator address, and is used, together with the
to recognize and discard control traffic which was originated by router's current originator address, to enable a router to
the router itself. recognize and discard control traffic which was originated by the
router itself.
o Local Attached Network Set, containing addresses of networks to o Local Attached Network Set, containing network addresses of
which this router can act as a gateway, and advertises in its TC networks to which this router can act as a gateway, and advertises
messages. in its TC messages.
4.3.2. Interface Information Bases 4.3.2. Interface Information Bases
The Interface Information Bases, one for each OLSRv2 interface, are The Interface Information Bases, one for each OLSRv2 interface, are
specified in [NHDP]. In addition to the uses in [NHDP], information specified in [NHDP]. In addition to the uses in [NHDP], information
recorded in the Interface Information Bases is used for completing recorded in the Interface Information Bases is used for completing
the Routing Set. the Routing Set.
4.3.3. Neighbor Information Base 4.3.3. Neighbor Information Base
The Neighbor Information Base is specified in [NHDP], and is extended The Neighbor Information Base is specified in [NHDP], and is extended
to also record each neighbor's originator address, the willingness of to also record each neighbor's originator address, the willingness of
each neighbor to be an MPR, as well as this router's MPR each neighbor to be an MPR, as well as this router's MPR
relationships with each neighbor (whether an MPR and/or an MPR relationships with each neighbor (whether an MPR and/or an MPR
selector of that neighbor) and whether that neighbor is to be selector of that neighbor), and whether that neighbor is to be
advertised in TC messages. advertised in TC messages.
A router selects some of its symmetric 1-hop neighbors as MPRs (see A router selects some of its symmetric 1-hop neighbors as MPRs (see
Section 14). That selection is recorded in the Neighbor Set. This Section 17). That selection is recorded in the Neighbor Set. This
selection is then reported in the router's HELLO messages, extending selection is then reported in the router's HELLO messages, extending
the specification in [NHDP], by using an MPR Address Block TLV. In the specification in [NHDP], by using an MPR Address Block TLV. In
making that selection a router MUST consider its 1-hop neighbors' making that selection, a router MUST consider its 1-hop neighbors'
willingness to be an MPR, which (unless having default value) is willingness to be an MPR, which (unless having default value) is
reported using an Address Block TLV in HELLO messages and recorded in reported using an Address Block TLV in HELLO messages and recorded in
the receiving router's Neighbor Set. the receiving router's Neighbor Set.
A router also records in the Neighbor Set which symmetric 1-hop A router also records, in the Neighbor Set, which symmetric 1-hop
neighbors have selected it as an MPR (i.e. its MPR selectors). This neighbors have selected it as an MPR (i.e., its MPR selectors). This
is determined from the MPR TLVs in received HELLO messages. It also is determined from the MPR TLVs in received HELLO messages. It also
records which symmetric 1-hop neighbors that it is to advertise records which symmetric 1-hop neighbors that it is to advertise
connectivity to in its TC messages; this MUST include all of its MPR connectivity to in its TC messages; this MUST include all of its MPR
selectors. selectors.
The Neighbor Set finally records each 1-hop neighbor's originator The Neighbor Set finally records each 1-hop neighbor's originator
address, as included in its HELLO messages in an extension to [NHDP]. address, as deduced from received HELLO messages as described in
This, and other information in the Neighbor Set, including each 1-hop Section 14.4. This, and other information in the Neighbor Set,
neighbor's routable addresses, is used in advertising the selected including each 1-hop neighbor's routable addresses, is used in
symmetric 1-hop neighbors in TC messages. advertising the selected symmetric 1-hop neighbors in TC messages.
4.3.4. Topology Information Base 4.3.4. Topology Information Base
The purpose of the Topology Information Base is to record information
used, in addition to that in the Local Information Base, the
Interface Information Bases and the Neighbor Information Base, to
construct the Routing Set (which is also included in the Topology
Information Base).
This specification describes the calculation of the Routing Set based
on a Topology Graph constructed in two phases. First, a "backbone"
graph representing the routers in the MANET, and the connectivity
between them, is constructed from the Local Information Base, the
Neighbor Information Base and the Router Topology Set in the Topology
Information Base. Second, this graph is "decorated" with additional
destination addresses using the Local Information Base, and the
Routable Address Topology Set and the Attached Network Set in the
Topology Information Base.
The Topology Graph does not need to be recorded in the Topology
Information Base, it can either be constructed as required when the
Routing Set is to be changed, or need not be explicitly constructed
(as illustrated in Appendix B. An implementation MAY construct and
retain the Topology Graph if preferred.
The Topology Information Base in each router contains: The Topology Information Base in each router contains:
o An Advertising Remote Router Set, recording each other router from o An Advertising Remote Router Set, recording each other router from
which TC messages have been received. This is used in order to which TC messages have been received. This is used in order to
determine if a received TC messages contains fresh or outdated determine if a received TC message contains fresh or outdated
information; the TC message is ignored in the latter case. information; a received TC message is ignored in the latter case.
o A Router Topology Set, recording links between routers in the o A Router Topology Set, recording links between routers in the
MANET, as described by received TC messages. MANET, as described by received TC messages.
o A Routable Address Topology Set, recording routable addresses in o A Routable Address Topology Set, recording routable addresses in
the MANET (available as packet destinations) and from which other the MANET (available as packet destinations) and from which other
router these addresses can be directly reached (i.e. in a single router these routable addresses can be directly reached (i.e., in
IP hop) as reported by received TC messages. a single IP hop), as reported by received TC messages.
o An Attached Network Set, recording networks to which a remote o An Attached Network Set, recording networks to which a remote
router has advertised that it may act as a gateway. These router has advertised that it may act as a gateway. These
networks may be reached in one or more IP hops. networks may be reached in one or more IP hops.
o A Routing Set, recording routes from this router to all available o A Routing Set, recording routes from this router to all available
destinations. The IP routing table is to be updated using this destinations. The IP routing table is to be updated using this
Routing Set. (A router MAY choose to use any or all destination Routing Set. (A router MAY choose to use any or all destination
addresses in the Routing Set to update the IP routing table, this network addresses in the Routing Set to update the IP routing
selection is outside the scope of this protocol.) table, this selection is outside the scope of this protocol.)
The purpose of the Topology Information Base is to record information
used, in addition to that in the Local Information Base, the
Interface Information Bases and the Neighbor Information Base, to
construct the Routing Set (which is also included in the Topology
Information Base).
This specification describes the calculation of the Routing Set based
on a Topology Graph constructed in two phases. First, a "backbone"
graph representing the routers in the MANET, and the connectivity
between them, is constructed from the Local Information Base, the
Neighbor Information Base and the Router Topology Set. Second, this
graph is "decorated" with additional destination network addresses
using the Local Information Base, the Routable Address Topology Set
and the Attached Network Set.
The Topology Graph does not need to be recorded in the Topology
Information Base, it can either be constructed as required when the
Routing Set is to be changed, or need not be explicitly constructed
(as illustrated in Appendix B). An implementation MAY construct and
retain the Topology Graph if preferred.
4.3.5. Received Message Information Base 4.3.5. Received Message Information Base
The Received Message Information Base in each router contains: The Received Message Information Base in each router contains:
o A Received Set for each OLSRv2 interface, describing TC messages o A Received Set for each OLSRv2 interface, describing TC messages
received by this router on that OLSRv2 interface. received by this router on that OLSRv2 interface.
o A Processed Set, describing TC messages processed by this router. o A Processed Set, describing TC messages processed by this router.
o A Forwarded Set, describing TC messages forwarded by this router. o A Forwarded Set, describing TC messages forwarded by this router.
The Received Message Information Base serves the MPR flooding The Received Message Information Base serves the MPR flooding
mechanism by ensuring that received messages are forwarded at most mechanism by ensuring that received messages are forwarded at most
once by a router, and also ensures that received messages are once by a router, and also ensures that received messages are
processed exactly once by a router. processed exactly once by a router.
4.4. Signaling Overview 4.4. Signaling Overview
This protocol generates and processes HELLO messages according to This protocol generates and processes HELLO messages according to
[NHDP], extended according to Section 9 and Section 10 of this [NHDP], extended according to Section 14 of this specification to
specification to include an originator address and MPR selection include an originator address and MPR selection information.
information.
This protocol specifies a single message type, the TC message. This protocol specifies a single message type, the TC message. TC
messages are sent by their originating router proactively, at a
regular interval. This interval may be fixed, or may be dynamic, for
example it may be backed off due to congestion or network stability.
TC messages may also be sent as a response to a change in the router
itself, or its advertised 1-hop neighborhood, for example on first
being selected as an MPR.
This protocol is tolerant of unreliable transmissions of TC messages; Because TC messages are sent periodically, this protocol is tolerant
each router sends TC messages periodically, and can therefore sustain of unreliable transmissions of TC messages. Message losses may occur
a reasonable loss of some such messages. Such losses may occur more more frequently in wireless networks due to collisions or other
frequently in wireless networks due to collisions or other
transmission problems. This protocol MAY use "jitter", randomized transmission problems. This protocol MAY use "jitter", randomized
adjustments to message transmission times, to reduce the incidence of adjustments to message transmission times, to reduce the incidence of
collisions as specified in [RFC5148]. collisions, as specified in [RFC5148].
This protocol is tolerant of out of sequence delivery of TC messages This protocol is tolerant of out of sequence delivery of TC messages
due to in transit message reordering (possibly due to message due to in transit message reordering. Each router maintains an
alternative routing by flooding and message loss). Each router Advertised Neighbor Sequence Number (ANSN) that is incremented when
maintains an Advertised Neighbor Sequence Number (ANSN) which is its recorded neighbor information that is to be included in its TC
incremented when its recorded neighbor information that is to be messages changes. This ANSN is included in the router's TC messages.
included in its TC messages changes. This ANSN is included in the The recipient of a TC message can used this included ANSN to identify
router's TC messages. The recipient of a TC message can used this which of the information it has received is most recent, even if
included ANSN to identify which of the information it has received is messages have been reordered while in transit. Only the most recent
most recent, even if messages have been re-ordered while in transit. information received is used, older information received later is
Only the most recent information received is used, older information discarded.
received later is discarded.
TC messages may be "complete" or "incomplete". A complete TC message TC messages may be "complete" or "incomplete". A complete TC message
advertises all of the originating router's MPR selectors, it may also advertises all of the originating router's MPR selectors, it may also
advertise other symmetric 1-hop neighbors. Complete TC messages are advertise other symmetric 1-hop neighbors. Complete TC messages are
generated periodically (and also, optionally, in response to generated periodically (and also, optionally, in response to
neighborhood changes). Incomplete TC messages may be used to report neighborhood changes). Incomplete TC messages may be used to report
additions to advertised information without repeating unchanged additions to advertised information, without repeating unchanged
information. information.
TC messages, and HELLO messages as extended by this specification, TC messages, and HELLO messages as extended by this specification,
include an originator address for the router that created the include an originator address for the router that created the
message. A TC message reports both the originator addresses and message. A TC message reports both the originator addresses and
routable addresses of its advertised neighbors, distinguishing the routable addresses of its advertised neighbors, distinguishing the
two using a TLV for this purpose (an address may be both). two using an Address Block TLV (an address may be both routable and
an originator address). TC messages also report the originator's
TC messages also report the originator's locally attached networks. locally attached networks.
TC messages are MPR flooded throughout the MANET. A router TC messages are MPR flooded throughout the MANET. A router
retransmits a TC message only if it is received from (i.e., retransmits a TC message only if it is received from (i.e.,
originated from or was last relayed by) one of that router's MPR originated from or was last relayed by) one of that router's MPR
selectors. selectors.
Some TC messages may be MPR flooded over only part of the network, Some TC messages may be MPR flooded over only part of the network,
e.g., allowing a router to ensure that nearer routers are kept more e.g., allowing a router to ensure that nearer routers are kept more
up to date than distant routers, such as is used in Fisheye State up to date than distant routers, such as is used in Fisheye State
Routing [FSR] and Fuzzy Sighted Link State routing [FSLS]. This is Routing [FSR] and Fuzzy Sighted Link State routing [FSLS]. This is
enabled using [RFC5497]. enabled using [RFC5497].
4.5. Routing Set 4.5. Routing Set
The purpose of the Routing Set is to determine and record routes The purpose of the Routing Set is to determine and record routes
(local interface address and next hop interface address) to all (local interface network address and next hop interface network
possible routable addresses and of all destinations that are local, address) to all possible routable addresses advertised by this
i.e. within one hop, to the router (whether using routable addresses protocol, as well as of all destinations that are local, i.e., within
or not). Only symmetric links are used in such routes. one hop, to the router (whether using routable addresses or not).
Only symmetric links are used in such routes.
It is intended that the Routing Set can be used for packet routing, It is intended that the Routing Set can be used for packet routing,
by using its contents to update IP's routing tables. That update, by using its contents to update IP's routing tables. That update,
and whether any Routing Tuples are not used in IP's routing table, is and whether any Routing Tuples are not used in IP's routing table, is
outside the scope of this specification. outside the scope of this specification.
The signaling in this specification has been designed so that a The signaling in this specification has been designed so that a
"backbone" Topology Graph of routers, each identified by its "backbone" Topology Graph of routers, each identified by its
originator address, with at most one direct connection between any originator address, with at most one direct connection between any
pair of routers, can be constructed (from the Neighbor Set and the pair of routers, can be constructed (from the Neighbor Set and the
Router Topology Set) using a suitable minimum path length algorithm, Router Topology Set) using a suitable minimum path length algorithm.
and then this Topology Graph can have other addresses (routable, or This Topology Graph can, then, have other network addresses (routable
of symmetric 1-hop neighbors) added to it (using the Interface or of symmetric 1-hop neighbors) added to it (using the Interface
Information Base, the Routable Address Topology Set and the Attached Information Bases, the Routable Address Topology Set and the Attached
Network Set). Network Set).
5. Protocol Parameters and Constants 5. Protocol Parameters and Constants
The parameters and constants used in this specification are those The parameters and constants used in this specification are those
defined in [NHDP] plus those defined in this section. The separation defined in [NHDP] plus those defined in this section. The separation
in [NHDP] into interface parameters, router parameters and constants in [NHDP] into interface parameters, router parameters and constants
is also used in this specification, however all but one is also used in this specification, however all but one
(RX_HOLD_TIME) of the parameters added by this protocol are router (RX_HOLD_TIME) of the parameters added by this specification are
parameters. Parameters may be categorized as follows: router parameters.
o Local history times
o Message intervals
o Advertised information validity times
o Received message validity times
o Jitter times
o Hop limits
o Willingness
In addition, constants for particular cases of a router's willingness Parameters and constants are detailed in the following sections. As
to be an MPR are defined. These parameters and constants are for the parameters in [NHDP], parameters defined in this
detailed in the following sections. As for the parameters in [NHDP], specification may be changed dynamically by a router, and need not be
parameters defined in this document may be changed dynamically by a the same on different routers, even in the same MANET, or, for
router, and need not be the same on different routers, even in the interface parameters, on different interfaces of the same router.
same MANET, or, for interface parameters, on different interfaces of
the same router.
5.1. Protocol and Port Numbers 5.1. Protocol and Port Numbers
This protocol specifies TC messages, which are included in packets as This protocol specifies TC messages, which are included in packets as
defined by [RFC5444]. These packets may be sent either using the defined by [RFC5444]. These packets may be sent either using the
"manet" protocol number or the "manet" well-known UDP port number, as "manet" protocol number or the "manet" UDP well-known port number, as
specified in [RFC5498]. specified in [RFC5498].
TC messages and HELLO messages [NHDP] SHOULD, in a given deployment TC messages and HELLO messages [NHDP] SHOULD, in a given deployment
of this protocol, both be using the same of either of IP or UDP, in of this protocol, both be using the same of either of IP or UDP, in
order that it is possible to combine messages of both protocols into order that it is possible to combine messages of both protocols into
the same [RFC5444] packet for transmission. the same [RFC5444] packet for transmission.
5.2. Multicast Address 5.2. Multicast Address
This protocol specifies TC messages, which are included in packets as This protocol specifies TC messages, which are included in packets as
defined by [RFC5444]. These packets may be locally transmitted using defined by [RFC5444]. These packets MAY be transmitted using the
the link local multicast address "LL-MANET-Routers", as specified in link local multicast address "LL-MANET-Routers", as specified in
[RFC5498]. [RFC5498].
5.3. Local History Times 5.3. Local History Times
The following router parameter manages the time for which local The following router parameter manages the time for which local
information is retained: information is retained:
O_HOLD_TIME - is used to define the time for which a recently used O_HOLD_TIME - is used to define the time for which a recently used
and replaced originator address is used to recognize the router's and replaced originator address is used to recognize the router's
own messages. own messages.
The following constraint applies to this parameter: The following constraint applies to this parameter:
o O_HOLD_TIME >= 0 o O_HOLD_TIME >= 0
5.4. Message Intervals 5.4. Message Intervals
The following router parameters regulate TC message transmissions by The following router parameters regulate TC message transmissions by
a router. TC messages are usually sent periodically, but MAY also be a router. TC messages are usually sent periodically, but MAY also be
sent in response to changes in the router's Neighbor Set and/or Local sent in response to changes in the router's Neighbor Set and/or Local
Attached Network Set. With a larger value of the parameter Attached Network Set. In a highly dynamic network, and with a larger
TC_INTERVAL, and a smaller value of the parameter TC_MIN_INTERVAL, TC value of the parameter TC_INTERVAL and a smaller value of the
messages may more often be transmitted in response to changes in a parameter TC_MIN_INTERVAL, TC messages may be transmitted more often
highly dynamic network. However because a router has no knowledge in response to changes than periodically. However because a router
of, for example, routers remote to it (i.e. beyond 2 hops away) has no knowledge of, for example, routers remote to it (i.e., beyond
joining the network, TC messages MUST NOT be sent purely two hops away) joining the network, TC messages MUST NOT be sent
responsively. purely responsively.
TC_INTERVAL - is the maximum time between the transmission of two TC_INTERVAL - is the maximum time between the transmission of two
successive TC messages by this router. When no TC messages are successive TC messages by this router. When no TC messages are
sent in response to local network changes (by design, or because sent in response to local network changes (by design, or because
the local network is not changing) then TC messages SHOULD be sent the local network is not changing) then TC messages SHOULD be sent
at 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 router. (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 [RFC5497] are included in TC o If TLVs with Type = INTERVAL_TIME, as defined in [RFC5497], are
messages, then TC_INTERVAL MUST be representable as described in included in TC messages, then TC_INTERVAL MUST be representable as
[RFC5497]. described in [RFC5497].
5.5. Advertised Information Validity Times 5.5. Advertised Information Validity Times
The following router parameters manage the validity time of The following router parameters manage the validity time of
information 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 TLV with
VALIDITY_TIME TLV included in all TC messages sent by this router. Type = VALIDITY_TIME included in all TC messages sent by this
If a single value of parameter TC_HOP_LIMIT (see Section 5.8) is router. If a single value of parameter TC_HOP_LIMIT (see
used then this will be the only Value in that TLV. Section 5.8) is used then this will be the only value in that TLV.
A_HOLD_TIME - is the period during which TC messages are sent after A_HOLD_TIME - is the period during which TC messages are sent after
they no longer have any advertised information to report, but are they no longer have any advertised information to report, but are
sent in order to accelerate outdated information removal by other sent in order to accelerate outdated information removal by other
routers. routers.
The following constraints apply to these parameters: The following constraints apply to these parameters:
o T_HOLD_TIME > 0 o T_HOLD_TIME > 0
skipping to change at page 19, line 36 skipping to change at page 19, line 29
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
router 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 a router parameter, and is the period after receipt P_HOLD_TIME - is a router parameter, and is the period after receipt
of a message which is processed by this router for which that of a message that is processed by this router for which that
information is recorded, in order that the message is not information is recorded, in order that the message is not
processed again if received again. processed again if received again.
F_HOLD_TIME - is a router parameter, and is the period after receipt F_HOLD_TIME - is a router parameter, and is the period after receipt
of a message which is forwarded by this router for which that of a message that is forwarded by this router for which that
information is recorded, in order that the message is not information is recorded, in order that the message is not
forwarded again if received again. 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
skipping to change at page 20, line 23 skipping to change at page 20, line 19
TP_MAXJITTER - represents the value of MAXJITTER used in [RFC5148] TP_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
for periodically generated TC messages sent by this router. for periodically generated TC messages sent by this router.
TT_MAXJITTER - represents the value of MAXJITTER used in [RFC5148] TT_MAXJITTER - represents the value of MAXJITTER used in [RFC5148]
for externally triggered TC messages sent by this router. for externally triggered TC messages sent by this router.
F_MAXJITTER - represents the default value of MAXJITTER used in F_MAXJITTER - represents the default value of MAXJITTER used in
[RFC5148] for messages forwarded by this router. However before [RFC5148] for messages forwarded by this router. However before
using F_MAXJITTER a router MAY attempt to deduce a more using F_MAXJITTER a router MAY attempt to deduce a more
appropriate value of MAXJITTER, for example based on any appropriate value of MAXJITTER, for example based on any TLVs with
INTERVAL_TIME or VALIDITY_TIME TLVs contained in the message to be Type = INTERVAL_TIME or Type = VALIDITY_TIME contained in the
forwarded. message to be forwarded.
For constraints on these parameters see [RFC5148]. For constraints on these parameters see [RFC5148].
5.8. Hop Limit Parameter 5.8. 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 router. However each other router, at any messages sent by the same router. However each other router, at any
hop count distance, SHOULD see a regular pattern of TC messages, in hop count distance, SHOULD see a regular pattern of TC messages in
order that meaningful Values of INTERVAL_TIME and VALIDITY_TIME TLVs order that meaningful values of TLVs with Type = INTERVAL_TIME and
at each hop count distance can be included as defined in [RFC5497]. Type = VALIDITY_TIME at each hop count distance can be included as
Thus the pattern of TC_HOP_LIMIT SHOULD be defined to have this defined in [RFC5497]. Thus the pattern of TC_HOP_LIMIT SHOULD be
property. For example the repeating pattern (255 4 4) satisfies this defined to have this property. For example the repeating pattern
property (having period TC_INTERVAL at hop counts up to 4, inclusive, (255 4 4) satisfies this property (having period TC_INTERVAL at hop
and 3 x TC_INTERVAL at hop counts greater than 4), but the repeating counts up to 4, inclusive, and 3 x TC_INTERVAL at hop counts greater
pattern (255 255 4 4) does not satisfy this property because at hop than 4), but the repeating pattern (255 255 4 4) does not satisfy
counts greater than 4, message intervals are alternately TC_INTERVAL this property because at hop counts greater than 4, message intervals
and 3 x TC_INTERVAL. are alternately TC_INTERVAL and 3 x TC_INTERVAL.
The following constraints apply to this parameter: The following constraints apply to this parameter:
o The maximum value of TC_HOP_LIMIT >= the network diameter in hops, o The maximum value of TC_HOP_LIMIT >= the network diameter in hops,
a value of 255 is RECOMMENDED. Note that if using a pattern of a value of 255 is RECOMMENDED. Note that if using a pattern of
different values of TC_HOP_LIMIT as described above, then only the different values of TC_HOP_LIMIT as described above, then only the
maximum value in the patttern is so constrained. maximum value in the pattern is so constrained.
o All values of TC_HOP_LIMIT >= 2. o All values of TC_HOP_LIMIT >= 2.
5.9. Willingness 5.9. Willingness
Each router 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 the router's WILL_NEVER to WILL_ALWAYS, inclusive, and which represents the
willingness to be an MPR, and hence its willingness to forward router's willingness to be an MPR, and hence its willingness to
messages and be an intermediate router on routes. If a router has forward messages and be an intermediate router on routes. The higher
WILLINGNESS = WILL_NEVER it does not perform these tasks. A MANET the value, the greater the router's willingness to be an MPR. If a
using this protocol with too many routers having WILLINGNESS = router has WILLINGNESS = WILL_NEVER (the lowest possible value) it
WILL_NEVER will not function; it MUST be ensured, by administrative does not perform these tasks. A MANET using this protocol with too
or other means, that this does not happen. many routers having WILLINGNESS = WILL_NEVER will not function; it
MUST be ensured, by administrative or other means, that this does not
happen. If a router has WILLINGNESS = WILL_ALWAYS (the highest
possible value) then it MUST always be selected as an MPR by all
symmetric 1-hop neighbors.
Routers MAY have different WILLINGNESS values; however the three 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 16. (Use of WILLINGNESS = WILL_DEFAULT values defined in Section 19. (Use of WILLINGNESS = WILL_DEFAULT
allows a router to avoid including an MPR_WILLING TLV in its TC allows a router to avoid advertising its WILLINGNESS in its HELLO
messages, use of WILLINGNESS = WILL_ALWAYS means that a router will messages.)
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.10. Parameter Change Constraints 5.10. Parameter Change Constraints
This section presents guidelines, applicable if protocol parameters If protocol parameters are changed dynamically, then the constraints
are changed dynamically. in this section apply.
O_HOLD_TIME O_HOLD_TIME
* If O_HOLD_TIME for a router changes, then O_time for all * If O_HOLD_TIME for a router changes, then the expiry time for
Originator Tuples MAY be changed. all Originator Tuples MAY be changed.
TC_INTERVAL TC_INTERVAL
* If the TC_INTERVAL for a router increases, then the next TC * If the TC_INTERVAL for a router increases, then the next TC
message generated by this router MUST be generated according to message generated by this router MUST be generated according to
the previous, shorter, TC_INTERVAL. Additional subsequent TC the previous, shorter, TC_INTERVAL. Additional subsequent TC
messages MAY be generated according to the previous, shorter, messages MAY be generated according to the previous, shorter,
TC_INTERVAL. TC_INTERVAL.
* If the TC_INTERVAL for a router decreases, then the following * If the TC_INTERVAL for a router decreases, then the following
TC messages from this router MUST be generated according to the TC messages from this router MUST be generated according to the
current, shorter, TC_INTERVAL. current, shorter, TC_INTERVAL.
RX_HOLD_TIME 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 the
for all Received Tuples for that OLSRv2 interface MAY be expiry time for all Received Tuples for that OLSRv2 interface
changed. MAY be changed.
P_HOLD_TIME P_HOLD_TIME
* If P_HOLD_TIME changes, then P_time for all Processed Tuples * If P_HOLD_TIME changes, then the expiry time for all Processed
MAY be changed. Tuples 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 the expiry time for all Forwarded
MAY be changed. Tuples 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 router 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 router MAY be rescheduled. on this router MAY be rescheduled.
skipping to change at page 22, line 45 skipping to change at page 22, line 45
rescheduled. rescheduled.
TC_HOP_LIMIT TC_HOP_LIMIT
* If TC_HOP_LIMIT changes, and the router uses multiple values * If TC_HOP_LIMIT changes, and the router uses multiple values
after the change, then message intervals and validity times after the change, then message intervals and validity times
included in TC messages MUST be respected. The simplest way to included in TC messages MUST be respected. The simplest way to
do this is to start any new repeating pattern of TC_HOP_LIMIT do this is to start any new repeating pattern of TC_HOP_LIMIT
values with its largest value. values with its largest value.
6. Information Bases 6. Local Information Base
The purpose of this protocol is to determine the Routing Set, which
may be used to update IP's Routing Table, providing "next hop"
routing information for IP packets. This specification includes the
following Information Bases:
Local Information Base - as defined in [NHDP], extended by the
inclusion of the router's originator address and the addition of
an Originator Set, defined in Section 6.1.1, and a Local Attached
Network Set, defined in Section 6.1.2.
Interface Information Bases - as defined in [NHDP], an Interface
Information Base for each OLSRv2 interface.
Neighbor Information Base - as defined in [NHDP], extended by the
addition of five elements to each Neighbor Tuple, and the
inclusion of an Advertised Neighbor Sequence Number (ANSN), both
as defined in Section 6.2.
Topology Information Base - this Information Base is specific to
this protocol, and is defined in Section 6.3.
Received Message Information Base - this Information Base is
specific to this protocol, and is defined in Section 6.4.
The ordering of sequence numbers, when considering which is the
greater, is as defined in Section 17.
6.1. Local Information Base
The Local Information Base as defined in [NHDP] is extended by: The Local Information Base, as defined for each router in [NHDP], is
extended by this protocol by:
o Recording the router's originator address. Note that this MAY be o Recording the router's originator address. The originator address
equal to any address in any I_local_iface_addr_list in a Local MUST be unique to this router. It MUST NOT be used by any other
Interface Tuple, but MUST NOT be equal to the AL_net_addr in a router as an originator address. It MAY be included in any
Local Attached Network Tuple. network address in any I_local_iface_addr_list of this router, it
MUST NOT be included in any network address in any
I_local_iface_addr_list of any other router. It MAY be included
in, but MUST NOT be equal to, the AL_net_addr in any Local
Attached Network Tuple in this or any other router.
o The addition of an Originator Set, defined in Section 6.1.1, and a o The addition of an Originator Set, defined in Section 6.1, and a
Local Attached Network Set, defined in Section 6.1.2. Local Attached Network Set, defined in Section 6.2.
All routable addresses of the router for which it is to accept All routable addresses of the router for which it is to accept
packets as destination MUST be included in the Local Interface Set or packets as destination MUST be included in the Local Interface Set or
the Local Attached Network Set. the Local Attached Network Set.
6.1.1. Originator Set 6.1. Originator Set
A router's Originator Set records addresses that were recently used A router's Originator Set records addresses that were recently used
as originator addresses by this router. If a router's originator as originator addresses by this router. If a router's originator
address is immutable then this set is always empty and MAY be address is immutable then this set is always empty and MAY be
omitted. It consists of Originator Tuples: omitted. It consists of Originator Tuples:
(O_orig_addr, O_time) (O_orig_addr, O_time)
where: where:
O_orig_addr is a recently used originator address, note that this O_orig_addr - is a recently used originator address, note that this
does not include a prefix length; does not include a prefix length;
O_time specifies the time at which this Tuple expires and MUST be O_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
6.1.2. Local Attached Network Set 6.2. Local Attached Network Set
A router's Local Attached Network Set records its local non-OLSRv2 A router's Local Attached Network Set records its local non-OLSRv2
interfaces via which it can act as gateways to other networks. The interfaces via which it can act as gateways to other networks. The
Local Attached Network Set is not modified by this protocol. This Local Attached Network Set is not modified by this protocol. This
protocol MAY respond to changes to the Local Attached Network Set, protocol MAY respond to changes to the Local Attached Network Set,
which MUST reflect corresponding changes in the router's status. It which MUST reflect corresponding changes in the router's status. It
consists of Local Attached Network Tuples: consists of Local Attached Network Tuples:
(AL_net_addr, AL_dist) (AL_net_addr, AL_dist)
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
be reached via this router. This SHOULD be a routable address, can be reached via this router. This SHOULD be a routable
and MUST NOT be an interface address, or the originator address, address. It is constrained as described below.
of 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 network address
AL_net_addr from this router. AL_net_addr from this router.
Attached networks local to this router only (i.e. not reachable Attached networks local to this router only (i.e., not reachable
except via this router) SHOULD be treated as local non-MANET except via this router) SHOULD be treated as local non-MANET
interfaces, and added to the Local Interface Set, as specified in interfaces, and added to the Local Interface Set, as specified in
[NHDP], rather than be added to the Local Attached Network Set. [NHDP], rather than be added to the Local Attached Network Set.
Because an attached network is not specific to the router, and may be Because an attached network is not specific to the router, and may be
outside the MANET, an attached network MAY also be attached to other outside the MANET, an attached network MAY also be attached to other
routers. routers. Routing to an AL_net_addr will use maximum prefix length
matching; consequently an AL_net_addr MAY include, but MUST NOT equal
or be included in, any network address which is of any interface of
any router (i.e., is included in any I_local_iface_addr_list) or
equal any router's originator address.
It is not the responsibility of this protocol to maintain routes from It is not the responsibility of this protocol to maintain routes from
this router to networks recorded in the Local Attached Network Set. this router to networks recorded in the Local Attached Network Set.
Local Attached Neighbor Tuples are removed from the Local Attached Local Attached Neighbor Tuples are removed from the Local Attached
Network Set only when the routers' local attached network Network Set only when the routers' local attached network
configuration changes, i.e., they are not subject to timer-based configuration changes, i.e., they are not subject to timer-based
expiration or changes due to received messages. expiration or changes due to received messages.
6.2. Neighbor Information Base 7. Interface Information Base
Each Neighbor Tuple in the Neighbor Set, defined in [NHDP], has these An Interface Information Base, as defined in [NHDP], is maintained
additional elements: for each OLSRv2 interface. It is not modified by this protocol.
N_orig_addr is the neighbor's originator address, which may be 8. Neighbor Information Base
An Neighbor Information Base, as defined in [NHDP], is maintained for
each router. It is modified by this protocol by adding these
additional elements to each Neighbor Tuple in the Neighbor Set:
N_orig_addr - is the neighbor's originator address, which may be
unknown. Note that this originator address does not include a unknown. Note that this originator address does not include a
prefix length; prefix length;
N_willingness is the neighbor's willingness to be selected as an N_willingness - is the neighbor's willingness to be selected as an
MPR, in the range from WILL_NEVER to WILL_ALWAYS, both inclusive; MPR, 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
an MPR by this router; as 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 router 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
router. router.
N_advertised is a boolean flag, describing if this router has N_advertised - is a boolean flag, describing if this router has
elected to advertise a link to this neighbor in its TC messages. elected to advertise a link to this neighbor in its TC messages.
A Neighbor Tuple created (but not updated) by [NHDP] MUST set: A Neighbor Tuple created (but not updated) by [NHDP] MUST set:
N_orig_addr := unknown; N_orig_addr := unknown;
N_willingness := WILL_NEVER; N_willingness := WILL_NEVER;
N_mpr := false; N_mpr := false;
N_mpr_selector := false; N_mpr_selector := false;
N_advertised := false. N_advertised := false.
The Neighbor Information Base also includes a variable, the The Neighbor Information Base also includes a variable, the
Advertised Neighbor Sequence Number (ANSN), whose value is included Advertised Neighbor Sequence Number (ANSN), whose value is included
in TC messages to indicate the freshness of the information in TC messages to indicate the freshness of the information
transmitted. The ANSN is incremented whenever advertised information transmitted. The ANSN is incremented whenever advertised information
(the originator and routable addresses included in Neighbor Tuples (the originator and routable addresses included in Neighbor Tuples
with N_advertised = true, and local attached networks recorded in the with N_advertised = true, and local attached networks recorded in the
Local Attached Network Set in the Local Information Base) changes. Local Attached Network Set in the Local Information Base) changes,
including addition or removal of such information.
6.3. Topology Information Base 9. Topology Information Base
The Topology Information Base stores information received in TC The Topology Information Base, defined for each router by this
messages, in the Advertising Remote Router Set, the Router Topology specification, stores information received in TC messages, in the
Set, the Routable Address Topology Set and the Attached Network Set. Advertising Remote Router Set, the Router Topology Set, the Routable
Address Topology Set and the Attached Network Set.
Additionally, a Routing Set is maintained, derived from the Additionally, a Routing Set is maintained, derived from the
information recorded in the Local Information Base, the Interface information recorded in the Local Information Base, the Interface
Information Bases, the Neighbor Information Base and the rest of the Information Bases, the Neighbor Information Base and the rest of the
Topology Information Base. Topology Information Base.
6.3.1. Advertising Remote Router Set 9.1. Advertising Remote Router Set
A router's Advertising Remote Router Set records information A router's Advertising Remote Router Set records information
describing each remote router in the network that transmits TC describing each remote router in the network that transmits TC
messages, allowing outdated TC messages to be recognized and messages, allowing outdated TC messages to be recognized and
discarded. It consists of Advertising Remote Router Tuples: discarded. It consists of Advertising Remote Router Tuples:
(AR_orig_addr, AR_seq_number, AR_time) (AR_orig_addr, AR_seq_number, AR_time)
where: where:
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
originated from the router with originator address AR_orig_addr which originated from the router with originator address
(i.e., which contributed to the information contained in this AR_orig_addr (i.e., which contributed to the information contained
Tuple); in this Tuple);
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.2. Router Topology Set 9.2. Router Topology Set
A router's Topology Set records topology information about the links A router's Topology Set records topology information about the links
between routers in the MANET, allowing a "backbone" graph of all between routers in the MANET. It consists of Router Topology Tuples:
routers to be constructed using a minimum distance algorithm. It
consists of Router Topology Tuples:
(TR_from_orig_addr, TR_to_orig_addr, TR_seq_number, TR_time) (TR_from_orig_addr, TR_to_orig_addr, TR_seq_number, TR_time)
where: where:
TR_from_orig_addr is the originator address of a router which can TR_from_orig_addr - is the originator address of a router which can
reach the router with originator address TR_to_orig_addr in one reach the router with originator address TR_to_orig_addr in one
hop, note that this does not include a prefix length; hop, note that this does not include a prefix length;
TR_to_orig_addr is the originator address of a router which can be TR_to_orig_addr - is the originator address of a router which can be
reached by the router with originator address TR_to_orig_addr in reached by the router with originator address TR_to_orig_addr in
one hop, note that this does not include a prefix length; one hop, note that this does not include a prefix length;
TR_seq_number is the greatest ANSN in any TC message received which TR_seq_number - is the greatest ANSN in any TC message received
originated from the router with originator address which originated from the router with originator address
TR_from_orig_addr (i.e., which contributed to the information TR_from_orig_addr (i.e., which contributed to the information
contained in this Tuple); contained in this Tuple);
TR_time specifies the time at which this Tuple expires and MUST be TR_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
6.3.3. Routable Address Topology Set 9.3. Routable Address Topology Set
A router's Routable Address Topology Set records topology information A router's Routable Address Topology Set records topology information
about the routable addresses within the MANET, and via which routers about the routable addresses within the MANET, and via which routers
they may be reached. It consists of Routable Address Topology they may be reached. It consists of Routable Address Topology
Tuples: Tuples:
(TA_from_orig_addr, TA_dest_addr, TA_seq_number, TA_time) (TA_from_orig_addr, TA_dest_addr, TA_seq_number, TA_time)
where: where:
TA_from_orig_addr is the originator address of a router which can TA_from_orig_addr - is the originator address of a router which can
reach the router with routable address TA_dest_addr in one hop, reach the router with routable address TA_dest_addr in one hop,
note that this does not include a prefix length; note that this does not include a prefix length;
TA_dest_addr is a routable address of a router which can be reached TA_dest_addr - is a routable address of a router which can be
by the router with originator address TA_from_orig_addr in one reached by the router with originator address TA_from_orig_addr in
hop; one hop;
TA_seq_number is the greatest ANSN in any TC message received which TA_seq_number - is the greatest ANSN in any TC message received
originated from the router with originator address which originated from the router with originator address
TA_from_orig_addr (i.e., which contributed to the information TA_from_orig_addr (i.e., which contributed to the information
contained in this Tuple); contained in this Tuple);
TA_time specifies the time at which this Tuple expires and MUST be TA_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
6.3.4. Attached Network Set 9.4. Attached Network Set
A router's Attached Network Set records information about networks A router's Attached Network Set records information about networks
(which may be outside the MANET) attached to other routers and their (which may be outside the MANET) attached to other routers and their
routable addresses. It consists of Attached Network Tuples: routable addresses. It consists of Attached Network Tuples:
(AN_orig_addr, AN_net_addr, AN_dist, AN_seq_number, AN_time) (AN_orig_addr, AN_net_addr, AN_dist, AN_seq_number, AN_time)
where: where:
AN_orig_addr is the originator address of a router which can act as AN_orig_addr - is the originator address of a router which can act
gateway to the network with address AN_net_addr, note that this as gateway to the network with network address AN_net_addr, note
does not include a prefix length; that this does not include a prefix length;
AN_net_addr is the network address of an attached network, which may AN_net_addr - is the network address of an attached network, which
be reached via the router with originator address AN_orig_addr; may be reached via the router with originator address
AN_orig_addr;
AN_dist is the number of hops to the network with address AN_dist - is the number of hops to the network with network address
AN_net_addr from the router with originator address AN_orig_addr; AN_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
originated from the router with originator address AN_orig_addr which originated from the router with originator address
(i.e., which contributed to the information contained in this AN_orig_addr (i.e., which contributed to the information contained
Tuple); in this Tuple);
AN_time specifies the time at which this Tuple expires and MUST be AN_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
6.3.5. Routing Set 9.5. Routing Set
A router's Routing Set records the first hop along a selected path to A router's Routing Set records the first hop along a selected path to
each destination for which any such path is known. It consists of each destination for which any such path is known. It consists of
Routing Tuples: Routing Tuples:
(R_dest_addr, R_next_iface_addr, R_local_iface_addr, R_dist) (R_dest_addr, R_next_iface_addr, R_local_iface_addr, R_dist)
where: where:
R_dest_addr is the address of the destination, either the address of R_dest_addr - is the network address of the destination, either the
an interface of a destination router, or the network address of an network address of an interface of a destination router, or the
attached network; network address of an attached network;
R_next_iface_addr is the address of the "next hop" on the selected R_next_iface_addr - is the network address of the "next hop" on the
path to the destination; selected path to the destination;
R_local_iface_addr is the address of the local OLSRv2 interface over R_local_iface_addr - is the network address of the local OLSRv2
which a packet MUST be sent to reach the destination by the interface over which a packet MUST be sent to reach the
selected path. destination by the selected path.
R_dist is the number of hops on the selected path to the R_dist - is the number of hops on the selected path to the
destination; destination;
The Routing Set for a router is derived from the contents of other The Routing Set for a router is derived from the contents of other
protocol Sets of the router (the Link Sets, the Neighbor Set, the protocol Sets of the router (the Link Sets, the Neighbor Set, the
Router Topology Set, the Routable Address Topology Set, the Attached Router Topology Set, the Routable Address Topology Set, the Attached
Network Set, and OPTIONALLY the Two Hop Sets). The Routing Set is Network Set, and OPTIONALLY the Two Hop Sets). The Routing Set is
updated (Routing Tuples added or removed, or the complete Routing Set updated (Routing Tuples added or removed, or the complete Routing Set
recalculated) when routing paths are calculated, based on changes to recalculated) when routing paths are calculated, based on changes to
these other protocol Sets. Routing Tuples are not subject to timer- these other protocol Sets. Routing Tuples are not subject to timer-
based expiration. based expiration.
6.4. Received Message Information Base 10. Received Message Information Base
The Received Message Information Base records information required to The Received Message Information Base, defined by this specification,
ensure that a message is processed at most once and is forwarded at records information required to ensure that a message is processed at
most once per OLSRv2 interface of a router, using MPR flooding. most once and is forwarded at most once per OLSRv2 interface of a
router, using MPR flooding.
6.4.1. Received Set 10.1. Received Set
A router has a Received Set per OLSRv2 interface. Each Received Set A router has a Received Set per OLSRv2 interface. Each Received Set
records the signatures of messages which have been received over that records the signatures of messages which have been received over that
OLSRv2 interface. Each consists of Received Tuples: OLSRv2 interface. Each consists of Received Tuples:
(RX_type, RX_orig_addr, RX_seq_number, RX_time) (RX_type, RX_orig_addr, RX_seq_number, RX_time)
where: where:
RX_type is the received Message Type; RX_type - is the received Message Type;
RX_orig_addr is the originator address of the received message, note RX_orig_addr - is the originator address of the received message,
that this does not include a prefix length; note that this does not include a prefix length;
RX_seq_number is the message sequence number of the received RX_seq_number - is the message sequence number of the received
message; message;
RX_time specifies the time at which this Tuple expires and MUST be RX_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
6.4.2. Processed Set 10.2. Processed Set
A router has a single Processed Set which records signatures of A router has a single Processed Set which records signatures of
messages which have been processed by the router. It consists of messages which have been processed by the router. It consists of
Processed Tuples: Processed Tuples:
(P_type, P_orig_addr, P_seq_number, P_time) (P_type, P_orig_addr, P_seq_number, P_time)
where: where:
P_type is the processed Message Type; P_type - is the processed Message Type;
P_orig_addr is the originator address of the processed message, note P_orig_addr - is the originator address of the processed message,
that this does not include a prefix length; note that this does not include a prefix length;
P_seq_number is the message sequence number of the processed P_seq_number - is the message sequence number of the processed
message; message;
P_time specifies the time at which this Tuple expires and MUST be P_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
6.4.3. Forwarded Set 10.3. Forwarded Set
A router has a single Forwarded Set which records signatures of A router has a single Forwarded Set which records signatures of
messages which have been forwarded by the router. It consists of messages which have been forwarded by the router. It consists of
Forwarded Tuples: Forwarded Tuples:
(F_type, F_orig_addr, F_seq_number, F_time) (F_type, F_orig_addr, F_seq_number, F_time)
where: where:
F_type is the forwarded Message Type; F_type - is the forwarded Message Type;
F_orig_addr - is the originator address of the forwarded message,
F_orig_addr is the originator address of the forwarded message, note note that this does not include a prefix length;
that this does not include a prefix length;
F_seq_number is the message sequence number of the forwarded F_seq_number - is the message sequence number of the forwarded
message; message;
F_time specifies the time at which this Tuple expires and MUST be F_time - specifies the time at which this Tuple expires and MUST be
removed. removed.
6.5. Corresponding Protocol Tuples 11. Updating Information Bases
In a number of cases there is a natural correspondence from a The purpose of this protocol is to determine the contents of the
Protocol Tuple in a Protocol Set to a single Protocol Tuple in router's Routing Set, which may be used to update IP's Routing Table,
another Protocol Set. The latter Protocol Tuple is referred to as providing "next hop" routing information for IP packets. This is
"corresponding" to the former. performed by first updating the other Protocol Sets in the
Information Bases, and then using information from some of those
other Protocol Sets to determine the contents of the Routing Set.
Specific examples include: As part of this specification, in a number of cases there is a
natural correspondence from a Protocol Tuple in one Protocol Set to a
single Protocol Tuple in another Protocol Set, in the same or another
Information Base. The latter Protocol Tuple is referred to as
"corresponding" to the former Protocol Tuple.
Specific examples of corresponding Protocol Tuples include:
o There is a Local Interface Tuple corresponding to each Link Tuple, o There is a Local Interface Tuple corresponding to each Link Tuple,
where the Link Tuple is in the Link Set for an OLSRv2 interface, where the Link Tuple is in the Link Set for an OLSRv2 interface,
and the Local Interface Tuple represents that OLSRv2 interface. and the Local Interface Tuple represents that OLSRv2 interface.
o There is a Neighbor Tuple corresponding to each Link Tuple which o There is a Neighbor Tuple corresponding to each Link Tuple which
has L_HEARD_time not expired, such that N_neighbor_addr_list has L_HEARD_time not expired, such that N_neighbor_addr_list
contains L_neighbor_iface_addr_list. contains L_neighbor_iface_addr_list.
o There is a Link Tuple (in the Link Set in the same Interface o There is a Link Tuple (in the Link Set in the same Interface
Information Base) corresponding to each 2-Hop Tuple such that Information Base) corresponding to each 2-Hop Tuple such that
L_neighbor_iface_addr_list = N2_neighbor_iface_addr_list. L_neighbor_iface_addr_list = N2_neighbor_iface_addr_list.
o There is a Neighbor Tuple corresponding to each 2-Hop Tuple, such o There is a Neighbor Tuple corresponding to each 2-Hop Tuple, such
that N_neighbor_addr_list contains N2_neighbor_iface_addr_list. that N_neighbor_addr_list contains N2_neighbor_iface_addr_list.
(This is the Neighbor Tuple corresponding to the Link Tuple that
corresponds to the 2-Hop Tuple.)
o There is an Advertising Remote Router Tuple corresponding to each o There is an Advertising Remote Router Tuple corresponding to each
Router Topology Tuple such that AR_orig_addr = TR_from_orig_addr. Router Topology Tuple such that AR_orig_addr = TR_from_orig_addr.
o There is an Advertising Remote Router Tuple corresponding to each o There is an Advertising Remote Router Tuple corresponding to each
Routable Address Topology Tuple such that AR_orig_addr = Routable Address Topology Tuple such that AR_orig_addr =
TA_from_orig_addr. TA_from_orig_addr.
o There is an Advertising Remote Router Tuple corresponding to each o There is an Advertising Remote Router Tuple corresponding to each
Attached Network Tuple such that AR_orig_addr = AN_orig_addr. Attached Network Tuple such that AR_orig_addr = AN_orig_addr.
o There is an Neighbor Tuple corresponding to each Routing Tuple o There is an Neighbor Tuple corresponding to each Routing Tuple
such that N_neighbor_addr_list contains R_next_iface_addr. such that N_neighbor_addr_list contains R_next_iface_addr.
7. Message Processing and Forwarding Addresses or network addresses with the following properties are
considered as "fully owned" by a router when processing a received
message:
This protocol defines, and hence owns, the TC message type (see o Equaling its originator address, OR;
Section 20). Thus, as specified in [RFC5444], this protocol receives
all TC messages and is responsible for determining whether and how
each TC message is to be processed (updating Information Bases)
and/or forwarded, according to this specification. OLSRv2 does not
require any part of the Packet Header.
This protocol also receives HELLO messages, which are defined, and o Equaling the O_orig_addr in an Originator Tuple, OR;
hence owned, by [NHDP]. Such messages, when received on an OLSRv2
interface, are made available to this protocol in two ways, both as
permitted by [NHDP]. First, such received HELLO messages MUST be
made available to this protocol on reception, which allows them to be
discarded before being processed by [NHDP], for example if the
information added to the HELLO message by this protocol is
inconsistent. Second, such received HELLO messages MUST be made
available to OLSRv2 after [NHDP] has completed its processing
thereof, unless discarded as malformed by [NHDP], for processing by
this protocol. HELLO messages are not forwarded by this protocol.
Extensions to this protocol which define, and hence own, other o Equaling or being a sub-range of the I_local_iface_addr_list in a
Messages Types, MAY manage the processing and/or forwarding of these Local Interface Tuple, OR;
messages using the same mechanism as for TC messages. These
mechanisms contain elements (P_type, RX_type, F_type) required only o Equaling or being a sub-range of the IR_local_iface_addr in a
for such usage. Removed Interface Address Tuple, OR;
o Equaling an AL_net_addr in a Local Attached Network Tuple.
Addresses or network addresses with the following properties are
considered as "partially owned" (which may include being fully owned)
by a router when processing a received message:
o Overlapping (equaling or containing) its originator address, OR;
o Overlapping (equaling or containing) the O_orig_addr in an
Originator Tuple, OR;
o Overlapping the I_local_iface_addr_list in a Local Interface
Tuple, OR;
o Overlapping the IR_local_iface_addr in a Removed Interface Address
Tuple, OR;
o Equaling or having as a sub-range an AL_net_addr in a Local
Attached Network Tuple.
12. Packets and Messages
The packet and message format used by this protocol is defined in
[RFC5444]. Except as otherwise noted, options defined in [RFC5444]
may be freely used, in particular alternative formats defined by
packet, message, Address Block and TLV flags.
Routers using this protocol exchange information through messages.
The message types used by this protocol are the HELLO message and the
TC message. The HELLO message is defined by [NHDP] and extended by
this specification, see Section 14. The TC message is defined by
this specification, see Section 15.
One or more messages sent by a router at the same time SHOULD be
combined into a single packet, subject to any constraints on maximum
packet size (such as derived from the MTU over a local single hop)
that MAY be imposed. These messages may have originated at the
sending router, or have originated at another router and are being
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], including but
not limited to [NHDP], MAY be combined for transmission within the
same packet. This specification does not define or use any contents
of the Packet Header.
Forwarded messages MAY be jittered as described in [RFC5148]. The
value of MAXJITTER used in jittering a forwarded message MAY be based
on information in that message (in particular any Message TLVs with
Type = INTERVAL_TIME or Type = VALIDITY_TIME) or otherwise SHOULD be
with a maximum delay of F_MAXJITTER. A router MAY modify the jitter
applied to a message in order to more efficiently combine messages in
packets, as long as the maximum jitter is not exceeded.
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.
13. Message Processing and Forwarding
This section describes the optimized flooding operation (MPR
flooding) used when control messages, as instances of [RFC5444], are
intended for MANET wide distribution. This flooding mechanism
defines when a received message is, or is not, processed and/or
forwarded.
This flooding mechanism is used by this protocol and MAY be used by
extensions to this protocol which define, and hence own, other
message types, to manage processing and/or forwarding of these
messages. This specification contains elements (P_type, RX_type,
F_type) required only for such usage.
This flooding mechanism is always used for TC messages (see
Section 15). Received HELLO messages (see Section 14 are, unless
invalid, always processed, and never forwarded by this flooding
mechanism. They thus do not need to be recorded in the Received
Message Information Base.
The processing selection and forwarding mechanisms are designed to The processing selection and forwarding mechanisms are designed to
only need to parse the Message Header in order to determine whether a only need to parse the Message Header in order to determine whether a
message is to be processed and/or forwarded, and not to have to parse message is to be processed and/or forwarded, and not to have to parse
the Message Body even if the message is forwarded (but not the Message Body even if the message is forwarded (but not
processed). An implementation MAY either only parse the Message Body processed). An implementation MAY only parse the Message Body if
if necessary, or MAY always parse the Message Body. necessary, or MAY always parse the Message Body and reject the
message if it cannot be so parsed, or any other error is identified.
An implementation MUST discard the message silently if it is unable An implementation MUST discard the message silently if it is unable
to parse the Message Header or (if attempted) the Message Body. to parse the Message Header or (if attempted) the Message Body, or if
a message (other than a HELLO message) does not include a message
7.1. Actions when Receiving a Message sequence number.
If the router receives a HELLO message from [NHDP], then the message 13.1. Actions when Receiving a Message
may be rejected before processing by [NHDP] or processed after
processing by [NHDP], both according to Section 10.
A router MUST perform the following tasks for each received TC On receiving a message of a type specified to be using this
message (or other Message Type defined by an extension to this mechanism, which includes the TC messages defined in this
protocol and specified to use this process): specification, a router MUST perform the following:
1. If the router recognizes from the originator address of the 1. If the router recognizes from the originator address of the
message that the message is one which the receiving router itself message that the message is one which the receiving router itself
originated (i.e. is the originator address of this router, or is originated (i.e., the message originator address is the
an O_orig_addr in an Originator Tuple) then the message MUST be originator address of this router, or is an O_orig_addr in an
silently discarded. Originator Tuple) then the message MUST be silently discarded.
2. Otherwise: 2. Otherwise:
1. If the message is of a type which may be processed, including 1. If the message is of a type which may be processed, then the
being a TC message, then the message is considered for message is considered for processing according to
processing according to Section 7.2, AND; Section 13.2.
2. If the message is of a type which may be forwarded, including 2. If the message is of a type which may be forwarded, AND:
being a TC message, AND:
+ <msg-hop-limit> is present and <msg-hop-limit> > 1, AND; + <msg-hop-limit> is present and <msg-hop-limit> > 1, AND;
+ <msg-hop-count> is not present or <msg-hop-count> < 255 + <msg-hop-count> is not present or <msg-hop-count> < 255;
then the message is considered for forwarding according to then the message is considered for forwarding according to
Section 7.3. Section 13.3.
7.2. Message Considered for Processing 13.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 the sending address (i.e., the source address of the IP
datagram containing the current message) does not match (taking
into account any address prefix) a network address in 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
current message was received (the "receiving interface") then
processing the current message is OPTIONAL. If the current
message is not processed then the following steps are not carried
out.
2. If a Processed Tuple exists with:
* P_type = the Message Type of the current message, AND; * P_type = the Message Type of the current message, AND;
* P_orig_addr = the originator address of the current message, * P_orig_addr = the originator address of the current message,
AND; AND;
* P_seq_number = the message sequence number of the current * P_seq_number = the message sequence number of the current
message; message;
then the current message MUST NOT be processed. then the current message MUST NOT be processed.
2. Otherwise: 3. Otherwise:
1. Create a Processed Tuple with: 1. Create a Processed Tuple with:
+ P_type := the Message Type of the current message; + P_type := the Message Type of the current message;
+ P_orig_addr := the originator address of the current + P_orig_addr := the originator address of the current
message; message;
+ P_seq_number := the sequence number of the current + P_seq_number := the sequence number of the current
message; message;
+ P_time := current time + P_HOLD_TIME. + P_time := current time + P_HOLD_TIME.
2. Process the current message according to its type. For a TC 2. Process the current message according to its Message Type.
message this is as defined in Section 12. For a TC message this is as defined in Section 15.4.
7.3. Message Considered for Forwarding 13.3. Message Considered for Forwarding
If a message (the "current message") is considered for forwarding, If a message (the "current message") is considered for forwarding,
then the following tasks MUST be performed: then the following tasks MUST be performed:
1. If the sending address (i.e., the source address of the IP 1. If the sending address (i.e., the source address of the IP
datagram containing the current message) does not match (taking datagram containing the current message) does not match (taking
into account any address prefix) an address in an into account any address prefix) a network address in an
L_neighbor_iface_addr_list of a Link Tuple, with L_status = L_neighbor_iface_addr_list of a Link Tuple, with L_status =
SYMMETRIC, in the Link Set for the OLSRv2 interface on which the SYMMETRIC, in the Link Set for the OLSRv2 interface on which the
current message was received (the "receiving interface") then the current message was received (the "receiving interface") then the
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:
skipping to change at page 34, line 31 skipping to change at page 35, line 51
- F_orig_addr = the originator address of the current - F_orig_addr = the originator address of the current
message, AND; message, AND;
- F_seq_number = the sequence number of the current - F_seq_number = the sequence number of the current
message. message.
then the current message MUST be silently discarded. then the current message MUST be silently discarded.
3. Otherwise if the sending address matches (taking account 3. Otherwise if the sending address matches (taking account
of any address prefix) any address in an of any address prefix) any network address in an
L_neighbor_iface_addr_list of a Link Tuple in the Link L_neighbor_iface_addr_list of a Link Tuple in the Link
Set for the receiving OLSRv2 interface which has L_status Set for the receiving OLSRv2 interface that has L_status
= SYMMETRIC and whose corresponding Neighbor Tuple has = SYMMETRIC and whose corresponding Neighbor Tuple has
N_mpr_selector = true, then: N_mpr_selector = true, then:
1. Create a Forwarded Tuple with: 1. Create a Forwarded Tuple with:
o F_type := the Message Type of the current message; o F_type := the Message Type of the current message;
o F_orig_addr := originator address of the current o F_orig_addr := originator address of the current
message; message;
skipping to change at page 35, line 11 skipping to change at page 36, line 30
2. The Message Header of the current message is modified 2. The Message Header of the current message is modified
by: by:
o if present, decrement <msg-hop-limit> in the o if present, decrement <msg-hop-limit> in the
Message Header by 1, AND; Message Header by 1, AND;
o if present, increment <msg-hop-count> in the o if present, increment <msg-hop-count> in the
Message Header by 1. Message Header by 1.
3. For each OLSRv2 interface of the router, include the 3. The message is transmitted over all OLSRv2
message in a packet to be transmitted on that OLSRv2 interfaces, as described in Section 12.
interface, as described in Section 8. This packet
MAY contain other forwarded messages and/or messages
generated by this router, including by other
protocols using [RFC5444]. Forwarded messages MAY be
jittered as described in [RFC5148]. The value of
MAXJITTER used in jittering a forwarded message MAY
be based on information in that message (in
particular any INTERVAL_TIME or VALIDITY_TIME TLVs in
that message) or otherwise SHOULD be with a maximum
delay of F_MAXJITTER. A router MAY modify the jitter
applied to a message in order to more efficiently
combine messages in packets, as long as the maximum
jitter is not exceeded.
8. Packets and Messages
The packet and message format used by this protocol is defined in
[RFC5444]. Except as otherwise noted, options defined in [RFC5444]
may be freely used, in particular alternative formats defined by
packet, message, Address Block and TLV flags.
This protocol may extend HELLO messages (owned by [NHDP]) by adding a
message originator address and/or TLVs to these messages when sent
over OLSRv2 interfaces, and processes these HELLO messages after
their processing by NHDP, as permitted by [NHDP].
This protocol defines and owns the TC Message Type. Extensions to
this protocol MAY define additions to TC messages. These MAY include
new Message TLVs and/or Address Block TLVs. Extensions MAY also
include new Messsage Types to be handled similarly to TC messages.
See Section 18.
Routers using this protocol exchange information through messages. 14. HELLO messages
One or more messages sent by a router at the same time SHOULD be
combined into a single packet (size permitting). 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 HELLO message Message Type is owned by [NHDP], and thus HELLO
[RFC5444], Message Types and TLVs specific to this protocol. All messages are generated, transmitted, received and processed by
references in this specification to TLVs that do not indicate a type [NHDP]. This protocol, as permitted by [NHDP], also uses HELLO
extension, assume Type Extension = 0. TLVs in processed messages messages, including adding to HELLO message generation, and
with a type extension which is neither zero as so assumed, nor a implementing additional processing based on received HELLO messages.
specifically indicated non-zero type extension, are ignored. HELLO messages are not forwarded by [NHDP] or this specification.
8.1. HELLO Messages 14.1. HELLO Message Generation
A HELLO message is generated as specified in [NHDP]. In addition, a An HELLO message is generated as defined in [NHDP], extended by the
router using this protocol MUST be able to add information to such following elements being added to the HELLO message by this
messages, prior to these being sent on an OLSRv2 interface, as specification before the HELLO message is sent over an OLSRv2
permitted by [NHDP], so that all HELLO messages sent on an OLSRv2
interface: interface:
o MUST allow a message originator address to be determined. This o A message originator address, recording this router's originator
will usually use the message's <msg-orig-addr> element as defined address. This MUST use a <msg-orig-addr> element, unless:
in [RFC5444]. There are two permitted exceptions when the router
MAY omit a <msg-orig-addr> element, but an originator address of
the message is still correctly defined:
* If the message contains only a single local interface address, * The message specifies only a single local interface address
and that address is equal to this router's originator address, (i.e., contains only one address object that is associated with
then that local interface address is the message originator an Address Block TLV with Type = LOCAL_IF, and which has no
address. prefix length, or a maximum prefix length) which will then be
interpreted as the message originator address, OR;
* If the message contains no local interface addresses, then, as * The message does not include any local interface network
specified in [NHDP], the source address of the IP datagram addresses (i.e., has no address objects associated with an
containing the message is recognised as the only interface Address Block TLV with Type = LOCAL_IF), as permitted by the
address of the router. In this case, that address is also the specification in [NHDP] when the router that generated the
message originator address. HELLO message has only one interface address and will use that
as the sending address of the IP datagram in which the HELLO
message is contained. In this case that address will be
interpreted as the message originator address.
o MUST, if it is including any addresses from an o A Message TLV with Type := MPR_WILLING and Value := WILLINGNESS
N_neighbor_addr_list that has N_mpr = true and are associated with MUST be included, unless WILLINGNESS = WILL_DEFAULT (in which case
a TLV with Type = LINK_STATUS and Value = SYMMETRIC, include it MAY be included).
TLV(s) with Type := MPR associated with at least one such address
from each such N_neighbor_addr_list.
o MUST NOT include any TLVs with Type = MPR associated with any o For each Neighbor Tuple with N_mpr = true, and for which one or
other addresses. more network addresses in its N_neighbor_addr_list are included as
address objects in the HELLO message with an associated Address
Block TLV with Type = LINK_STATUS and Value = SYMMETRIC, at least
one, possibly more, of these address objects (including a
different copy of that address object, in the same or a different
Address Block) MUST be associated with an Address Block TLV with
Type := MPR. Address objects which do not satisfy this property
MUST NOT be associated with an Address Block TLV with Type = MPR.
o MAY include a message TLV with Type := MPR_WILLING, indicating the 14.2. HELLO Message TLVs
router's willingness to be selected as an MPR.
An router using this protocol MUST also be able to access any This specification defines one Message TLV and one Address Block TLV
incoming HELLO message received on an OLSRv2 interface, subsequent to that may be added to HELLO messages by this specification.
the processing specified in [NHDP], as permitted by [NHDP].
8.1.1. HELLO Message TLVs 14.2.1. Message TLVs
In a HELLO message, a router MUST include an MPR_WILLING Message TLV This specification defines one Message TLV that may be included in a
as specified in Table 1, unless WILLINGNESS = WILL_DEFAULT (in which HELLO message:
case it MAY be included). A router MUST NOT include more than one
MPR_WILLING Message TLV.
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| Type | Value Length | Value | | Type | Value Length | Value |
+-------------+--------------+--------------------------------------+ +-------------+--------------+--------------------------------------+
| MPR_WILLING | 1 octet | Router 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: MPR_WILLING TLV definition Table 1: MPR_WILLING TLV definition
If a router does not advertise an MPR_WILLING TLV in a HELLO message, 14.2.2. Address Block TLVs
then the router MUST be assumed to have WILLINGNESS equal to
WILL_DEFAULT.
8.1.2. HELLO Message Address Block TLVs
In a HELLO message, a router MAY include MPR Address Block TLV(s) as This specification defines one Address Block TLV that may be included
specified in Table 2. in a HELLO message:
+------+--------------+-------+ +------+--------------+-------+
| Type | Value Length | Value | | Type | Value Length | Value |
+------+--------------+-------+ +------+--------------+-------+
| MPR | 0 octets | None. | | MPR | 0 octets | None. |
+------+--------------+-------+ +------+--------------+-------+
Table 2: MPR TLV definition Table 2: MPR TLV definition
8.2. TC Messages 14.3. HELLO Message Transmission
A TC message MUST contain:
o A message originator address, using the message's <msg-orig-addr>
element as defined in [RFC5444].
o <msg-seq-num> and <msg-hop-limit> elements, as specified in
[RFC5444].
o A <msg-hop-count> element in its Message Header if the message
contains a TLV with either Type = VALIDITY_TIME or Type =
INTERVAL_TIME indicating more than one time value according to
distance. (A TC message MAY contain <msg-hop-count> even if it
does not need to.)
o A single Message TLV with Type := CONT_SEQ_NUM, and Type Extension
:= COMPLETE or Type Extension := INCOMPLETE, as specified in
Section 8.2.1 (for complete and incomplete TC messages,
respectively) except that the latter MAY be omitted if the message
does not contain any addresses associated with a TLV with Type =
NBR_ADDR_TYPE or Type = GATEWAY.
o A Message TLV with Type := VALIDITY_TIME, as specified in HELLO messages are scheduled and transmitted by [NHDP]. This
[RFC5497]. The options included in [RFC5497] for representing protocol MAY require that an additional HELLO message is sent when
zero and infinite times MUST NOT be used. the router's set of MPRs changes, in addition to the cases specified
in [NHDP], and subject to the same constraints.
o If the TC message is complete, all addresses which are the 14.4. HELLO Message Processing
N_orig_addr of a Neighbor Tuple with N_advertised = true, each
associated with a TLV with Type = NBR_ADDR_TYPE, and Value =
ORIGINATOR, or with Value = ROUTABLE_ORIG if also to be associated
with Value = ROUTABLE, see Section 8.2.2. If the TC message is
incomplete then any such addresses MAY be included; if any such
addresses are included then this MUST be with the appropriate
associated TLV(s).
o If the TC message is complete, all routable addresses which are in When received on an OLSRv2 interface, HELLO messages are made
the N_neighbor_addr_list of a Neighbor Tuple with N_advertised = available to this protocol in two ways, both as permitted by [NHDP]:
true. Each such address MUST be associated with a TLV with Type =
NBR_ADDR_TYPE, and Value = ROUTABLE, or with Value = ROUTABLE_ORIG
if also to be associated with Value = ORIGINATOR, see
Section 8.2.2. If the TC message is incomplete then any such
addresses MAY be included; if any such addresses are included then
this MUST be with the appropriate associated TLV(s).
o If the TC message is complete, all addresses which are the o Such received HELLO messages MUST be made available to this
AL_net_addr of a Local Attached Network Tuple. Each such address protocol on reception, which allows them to be discarded before
MUST be associated with a TLV with Type = GATEWAY, and Value = being processed by [NHDP], for example if the information added to
AN_dist as specified in Section 8.2.2. If the TC message is the HELLO message by this protocol is inconsistent.
incomplete then any such addresses MAY be included; if included
then this MUST be with the appropriate associated TLV.
A TC message MAY contain: o Such received HELLO messages MUST be made available to OLSRv2
after [NHDP] has completed its processing thereof, unless
discarded as malformed by [NHDP], for processing by this protocol.
o A Message TLV with Type := INTERVAL_TIME, as specified in 14.4.1. HELLO Message Discarding
[RFC5497]. The options included in [RFC5497] for representing
zero and infinite times MUST NOT be used.
8.2.1. TC Message TLVs In addition to the reasons specified in [NHDP] for discarding a HELLO
message on reception, a HELLO message MUST be discarded before
processing by [NHDP] or this specification if it:
In each TC message which contains any addresses associated with a TLV o Has more than one Message TLV with Type = MPR_WILLING.
with Type = NBR_ADDR_TYPE or Type = GATEWAY, a router MUST include a
single CONT_SEQ_NUM Message TLV, as specified in Table 3, and with
Type Extension = COMPLETE or Type Extension = INCOMPLETE, according
to whether the TC message is complete or incomplete.
+--------------+--------------+-------------------------------------+ o Has a message originator address, or a network address
| Type | Value Length | Value | corresponding to an address object associated with an Address
+--------------+--------------+-------------------------------------+ Block TLV with Type = LOCAL_IF, that is partially owned by this
| CONT_SEQ_NUM | 2 octets | The ANSN contained in the Neighbor | router. (Some of these cases are already excluded by [NHDP].)
| | | Information Base. |
+--------------+--------------+-------------------------------------+
Table 3: CONT_SEQ_NUM TLV definition o Includes any address object associated with an Address Block TLV
with Type = LINK_STATUS or Type = OTHER_NEIGHB that overlaps the
message's originator address.
8.2.2. TC Message Address Block TLVs o Contains any address object associated with an Address Block TLV
with Type = MPR that is not also associated with an Address Block
TLV with Type = LINK_STATUS and Value = SYMMETRIC (including using
a different copy of that address object, in the same or a
different Address Block).
In a TC message, a router MAY include NBR_ADDR_TYPE Address Block 14.4.2. HELLO Message Usage
TLV(s) as specified in Table 4.
+---------------+--------------+------------------------------------+ HELLO messages are first processed as specified in [NHDP]. That
| Type | Value Length | Value | processing includes identifying (or creating) a Neighbor Tuple
+---------------+--------------+------------------------------------+ corresponding to the originator of the HELLO message (the "current
| NBR_ADDR_TYPE | 1 octet | ORIGINATOR indicates that the | Neighbor Tuple"). After this, the following processing MUST also be
| | | address is an originator address, | performed:
| | | ROUTABLE indicates that the |
| | | address is a routable address of |
| | | an interface, ROUTABLE_ORIG |
| | | indicates that the address is both |
+---------------+--------------+------------------------------------+
Table 4: NBR_ADDR_TYPE TLV definition 1. If the HELLO message has a well-defined message originator
address, i.e., has an <msg-orig-addr> element or has zero or one
network addresses associated with a TLV with Type = LOCAL_IF:
If an address is both a originator address and a routable interface 1. Remove any other Neighbor Tuple with N_orig_addr = message
address, then it may be associated, using a TLV with Type = originator address, taking any consequent action (including
NBR_ADDR_TYPE, with either a Value = ROUTABLE_ORIG, or (using two removing one or more Link Tuples) as specified in [NHDP].
separate TLVs) both with Value = ORIGINATOR and with Value =
ROUTABLE.
In a TC message, a router MAY include GATEWAY Address Block TLV(s) as 2. The current Neighbor Tuple is then updated according to:
specified in Table 5.
+---------+--------------+-------------------------------------+ 1. N_orig_addr := message originator address;
| Type | Value Length | Value |
+---------+--------------+-------------------------------------+
| GATEWAY | 1 octet | Number of hops to attached network. |
+---------+--------------+-------------------------------------+
Table 5 2. Update N_willingness as described in Section 14.4.2.1;
All addresses included in a TC message according to this 3. Update N_mpr_selector as described in Section 14.4.2.2.
specification MUST be associated with either at least one TLV with
Type = NBR_ADDR_TYPE or a TLV with Type = GATEWAY, but not both.
Other addresses MAY be included in the TC message, but (other than
the message originator address) are ignored by this specification.
9. HELLO Message Generation 2. If there are any changes to the router's Information Bases, then
perform the processing defined in Section 16.
An HELLO message is composed and generated as defined in [NHDP], 14.4.2.1. Updating Willingness
extended by the following being added to the HELLO message by this
protocol before being sent over an OLSRv2 interface, as permitted by
[NHDP]:
o A message originator address, using a <msg-orig-addr> element, N_willingness in the current Neighbor Tuple is updated as follows:
unless:
* The message contains only a single local interface address, 1. If the HELLO message contains a Message TLV with Type =
which is then interpreted as the message originator address, MPR_WILLING then N_willingness := the value of that TLV;
OR;
* The message does not include any local interface addresses, as 2. Otherwise, N_willingness := WILL_DEFAULT.
permitted by the specification in [NHDP] when the router that
generated the HELLO message has only one interface address, and
will use that as the sending address of the IP datagram in
which the HELLO message is contained. In this case that
address MAY also be used as the message originator address.
o A Message TLV with Type := MPR_WILLING and Value := WILLINGNESS 14.4.2.2. Updating MPR Selector Status
MUST be included, unless WILLINGNESS = WILL_DEFAULT (in which case
it MAY be included).
o For each Neighbor Tuple with N_mpr = true, and for which one or N_mpr_selector is updated as follows:
more addresses in its N_neighbor_addr_list are included with an
associated TLV with Type = LINK_STATUS and Value = SYMMETRIC, at
least one of these addresses (including a different copy of that
address, in the same or a different Address Block) MUST be
associated with an Address Block TLV with Type := MPR. Note that
other addresses (which do not meet this specification) MUST NOT be
associated with an Address Block TLV with Type = MPR, but that
more than one address from the same qualifying
N_neighbor_addr_list MAY be associated with an Address Block TLV
with Type := MPR.
o An additional HELLO message MAY be sent when the router's set of 1. If a router finds an address object representing any of its local
MPRs changes, in addition to the cases specified in [NHDP], and interface network addresses (i.e., those contained in the
subject to the same constraints. I_local_iface_addr_list of an OLSRv2 interface) with an
associated Address Block TLV with Type = MPR in the HELLO message
(indicating that the originating router has selected the
receiving router as an MPR) then, for the current Neighbor Tuple:
9.1. HELLO Message: Transmission * N_mpr_selector := true
HELLO messages are included in packets as specified in [RFC5444]. 2. Otherwise (i.e., if no such address object and Address Block TLV
These packets may contain other messages, including TC messages. was found) if a router finds an address object representing any
of its local interface network addresses (i.e., those contained
in the I_local_iface_addr_list of an OLSRv2 interface) with an
associated Address Block TLV with Type = LINK_STATUS and Value =
SYMMETRIC in the HELLO message, then for the current Neighbor
Tuple:
10. HELLO Message Processing * N_mpr_selector := false
All HELLO message processing, including determination of whether a * N_advertised := false
message is invalid, considers only TLVs with Type Extension = 0.
TLVs with any other type extension are ignored. All references to,
for example, a TLV with Type = MPR_WILLING refer to a TLV with Type =
MPR_WILLING and Type Extension = 0.
In addition to the reasons specified in [NHDP] for discarding a HELLO 15. TC Messages
message on reception, a HELLO message MUST be discarded before
processing by [NHDP] or this specification if it:
o Has more than one TLV with Type = MPR_WILLING in its Message TLV This protocol defines, and hence owns, the TC message type (see
Block. Section 23). Thus, as specified in [RFC5444], this protocol
generates and transmits all TC messages, receives all TC messages and
is responsible for determining whether and how each TC message is to
be processed (updating the Topology Information Base) and/or
forwarded, according to this specification.
o Has a message originator address, or any address associated with a 15.1. TC Message Generation
TLV with Type = LOCAL_IF, that the receiving router has recorded
as:
* its originator address, OR; A TC message is a message as defined in [RFC5444]. A generated TC
message MUST contain the following elements as defined in [RFC5444]:
* as the O_orig_addr in an Originator Tuple, OR; o A message originator address, recording this router's originator
address. This MUST use a <msg-orig-addr> element.
* in an I_local_iface_addr_list in a Local Interface Tuple, OR; o <msg-seq-num> element containing the message sequence number.
* as the IR_local_iface_addr in a Removed Interface Address o A <msg-hop-limit> element, containing TC_HOP_LIMIT. A router MAY
Tuple, OR; use the same or different values of TC_HOP_LIMIT in its TC
messages, see Section 5.8.
* as the AL_net_addr in a Local Attached Network Tuple. o A <msg-hop-count> element, containing zero, if the message
contains a TLV with either Type = VALIDITY_TIME or Type =
INTERVAL_TIME (as specified in [RFC5497]) indicating more than one
time value according to distance. A TC message MAY contain such a
<msg-hop-count> element even if it does not need to.
Note that some of these cases are already excluded by [NHDP]. o A single Message TLV with Type := CONT_SEQ_NUM and Value := ANSN
from the Neighbor Information Base. If the TC message is complete
then this Message TLV MUST have Type Extension := COMPLETE,
otherwise it MUST have Type Extension := INCOMPLETE. (Exception:
a TC message MAY omit such a Message TLV if the TC message does
not include any address objects with an associated Address Block
TLV with Type = NBR_ADDR_TYPE or Type = GATEWAY.)
o Includes any address associated with a TLV with Type = LINK_STATUS o A single Message TLV with Type := VALIDITY_TIME, as specified in
or Type = OTHER_NEIGHB that is also the message's originator [RFC5497]. If all TC messages are sent with the same hop limit
address. then this TLV MUST have a value encoding the period T_HOLD_TIME.
If TC messages are sent with different hop limits (more than one
value of TC_HOP_LIMIT) then this TLV MUST specify times that vary
with the number of hops distance appropriate to the chosen pattern
of TC message hop limits, as specified in [RFC5497]; these times
SHOULD be appropriate multiples of T_HOLD_TIME. The options
included in [RFC5497] for representing zero and infinite times
MUST NOT be used.
o Contains any address associated with a TLV with Type = MPR, where o If the TC message is complete, all network addresses which are the
that address (including a different copy of that address, in the N_orig_addr of a Neighbor Tuple with N_advertised = true, MUST be
same or a different Address Block) is not also associated with a represented by address objects in one or more Address Blocks. If
TLV with Type = LINK_STATUS and Value = SYMMETRIC. the TC message is incomplete then any such address objects MAY be
included. At least one copy of each such address object that is
included MUST be associated with an Address Block TLV with Type :=
NBR_ADDR_TYPE, and Value := ORIGINATOR, or with Value :=
ROUTABLE_ORIG if that address object is also to be associated with
Value = ROUTABLE.
HELLO messages are first processed as specified in [NHDP]. That o If the TC message is complete, all routable addresses which are in
processing includes identifying (or creating) a Neighbor Tuple the N_neighbor_addr_list of a Neighbor Tuple with N_advertised =
corresponding to the originator of the HELLO message (the "current true MUST be represented by address objects in one or more Address
Neighbor Tuple"). After this, the following MUST be performed: Blocks. If the TC message is incomplete then any such address
objects MAY be included. At least one copy of each such address
object MUST be associated with an Address Block TLV with Type =
NBR_ADDR_TYPE, and Value = ROUTABLE, or with Value = ROUTABLE_ORIG
if also to be associated with Value = ORIGINATOR.
1. If the HELLO message has a well-defined message originator o If the TC message is complete, all network addresses which are the
address, i.e., has an <msg-orig-addr> element or has zero or one AL_net_addr of a Local Attached Network Tuple MUST be represented
addresses associated with a TLV with Type = LOCAL_IF: by address objects in one or more Address Blocks. If the TC
message is incomplete then any such address objects MAY be
included. At least one copy of each such address object MUST be
associated with an Address Block TLV with Type := GATEWAY, and
Value := AN_dist.
1. Remove any other Neighbor Tuples with N_orig_addr = message A TC message MAY contain:
originator address, taking any consequent action (including
removing one or more Link Tuples) as specified in [NHDP].
2. The current Neighbor Tuple is then updated according to: o A single Message TLV with Type := INTERVAL_TIME, as specified in
[RFC5497]. If all TC messages are sent with the same hop limit
then this TLV MUST have a value encoding the period TC_INTERVAL.
If TC messages are sent with different hop limits, then this TLV
MUST specify times that vary with the number of hops distance
appropriate to the chosen pattern of TC message hop limits, as
specified in [RFC5497]; these times SHOULD be appropriate
multiples of TC_INTERVAL. The options included in [RFC5497] for
representing zero and infinite times MUST NOT be used.
1. N_orig_addr := message originator address; 15.2. TC Message TLVs
2. Update N_willingness as described in Section 10.1; This specification defines one Message TLV and two Address Block TLV
that may be used in TC messages by this specification.
3. Update N_mpr_selector as described in Section 10.2. 15.2.1. Message TLVs
2. If there are any changes to the router's Information Bases, then In a TC message, a router MAY include at most one (and except in an
perform the processing defined in Section 13. exceptional case MUST include exactly one) CONT_SEQ_NUM Message TLV
as specified in Table 3.
10.1. Updating Willingness +--------------+--------------+-------------------------------------+
| Type | Value Length | Value |
+--------------+--------------+-------------------------------------+
| CONT_SEQ_NUM | 2 octets | The ANSN contained in the Neighbor |
| | | Information Base. |
+--------------+--------------+-------------------------------------+
N_willingness in the current Neighbor Tuple is updated as follows: Table 3: CONT_SEQ_NUM TLV definition
1. If the HELLO message contains a Message TLV with Type = 15.2.2. Address Block TLVs
MPR_WILLING then N_willingness := the Value of that TLV;
2. Otherwise, N_willingness := WILL_DEFAULT. In a TC message, a router MAY include NBR_ADDR_TYPE Address Block
TLV(s) as specified in Table 4.
10.2. Updating MPR Selectors +---------------+--------------+------------------------------------+
| Type | Value Length | Value |
+---------------+--------------+------------------------------------+
| NBR_ADDR_TYPE | 1 octet | ORIGINATOR indicates that the |
| | | corresponding address (which MUST |
| | | have maximum prefix length) is an |
| | | originator address, ROUTABLE |
| | | indicates that the corresponding |
| | | network address is a routable |
| | | address of an interface, |
| | | ROUTABLE_ORIG indicates that the |
| | | corresponding address is both |
+---------------+--------------+------------------------------------+
N_mpr_selector is updated as follows: Table 4: NBR_ADDR_TYPE TLV definition
1. If a router finds any of its local interface addresses (i.e., If an address is both a originator address and a routable address,
those contained in the I_local_iface_addr_list of an OLSRv2 then it may be associated with either one Address Block TLV with Type
interface) with an associated TLV with Type = MPR in the HELLO := NBR_ADDR_TYPE and Value := ROUTABLE_ORIG, or with two Address
message (indicating that the originating router has selected the Block TLVs with Type:= NBR_ADDR_TYPE, one with Value := ORIGINATOR
receiving router as an MPR) then, for the current Neighbor Tuple: and one with Value := ROUTABLE.
* N_mpr_selector := true In a TC message, a router MAY include GATEWAY Address Block TLV(s) as
specified in Table 5.
2. Otherwise (i.e., if no such address and TLV were found) if a +---------+--------------+-------------------------------------+
router finds any of its local interface addresses with an | Type | Value Length | Value |
associated TLV with Type = LINK_STATUS and Value = SYMMETRIC in +---------+--------------+-------------------------------------+
the HELLO message, then for the current Neighbor Tuple: | GATEWAY | 1 octet | Number of hops to attached network. |
+---------+--------------+-------------------------------------+
* N_mpr_selector := false Table 5
* N_advertised := false All address objects included in a TC message according to this
specification MUST be associated either with at least one TLV with
Type := NBR_ADDR_TYPE or with a TLV with Type := GATEWAY, but not
both. Any other address objects MAY be included in Address Blocks in
a TC message, but are ignored by this specification.
11. TC Message Generation 15.3. TC Message Transmission
A router with one or more OLSRv2 interfaces, and with any Neighbor A router with one or more OLSRv2 interfaces, and with any Neighbor
Tuples with N_advertised = true, or with a non-empty Local Attached Tuples with N_advertised = true, or with a non-empty Local Attached
Network Set MUST generate TC messages. A router which does not have Network Set MUST generate TC messages. A router which does not have
such information to advertise SHOULD also generate "empty" TC such information to advertise SHOULD also generate "empty" TC
messages for a period A_HOLD_TIME after it last generated a non-empty messages for a period A_HOLD_TIME after it last generated a non-empty
TC message. TC messages (non-empty and empty) are generated TC message.
according to the following:
1. The message originator address MUST be the router's originator
address.
2. The message hop count, if included, MUST be set to zero.
3. The message hop limit MUST be set to a value greater than 1. A
router MAY use the same hop limit TC_HOP_LIMIT in all TC
messages, or use different values of the hop limit TC_HOP_LIMIT
in TC messages, see Section 5.8.
4. The message MUST contain a Message TLV with Type := CONT_SEQ_NUM
and Value := ANSN from the Neighbor Information Base. If the TC
message is complete then this Message TLV MUST have Type
Extension := COMPLETE, otherwise it MUST have Type Extension :=
INCOMPLETE. (Exception: a TC message MAY omit such a Message TLV
if the TC message is not reporting any addresses with associated
TLV with Type = NBR_ADDR_TYPE or Type = GATEWAY.)
5. The message MUST contain a Message TLV with Type :=
VALIDITY_TIME, as specified in [RFC5497]. If all TC messages are
sent with the same hop limit then this TLV MUST have Value :=
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
times which vary with the number of hops distance appropriate to
the chosen pattern of TC message hop limits, as specified in
[RFC5497], these times SHOULD be appropriate multiples of
T_HOLD_TIME.
6. The message MAY contain a Message TLV with Type := INTERVAL_TIME,
as specified in [RFC5497]. If all TC messages are sent with the
same hop limit then this TLV MUST have Value := TC_INTERVAL. If
TC messages are sent with different hop limits, then this TLV
MUST specify times which vary with the number of hops distance
appropriate to the chosen pattern of TC message hop limits, as
specified in [RFC5497], these times SHOULD be appropriate
multiples of TC_INTERVAL.
7. A complete message MUST include, and an incomplete message MAY
include, in its Address Blocks:
1. N_orig_addr in each Neighbor Tuple with N_advertised = true,
associated with a TLV with Type := NBR_ADDR_TYPE and Value :=
ORIGINATOR (or Value := ROUTABLE_ORIG if also to be
associated with Value = ROUTABLE).
2. Each routable address in an N_neighbor_addr_list in each
Neighbor Tuple with N_advertised = true, associated with a
TLV with Type := NBR_ADDR_TYPE and Value := ROUTABLE (or
Value := ROUTABLE_ORIG if also to be associated with Value =
ORIGINATOR).
3. AL_net_addr in each Local Attached Neighbor Tuple, each
associated with a TLV with Type := GATEWAY and Value :=
AL_dist.
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 router of TC_INTERVAL. consecutive TC transmissions by the same router of TC_INTERVAL.
TC messages MAY be generated in response to a change in the TC messages MAY be generated in response to a change in the
information which they are to advertise, indicated by a change in information which they are to advertise, indicated by a change in the
ANSN. In this case a router MAY send a complete TC message, and if ANSN in the Neighbor Information Base. In this case a router MAY
so MAY re-start its TC message schedule. Alternatively a router MAY send a complete TC message, and if so MAY re-start its TC message
send an incomplete TC message with at least the newly advertised schedule. Alternatively a router MAY send an incomplete TC message
addresses (i.e. not previously, but now, an N_orig_addr or an with at least the newly advertised network addresses (i.e., not
N_neighbor_addr_list in a Neighbor Tuple with N_advertised = true, or previously, but now, an N_orig_addr or in an N_neighbor_addr_list in
in an AL_net_addr) in its Address Blocks, with associated TLV(s). a Neighbor Tuple with N_advertised = true, or an AL_net_addr) in its
Note that a router cannot report removal of advertised content using Address Blocks, with associated Address Block TLV(s). Note that a
an incomplete TC message. router cannot report removal of advertised content using an
incomplete TC message.
When sending a TC message in response to a change of advertised When sending a TC message in response to a change of advertised
addresses, a router must respect a minimum interval of network addresses, a router MUST respect a minimum interval of
TC_MIN_INTERVAL between generated TC messages. Sending an incomplete TC_MIN_INTERVAL between generated TC messages. Sending an incomplete
TC message MUST NOT cause the interval between complete TC messages TC message MUST NOT cause the interval between complete TC messages
to be increased, and thus a router MUST NOT send an incomplete TC to be increased, and thus a router MUST NOT send an incomplete TC
message if within TC_MIN_INTERVAL of the next scheduled complete TC message if within TC_MIN_INTERVAL of the next scheduled complete TC
message. message.
The generation of TC messages, whether scheduled or triggered by a The generation of TC messages, whether scheduled or triggered by a
change of contents MAY be jittered as described in [RFC5148]. The change of contents, MAY be jittered as described in [RFC5148]. The
values of MAXJITTER used SHOULD be: values of MAXJITTER used 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 [RFC5444]. These 15.4. TC Message Processing
packets MAY contain other messages, including HELLO messages and TC
messages with different originator addresses. TC messages are
forwarded according to the specification in Section 7.3.
12. TC Message Processing
On receiving a TC message, a router MUST first check if the message On receiving a TC message, the receiving router MUST then follow the
is invalid for processing by this router, as defined in Section 12.1. processing and forwarding procedure, defined in Section 13.
Otherwise the receiving router MUST update its appropriate Interface
Information Base and its Router Information Base as specified in
Section 12.2.
All TC message processing, including determination of whether a If the message is considered for processing (Section 13.2), then a
message is invalid, unless otherwise noted considers only TLVs with router MUST first check if the message is invalid for processing by
Type Extension = 0. TLVs with any other type extension (or any this router, as defined in Section 15.4.1. A router MAY make a
unmentioned type extension when other type extensions are considered) similar check before considering a message for forwarding, it MUST
are ignored. All references to, for example, a TLV with Type = make those aspects of the check that apply to elements in the Message
VALIDITY_TIME refer to a TLV with Type = VALIDITY_TIME and Type Header.
Extension = 0.
Following TC message processing, if there are any changes in the If the TC message is not invalid, then the TC message type specific
router's Information Bases, then the processing in Section 13 MUST be processing, described in Section 15.4.2 MUST be applied. This will
update its appropriate Interface Information Base and its Router
Information Base. Following this, if there are any changes in these
Information Bases, then the processing in Section 16 MUST be
performed. performed.
12.1. Invalid Message 15.4.1. Invalid Message
A received TC message is invalid for processing by this router if the A received TC message is invalid for processing by this router if the
message: message:
o Does not include a message originator address, a message sequence o The address length as specified in the Message Header is not equal
number, and a hop limit. to the length of the addresses used by this router.
o Does not include a message originator address and a message
sequence number.
o Does not include a hop count, and contains a multi-value TLV with o Does not include a hop count, and contains a multi-value TLV with
Type = VALIDITY_TIME or Type = INTERVAL_TIME, as defined in Type = VALIDITY_TIME or Type = INTERVAL_TIME, as defined in
[RFC5497]. [RFC5497].
o Does not have exactly one TLV with Type = VALIDITY_TIME in its o Does not have exactly one Message TLV with Type = VALIDITY_TIME.
Message TLV Block.
o Has more than one TLV with Type = INTERVAL_TIME in its Message TLV
Block.
o Does not have a TLV with Type = CONT_SEQ_NUM and Type Extension =
COMPLETE or Type Extension = INCOMPLETE in its Message TLV Block,
and contains at least one address associated with a TLV with Type
= NBR_ADDR_TYPE or Type = GATEWAY.
o Has more than one TLV with Type = CONT_SEQ_NUM and Type Extension
= COMPLETE or Type Extension = INCOMPLETE in its Message TLV
Block.
o Has a message originator address, or any address associated with a
TLV with Type = NBR_ADDR_TYPE or Type = GATEWAY, that the
receiving router has recorded as:
* its originator address, OR;
* as the O_orig_addr in an Originator Tuple, OR; o Has more than one Message TLV with Type = INTERVAL_TIME.
* in an I_local_iface_addr_list in a Local Interface Tuple, OR; o Does not have a Message TLV with Type = CONT_SEQ_NUM and Type
Extension = COMPLETE or Type Extension = INCOMPLETE, and contains
at least one address object associated with an Address Block TLV
with Type = NBR_ADDR_TYPE or Type = GATEWAY.
* the IR_local_iface_addr in a Removed Interface Address Tuple. o Has more than one Message TLV with Type = CONT_SEQ_NUM and Type
Extension = COMPLETE or Type Extension = INCOMPLETE.
o Has a message originator address, or any address associated with a o Has a message originator address that is partially owned by this
TLV with Type = NBR_ADDR_TYPE, that the receiving router has router.
recorded as the AL_net_addr in a Local Attached Network Tuple.
o Includes any address with a prefix length which is not maximal o Includes any address object with a prefix length which is not
(equal to the address length, in bits) associated with a TLV with maximal (equal to the address length, in bits), associated with an
Type = NBR_ADDR_TYPE and Value = ORIGINATOR or Value = Address Block TLV with Type = NBR_ADDR_TYPE and Value = ORIGINATOR
ROUTABLE_ORIG. or Value = ROUTABLE_ORIG.
o Includes any non-routable address associated with a TLV with Type o Includes any address object that represents a non-routable
= NBR_ADDR_TYPE and Value = ROUTABLE or Value = ROUTABLE_ORIG. address, associated with an Address Block TLV with Type =
NBR_ADDR_TYPE and Value = ROUTABLE or Value = ROUTABLE_ORIG.
o Includes any address associated with a TLV with Type = o Includes any address object associated with an Address Block TLV
NBR_ADDR_TYPE or Type = GATEWAY that is also the message's with Type = NBR_ADDR_TYPE or Type = GATEWAY that also represents
originator address. the message's originator address.
o Associates any address (including different copies of an address, o Associates any address object (including different copies of an
in the same or different Address Blocks) with more than one single address object, in the same or different Address Blocks) with more
Value using one or more TLV(s) with Type = GATEWAY. than one single value using one or more Address Block TLV(s) with
Type = GATEWAY.
o Associates any address (including different copies of an address, o Associates any address object (including different copies of an
in the same or different Address Blocks) with TLVs with Type = address object, in the same or different Address Blocks) with
NBR_ADDR_TYPE and Type = GATEWAY. Address Block TLVs with Type = NBR_ADDR_TYPE and Type = GATEWAY.
A router MAY recognize additional reasons for identifying that a A router MAY recognize additional reasons for identifying that a
message is invalid. An invalid message MUST be silently discarded, message is invalid. An invalid message MUST be silently discarded,
without updating the router's Information Bases. without updating the router's Information Bases.
12.2. TC Message Processing Definitions 15.4.2. TC Message Processing Definitions
When, according to Section 7.2, a TC message is to be "processed When, according to Section 13.2, a TC message is to be "processed
according to its type", this means that: according to its type", this means that:
o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM
and Type Extension = COMPLETE, then processing according to and Type Extension = COMPLETE, then processing according to
Section 12.3 and then according to Section 12.4 is carried out. Section 15.4.3 and then according to Section 15.4.4 is carried
out.
o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM o If the TC message contains a Message TLV with Type = CONT_SEQ_NUM
and Type Extension = INCOMPLETE, then only processing according to and Type Extension = INCOMPLETE, then only processing according to
Section 12.3 is carried out. Section 15.4.3 is carried out.
For the purposes of this section: For the purposes of this section:
o "validity time" is calculated from a VALIDITY_TIME Message TLV in o "validity time" is calculated from a VALIDITY_TIME Message TLV in
the TC message according to the specification in [RFC5497]. All the TC message according to the specification in [RFC5497]. All
information in the TC message has the same validity time. information in the TC message has the same validity time.
o "received ANSN" is defined as being the Value of a Message TLV o "received ANSN" is defined as being the value of a Message TLV
with Type = CONT_SEQ_NUM. with Type = CONT_SEQ_NUM.
o Comparisons of sequence numbers are carried out as specified in o Comparisons of sequence numbers are carried out as specified in
Section 17. Section 20.
12.3. Initial TC Message Processing 15.4.3. Initial TC Message Processing
The TC message is processed as follows: The TC message is processed as follows:
1. The Advertising Remote Router Set is updated according to 1. The Advertising Remote Router Set is updated according to
Section 12.3.1. If the TC message is indicated as discarded in Section 15.4.3.1. If the TC message is indicated as discarded in
that processing then the following steps are not carried out. that processing then the following steps are not carried out.
2. The Router Topology Set is updated according to Section 12.3.2. 2. The Router Topology Set is updated according to Section 15.4.3.2.
3. The Routable Address Topology Set is updated according to 3. The Routable Address Topology Set is updated according to
Section 12.3.3. Section 15.4.3.3.
4. The Attached Network Set is updated according to Section 12.3.4. 4. The Attached Network Set is updated according to
Section 15.4.3.4.
12.3.1. Populating the Advertising Remote Router Set 15.4.3.1. Populating the Advertising Remote Router Set
The router MUST update its Advertising Remote Router Set as follows: The router MUST update its Advertising Remote Router Set as follows:
1. If there is an Advertising Remote Router Tuple with: 1. If there is an Advertising Remote Router Tuple with:
* AR_orig_addr = message originator address; AND * AR_orig_addr = message originator address, AND;
* AR_seq_number > received ANSN * AR_seq_number > received ANSN,
then the TC message MUST be discarded. then the TC message MUST be discarded.
2. Otherwise: 2. Otherwise:
1. If there is no Advertising Remote Router Tuple such that: 1. If there is no Advertising Remote Router Tuple such that:
+ AR_orig_addr = message originator address; + AR_orig_addr = message originator address;
then create an Advertising Remote Router Tuple with: then create an Advertising Remote Router Tuple with:
+ AR_orig_addr := message originator address. + AR_orig_addr := message originator address.
2. This Advertising Remote Router Tuple (existing or new) is 2. This Advertising Remote Router Tuple (existing or new) is
then modified as follows: then modified as follows:
+ AR_seq_number := received ANSN; + AR_seq_number := received ANSN;
+ AR_time := current time + validity time. + AR_time := current time + validity time.
12.3.2. Populating the Router Topology Set 15.4.3.2. Populating the Router Topology Set
The router MUST update its Router Topology Set as follows: The router MUST update its Router Topology Set as follows:
1. For each address (henceforth advertised address) in an Address 1. For each address (henceforth advertised address) corresponding to
Block that has an associated TLV with Type = NBR_ADDR_TYPE and one or more address objects with an associated Address Block TLV
Value = ORIGINATOR or Value = ROUTABLE_ORIG, perform the with Type = NBR_ADDR_TYPE and Value = ORIGINATOR or Value =
following processing: ROUTABLE_ORIG, and that is not partially owned by this router,
perform the following processing:
1. If there is no Router Topology Tuple such that: 1. If there is no Router Topology Tuple such that:
+ TR_from_orig_addr = message originator address; AND + TR_from_orig_addr = message originator address, AND;
+ TR_to_orig_addr = advertised address + TR_to_orig_addr = advertised address,
then create a new Router Topology Tuple with: then create a new Router Topology Tuple with:
+ TR_from_orig_addr := message originator address + TR_from_orig_addr := message originator address;
+ TR_to_orig_addr := advertised address. + TR_to_orig_addr := advertised address.
2. This Router Topology Tuple (existing or new) is then modified 2. This Router Topology Tuple (existing or new) is then modified
as follows: as follows:
+ TR_seq_number := received ANSN; + TR_seq_number := received ANSN;
+ TR_time := current time + validity time. + TR_time := current time + validity time.
12.3.3. Populating the Routable Address Topology Set 15.4.3.3. Populating the Routable Address Topology Set
The router MUST update its Routable Address Topology Set as follows: The router MUST update its Routable Address Topology Set as follows:
1. For each address (henceforth advertised address) in an Address 1. For each network address (henceforth advertised address)
Block that has an associated TLV with Type = NBR_ADDR_TYPE and corresponding to one or more address objects with an associated
Value = ROUTABLE or Value = ROUTABLE_ORIG, perform the following Address Block TLV with Type = NBR_ADDR_TYPE and Value = ROUTABLE
processing: or Value = ROUTABLE_ORIG, and that is not partially owned by this
router, perform the following processing:
1. If there is no Routable Address Topology Tuple such that: 1. If there is no Routable Address Topology Tuple such that:
+ TA_from_orig_addr = message originator address; AND + TA_from_orig_addr = message originator address, AND;
+ TA_dest_addr = advertised address + TA_dest_addr = advertised address,
then create a new Routable Address Topology Tuple with: then create a new Routable Address Topology Tuple with:
+ TA_from_orig_addr := message originator address; + TA_from_orig_addr := message originator address;
+ TA_dest_addr := advertised address. + TA_dest_addr := advertised address.
2. This Routable Address Topology Tuple (existing or new) is 2. This Routable Address Topology Tuple (existing or new) is
then modified as follows: then modified as follows:
+ TA_seq_number := received ANSN; + TA_seq_number := received ANSN;
+ TA_time := current time + validity time. + TA_time := current time + validity time.
12.3.4. Populating the Attached Network Set 15.4.3.4. Populating the Attached Network Set
The router MUST update its Attached Network Set as follows: The router MUST update its Attached Network Set as follows:
1. For each address (henceforth advertised address) in an Address 1. For each network address (henceforth attached address)
Block that has an associated TLV with Type = GATEWAY, and is not corresponding to one or more address objects with an associated
an AL_net_addr in a Local Attached Network Tuple, perform the Address Block TLV with Type = GATEWAY, and that is not fully
following processing: owned by this router, perform the following processing:
1. If there is no Attached Network Tuple such that: 1. If there is no Attached Network Tuple such that:
+ AN_net_addr = network address; AND + AN_net_addr = attached address, AND;
+ AN_orig_addr = message originator address + AN_orig_addr = message originator address,
then create a new Attached Network Tuple with: then create a new Attached Network Tuple with:
+ AN_net_addr := network address; + AN_net_addr := attached address;
+ AN_orig_addr := message originator address. + AN_orig_addr := message originator address.
2. This Attached Network Tuple (existing or new) is then 2. This Attached Network Tuple (existing or new) is then
modified as follows: modified as follows:
+ AN_dist := the Value of the associated GATEWAY TLV; + AN_dist := the Value of the associated GATEWAY TLV;
+ AN_seq_number := received ANSN; + AN_seq_number := received ANSN;
+ AN_time := current time + validity time. + AN_time := current time + validity time.
12.4. Completing TC Message Processing 15.4.4. Completing TC Message Processing
The TC message is processed as follows: The TC message is processed as follows:
1. The Router Topology Set is updated according to Section 12.4.1. 1. The Router Topology Set is updated according to Section 15.4.4.1.
2. The Routable Address Topology Set is updated according to 2. The Routable Address Topology Set is updated according to
Section 12.4.2. Section 15.4.4.2.
3. The Attached Network Set is updated according to Section 12.4.3. 3. The Attached Network Set is updated according to
Section 15.4.4.3.
12.4.1. Purging the Router Topology Set 15.4.4.1. Purging the Router Topology Set
The Router Topology Set MUST be updated as follows: The Router Topology Set MUST be updated as follows:
1. Any Router Topology Tuples with: 1. Any Router Topology Tuples with:
* TR_from_orig_addr = message originator address; AND * TR_from_orig_addr = message originator address, AND;
* TR_seq_number < received ANSN * TR_seq_number < received ANSN,
MUST be removed. MUST be removed.
12.4.2. Purging the Routable Address Topology Set 15.4.4.2. Purging the Routable Address Topology Set
The Routable Address Topology Set MUST be updated as follows: The Routable Address Topology Set MUST be updated as follows:
1. Any Routable Address Topology Tuples with: 1. Any Routable Address Topology Tuples with:
* TA_from_orig_addr = message originator address; AND * TA_from_orig_addr = message originator address, AND;
* TA_seq_number < received ANSN * TA_seq_number < received ANSN,
MUST be removed. MUST be removed.
12.4.3. Purging the Attached Network Set 15.4.4.3. Purging the Attached Network Set
The Attached Network Set MUST be updated as follows: The Attached Network Set MUST be updated as follows:
1. Any Attached Network Tuples with: 1. Any Attached Network Tuples with:
* AN_orig_addr = message originator address; AND * AN_orig_addr = message originator address, AND;
* AN_seq_number < received ANSN * AN_seq_number < received ANSN,
MUST be removed. MUST be removed.
13. Information Base Changes 16. Information Base Changes
The changes described in the following sections MUST be carried out The changes described in the following sections MUST be carried out
when any Information Base changes as indicated. when any Information Base changes as indicated.
13.1. Originator Address Changes 16.1. Originator Address Changes
If the router changes originator address, then: If the router changes originator address, then:
1. If there is no Originator Tuple with: 1. If there is no Originator Tuple with:
* O_orig_addr = old originator address * O_orig_addr = old originator address
then create an Originator Tuple with: then create an Originator Tuple with:
* O_orig_addr := old originator address * O_orig_addr := old originator address
The Originator Tuple (existing or new) with: The Originator Tuple (existing or new) with:
* O_orig_addr = new originator address * O_orig_addr = new originator address
is then modified as follows: is then modified as follows:
* O_time := current time + O_HOLD_TIME * O_time := current time + O_HOLD_TIME
13.2. Neighbor State Changes 16.2. Neighbor State Changes
The N_mpr_selector and N_advertised flags in Neighbor Tuples MUST be The N_mpr_selector and N_advertised flags in Neighbor Tuples MUST be
maintained according to the following rules: maintained according to the following rules:
1. If N_symmetric = false, then N_mpr_selector = false and 1. If N_symmetric = false, then N_mpr_selector = false and
N_advertised = false. N_advertised = false.
2. If N_mpr_selector = true, then N_advertised = true. 2. If N_mpr_selector = true, then N_advertised = true.
3. In other cases (i.e. N_symmetric = true and N_mpr_selector = 3. In other cases (i.e., N_symmetric = true and N_mpr_selector =
false) a router MAY select N_advertised = true or N_advertised = false) a router MAY select N_advertised = true or N_advertised =
false. The more neighbors that are advertised, the larger TC false. The more neighbors that are advertised, the larger TC
messages become, but the more redundancy is available for messages become, but the more redundancy is available for
routing. A router SHOULD consider the nature of its network in routing. A router SHOULD consider the nature of its network in
making such a decision, and SHOULD avoid unnecessary changes in making such a decision, and SHOULD avoid unnecessary changes in
advertising status, which may result both in additional TC advertising status, which may result both in additional TC
messages having to be sent by its neighbors, and in unnecessary messages having to be sent by its neighbors, and in unnecessary
changes to routing, which will have similar effects to other changes to routing, which will have similar effects to other
forms of topology changes in the MANET. forms of topology changes in the MANET.
13.3. Advertised Neighbor Changes 16.3. Advertised Neighbor Changes
The router MUST increment the ANSN in the Neighbor Information Base The router MUST increment the ANSN in the Neighbor Information Base
whenever: whenever:
1. Any Neighbor Tuple changes its N_advertised value. 1. Any Neighbor Tuple changes its N_advertised value.
2. N_orig_addr is changed, or any routable address is added to or 2. N_orig_addr is changed, or any routable address is added to or
removed from any Neighbor Tuple with N_advertised = true. removed from any Neighbor Tuple with N_advertised = true.
3. There is any change to the Local Attached Network Set. 3. Any Neighbor Tuple with N_advertised = true is removed.
13.4. Advertising Remote Router Tuple Expires 4. There is any change to the Local Attached Network Set.
16.4. Advertising Remote Router Tuple Expires
The Router Topology Set, the Routable Address Topology Set and the The Router Topology Set, the Routable Address Topology Set and the
Attached Network Set MUST be changed when an Advertising Remote Attached Network Set MUST be changed when an Advertising Remote
Router Tuple expires (AR_time is reached). The following changes are Router Tuple expires (AR_time is reached). The following changes are
required before the Advertising Remote Router Tuple is removed: required before the Advertising Remote Router Tuple is removed:
1. All Router Topology Tuples with: 1. All Router Topology Tuples with:
* TR_from_orig_addr = AR_orig_addr of the Advertising Remote * TR_from_orig_addr = AR_orig_addr of the Advertising Remote
Router Tuple Router Tuple
skipping to change at page 53, line 12 skipping to change at page 52, line 26
are removed. are removed.
3. All Attached Network Tuples with: 3. All Attached Network Tuples with:
* AN_orig_addr = AR_orig_addr of the Advertising Remote Router * AN_orig_addr = AR_orig_addr of the Advertising Remote Router
Tuple Tuple
are removed. are removed.
13.5. Neighborhood Changes and MPR Updates 16.5. Neighborhood Changes and MPR Updates
The set of symmetric 1-hop neighbors selected as MPRs MUST satisfy The set of symmetric 1-hop neighbors selected as MPRs MUST satisfy
the conditions defined in Section 14. To ensure this: the conditions defined in Section 17. To ensure this:
1. The set of MPRs of a router MUST be recalculated if: 1. The set of MPRs of a router MUST be recalculated if:
* a Link Tuple is added with L_status = SYMMETRIC, OR; * a Link Tuple is added with L_status = SYMMETRIC, OR;
* a Link Tuple with L_status = SYMMETRIC is removed, OR; * a Link Tuple with L_status = SYMMETRIC is removed, OR;
* a Link Tuple with L_status = SYMMETRIC changes to having * a Link Tuple with L_status = SYMMETRIC changes to having
L_status = HEARD or L_status = LOST, OR; L_status = HEARD or L_status = LOST, OR;
* a Link Tuple with L_status = HEARD or L_status = LOST changes * a Link Tuple with L_status = HEARD or L_status = LOST changes
to having L_status = SYMMETRIC, OR; to having L_status = SYMMETRIC, OR;
* a 2-Hop Tuple is added or removed, OR; * a 2-Hop Tuple is added or removed, OR;
* the N_willingness of a Neighbor Tuple with N_symmetric = true * the N_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_mpr = true
and N_mpr = true changes to WILL_NEVER from any other value, changes to WILL_NEVER from any other value, OR;
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 = false changes to WILL_ALWAYS from any other value. and N_mpr = false changes to WILL_ALWAYS from any other value.
2. Otherwise, the set of MPRs of a router MAY be recalculated if the 2. Otherwise, the set of MPRs of a router MAY be recalculated if the
N_willingness of a Neighbor Tuple with N_symmetric = true changes N_willingness of a Neighbor Tuple with N_symmetric = true changes
in any other way; it SHOULD be recalculated if N_mpr = false and 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 this is an increase in N_willingness or if N_mpr = true and this
is a decrease in N_willingness. is a decrease in N_willingness.
If the set of MPRs of a router 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 17. Before that calculation, the N_mpr of all
Neighbor Tuples are set false (although the previous values of N_mpr Neighbor Tuples are set false (although the previous values of N_mpr
MAY be used by an algorithm that minimises changes to the set of MAY be used by an algorithm that minimizes changes to the set of
MPRs). After that calculation the N_mpr of all Neighbor Tuples MPRs). After that calculation the N_mpr of all Neighbor Tuples
representing symmetric 1-hop neighbors which are chosen as MPRs, are representing symmetric 1-hop neighbors that are chosen as MPRs, are
set true. set true.
13.6. Routing Set Updates 16.6. Routing Set Updates
The Routing Set MUST be updated, as described in Section 15 when The Routing Set MUST be updated, as described in Section 18 when
changes in the Local Information Base, the Neighborhood Information changes in the Local Information Base, the Neighborhood Information
Base or the Topology Information Base indicate a change of the known Base or the Topology Information Base indicate a change of the known
symmetric links and/or attached networks in the MANET, hence changing symmetric links and/or attached networks in the MANET, hence changing
the Topology Graph. It is sufficient to consider only changes which the Topology Graph. It is sufficient to consider only changes which
affect at least one of: affect at least one of:
o The Local Interface Set, if the change removes any address in an o The Local Interface Set, if the change removes any network address
I_local_iface_addr_list. In this case, unless the OLSRv2 in an I_local_iface_addr_list. In this case, unless the OLSRv2
interface is removed, it may not be necessary to do more than interface is removed, it may not be necessary to do more than
replace such addresses, if used, by an alternative address from replace such network addresses, if used, by an alternative network
the same I_local_iface_addr_list. address from the same I_local_iface_addr_list.
o The Local Attached Set, if the change removes any AL_net_addr o The Local Attached Set, if the change removes any AL_net_addr
which is also an AN_net_addr. In this case it may not be which is also an AN_net_addr. In this case it may not be
necessary to do more than add and remove Routing Tuples with necessary to do more than add Routing Tuples with R_dest_addr
R_dest_addr equal to that AN_net_addr. equal to that AN_net_addr.
o The Link Set of any OLSRv2 interface, and to consider only Link o The Link Set of any OLSRv2 interface, 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 router, and to consider only Neighbor o The Neighbor Set of the router, and to consider only Neighbor
Tuples that have, or just had, N_symmetric = true, and do not have Tuples that have, or just had, N_symmetric = true, and do not have
N_orig_addr = unknown. N_orig_addr = unknown.
o The 2-Hop Set of any OLSRv2 interface, if used in the creation of o The 2-Hop Set of any OLSRv2 interface, if used in the creation of
the Routing Set. the Routing Set.
o The Router Topology Set of the router. o The Router Topology Set of the router.
o The Routable Address Topology Set of the router. o The Routable Address Topology Set of the router.
o The Attached Network Set of the router. o The Attached Network Set of the router.
14. Selecting MPRs 17. Selecting MPRs
Each router MUST select, from among its willing symmetric 1-hop Each router MUST select, from among its willing symmetric 1-hop
neighbors, a subset of these routers as MPRs. Only MPRs forward neighbors, a subset of these routers as MPRs. Only MPRs forward
control messages flooded through the MANET, thus effecting a flooding control messages flooded through the MANET, thus effecting a flooding
reduction, an optimization of the classical flooding mechanism, known reduction, an optimization of the classical flooding mechanism, known
as MPR flooding. MPRs MAY also be used to effect a topology as MPR flooding. MPRs MAY also be used to effect a topology
reduction in the MANET. Consequently, while it is not essential that reduction in the MANET. Consequently, while it is not essential that
the set of MPRs is minimal, keeping the number of MPRs small ensures the set of MPRs is minimal, keeping the number of MPRs small ensures
that the overhead is kept at a minimum. that the overhead is kept at a minimum.
skipping to change at page 55, line 27 skipping to change at page 54, line 41
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 router 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 router through that OLSRv2 interface will receive of the selecting router through that OLSRv2 interface will receive
that message over a symmetric link. that message over a symmetric link.
When a router selects its set of MPRs it MAY consider any other
characteristics of its neighbors that it is aware of. In particular
it SHOULD consider the willingness of the neighbor, as recorded by
the corresponding N_willingness value, preferring neighbors with
higher values of N_willingness, but MAY consider other
characteristics to have a greater significance.
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 router is a set of all willing symmetric 1-hop neighbors of a router is a
(maximal) valid set of MPRs for that router. However a router SHOULD (maximal) valid set of MPRs for that router. However a router SHOULD
NOT select a symmetric 1-hop neighbor with Willingness != WILL_ALWAYS NOT select a symmetric 1-hop neighbor with N_willingness !=
as an MPR if there are no symmetric strict 2-hop neighbors with a WILL_ALWAYS as an MPR if there are no symmetric strict 2-hop
symmetric link to that symmetric 1-hop neighbor. Thus a router with neighbors with a symmetric link to that symmetric 1-hop neighbor.
no symmetric 1-hop neighbors with willingness WILL_ALWAYS and with no Thus a router with no symmetric 1-hop neighbors with N_willingness =
symmetric strict 2-hop neighbors SHOULD NOT select any MPRs. WILL_ALWAYS and with no symmetric strict 2-hop neighbors SHOULD NOT
select any MPRs.
A router 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 router MAY select its MPRs independently from the interface. Each router MAY select its MPRs independently from the
MPR selection by other routers, or it MAY, for example, give MPR selection by other routers, or it MAY, for example, give
preference to routers that either are, or are not, already selected preference to routers that either are, or are not, already selected
as MPRs by other routers. 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 only, and the Neighbor Set of the router OLSRv2 interface only, and the Neighbor Set of the router
(specifically the N_willingness elements). (specifically the N_willingness elements).
The selection of MPRs (overall, not per OLSRv2 interface) is recorded The selection of MPRs is recorded in the Neighbor Set of the router,
in the Neighbor Set of the router (using the N_mpr elements). A by setting N_mpr = true for any selected MPR (on any OLSRv2
selected MPR MUST be a willing symmetric 1-hop neighbor (i.e. the interface) and ensuring that N_mpr = false otherwise. A selected MPR
corresponding N_symmetric = true, and the corresponding N_willingness MUST be a willing symmetric 1-hop neighbor (i.e., MUST have
!= WILL_NEVER). corresponding N_symmetric = true, and corresponding N_willingness !=
WILL_NEVER). Note that although selected per OLSRv2 interface, MPRs
are recorded and used independent of interface, i.e., a router's set
of MPRs is the union of the sets of MPRs selected per OLSRv2
interface.
A router MUST recalculate its MPRs whenever the currently selected A router MUST recalculate its MPRs whenever the currently selected
set of MPRs does not still satisfy the required conditions. It MAY set of MPRs does not still satisfy the required conditions. It MAY
recalculate its MPRs if the current set of MPRs is still valid, but recalculate its MPRs if the current set of MPRs is still valid, but
could be more efficient. Sufficient conditions to recalculate a could be more efficient. Sufficient conditions to recalculate a
router's set of MPRs are given in Section 13.5. router's set of MPRs are given in Section 16.5.
An example algorithm that creates a set of MPRs that satisfies the An example algorithm that creates a set of MPRs that satisfies the
required conditions is given in Appendix A. required conditions is given in Appendix A.
15. Routing Set Calculation 18. Routing Set Calculation
The Routing Set of a router is populated with Routing Tuples that The Routing Set of a router is populated with Routing Tuples that
represent paths from that router to all destinations in the network. represent paths from that router to all destinations in the network.
These paths are calculated based on the Network Topology Graph, which These paths are calculated based on the Network Topology Graph, which
is constructed from information in the Information Bases, obtained is constructed from information in the Information Bases, obtained
via HELLO and TC message exchange. via HELLO and TC message exchange.
Changes to the Routing Set do not require any messages to be Changes to the Routing Set do not require any messages to be
transmitted. The state of the Routing Set SHOULD, however, be transmitted. The state of the Routing Set SHOULD, however, be
reflected in IP's routing table by adding and removing entries from reflected in IP's routing table by adding and removing entries from
IP's routing table as appropriate. Only appropriate Routing Tuples IP's routing table as appropriate. Only appropriate Routing Tuples
(in particular only those that represent local links or paths to (in particular only those that represent local links or paths to
routable addresses) need be reflected in IP's routing table. routable addresses) need be reflected in IP's routing table.
15.1. Network Topology Graph 18.1. Network Topology Graph
The Network Topology Graph is formed from information from the The Network Topology Graph is formed from information from the
router's Local Interface Set, Link Sets, Neighbor Set, Router router's Local Interface Set, Link Sets, Neighbor Set, Router
Topology Set, Routable Address Topology Set and Attached Network Set. Topology Set, Routable Address Topology Set and Attached Network Set.
The Network Topology Graph MAY also use information from the router's The Network Topology Graph MAY also use information from the router's
2-Hop Sets. The Network Topology Graph forms the router's 2-Hop Sets. The Network Topology Graph forms the router's
topological view of the network in form of a directed graph. The topological view of the network in form of a directed graph. The
Network Topology Graph has a "backbone" (within which minimum Network Topology Graph has a "backbone" (within which minimum
distance routes will be constructed) containing the following edges: distance routes will be constructed) containing the following edges:
skipping to change at page 57, line 7 skipping to change at page 56, line 30
* Y is the N_orig_addr of a Neighbor Tuple, AND; * Y is the N_orig_addr of a Neighbor Tuple, AND;
* N_orig_addr is not unknown; * N_orig_addr is not unknown;
* X is in the I_local_iface_addr_list of a Local Interface Tuple, * X is in the I_local_iface_addr_list of a Local Interface Tuple,
AND; AND;
* There is a Link Tuple with L_status = SYMMETRIC such that this * There is a Link Tuple with L_status = SYMMETRIC such that this
Neighbor Tuple and this Local Interface Tuple correspond to it. Neighbor Tuple and this Local Interface Tuple correspond to it.
An address from L_neighbor_iface_addr_list will be denoted R in A network address from L_neighbor_iface_addr_list will be
this case. denoted R in this case.
It SHOULD be preferred, where possible, to select R = S and X from It SHOULD be preferred, where possible, to select R = S and X from
the Local Interface Tuple corresponding to the Link Tuple from the Local Interface Tuple corresponding to the Link Tuple from
which R was selected. which R was selected.
o All edges W -> U such that: o All edges W -> U such that:
* W is the TR_from_orig_addr of a Router Topology Tuple, AND; * W is the TR_from_orig_addr of a Router Topology Tuple, AND;
* U is the TR_to_orig_addr of the same Router Topology Tuple. * U is the TR_to_orig_addr of the same Router Topology Tuple.
The Network Topology Graph is further "decorated" with the following The Network Topology Graph is further "decorated" with the following
edges. If an address S, V, Z or T equals an address Y or W, then the edges. If a network address S, V, Z or T equals a network address Y
edge terminating in the address S, V, Z or T MUST NOT be used in any or W, then the edge terminating in the network address S, V, Z or T
path. MUST NOT be used in any path.
o Edges X -> S for all possible S, and one X per S, such that: o Edges X -> S for all possible S, and one X per S, such that:
* S is in the N_neighbor_addr_list of a Neighbor Tuple, AND; * S is in the N_neighbor_addr_list of a Neighbor Tuple, AND;
* X is in the I_local_iface_addr_list of a Local Interface Tuple, * X is in the I_local_iface_addr_list of a Local Interface Tuple,
AND; AND;
* There is a Link Tuple with L_status = SYMMETRIC such that this * There is a Link Tuple with L_status = SYMMETRIC such that this
Neighbor Tuple and this Local Interface Tuple correspond to it. Neighbor Tuple and this Local Interface Tuple correspond to it.
An address from L_neighbor_iface_addr_list will be denoted R in A network address from L_neighbor_iface_addr_list will be
this case. denoted R in this case.
It SHOULD be preferred, where possible, to select R = S and X from It SHOULD be preferred, where possible, to select R = S and X from
the Local Interface Tuple corresponding to the Link Tuple from the Local Interface Tuple corresponding to the Link Tuple from
which R was selected. which R was selected.
o All edges W -> V such that: o All edges W -> V such that:
* W is the TA_from_orig_addr of a Routable Address Topology * W is the TA_from_orig_addr of a Routable Address Topology
Tuple, AND; Tuple, AND;
skipping to change at page 58, line 18 skipping to change at page 57, line 42
* Z is a routable address and is the N2_2hop_addr of a 2-Hop * Z is a routable address and is the N2_2hop_addr of a 2-Hop
Tuple, AND; Tuple, AND;
* Y is the N_orig_addr of the corresponding Neighbor Tuple, AND; * Y is the N_orig_addr of the corresponding Neighbor Tuple, AND;
* This Neighbor Tuple has N_willingness not equal to WILL_NEVER. * This Neighbor Tuple has N_willingness not equal to WILL_NEVER.
A path terminating with such an edge SHOULD NOT be used in A path terminating with such an edge SHOULD NOT be used in
preference to any other path. preference to any other path.
Any part of the Topology Graph which is not connected to an address X Any part of the Topology Graph which is not connected to a local
is not used. Only one selection X need be made from each network address X is not used. Only one selection X SHOULD be made
I_local_iface_addr_list, and only one selection R need be made from from each I_local_iface_addr_list, and only one selection R SHOULD be
any L_neighbor_iface_addr_list. All edges have a cost (hop count) of made from any L_neighbor_iface_addr_list. All edges have a cost (hop
one, except edges W -> T which each have a cost (hop count) equal to count) of one, except edges W -> T which each have a cost (hop count)
the appropriate value of AN_dist. equal to the appropriate value of AN_dist.
15.2. Populating the Routing Set 18.2. Populating the Routing Set
The Routing Set MUST contain the shortest paths for all destinations The Routing Set MUST contain the shortest paths for all destinations
from all local OLSRv2 interfaces using the Network Topology Graph. from all local OLSRv2 interfaces using the Network Topology Graph.
This calculation MAY use any algorithm, including any means of This calculation MAY use any algorithm, including any means of
choosing between paths of equal length. choosing between paths of equal length.
Using the notation of Section 15.1, initially "backbone" paths using Using the notation of Section 18.1, initially "backbone" paths using
only edges X -> Y and W -> U need be constructed (using a minimum only edges X -> Y and W -> U need be constructed (using a minimum
distance algorithm). Then paths using only a final edge of the other distance algorithm). Then paths using only a final edge of the other
types may be added. These MUST NOT replace backbone paths with the types may be added. These MUST NOT replace backbone paths with the
same destination (and paths terminating in an edge Y -> Z SHOULD NOT same destination (and paths terminating in an edge Y -> Z SHOULD NOT
replace paths with any other form of terminating edge). replace paths with any other form of terminating edge).
Each path will correspond to a Routing Tuple. These will be of two Each path will correspond to a Routing Tuple. These will be of two
types. The first type will represent single edge paths, of type X -> types. The first type will represent single edge paths, of type X ->
S or X -> Y, by: S or X -> Y, by:
o R_local_iface_addr := X; o R_local_iface_addr := X;
o R_next_iface_addr := R; o R_next_iface_addr := R;
o R_dest_addr := S or Y; o R_dest_addr := S or Y;
o R_dist := 1, o R_dist := 1,
where R is as defined in Section 15.1 for these types of edges. where R is as defined in Section 18.1 for these types of edges.
The second type will represent a multiple edge path, which will The second type will represent a multiple edge path, which will
always have first edge of type X -> Y, and will have final edge of always have first edge of type X -> Y, and will have final edge of
type W -> U, W -> V, W -> T or Y -> Z. The Routing Tuple will be: type W -> U, W -> V, W -> T or Y -> Z. The Routing Tuple will be:
o R_local_iface_addr := X; o R_local_iface_addr := X;
o R_next_iface_addr := Y; o R_next_iface_addr := Y;
o R_dest_addr := U, V, T or Z; o R_dest_addr := U, V, T or Z;
o R_dist := the total hop count of the path. o R_dist := the total hop count of the path.
Finally, Routing Tuples of the second type whose R_dest_addr is not Finally, Routing Tuples of the second type whose R_dest_addr is not
routable MAY be discarded. routable MAY be discarded.
An example algorithm for calculating the Routing Set of a router is An example algorithm for calculating the Routing Set of a router is
given in Appendix B. given in Appendix B.
16. Proposed Values for Parameters and Constants 19. Proposed Values for Parameters and Constants
This protocol uses all parameters and constants defined in [NHDP] and This protocol uses all parameters and constants defined in [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 router 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.
16.1. Local History Time Parameters 19.1. Local History Time Parameters
o O_HOLD_TIME := 30 seconds o O_HOLD_TIME := 30 seconds
16.2. Message Interval Parameters 19.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
16.3. Advertised Information Validity Time Parameters 19.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
16.4. Received Message Validity Time Parameters 19.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
16.5. Jitter Time Parameters 19.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
16.6. Hop Limit Parameter 19.6. Hop Limit Parameter
o TC_HOP_LIMIT := 255 o TC_HOP_LIMIT := 255
16.7. Willingness Parameter and Constants 19.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 := 7
o WILL_ALWAYS := 7 o WILL_ALWAYS := 15
17. Sequence Numbers 20. Sequence Numbers
Sequence numbers are used in this specification for the purpose of Sequence numbers are used in this specification for the purpose of
discarding "old" information, i.e. messages received out of order. discarding "old" information, i.e., messages received out of order.
However with a limited number of bits for representing sequence However with a limited number of bits for representing sequence
numbers, wrap-around (that the sequence number is incremented from numbers, wrap-around (that the sequence number is incremented from
the maximum possible value to zero) will occur. To prevent this from the maximum possible value to zero) will occur. To prevent this from
interfering with the operation of this protocol, the following MUST interfering with the operation of this protocol, the following MUST
be observed when determining the ordering of sequence numbers. be observed when determining the ordering of sequence numbers.
The term MAXVALUE designates in the following one more than the The term MAXVALUE designates in the following one more than the
largest possible value for a sequence number. For a 16 bit sequence largest possible value for a sequence number. For a 16 bit sequence
number (as are those defined in this specification) MAXVALUE is number (as are those defined in this specification) MAXVALUE is
65536. 65536.
skipping to change at page 61, line 17 skipping to change at page 60, line 45
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.
18. Extensions 21. Extensions
An extension to this protocol will need to interact with this An extension to this protocol will need to interact with this
specification, and possibly also with [NHDP]. This protocol is specification, and possibly also with [NHDP]. This protocol is
designed to permit such interactions, in particular: designed to permit such interactions, in particular:
o Through accessing, and possibly extending, the information in the o Through accessing, and possibly extending, the information in the
Information Bases. All updates to the elements specified in this Information Bases. All updates to the elements specified in this
document are subject to the constraints specified in [NHDP] and document are subject to the constraints specified in [NHDP] and
Appendix D. Appendix D.
o Through accessing an outgoing message prior to it being o Through accessing an outgoing message prior to it being
transmitted over any OLSRv2 interface, and to add information to transmitted over any OLSRv2 interface, and to add information to
it as specified in [RFC5444]. This MAY include Message TLVs it as specified in [RFC5444]. This MAY include Message TLVs
and/or addresses with associated Address Block TLVs. (Addresses and/or network addresses with associated Address Block TLVs.
without new associated TLVs SHOULD NOT be added to messages.) (Network addresses without new associated TLVs SHOULD NOT be added
This may, for example, be to allow a security protocol, as to messages.) This may, for example, be to allow a security
suggested in Section 19, to add a TLV containing a cryptographic protocol, as suggested in Section 22, to add a TLV containing a
signature to the message. cryptographic signature to the message.
o Through accessing an incoming message, and potentially discarding o Through accessing an incoming message, and potentially discarding
it prior to processing by this protocol. This may, for example, it prior to processing by this protocol. This may, for example,
allow a security protocol as suggested in Section 19 to perform allow a security protocol as suggested in Section 22 to perform
verification of message signatures and prevent processing and/or verification of message signatures and prevent processing and/or
forwarding of unverifiable messages by this protocol. forwarding of unverifiable messages by this protocol.
o Through accessing an incoming message after it has been completely o Through accessing an incoming message after it has been completely
processed by this protocol. This may, in particular, allow a processed by this protocol. This may, in particular, allow a
protocol which has added information, by way of inclusion of protocol which has added information, by way of inclusion of
appropriate TLVs, or of addresses associated with new TLVs, access appropriate TLVs, or of network addresses associated with new
to such information after appropriate updates have been recorded TLVs, access to such information after appropriate updates have
in the Information Bases in this protocol. been recorded in the Information Bases in this protocol.
o Through requesting that a message be generated at a specific time. o Through requesting that a message be generated at a specific time.
In that case, message generation MUST still respect the In that case, message generation MUST still respect the
constraints in [NHDP] and Section 5.4. constraints in [NHDP] and Section 5.4.
19. Security Considerations 22. Security Considerations
Currently, this protocol does not specify any special security Currently, this protocol does not specify any special security
measures. As a proactive routing protocol, this protocol is a measures. As a proactive routing protocol, this protocol is a
potential target for various attacks. Various possible potential target for various attacks. Various possible
vulnerabilities are discussed in this section. vulnerabilities are discussed in this section.
19.1. Confidentiality 22.1. Confidentiality
This protocol periodically MPR floods topological information to all This protocol periodically MPR floods topological information to all
routers in the network. Hence, if used in an unprotected wireless routers in the network. Hence, if used in an unprotected wireless
network, the network topology is revealed to anyone who listens to network, the network topology is revealed to anyone who listens to
the control messages. the control messages.
In situations where the confidentiality of the network topology is of In situations where the confidentiality of the network topology is of
importance, regular cryptographic techniques, such as exchange of importance, regular cryptographic techniques, such as exchange of
OLSRv2 control traffic messages encrypted by PGP [RFC4880] or OLSRv2 control traffic messages encrypted by PGP [RFC4880] or
encrypted by some shared secret key, can be applied to ensure that encrypted by some shared secret key, can be applied to ensure that
control traffic can be read and interpreted by only those authorized control traffic can be read and interpreted by only those authorized
to do so. to do so.
19.2. Integrity 22.2. Integrity
Each router is injecting topological information into the network Each router is injecting topological information into the network
through transmitting HELLO messages and, for some routers, TC through transmitting HELLO messages and, for some routers, TC
messages. If some routers for some reason, malicious or malfunction, messages. If some routers for some reason, malicious or malfunction,
inject invalid control traffic, network integrity may be compromised. inject invalid control traffic, network integrity may be compromised.
Therefore, message authentication is recommended. Therefore, message authentication is recommended.
Different such situations may occur, for instance: Different such situations may occur, for instance:
1. a router generates TC messages, advertising links to non-neighbor 1. a router generates TC messages, advertising links to non-neighbor
skipping to change at page 63, line 41 skipping to change at page 63, line 22
transmitted either to all routers in the neighborhood (HELLO transmitted either to all routers in the neighborhood (HELLO
messages) or broadcast to all routers in the network (TC messages). messages) or broadcast to all routers in the network (TC messages).
For example, a control message in this protocol is always a point-to- For example, a control message in this protocol is always a point-to-
multipoint transmission. It is therefore important that the multipoint transmission. It is therefore important that the
authentication mechanism employed permits that any receiving router authentication mechanism employed permits that any receiving router
can validate the authenticity of a message. As an analogy, given a can validate the authenticity of a message. As an analogy, given a
block of text, signed by a PGP private key, then anyone with the block of text, signed by a PGP private key, then anyone with the
corresponding public key can verify the authenticity of the text. corresponding public key can verify the authenticity of the text.
19.3. Interaction with External Routing Domains 22.3. Interaction with External Routing Domains
This protocol does, through the use of TC messages, provide a basic This protocol does, through the use of TC messages, provide a basic
mechanism for injecting external routing information to this mechanism for injecting external routing information to this
protocol's domain. Routing information can be extracted from the protocol's domain. Routing information can be extracted from the
protocol's Information Bases, in particular the Routing Set, of this protocol's Information Bases, in particular the Routing Set, of this
protocol and, potentially, injected into an external domain, if the protocol and, potentially, injected into an external domain, if the
routing protocol governing that domain permits this. routing protocol governing that domain permits this.
When operating routers connecting a MANET using this protocol to an When operating routers connecting a MANET using this protocol to an
external routing domain, care MUST be taken not to allow potentially external routing domain, care MUST be taken not to allow potentially
skipping to change at page 64, line 16 skipping to change at page 63, line 45
validate the correctness of information prior to it being injected as validate the correctness of information prior to it being injected as
to avoid polluting routing tables with invalid information. to avoid polluting routing tables with invalid information.
A recommended way of extending connectivity from an existing routing A recommended way of extending connectivity from an existing routing
domain to a MANET routed using this protocol is to assign an IP domain to a MANET routed using this protocol is to assign an IP
prefix (under the authority of the routers/gateways connecting the prefix (under the authority of the routers/gateways connecting the
MANET with the exiting routing domain) exclusively to that MANET MANET with the exiting routing domain) exclusively to that MANET
area, and to statically configure the gateways to advertise routes area, and to statically configure the gateways to advertise routes
for that IP sequence to routers in the existing routing domain. for that IP sequence to routers in the existing routing domain.
20. IANA Considerations 23. IANA Considerations
This specification defines one Message Type, which must be allocated This specification defines one Message Type, which must be allocated
from the "Message Types" repository of [RFC5444], two Message TLV from the "Message Types" repository of [RFC5444], two Message TLV
Types, which must be allocated from the "Message TLV Types" Types, which must be allocated from the "Message TLV Types"
repository of [RFC5444], and three Address Block TLV Types, which repository of [RFC5444], and three Address Block TLV Types, which
must be allocated from the "Address Block TLV Types" repository of must be allocated from the "Address Block TLV Types" repository of
[RFC5444]. [RFC5444].
20.1. Expert Review: Evaluation Guidelines 23.1. Expert Review: Evaluation Guidelines
For the registries where an Expert Review is required, the designated For the registries where an Expert Review is required, the designated
expert SHOULD take the same general recommendations into expert SHOULD take the same general recommendations into
consideration as are specified by [RFC5444]. consideration as are specified by [RFC5444].
20.2. Message Types 23.2. Message Types
This specification defines one Message Type, to be allocated from the This specification defines one Message Type, to be allocated from the
0-223 range of the "Message Types" namespace defined in [RFC5444], as 0-223 range of the "Message Types" namespace defined in [RFC5444], as
specified in Table 6. specified in Table 6.
+------+------+-----------------------------------------+ +------+----------------------------------------------+
| Name | Type | Description | | Type | Description |
+------+------+-----------------------------------------+ +------+----------------------------------------------+
| TC | TBD1 | Topology Control (MANET-wide signaling) | | TBD1 | TC : Topology Control (MANET-wide signaling) |
+------+------+-----------------------------------------+ +------+----------------------------------------------+
Table 6: Message Type assignment Table 6: Message Type assignment
20.3. Message-Type-specific TLV Type Registries 23.3. Message-Type-specific TLV Type Registries
IANA is requested to create a registry for Message-Type-specific IANA is requested to create a registry for Message-Type-specific
Message TLVs for TC messages, in accordance with Section 6.2.1 of Message TLVs for TC messages, in accordance with Section 6.2.1 of
[RFC5444], and with initial assignments and allocation policies as [RFC5444], and with initial assignments and allocation policies as
specified in Table 7. specified in Table 7.
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| Type | Description | Allocation Policy | | Type | Description | Allocation Policy |
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| 128-223 | Unassigned | Expert Review | | 128-223 | Unassigned | Expert Review |
skipping to change at page 65, line 26 skipping to change at page 65, line 7
specified in Table 8. specified in Table 8.
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| Type | Description | Allocation Policy | | Type | Description | Allocation Policy |
+---------+-------------+-------------------+ +---------+-------------+-------------------+
| 128-223 | Unassigned | Expert Review | | 128-223 | Unassigned | Expert Review |
+---------+-------------+-------------------+ +---------+-------------+-------------------+
Table 8: TC Message-Type-specific Address Block TLV Types Table 8: TC Message-Type-specific Address Block TLV Types
20.4. Message TLV Types 23.4. Message TLV Types
This specification defines two Message TLV Types, which must be This specification defines two Message TLV Types, which must be
allocated from the "Message TLV Types" namespace defined in allocated from the "Message TLV Types" namespace defined in
[RFC5444]. IANA are requested to make allocations in the 8-127 range [RFC5444]. IANA is requested to make allocations in the 0-127 range
for these types. This will create two new Type Extension registries for these types. This will create two new Type Extension registries
with assignments as specified in Table 9 and Table 10. with assignments as specified in Table 9 and Table 10.
Specifications of these TLVs are in Section 8.1.1 and Section 8.2.1, Specifications of these TLVs are in Section 14.2.1 and
respectively. Each of these TLVs MUST NOT be included more than once Section 15.2.1, respectively. Each of these TLVs MUST NOT be
in a Message TLV Block. included more than once in a Message TLV Block.
+-------------+------+-----------+----------------------------------+ +-------------+------+-----------+---------------------+------------+
| Name | Type | Type | Description | | Name | Type | Type | Description | Allocation |
| | | Extension | | | | | Extension | | Policy |
+-------------+------+-----------+----------------------------------+ +-------------+------+-----------+---------------------+------------+
| MPR_WILLING | TBD2 | 0 | Specifies the originating | | MPR_WILLING | TBD2 | 0 | Specifies the | |
| | | | router's willingness to act as a | | | | | originating | |
| | | | relay and to partake in network | | | | | router's | |
| | | | formation | | | | | willingness to act | |
| Unassigned | TBD2 | 1-255 | Expert Review | | | | | as a relay and to | |
+-------------+------+-----------+----------------------------------+ | | | | partake in network | |
| | | | formation (maximum | |
| | | | value is | |
| | | | WILL_ALWAYS = 15) | |
| MPR_WILLING | TBD2 | 1-255 | Unassigned | Expert |
| | | | | Review |
+-------------+------+-----------+---------------------+------------+
Table 9: Message TLV Type assignment: MPR_WILLING Table 9: Message TLV Type assignment: MPR_WILLING
+--------------+------+----------------+----------------------------+ +--------------+------+-----------+--------------------+------------+
| Name | Type | Type Extension | Description | | Name | Type | Type | Description | Allocation |
+--------------+------+----------------+----------------------------+ | | | Extension | | Policy |
| CONT_SEQ_NUM | TBD3 | 0 (COMPLETE) | Specifies a content | +--------------+------+-----------+--------------------+------------+
| | | | sequence number for this | | CONT_SEQ_NUM | TBD3 | 0 | COMPLETE : | |
| | | | complete message | | | | | Specifies a | |
| CONT_SEQ_NUM | TBD3 | 1 (INCOMPLETE) | Specifies a content | | | | | content sequence | |
| | | | sequence number for this | | | | | number for this | |
| | | | incomplete message | | | | | complete message | |
| Unassigned | TBD3 | 2-255 | Expert Review | | CONT_SEQ_NUM | TBD3 | 1 | INCOMPLETE : | |
+--------------+------+----------------+----------------------------+ | | | | Specifies a | |
| | | | content sequence | |
| | | | number for this | |
| | | | incomplete message | |
| CONT_SEQ_NUM | TBD3 | 2-255 | Unassigned | Expert |
| | | | | Review |
+--------------+------+-----------+--------------------+------------+
Table 10: Message TLV Type assignment: CONT_SEQ_NUM Table 10: Message TLV Type assignment: CONT_SEQ_NUM
Type extensions indicated as Expert Review SHOULD be allocated as Type extensions indicated as Expert Review SHOULD be allocated as
described in [RFC5444], based on Expert Review as defined in described in [RFC5444], based on Expert Review as defined in
[RFC5226]. [RFC5226].
20.5. Address Block TLV Types 23.5. Address Block TLV Types
This specification defines three Address Block TLV Types, which must This specification defines three Address Block TLV Types, which must
be allocated from the "Address Block TLV Types" namespace defined in be allocated from the "Address Block TLV Types" namespace defined in
[RFC5444]. IANA are requested to make allocations in the 8-127 range [RFC5444]. IANA are requested to make allocations in the 8-127 range
for these types. This will create three new Type Extension for these types. This will create three new Type Extension
registries with assignments as specified in Table 11, Table 12 and registries with assignments as specified in Table 11, Table 12 and
Table 13, respectively. Specifications of these TLVs are in Table 13, respectively. Specifications of these TLVs are in
Section 8.1.2 and Section 8.2.2. Section 14.2.2 and Section 15.2.2.
+------------+------+-----------+-----------------------------------+ +------+------+-----------+----------------------------+------------+
| Name | Type | Type | Description | | Name | Type | Type | Description | Allocation |
| | | Extension | | | | | Extension | | Policy |
+------------+------+-----------+-----------------------------------+ +------+------+-----------+----------------------------+------------+
| MPR | TBD4 | 0 | Specifies that a given address is | | MPR | TBD4 | 0 | Specifies that a given | |
| | | | of a router selected as an MPR | | | | | network address is of a | |
| Unassigned | TBD4 | 1-255 | Expert Review | | | | | router selected as an MPR | |
+------------+------+-----------+-----------------------------------+ | MPR | TBD4 | 1-255 | Unassigned | Expert |
| | | | | Review |
+------+------+-----------+----------------------------+------------+
Table 11: Address Block TLV Type assignment: MPR Table 11: Address Block TLV Type assignment: MPR
+---------------+------+-----------+--------------------------------+ +---------------+------+-----------+-------------------+------------+
| Name | Type | Type | Description | | Name | Type | Type | Description | Allocation |
| | | Extension | | | | | Extension | | Policy |
+---------------+------+-----------+--------------------------------+ +---------------+------+-----------+-------------------+------------+
| NBR_ADDR_TYPE | TBD5 | 0 | Specifies that a given address | | NBR_ADDR_TYPE | TBD5 | 0 | Specifies that a | |
| | | | is of a neighbor reached via | | | | | given network | |
| | | | the originating router | | | | | address is of a | |
| Unassigned | TBD5 | 1-255 | Expert Review | | | | | neighbor reached | |
+---------------+------+-----------+--------------------------------+ | | | | via the | |
| | | | originating | |
| | | | router, if it is | |
| | | | an originator | |
| | | | address | |
| | | | (ORIGINATOR = 1), | |
| | | | is a routable | |
| | | | address (ROUTABLE | |
| | | | = 2), or if it is | |
| | | | both | |
| | | | (ROUTABLE_ORIG = | |
| | | | 3) | |
| NBR_ADDR_TYPE | TBD5 | 1-255 | Unassigned | Expert |
| | | | | Review |
+---------------+------+-----------+-------------------+------------+
Table 12: Address Block TLV Type assignment: NBR_ADDR_TYPE Table 12: Address Block TLV Type assignment: NBR_ADDR_TYPE
+---------+------+-----------+-------------------------+------------+
| Name | Type | Type | Description | Allocation |
| | | extension | | Policy |
+---------+------+-----------+-------------------------+------------+
| GATEWAY | TBD6 | 0 | Specifies that a given | |
| | | | network address is | |
| | | | reached via a gateway | |
| | | | on the originating | |
| | | | router, with value | |
| | | | equal to the number of | |
| | | | hops | |
| GATEWAY | TBD6 | 1-255 | | Expert |
| | | | | Review |
+---------+------+-----------+-------------------------+------------+
Table 13: Address Block TLV Type assignment: GATEWAY
Type extensions indicated as Expert Review SHOULD be allocated as
described in [RFC5444], based on Expert Review as defined in
[RFC5226].
23.6. NBR_ADDR_TYPE Values
Note: This section does not require any IANA action, as the required
information is included in the descriptions of the NBR_ADDR_TYPE
Address Block TLV allocated in Section 23.5. This information is
recorded here for clarity, and for use elsewhere in this
specification.
The Values which the NBR_ADDR_TYPE Address Block TLV can use are the The Values which the NBR_ADDR_TYPE Address Block TLV can use are the
following: following:
o ORIGINATOR := 1; o ORIGINATOR := 1;
o ROUTABLE := 2; o ROUTABLE := 2;
o ROUTABLE_ORIG := 3. o ROUTABLE_ORIG := 3.
+------------+------+-----------+-----------------------------------+ 24. Contributors
| Name | Type | Type | Description |
| | | extension | |
+------------+------+-----------+-----------------------------------+
| GATEWAY | TBD6 | 0 | Specifies that a given address is |
| | | | reached via a gateway on the |
| | | | originating router |
| Unassigned | TBD6 | 1-255 | Expert Review |
+------------+------+-----------+-----------------------------------+
Table 13: Address Block TLV Type assignment: GATEWAY
Type extensions indicated as Expert Review SHOULD be allocated as
described in [RFC5444], based on Expert Review as defined in
[RFC5226].
21. Contributors
This specification is the result of the joint efforts of the This specification is the result of the joint efforts of the
following contributors -- listed alphabetically. following contributors -- listed alphabetically.
o Cedric Adjih, INRIA, France, <Cedric.Adjih@inria.fr> o Cedric Adjih, INRIA, France, <Cedric.Adjih@inria.fr>
o Emmanuel Baccelli, INRIA , France, <Emmanuel.Baccelli@inria.fr> o Emmanuel Baccelli, INRIA , France, <Emmanuel.Baccelli@inria.fr>
o Thomas Heide Clausen, LIX, France, <T.Clausen@computer.org> o Thomas Heide Clausen, LIX, France, <T.Clausen@computer.org>
o Justin Dean, NRL, USA, <jdean@itd.nrl.navy.mil> o Justin Dean, NRL, USA, <jdean@itd.nrl.navy.mil>
o Christopher Dearlove, BAE Systems, UK, o Christopher Dearlove, BAE Systems, UK,
<chris.dearlove@baesystems.com> <chris.dearlove@baesystems.com>
o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com> o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com>
o Philippe Jacquet, INRIA, France, <Philippe.Jacquet@inria.fr> o Philippe Jacquet, INRIA, France, <Philippe.Jacquet@inria.fr>
o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com> o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com>
skipping to change at page 68, line 19 skipping to change at page 68, line 48
o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com> o Satoh Hiroki, Hitachi SDL, Japan, <hiroki.satoh.yj@hitachi.com>
o Philippe Jacquet, INRIA, France, <Philippe.Jacquet@inria.fr> o Philippe Jacquet, INRIA, France, <Philippe.Jacquet@inria.fr>
o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com> o Monden Kazuya, Hitachi SDL, Japan, <kazuya.monden.vw@hitachi.com>
o Kenichi Mase, Niigata University, Japan, <mase@ie.niigata-u.ac.jp> o Kenichi Mase, Niigata University, Japan, <mase@ie.niigata-u.ac.jp>
o Ryuji Wakikawa, Toyota, Japan, <ryuji@sfc.wide.ad.jp> o Ryuji Wakikawa, Toyota, Japan, <ryuji@sfc.wide.ad.jp>
22. Acknowledgments 25. Acknowledgments
The authors would like to acknowledge the team behind OLSRv1, The authors would like to acknowledge the team behind OLSRv1,
specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale specified in RFC3626, including Anis Laouiti (INT, Paris), Pascale
Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir Minet (INRIA, France), Laurent Viennot (INRIA, France), and Amir
Qayyum (M.A. Jinnah University, Islamabad) for their contributions. Qayyum (M.A. Jinnah University, Islamabad) for their contributions.
The authors would like to gratefully acknowledge the following people The authors would like to gratefully acknowledge the following people
for intense technical discussions, early reviews and comments on the for intense technical discussions, early reviews and comments on the
specification and its components (listed alphabetically): Khaldoun Al specification and its components (listed alphabetically): Khaldoun Al
Agha (LRI), Teco Boot (Infinity Networks), Song-Yean Cho (LIX), Alan Agha (LRI), Teco Boot (Infinity Networks), Song-Yean Cho (LIX), Alan
Cullen (BAE Systems), Louise Lamont (CRC), Li Li (CRC), Joe Macker Cullen (BAE Systems), Louise Lamont (CRC), Li Li (CRC), Joe Macker
(NRL), Richard Ogier (SRI), Charles E. Perkins (WiChorus), Henning (NRL), Richard Ogier (SRI), Charles E. Perkins (WiChorus), Henning
Rogge (FGAN), and the entire IETF MANET working group. Rogge (FGAN), and the entire IETF MANET working group.
23. References 26. References
23.1. Normative References 26.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", RFC 2119, BCP 14, March 1997. Requirement Levels", RFC 2119, BCP 14, March 1997.
[RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter [RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter
considerations in MANETs", RFC 5148, February 2008. considerations in MANETs", RFC 5148, February 2008.
[RFC5226] Narten, T. and H. Alvestrand, "Guidelines for Writing an [RFC5226] Narten, T. and H. Alvestrand, "Guidelines for Writing an
IANA Considerations Section in RFCs", RFC 5226, BCP 26, IANA Considerations Section in RFCs", RFC 5226, BCP 26,
May 2008. May 2008.
skipping to change at page 69, line 13 skipping to change at page 69, line 40
February 2009. February 2009.
[RFC5497] Clausen, T. and C. Dearlove, "Representing multi-value [RFC5497] Clausen, T. and C. Dearlove, "Representing multi-value
time in MANETs", RFC 5497, March 2009. time in MANETs", RFC 5497, March 2009.
[RFC5498] Chakeres, I., "IANA Allocations for MANET Protocols", [RFC5498] Chakeres, I., "IANA Allocations for MANET Protocols",
RFC 5498, March 2009. RFC 5498, March 2009.
[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-10.txt, July 2009. progress draft-ietf-manet-nhdp-12.txt, March 2010.
23.2. Informative References 26.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 69, line 51 skipping to change at page 70, line 30
[FSLS] Santivanez, C., Ramanathan, R., and I. Stavrakakis, [FSLS] Santivanez, C., Ramanathan, R., and I. Stavrakakis,
"Making link-state routing scale for ad hoc networks", "Making link-state routing scale for ad hoc networks",
2000. 2000.
Appendix A. Example Algorithm for Calculating MPRs Appendix A. Example Algorithm for Calculating MPRs
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 router MAY improve on this, by interfaces. (As noted in Section 17 a router MAY improve on this, by
coordination between OLSRv2 interfaces.) A router's MPRs are coordination between OLSRv2 interfaces.) A router's MPRs are
recorded using the element N_mpr in Neighbor Tuples. recorded using the element N_mpr in Neighbor Tuples.
If using this example algorithm then the following steps MUST be If using this example algorithm then the following steps MUST be
executed in order for a router to select its MPRs: executed in order for a router to select its MPRs:
1. Set N_mpr := false in all Neighbor Tuples; 1. Set N_mpr := false in all Neighbor Tuples;
2. For each Neighbor Tuple with N_symmetric = true and N_willingness 2. For each Neighbor Tuple with N_symmetric = true and N_willingness
= WILL_ALWAYS, set N_mpr := true; = WILL_ALWAYS, set N_mpr := true;
skipping to change at page 70, line 35 skipping to change at page 71, line 15
Note that only symmetric strict 2-hop neighbors are considered, thus: Note that only symmetric strict 2-hop neighbors are considered, thus:
o Symmetric 1-hop neighbor routers with N_willingness = WILL_NEVER o Symmetric 1-hop neighbor routers with N_willingness = WILL_NEVER
MUST NOT be selected as MPRs, and MUST be ignored in the following MUST NOT be selected as MPRs, and MUST be ignored in the following
algorithm (and hence also ignore any 2-Hop Tuples whose algorithm (and hence also ignore any 2-Hop Tuples whose
N2_neighbor_iface_addr_list is included in the N2_neighbor_iface_addr_list is included in the
N_neighbor_addr_list of any such Neighbor Tuple). N_neighbor_addr_list of any such Neighbor Tuple).
o Symmetric 2-hop neighbor routers which are also symmetric 1-hop o Symmetric 2-hop neighbor routers which are also symmetric 1-hop
neighbor routers MUST be ignored in the following algorithm (i.e. neighbor routers MUST be ignored in the following algorithm (i.e.,
ignore any 2-Hop Tuples whose N2_2hop_addr is in the ignore any 2-Hop Tuples whose N2_2hop_addr is in the
N_neighbor_addr_list of any Neighbor Tuple). N_neighbor_addr_list of any Neighbor Tuple).
A.1. Terminology A.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 router with a N2(I) - The set of network addresses of interfaces of a router with
symmetric link to a router in N(I); this MAY be restricted to a 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_addr in 2-Hop Tuples in the 2-Hop Set for is the set of N2_2hop_addr in 2-Hop Tuples in the 2-Hop Set for
OLSRv2 interface I). 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 - A network address A in N2(I) is connected to
router Y in N(I) if A is an address of an interface of a symmetric I via a router Y in N(I) if A is a network address of an interface
1-hop neighbor of Y (i.e. A is the N2_2hop_addr in a 2-Hop Tuple of a symmetric 1-hop neighbor of Y (i.e., A is the N2_2hop_addr in
in the 2-Hop Set for OLSRv2 interface I, and whose a 2-Hop 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). network addresses of Y).
D(Y, I) - For a router Y in N(I), the number of addresses in N2(I) D(Y, I) - For a router Y in N(I), the number of network addresses in
which are connected to I via Y. N2(I) which are connected to I via Y.
R(Y, I): - For a router Y in N(I), the number of addresses in N2(I) R(Y, I): - For a router Y in N(I), the number of network addresses
which are connected to I via Y, but are not connected to I via any in N2(I) which are connected to I via Y, but are not connected to
router which has already been selected as an MPR. I via any router which has already been selected as an MPR.
A.2. MPR Selection Algorithm for each OLSRv2 Interface A.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 router Y 1. For each network address A in N2(I) for which there is only one
in N(I) such that A is connected to I via Y, select that router Y router Y in N(I) such that A is connected to I via Y, select that
as an MPR (i.e. set N_mpr := true in the Neighbor Tuple router Y as an MPR (i.e., set N_mpr := true in the Neighbor Tuple
corresponding to Y). corresponding to Y).
2. While there exists any router 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 router 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 B. Example Algorithm for Calculating the Routing Set Appendix B. Example Algorithm for Calculating the Routing Set
The following procedure is given as an example for calculating the The following procedure is given as an example for calculating the
Routing Set using a variation of Dijkstra's algorithm. First all Routing Set using a variation of Dijkstra's algorithm. First all
Routing Tuples are removed, and then, using the selections and Routing Tuples are removed, and then, using the selections and
definitions in Appendix B.1, the procedures in the following sections definitions in Appendix B.1, the procedures in the following sections
(each considered a "stage" of the processing) are applied in turn. (each considered a "stage" of the processing) are applied in turn.
B.1. Local Interfaces and Neighbors B.1. Local Interfaces and Neighbors
The following selections and definitions are made: The following selections and definitions are made:
1. For each Local Interface Tuple, select an address from its 1. For each Local Interface Tuple, select a network address from its
I_local_iface_addr_list, this is defined as the selected address I_local_iface_addr_list, this is defined as the selected address
for this Local Interface Tuple. for this Local Interface Tuple.
2. For each Link Tuple, the selected address of its corresponding 2. For each Link Tuple, the selected address of its corresponding
Local Interface Tuple is defined as the selected local address Local Interface Tuple is defined as the selected local address
for this Local Interface Tuple. for this Local Interface Tuple.
3. For each Neighbor Tuple with N_symmetric = true, the selected 3. For each Neighbor Tuple with N_symmetric = true, the selected
local address is defined as the selected local address of the local address is defined as the selected local address of the
selected Link Tuple for that Neighbor Tuple. selected Link Tuple for that Neighbor Tuple.
4. For each address (N_orig_addr or in N_neighbor_addr_list, the 4. For each network address (N_orig_addr or in N_neighbor_addr_list,
"neighbor address") from a Neighbor Tuple with N_symmetric = the "neighbor address") from a Neighbor Tuple with N_symmetric =
true, select a Link Tuple with L_status = SYMMETRIC whose true, select a Link Tuple with L_status = SYMMETRIC whose
corresponding Neighbor Tuple is this Neighbor Tuple and where, if corresponding Neighbor Tuple is this Neighbor Tuple and where, if
possible, L_neighbor_iface_addr_list contains the neighbor possible, L_neighbor_iface_addr_list contains the neighbor
address. This is defined as the selected Link Tuple for that address. This is defined as the selected Link Tuple for that
neighbor address. neighbor address.
5. For each address (N_orig_addr or in N_neighbor_addr_list, the 5. For each network address (N_orig_addr or in N_neighbor_addr_list,
"neighbor address") from a Neighbor Tuple with N_symmetric = the "neighbor address") from a Neighbor Tuple with N_symmetric =
true, a selected address from the L_neighbor_iface_addr_list of true, a selected address from the L_neighbor_iface_addr_list of
the selected Link Tuple for the neighbor address, if possible the selected Link Tuple for the neighbor address, if possible
equal to the neighbor address, is defined as the selected link equal to the neighbor address, is defined as the selected link
address for that neighbor address. address for that neighbor address.
6. Routing Tuple preference is decided by preference for 6. Routing Tuple preference is decided by preference for
corresponding Neighbor Tuples in this order: corresponding Neighbor Tuples in this order:
* For greater N_willingness. * For greater N_willingness.
skipping to change at page 73, line 50 skipping to change at page 74, line 31
added for an R_dest_addr in this stage. If so, then, for each added for an R_dest_addr in this stage. If so, then, for each
such R_dest_addr, a Routing Tuple which is preferred SHOULD be such R_dest_addr, a Routing Tuple which is preferred SHOULD be
added. added.
B.4. Add Neighbor Addresses B.4. Add Neighbor Addresses
The following procedure is executed once. The following procedure is executed once.
1. For each Neighbor Tuple with N_symmetric = true: 1. For each Neighbor Tuple with N_symmetric = true:
1. For each address (the "current address") in 1. For each network address (the "current address") in
N_neighbor_addr_list, if the current address is not equal to N_neighbor_addr_list, if the current address is not equal to
the R_dest_addr of any Routing Tuple, then add a new Routing the R_dest_addr of any Routing Tuple, then add a new Routing
Tuple, with: Tuple, with:
+ R_dest_addr := current address; + R_dest_addr := current address;
+ R_next_iface_addr := selected link address; + R_next_iface_addr := selected link address;
+ R_local_iface_addr := selected local address; + R_local_iface_addr := selected local address;
skipping to change at page 74, line 49 skipping to change at page 75, line 31
added for an R_dest_addr in this stage. If so, then, for each added for an R_dest_addr in this stage. If so, then, for each
such R_dest_addr, a Routing Tuple which is preferred SHOULD be such R_dest_addr, a Routing Tuple which is preferred SHOULD be
added. added.
B.6. Add Attached Networks B.6. Add Attached Networks
The following procedure is executed once. The following procedure is executed once.
1. For each Attached Network Tuple, if: 1. For each Attached Network Tuple, if:
* AN_orig_addr is not equal to the R_dest_addr of any Routing * AN_net_addr is not equal to the R_dest_addr of any Routing
Tuple added in an earlier stage, AND; Tuple added in an earlier stage, AND;
* AN_orig_addr is equal to the R_dest_addr of a Routing Tuple * AN_orig_addr is equal to the R_dest_addr of a Routing Tuple
(the "previous Routing Tuple), (the "previous Routing Tuple),
then add a new Routing Tuple, with: then add a new Routing Tuple, with:
* R_dest_addr := AN_net_addr; * R_dest_addr := AN_net_addr;
* R_next_iface_addr := R_next_iface_addr of the previous Routing * R_next_iface_addr := R_next_iface_addr of the previous Routing
skipping to change at page 76, line 7 skipping to change at page 76, line 36
* R_local_iface_addr := R_local_iface_addr of the previous * R_local_iface_addr := R_local_iface_addr of the previous
Routing Tuple; Routing Tuple;
* R_dist := 2. * R_dist := 2.
There may be more than one possible Routing Tuple that may be There may be more than one possible Routing Tuple that may be
added for an R_dest_addr in this stage. If so, then, for each added for an R_dest_addr in this stage. If so, then, for each
such R_dest_addr, a Routing Tuple which is preferred SHOULD be such R_dest_addr, a Routing Tuple which is preferred SHOULD be
added. added.
Appendix C. Example Message Layout Appendix C. TC Message Example
An example TC message is as follows. The message has full Message TC messages are instances of [RFC5444] messages. This protocol
Header (four bit Flags field value is 15). Its four bit Message requires that TC messages contains <msg-hop-limit> and <msg-orig-
Address Length field has value 3 and hence addresses in the message addr> fields. It supports TC messages with any combination of
have length four octets, here being IPv4 addresses. The overall remaining message header options and address encodings, enabled by
message length is 57 octets. [RFC5444] that convey the required information. As a consequence,
there is no single way to represent how all TC messages look. This
appendix illustrates a TC message, the exact values and content
included are explained in the following text.
The message has full Message 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 57 octets.
The message has a Message TLV Block with content length 13 octets The message has a Message TLV Block with content length 13 octets
containing three TLVs. The first two TLVs are interval and validity containing three TLVs. The first two TLVs are interval and validity
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. (This is not necessary, the The message has two Address Blocks. (This is not necessary, the
information could be conveyed using a single Address Block, the use information could be conveyed using a single Address Block, the use
of two Address Blocks, which is also allowed, is illustrative only.) of two Address Blocks, which is also allowed, is illustrative only.)
The first Address Block contains 3 addresses, with Flags octet value The first Address Block contains 3 addresses, with Flags octet value
128, hence with a Head section, (with length 2 octets) but no Tail 128, hence with a Head section, (with length 2 octets) but no Tail
section, and hence Mid sections with length two octets. The section, and hence Mid sections with length two octets. The
following TLV Block (content length 6 octets) contains a single following TLV Block (content length 6 octets) contains a single
NBR_ADDR_TYPE TLV (Flags octet value 16, includes a Value but no NBR_ADDR_TYPE TLV (Flags octet value 16, includes a Value but no
indexes) indicating that these addresses are associated with the indexes) indicating that these addresses are associated with the
Value (with Value Length 1 octet) ROUTABLE_ORIG, i.e. they are Value (with Value Length 1 octet) ROUTABLE_ORIG, i.e., they are
originator addresses of advertised neighbors that are also routable originator addresses of advertised neighbors that are also routable
addresses. addresses.
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 router is a gateway to this network, at a given the originating router is a gateway to this network, at a given
skipping to change at page 78, line 7 skipping to change at page 79, line 7
In each Originator Tuple: In each Originator Tuple:
o O_orig_addr MUST NOT equal any other O_orig_addr. o O_orig_addr MUST NOT equal any other O_orig_addr.
o O_orig_addr MUST NOT equal this router's originator address. o O_orig_addr MUST NOT equal this router's originator address.
In each Local Attached Network Tuple: In each Local Attached Network Tuple:
o AL_net_addr MUST NOT equal any other AL_net_addr. o AL_net_addr MUST NOT equal any other AL_net_addr.
o AL_net_addr MUST NOT be in the I_local_iface_addr_list of any o AL_net_addr MUST NOT equal or be a sub-range of any network
Local Interface Tuple or equal the IR_local_iface_addr of any address in the I_local_iface_addr_list of any Local Interface
Removed Interface Address Tuple. Tuple.
o AL_net_addr MUST not equal this router's originator address, or o AL_net_addr MUST NOT equal this router's originator address, or
equal the O_orig_addr in any Originator Tuple. equal the O_orig_addr in any Originator Tuple.
o 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 any network address
Local Attached Network Tuple. that AL_net_addr of any Local Attached Network Tuple equals or is
a sub-range of.
In each Neighbor Tuple: In each Neighbor Tuple:
o N_orig_addr MUST NOT be changed to unknown. o N_orig_addr MUST NOT be changed to unknown.
o N_orig_addr MUST NOT equal this router's originator address, or o N_orig_addr MUST NOT equal this router's originator address, or
equal O_orig_addr in any Originator Tuple. equal O_orig_addr in any Originator Tuple.
o N_orig_addr MUST NOT equal the AL_net_addr in any Local Attached o N_orig_addr MUST NOT equal the AL_net_addr in any Local Attached
Network Tuple. Network Tuple.
o N_neighbor_addr_list MUST NOT contain this router's originator o If N_orig_addr != unknown, then N_orig_addr MUST NOT equal the
address, the O_orig_addr in any Originator Tuple, or the N_orig_addr in any other Neighbor Tuple.
AL_net_addr in any Local Attached Network Tuple.
o N_neighbor_addr_list MUST NOT contain any network address which
includes this router's originator address, the O_orig_addr in any
Originator Tuple, or equal or have as a sub-range the AL_net_addr
in any Local Attached Network Tuple.
o If N_orig_addr = unknown, then N_willingness = WILL_NEVER, N_mpr = o If N_orig_addr = unknown, then N_willingness = WILL_NEVER, N_mpr =
false, N_mpr_selector = false, and N_advertised = false. false, N_mpr_selector = false, and N_advertised = false.
o If N_willingness MUST be in the range from WILL_NEVER to o N_willingness MUST be in the range from WILL_NEVER to WILL_ALWAYS,
WILL_ALWAYS, inclusive. 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 and o If N_mpr_selector = true, then N_advertised MUST be true.
N_advertised MUST be true.
o If N_advertised = true, then N_symmetric MUST be true. o If N_advertised = true, then N_symmetric MUST be true.
In each Lost Neighbor Tuple: In each Lost Neighbor Tuple:
o NL_neighbor_addr MUST NOT equal this router's originator address, o NL_neighbor_addr MUST NOT include this router's originator
equal the O_orig_addr in any Originator Tuple, or equal the address, the O_orig_addr in any Originator Tuple, or equal or have
AL_net_addr in any Local Attached Network Tuple. as a sub-range the AL_net_addr in any Local Attached Network
Tuple.
In each 2-Hop Tuple: In each 2-Hop Tuple:
o N2_2hop_addr MUST NOT equal this router's originator address, o N2_2hop_addr MUST NOT equal this router's originator address,
equal the O_orig_addr in any Originator Tuple, or equal the equal the O_orig_addr in any Originator Tuple, or equal or have as
AL_net_addr in any Local Attached Network Tuple. a sub-range the AL_net_addr in any Local Attached Network Tuple
In each Advertising Remote Router Tuple: In each Advertising Remote Router Tuple:
o AR_orig_addr MUST NOT be in the I_local_iface_addr_list in any o AR_orig_addr MUST NOT be in any network address in the
Local Interface Tuple or equal the IR_local_iface_addr in any I_local_iface_addr_list in any Local Interface Tuple or be in the
Removed Interface Address Tuple. IR_local_iface_addr in any Removed Interface Address Tuple.
o AR_orig_addr MUST NOT equal this router's originator address or o AR_orig_addr MUST NOT equal this router's originator address or
equal the O_orig_addr in any Originator Tuple. equal the O_orig_addr in any Originator Tuple.
o AR_orig_addr MUST NOT equal the AL_net_addr in any Local Attached o AR_orig_addr MUST NOT be in the AL_net_addr in any Local Attached
Network Tuple. Network Tuple.
o AR_orig_addr MUST NOT equal the AR_orig_addr in any other o AR_orig_addr MUST NOT equal the AR_orig_addr in any other
Advertising Remote Router Tuple. Advertising Remote Router Tuple.
In each Router Topology Tuple: In each Router Topology Tuple:
o There MUST be an Advertising Remote Router Tuple with AR_orig_addr o There MUST be an Advertising Remote Router Tuple with AR_orig_addr
= TR_from_orig_addr. = TR_from_orig_addr.
o TR_to_orig_addr MUST NOT be in the I_local_iface_addr_list in any o TR_to_orig_addr MUST NOT be in any network address in the
Local Interface Tuple or equal the IR_local_iface_addr in any I_local_iface_addr_list in any Local Interface Tuple or be in the
Removed Interface Address Tuple. IR_local_iface_addr in any Removed Interface Address Tuple.
o TR_to_orig_addr MUST NOT equal this router's originator address or o TR_to_orig_addr MUST NOT equal this router's originator address or
equal the O_orig_addr in any Originator Tuple. equal the O_orig_addr in any Originator Tuple.
o TR_to_orig_addr MUST NOT equal the AL_net_addr in any Local o TR_to_orig_addr MUST NOT be in the AL_net_addr in any Local
Attached Network Tuple. Attached Network Tuple.
o The ordered pair (TR_from_orig_addr, TR_to_orig_addr) MUST NOT o The ordered pair (TR_from_orig_addr, TR_to_orig_addr) MUST NOT
equal the corresponding pair for any other Router Topology Tuple. equal the corresponding pair for any other Router Topology Tuple.
o TR_seq_number MUST NOT be greater than AR_seq_number in the o TR_seq_number MUST NOT be greater than AR_seq_number in the
Advertising Remote Router Tuple with AR_orig_addr = Advertising Remote Router Tuple with AR_orig_addr =
TR_from_orig_addr. TR_from_orig_addr.
In each Routable Address Topology Tuple: In each Routable Address Topology Tuple:
o There MUST be an Advertising Remote Router Tuple with AR_orig_addr o There MUST be an Advertising Remote Router Tuple with AR_orig_addr
= TA_from_orig_addr. = TA_from_orig_addr.
o TA_dest_addr MUST be routable. o TA_dest_addr MUST be routable.
o TA_dest_addr MUST NOT be in the I_local_iface_addr_list in any o TA_dest_addr MUST NOT overlap any network address in the
Local Interface Tuple or equal the IR_local_iface_addr in any I_local_iface_addr_list in any Local Interface Tuple or overlap
Removed Interface Address Tuple. the IR_local_iface_addr in any Removed Interface Address Tuple.
o TA_dest_addr MUST NOT equal this router's originator address or o TA_dest_addr MUST NOT include this router's originator address or
equal the O_orig_addr in any Originator Tuple. include the O_orig_addr in any Originator Tuple.
o TA_dest_addr MUST NOT equal the AL_net_addr in any Local Attached o TA_dest_addr MUST NOT equal or have as a sub-range the AL_net_addr
Network Tuple. in any Local Attached Network Tuple.
o The ordered pair (TA_from_orig_addr, TA_dest_addr) MUST NOT equal o The ordered pair (TA_from_orig_addr, TA_dest_addr) MUST NOT equal
the corresponding pair for any other Attached Network Tuple. the corresponding pair for any other Attached Network Tuple.
o TA_seq_number MUST NOT be greater than AR_seq_number in the o TA_seq_number MUST NOT be greater than AR_seq_number in the
Advertising Remote Router Tuple with AR_orig_addr = Advertising Remote Router Tuple with AR_orig_addr =
TA_from_orig_addr. TA_from_orig_addr.
In each Attached Network Tuple: In each Attached Network Tuple:
o There MUST be an Advertising Remote Router Tuple with AR_orig_addr o There MUST be an Advertising Remote Router Tuple with AR_orig_addr
= AN_orig_addr. = AN_orig_addr.
o AN_net_addr MUST NOT be in the I_local_iface_addr_list in any o AN_net_addr MUST NOT equal or be a sub-range of any network
Local Interface Tuple or equal the IR_local_iface_addr in any address in the I_local_iface_addr_list in any Local Interface
Removed Interface Address Tuple. Tuple or be a sub-range of the IR_local_iface_addr in any Removed
Interface Address Tuple.
o AN_net_addr MUST NOT equal this router's originator address or o AN_net_addr MUST NOT equal this router's originator address or
equal the O_orig_addr in any Originator Tuple. equal the O_orig_addr in any Originator Tuple.
o AN_net_addr MUST NOT equal the AL_net_addr in any Local Attached o AN_net_addr MUST NOT equal the AL_net_addr in any Local Attached
Network Tuple. Network Tuple.
o The ordered pair (AN_orig_addr, AN_net_addr) MUST NOT equal the o The ordered pair (AN_orig_addr, AN_net_addr) MUST NOT equal the
corresponding pair for any other Attached Network Tuple. corresponding pair for any other Attached Network Tuple.
o AN_seq_number MUST NOT be greater than AR_seq_number in the o AN_seq_number MUST NOT be greater than AR_seq_number in the
Advertising Remote Router Tuple with AR_orig_addr = AN_orig_addr. Advertising Remote Router Tuple with AR_orig_addr = AN_orig_addr.
o AN_dist MUST NOT be less than zero. o AN_dist MUST NOT be less than zero.
In each Received Tuple:
o RX_orig_addr MUST NOT equal this router's originator address or
the O_orig_addr in any Originator Tuple.
o Each ordered triple (RX_type, RX_orig_addr, RX_seq_number) MUST
NOT equal the corresponding triple for any other Received Tuple in
the same Received Set.
In each Processed Tuple:
o P_orig_addr MUST NOT equal this router's originator address or
equal the O_orig_addr in any Originator Tuple.
o Each ordered triple (P_type, P_orig_addr, P_seq_number) MUST NOT
equal the corresponding triple for any other Processed Tuple.
In each Forwarded Tuple:
o F_orig_addr MUST NOT equal this router's originator address or
equal the O_orig_addr in any Originator Tuple.
o Each ordered triple (F_type, F_orig_addr, F_seq_number) MUST NOT
equal the corresponding triple for any other Forwarded Tuple.
Appendix E. Flow and Congestion Control Appendix E. Flow and Congestion Control
Due to its proactive nature, this protocol has a natural control over Due to its proactive nature, this protocol has a natural control over
the flow of its control traffic. Routers transmit control messages the flow of its control traffic. Routers transmit control messages
at predetermined rates specified and bounded by message intervals. at predetermined rates specified and bounded by message intervals.
This protocol employs [NHDP] for local signaling, embedding MPR This protocol employs [NHDP] for local signaling, embedding MPR
selection advertisement through a simple Address Block TLV, and selection advertisement through a simple Address Block TLV, and
router willingness advertisement (if any) as a single Message TLV. router willingness advertisement (if any) as a single Message TLV.
Local signaling, therefore, shares the characteristics and Local signaling, therefore, shares the characteristics and
 End of changes. 436 change blocks. 
1290 lines changed or deleted 1288 lines changed or added

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