External Links

    Journal: Queueing Syst.

    Volume 39, Issue 4

    303 -- 315Vinod Sharma. Queues with Service Rate Controlled by a Delayed Feedback
    317 -- 333Paavo Salminen, Ilkka Norros. On Busy Periods of the Unbounded Brownian Storage
    335 -- 336. OBITUARY Associate Professor W. (Bill) Henderson (1943-2001)
    337 -- 348Xiuli Chao, William Henderson, Peter G. Taylor. State-Dependent Coupling in General Networks
    349 -- 375Tetsuya Takine. Queue Length Distribution in a FIFO Single-Server Queue with Multiple Arrival Streams Having Different Service Time Distributions
    377 -- 397Fabrice Guillemin, Jacqueline Boyer. Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory

    Volume 39, Issue 2/3

    109 -- 135Huei-Wen Ferng, Jin-Fu Chang. Departure Processes of BMAP/G/1 Queues
    137 -- 155Avi Giloni, Sridhar Seshadri. Optimal Configurations of General Job Shops
    157 -- 182Vladimir V. Anisimov, Jesus R. Artalejo. Analysis of Markov Multiserver Retrial Queues with Negative Arrivals
    183 -- 200Sanjay Shakkottai, R. Srikant. Many-Sources Delay Asymptotics with Applications to Priority Queues
    201 -- 212Sunggon Kim, Jongho Bae, Eui Yong Lee. Busy Periods of Poisson Arrival Queues with Loss
    213 -- 256Charles Knessl, Yongzhi (Peter) Yang. Asymptotic Expansions for the Congestion Period for the M/M/¥ Queue

    Volume 39, Issue 1

    5 -- 6Attahiru Sule Alfa, Jungong Xue, Qiang Ye. Perturbation Theory for the Asymptotic Decay Rates in the Queues with Markovian Arrival Process and/or Markovian Service Process - Correction
    7 -- 22David Perry, Wolfgang Stadje, S. Zacks. The M/G/1 Queue with Finite Workload Capacity
    23 -- 54Erica L. Plambeck, Sunil Kumar, J. Michael Harrison. A Multiclass Queue in Heavy Traffic with Throughput Time Constraints: Asymptotically Optimal Dynamic Controls
    55 -- 78Pieter-Tjerk de Boer, Victor F. Nicola, Jan-Kees C. W. van Ommeren. The Remaining Service Time upon Reaching a High Level in M/G/1 Queues
    79 -- 102Maury Bramson. Stability of Earliest-Due-Date, First-Served Queueing Networks
    runs on