Formalising the Optimised Link State Routing Protocol
Abstract
Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise and verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2020
- DOI:
- 10.48550/arXiv.2004.13285
- arXiv:
- arXiv:2004.13285
- Bibcode:
- 2020arXiv200413285B
- Keywords:
-
- Computer Science - Networking and Internet Architecture;
- Computer Science - Logic in Computer Science
- E-Print:
- In Proceedings MARS 2020, arXiv:2004.12403