Formalising the Optimised Link State Routing Protocol

04/28/2020
by   Ryan Barry, et al.
0

Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise and verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/28/2020

Formal Models of the OSPF Routing Protocol

We present three formal models of the OSPF routing protocol. The first t...
research
07/31/2019

A Process Algebra for Link Layer Protocols

We propose a process algebra for link layer protocols, featuring a uniqu...
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
03/18/2022

Advanced Models for the OSPF Routing Protocol

We present two formal models for the OSPF routing protocol, designed for...
research
07/02/2020

Spores: Stateless Predictive Onion Routing for E-Squads

Mass surveillance of the population by state agencies and corporate part...
research
02/05/2019

A Survey of Limitations and Enhancements of the IPv6 Routing Protocol for Low-power and Lossy Networks: A Focus on Core Operations

Driven by the special requirements of the Lowpower and Lossy Networks (L...
research
02/16/2020

The HPIM-DM Multicast Routing Protocol

This paper proposes the HPIM-DM (Hard-state Protocol Independent Multica...

Please sign up or login with your details

Forgot password? Click here to reset