We consider the setting of a network providing differentiated services. As is often the case in differentiated services, we assume that the packets are tagged as either being a hi...
William Aiello, Yishay Mansour, S. Rajagopolan, Ad...
We present the transient analysis of the system content in a two-class discrete-time MX /D/1 priority queue. In particular, we derive an expression for the generating function of ...
We give a closed-form expression for the discounted weighted queue length and switching costs of a two-class single-server queueing model under a preemptive priority rule. These e...
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
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( √ ...