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

Hierarchical Cellular Networks provide an enhanced use of the indoor networks. These two lower layers called picocell and femtocell consist both high and low speed users. To prevent the dropping and blocking probabilities of ongoing calls in a network, cells are spitted into the small sizes. Although, many effective approaches are used but these delaying calls reach in a queue until a channel b...

We examine an M/G/1 queue with several queueing disciplines. After reviewing some background material in probability theory, we consider a first-come first-served queue. Next, we examine an absolute priority queue, where high priority customers are always selected for service over lower priority customers, regardless of how long the latter have been waiting. We also review a method for calculat...