Formalising the optimised link state routing protocol
Date
Authors
Barry, Ryan
van Glabbeek, Rob
Höfner, Peter
Journal Title
Journal ISSN
Volume Title
Publisher
Access Statement
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.
Description
Keywords
Citation
Collections
Source
Electronic Proceedings in Theoretical Computer Science, EPTCS
Type
Book Title
Entity type
Publication