Georges, J.-P., Divoux, T. and Rondeau, E. (2005) Strict Priority versus Weighted Fair Queueing in Switched Ethernet Networks for Time Critical Applications. 19th IEEE International Parallel and Distributed Processing Symposium, Denver, 4-8 April 2005, 141-148.
https://doi.org/10.1109/IPDPS.2005.413

has been cited by the following article:

• TITLE: Modeling and Performance Analysis of Weighted Priority Queueing for Packet-Switched Networks

  AUTHORS: Dariusz Strzeciwilk, Wlodek M. Zuberek

  KEYWORDS: Timed Petri Nets, Discrete-Event Simulation, Priority Queueing, Weighted Priority Queueing, Performance Analysis

  JOURNAL NAME: Journal of Computer and Communications, Vol.6 No.11, November 23, 2018

  ABSTRACT: Weighted priority queueing is a modification of priority queueing that eliminates the possibility of blocking lower priority traffic. The weights assigned to priority classes determine the fractions of the bandwith that are guaranteed for individual traffic classes, similarly as in weighted fair queueing. The paper describes a timed Petri net model of weighted priority queueing and uses discrete-event simulation of this model to obtain performance characteristics of simple queueing systems. The model is also used to analyze the effects of finite queue capacity on the performance of queueing systems.