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

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

Two 11(15-->1)abeotaxanes having a tetrahydrofuran ring along the carbon atoms C-2, C-3, C-4, C-20 were identified for the first time from the needles of the Canadian yew, Taxus canadensis. The compounds could be identified as 4alpha,10beta,13alpha-triacetoxy-15-benzoyloxy-2alpha,20beta-epoxy-11(15-->1)abeotax-11-ene-5alpha,7beta,9alpha-triol (1) and 4alpha,7beta,9alpha,10beta,15-pentaacetoxy-2...

In this paper, we show that significant simplicities can arise in the analysis of a network when link capacities are large enough to carry many flows. In particular, we prove that, when an upstream queue serves a large number of regulated traffic sources, the queue-length of the downstream queue converges almost surely to the queue-length of a simplified queueing system (single queue) obtained ...

The performance and power optimization of dynamic superscalar microprocessors requires striking a careful balance between exploiting parallelism and hardware simplification. Hardware structures which are needlessly complex may exacerbate critical timing paths and dissipate extra power. One such structure requiring careful design is the issue queue. In a Simultaneous Multi-Threading (SMT) proces...

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

We present the most complete to date interferometric study of centimeter wavelength methanol masers detected in G358.93-0.03 at burst and post-burst epochs. A unique, NIR/(sub)mm-dark FIR-loud MYSO accretion was recently discovered G358.93-0.03. The event accompanied by flares an unprecedented number rare maser transitions. first images three newly-discovered 6.18, 12.23, 20.97 GHz are presente...

In the Operations Research queue-joining literature, beginning with Naor (1969), the queue joining probability is monotonic decreasing in the queue length; the longer the queue, the fewer consumers join. Recent academic and empirical evidence indicates that queue-joining probabilities may not always be decreasing in the queue length. We provide a simple explanation for these non-monotonic queue...