6 research outputs found
Performance analysis of priority queueing systems in discrete time
The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes
Discrete-time queueing models with priorities
This PhD-dissertation contains analyses of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the system contents and packet delays of both classes.
The results are applicable in heterogeneous telecommunication networks, when delay-sensitive traffic gets transmission priority over best-effort traffic. Our results predict the influence of priority scheduling on the QoS (Quality-of-Service) of the different types of traffic
Discrete Time Analysis of Multi-Queue Systems with Multiple Departure Streams in Material Handling and Production under Different Service Rules
In this work, we present a modelling approach in order to depict service rules holistically. The developed model is called multi-queue system with multiple departure streams (MQSMDS). The MQSMDS is modelled as a discrete time Markov chain. On the basis of a numerical study, the system characteristics are evaluated. The results of this work enable a rapid and low-cost analysis of material handling and production systems as well as a fast and easy identification of suitable service rules
Discrete Time Analysis of Consolidated Transport Processes
Diese Arbeit beschäftigt sich mit der Entwicklung zeitdiskreter Modelle zur Analyse von Transportbündelungen. Mit den entwickelten Modellen für Bestands- und Fahrzeugbündelungen, insbesondere Milkrun-Systeme, kann eine detaillierte Leistungsbewertung in kurzer Zeit durchgeführt werden. Darüber hinaus erlauben die Modelle die Analyse der Umschlagslagerbündelungen, beispielweise Hub-und-Spoke-Netzwerke, indem sie im Rahmen einer Netzwerkanalyse mit einander verknüpft werden