Formal Models of the OSPF Routing Protocol

@article{Drury2020FormalMO,
  title={Formal Models of the OSPF Routing Protocol},
  author={J. Drury and P. H{\"o}fner and Weiyou Wang},
  journal={ArXiv},
  year={2020},
  volume={abs/2004.13286},
  pages={72-120}
}
We present three formal models of the OSPF routing protocol. The first two are formalised in the timed process algebra T-AWN, which is not only tailored to routing protocols, but also specifies protocols in pseudo-code that is easily readable. The difference between the two models lies in the level of detail (level of abstraction). From the more abstract model we then generate the third model. It is based on networks of timed automata and can be executed in the model checker Uppaal. 
1 Citations

Figures and Tables from this paper

References

SHOWING 1-10 OF 56 REFERENCES
Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack
Transformation of AWN Protocol Specifications to the Uppaal Model Checker
  • Bachelor Thesis, Universität Hamburg and Data61,
  • 2017
A Timed Process Algebra for Wireless Networks. CoRR abs/1606.03663
  • Available at http://arxiv.org/abs/1606.03663
  • 2016
Modelling and verifying the AODV routing protocol
OSPF vulnerability to persistent poisoning attacks: a systematic analysis
Broadcast psi-calculi with an application to wireless protocols
Sequence numbers do not guarantee loop freedom: AODV can yield routing loops
...
1
2
3
4
5
...