Formal models of the OSPF routing protocol

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Drury, J., Höfner, P., & Wang, W. (2020). Formal models of the OSPF routing protocol. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 316, pp. 72–120). Open Publishing Association. https://doi.org/10.4204/EPTCS.316.4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free