Formal Models of the OSPF Routing Protocol

04/28/2020
by   Jack Drury, et al.
0

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.

READ FULL TEXT
research
04/28/2020

Formalising the Optimised Link State Routing Protocol

Routing protocol specifications are traditionally written in plain Engli...
research
03/18/2022

Advanced Models for the OSPF Routing Protocol

We present two formal models for the OSPF routing protocol, designed for...
research
09/24/2018

Mathematical Modeling of Routes Maintenance and Recovery Procedure for MANETs

Routing is one of the most mysterious issues from the birth of networks ...
research
03/04/2022

A Theory of Protocol Composition

Real-world communication protocols are often built out of a number of si...
research
02/17/2019

On the Complexity of Anonymous Communication Through Public Networks

Anonymous channels allow users to connect to websites or communicate wit...
research
06/02/2021

Formally Verified Convergence of Policy-Rich DBF Routing Protocols

In this paper we present new general convergence results about the behav...
research
08/31/2013

Artificial Intelligence Based Cognitive Routing for Cognitive Radio Networks

Cognitive radio networks (CRNs) are networks of nodes equipped with cogn...

Please sign up or login with your details

Forgot password? Click here to reset