The University of New South Wales

Formal models of the OSPF routing protocol

Authors

Jack Drury, Peter Hoefner and Weiyou Wang

DATA61

UNSW Sydney

Australian National University

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

BibTeX Entry

  @inproceedings{Drury_HW_20,
    month            = apr,
    date             = {2020-4-26},
    publisher        = {EPTCS},
    paperurl         = {https://trustworthy.systems/publications/csiro_full_text/Drury_HW_20.pdf},
    booktitle        = {MARS2020},
    year             = {2020},
    pages            = {72--120},
    author           = {Drury, Jack and Hoefner, Peter and Wang, Weiyou},
    title            = {Formal models of the {OSPF} routing protocol},
    address          = {Dublin, Ireland}
  }

Download