In this paperweconsidertheproblemof schedulingdifferentclasses of customerson multiple distributed serversto minimize an objective function basedon per-classmeanresponsetimes.This...
We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted an...
Johan van Leeuwaarden, Dee Denteneer, Jacques Resi...
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing syste...
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously pr...