In this paper, we discuss how to test partially specified IOTS through lossless queues. A liberal assumption is made of the IOTS model by allowing both blocked and unspecified inpu...
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...
Expected slowdown has been proposed as a criterion to evaluate queue fairness. In this work we examine how the constant slowdown principle can be used as a basis for a queueing fa...
DiffServ networks support three forwarding classes: EF, AF and BE. Scheduling algorithms based on priority queueing such as Cisco LLQ and MDRR seem to be a natural choice to provi...
Recently, a state-dependent change of measure for simulating overflows in the two-node tandem queue was proposed by Dupuis et al. (Ann. Appl. Probab. 17(4):1306– 1346, 2007), to...