Formal Models of the OSPF Routing Protocol

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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Drury, Jack, Höfner, Peter, Wang, Weiyou
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 28.04.2020
Subjects
Computer Science - Logic in Computer Science
Computer Science - Networking and Internet Architecture
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.2004.13286