Formalising the Optimised Link State Routing Protocol

@article{Barry2020FormalisingTO,
  title={Formalising the Optimised Link State Routing Protocol},
  author={Ryan Barry and R. V. Glabbeek and P. H{\"o}fner},
  journal={ArXiv},
  year={2020},
  volume={abs/2004.13285},
  pages={40-71}
}
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. 

References

SHOWING 1-10 OF 40 REFERENCES
Modelling and verifying the AODV routing protocol
Modelling Link State Routing in Event-B
  • Mojgan Kamali, L. Petre
  • Computer Science
  • 2016 21st International Conference on Engineering of Complex Computer Systems (ICECCS)
  • 2016
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol
A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)
Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
Mechanizing a Process Algebra for Network Protocols
...
1
2
3
4
...