Formalising the Optimised Link State Routing Protocol

Ryan Barry, Rob van Glabbeek, Peter Höfner

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.

Knowledge Graph



Sign up or login to leave a comment