A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- 1 March 1991
- journal article
- Published by Springer Nature in Queueing Systems
- Vol. 9 (1-2) , 163-190
- https://doi.org/10.1007/bf01158796
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State AnalysisThe Annals of Applied Probability, 1992
- Steady-State Analysis of RBM in a Rectangle: Numerical Methods and A Queueing ApplicationThe Annals of Applied Probability, 1991
- Dependence in packet queuesIEEE Transactions on Communications, 1989
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989
- Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queueProceedings of the IEEE, 1989
- Large deviations and rare events in the study of stochastic algorithmsIEEE Transactions on Automatic Control, 1983
- Sharing a Processor Among Many Job ClassesJournal of the ACM, 1980
- The multiple phase service network with generalized processor sharingActa Informatica, 1979
- A Generalization of Erlang's Loss System to State Dependent Arrival and Service RatesMathematics of Operations Research, 1978
- Analysis and Design of Loop Service Systems via a Diffusion ApproximationOperations Research, 1977