We study queue abandonment from a hospital emergency department. We show that abandonment is influenced by the queue length and the observable queue flows during the waiting exposure, even after controlling for wait time. For example, observing an additional person in the queue or an additional arrival to the queue leads to an increase in abandonment probability equivalent to a 25-minute or 5-m...

This paper deals with bi-level control policy and queuing analysis of a machine repair problem. The model is developed by incorporating mixed standbys (cold and warm), reneging, set up and vacation time. The repair facility consists of two heterogeneous repairmen in the system. The life and repair time of the failed units and also their set up times are assumed to be exponentially distributed. ...

1 2 The capacity drop indicates that the queue discharge rate is lower than the free-flow 3 capacity. Studies show that queue discharge rates vary under different traffic conditions. 4 Empirical data show that the queue discharge rate increases as the speed in congestion 5 increases. Insights into the underlying behavioral mechanisms that result in such variable 6 queue discharge rates can help...

In this paper, we analyze a scheduling algorithm which is suitable for the heterogeneous traffic network. In the large deviation setting, we are interested to see, how the asymptotic decay rate of maximum queue overflow probability achieved by this algorithm.We first derive an upper bound on the decay rate of the queue overflow probability as the queue overflow threshold approaches infinity. Th...

The rapid development of information technology has promoted the transformation traditional networks into intelligent networks. Huge data traffic is generated by various types services in networks, which can easily lead to network congestion, system instability, and other problems. These problems may incur great requirements pose challenges for queue management algorithms. Most active (AQM) alg...

The issue queue keeps the instructions that are waiting for the availability of input operands and issue slots. While some instructions remain for a few cycles in the issue queue, the instructions dependent on L2 misses may remain there for hundreds of cycles due to the L2 miss latency. Some authors have proposed mechanisms to extract these instructions from the issue queue. However, these mech...

FIFO Queues have over the years been the subject of significant research. Such queues are used as buffers both in a variety of applications, and in recent years as a key tool in buffering data in high speed communication networks. Overall, the most popular dynamic-memory lock-free FIFO queue algorithm in the literature remains the MS-queue algorithm of Michael and Scott. Unfortunately, this alg...