192 search results - page 4 / 39 » On priority queues with priority jumps |
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
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...
120
click to vote
PE
2008
Springer
15 years 1 months ago
2008
Springer
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 ...
QUESTA
2000
15 years 1 months ago
2000
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...
123
Voted
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
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...
115
click to vote
CATS
2007
15 years 3 months ago
2007
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( √ ...