This paper is concerned with the stability of a preemptive repeat priority queueing system with multiple types of customers and customer transfers between queues. Using the mean-drift method and matrix-analytic methods, simple conditions for the queueing system to be stable or instable are found. The conditions indicate that system stability depends only on the service rate of customers of the ...

We obtain an essentially optimal tradeoff between the amortized cost of the three basic priority queue operations insert, delete and find-min in the comparison model. More specifically, we show that A(find-min) = Ω ( n (2 + )A(insert)+A(delete) )

We study MX/G/1 nonpreemptive and preemptive-resume priority queues with/without vacations under random order of service (ROS) discipline within each class. By considering the conditional waiting times given the states of the system, which an arbitrary message observes upon arrival, we derive the Laplace-Stieltjes transforms of the waiting time distributions and explicitly obtain the first two ...

A new priority queue structure is introduced, for which the amortized time to insert a new element isO(1) while that for the minimumextraction is O(logK). K is the average, taken over all the deleted elements x, of the number of elements that are inserted during the lifespan of x and are still in the heap when x is removed. Several applications of our structure are mentioned.

A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...

An Oblivious Priority Queue (OPQ) is a cryptographic primitive that enables client to outsource its data dishonest server, and also securely manage the according priority queue algorithm. Though first OPQ achieves perfect security, it supports only two operations; Inserting an element extracting top-priority element, which are minimal requirement for queue. In addition, this allows adversary ob...

A minimal model based on individual interactions is proposed to study the non-Poisson statistical properties of human behavior: individuals in the system interact with their neighbors, the probability of an individual acting correlates to its activity, and all individuals involved in action will change their activities randomly. The model creates rich non-Poisson spatial-temporal properties in ...

This paper analyzes court priority queuing behavior by examining the time lapse between when a case enters a court’s docket and when it is ultimately disposed of. Using data from the Supreme courts of the United States, Massachusetts, and Canada we show that each court’s docket features a slow decay with a decreasing tail. This demonstrates that, in each of the courts examined, the vast majorit...