Using behavioral experiments, we examined the impact of dispensability of effort and salience of feedback on worker productivity and how they can be managed via queueing design. We considered two queue design features: queue structure that can either be parallel queues (multiple queues with a dedicated server per queue) or a single queue (a single pooled queue served by multiple providers); and...

This paper considers MAP/G/1 queueing systems under the following two situations: (1) At the end of a busy period, the server is turned off and inspects the queue length every time a customer a,rrives. When the queue length reaches a pre-specified value N , the server turns on and serves customers continuously until the system becomes empty. (2) At the end of a busy period, the server takes a s...

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel ...

In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...

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

Abstract We consider the notion of a constant length queue automaton —i.e., traditional with built-in limit on its queue—as formalism for representing regular languages. show that descriptional power automata greatly outperforms finite state automata, height pushdown and straight line programs expressions, by providing optimal exponential double-exponential size gaps. Moreover, we prove can be ...

In this paper, we refine the calculus proposed in [5, 8, 91. The new calculus, including network operations for multiplexing, input-output relation, and routing, allows us to compute tighter exponential bounds for the tail distributions of queue lengths in intree networks with routing. In particular, if external arrival processes and routing processes are either Markov arrival processes or auto...

Considering impatient users in space information networks, a preliminary queue congestion control model was presented. It balanced the network loads and make up for the resource lost from the impatient leaving users. To describe the competition among nodes, the model used queuing game theory. The introduced congestion control platform, which consisted of service nodes, calculated user’s gain to...

An approximation algorithm is presented for open tandem queueing networks with finite buffers and with general service times. The algorithm decomposes the system into individual queues with revised arrival and service process and revised queue capacity. Then, each queue is analyzed in isolation. The service process is revised so that to reB.ect the additional delay a unit might undergo due to b...

In this paper, we consider a PH/M/2 queue in which each server has its own queue and arriving customers join the shortest queue. For this model, it has been conjectured that the decay rate of the tail probabilities for the shortest queue length in the steady state is equal to the square of the decay rate for the queue length in the corresponding PH/M/2 model with a single queue. We prove this f...