We consider a 2-class, single-server, preemptive priority queueing model in which the high-priority customers form a classical M/M/1 queue, while the low-priority customers form the so-called Israeli Queue with at most N different groups and unlimited-size batch service. We provide an extensive probabilistic analysis and calculate key performance measures. Special cases are analyzed and numeric...

We formally prove the correctness of the time super-e cient result checker for priority queues, which is implemented in LEDA [17]. A priority queue is a data structure that supports insertion, deletion and retrieval of the minimal element, relative to some order. A result checker for priority queues is a data structure that monitors the input and output of the priority queue. Whenever the user ...

We present an eecient algorithm which can check the answers given by the fundamental abstract data types priority queues and mergeable priority queues. This is the rst linear-time checker for mergeable priority queues. These abstract data types are widely used in routing, scheduling, simulation, computational geometry and many other algorithmic domains. We have implemented our answer checker an...

In this study, a priority based protocol with queue management has been developed for wireless networks. The protocol is creating new queue management for reducing dropped TCP packets with priority. A load balancing method for gateways was also developed. The protocol has been tested using an ns-2 (network simulator 2) simulation tool. In the simulation, Drop-Tail, Red Queue and the present pro...

Abstract Pay-for-priority is a common practice in congestion-prone service systems. The extant literature on this topic restricts attention to the case where only epoch for customers purchase priority upon arrival , and if choose not upgrade when they arrive, cannot do so later during their wait. A natural alternative let pay at any time stay queue, even initially. This paper builds queueing-ga...

Existing concurrent priority queues do not allow to update the priority of an element after its insertion. As a result, algorithms that need this functionality, such as Dijkstra’s single source shortest path algorithm, resort to cumbersome and inefficient workarounds. We report on a heap-based concurrent priority queue which allows to change the priority of an element after its insertion. We sh...