Performance modelling of a priority scheduling system with exhaustive service, finite capacity and switchover

In modern communication systems edge nodes serve the incoming traffic flows from a number of networks and act as traffic aggregators in technologies like optical burst switching and carrier Ethernet. To provide fairness to incoming flows scheduling systems are used as an integral part of these nodes. A scheduling system can be modelled as a multi-queue single-server system. Modelling is categorized on the basis of different factors in consideration and type of service. In this paper, an exhaustive service priority scheduling system is analyzed using state space modelling technique. The model assumes a system with finite capacity and switch-over time is taken into account. The interest of this model is fueled by applications in edge nodes. The performance measures such as mean flow time and blocking probability have been evaluated. To illustrate the accuracy of analytical results, all results have been verified by simulations.