Modelling and Simulation of Scheduling Policies Implemented in Ethernet Switch by Using Coloured Petri Nets

TL;DR

This paper models Ethernet switch scheduling policies using Coloured Petri Nets to analyze their behavior in Networked Control Systems, validating the models through simulation.

Contribution

It introduces a Coloured Petri Nets-based modeling approach for Ethernet switch scheduling policies, specifically static priority and WRR, with validation against expected behaviors.

Findings

Models accurately simulate scheduler behavior

Validation shows results align with expected policies

Provides a framework for analyzing Ethernet switch scheduling

Abstract

The objective of this paper is to propose models enabling to study the behaviour of Ethernet switch for Networked Control Systems. Two scheduler policies are analyzed: the static priority and the WRR (Weighted Round Robin). The modelling work is based on Coloured Petri Nets. A temporal validation step based on the simulation of these modelling, shows that the obtained results are near to the expected behaviour of these scheduler policies.