The proposed model helps mining frequent patterns in large databases by implementing queue data structure. The whole database is scanned only once and the data is compressed in the form of patterns in the queue structure. The frequent patterns are mined from this compressed database of queue structure. This queue approach brings efficiency in mining as the number of database scans is effectivel...

This paper presents a concurrent FIFO queue. The queue is designed to support high, scalable performance through both partitioning its representation , and the removal of locks. A proof of the consistency properties of the queue operations is developed, based on the Linearizability consistency condition. Linearizability is of interest because of its compositional properties , providing a strong...

We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution of the total queue length, and the queue length of the first queue, implicitly determining the distribution o...

Offset optimization is of critical importance to the traffic control system, especially when spillovers appear. In order to avoid vehicle queue spillovers, an arterial offset optimization model was presented in saturated arterial intersections based on minimizing the queue length over the whole duration of the saturated traffic environment. The paper uses the shockwave theory to analyze the que...

In this paper we give a fairly complete survey of the available results on the control of arrival and service rates for both single queue and networks of queues. We also study two M/M/l queues in series. At the first queue, the arrival and the service rates are chosen in pair from a finite set whenever the queue lengths at both queues change. Each choice has a switching cost depending on the ch...

In this paper, we propose a per-class queue management and adaptive packet drop mechanism in the routers for Internet congestion control. We model active queue management as an optimization problem and our proposed mechanism provides congestion control and fairness for different types of traffic flows. An optimal packet drop rate is obtained to maintain a relatively small queue occupancy, which...

in this paper a single server queuing production system is considered which is subject to gradual deterioration. the system is discussed under two different deteriorating conditions. a planning horizon is considered and server which is a d/m/1 queuing system is gradually deteriorates through time periods. a maintenance policy is taken into account whereby the server is restored to its initial c...

In this paper we compare the exponential symmetric shortest queue system with two related systems: the shortest queue system with threshold jockeying and the shortest queue system with threshold blocking. The latter two systems are easier to analyse and are shown to give tight lower and upper bounds respectively for the mean waiting time in the shortest queue system. The approach also gives bou...

Queue computers use a FIFO data structure for data processing. The essential characteristics of a queue-based architecture excel at satisfying the demands of embedded systems, including: compact instruction set, simple hardware logic, high parallelism, and low power consumption. The size of the queue is an important concern in the design of a realizable embedded queue processor. We introduce th...

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...