The impact of a job buffer in a token-bank rate-control throttle
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 8 (4) , 685-717
- https://doi.org/10.1080/15326349208807247
Abstract
In this paper we study a rate-control throttle with a finite-capacity token bank and a finite-capacity job buffer. The primary purpose is to gain additional insight into the impact of the job buffer. We show that the overflow processes of jobs and tokens depend on the job-buffer and token-bank capacities only through their sum, in a very strong sense. Given two throttles with arbitrary token and job arrival processes, which differ only in their initial conditions and buffer capacities, having common total capacity, there exists a random time after which the overflow processes in these two systems coincide. For given total capacity, the job buffer smooths the stream of admitted jobs, but the reduced congestion is less than might be expected. For example, the heavy-traffic limiting behavior of a downstream infinite-capacity ^-server queue is unaffected by the job buffer in the throttle. We make a sample-path comparison of the throughputs at a downstream finite-capacity queue regulated by a token-bank rate-control throttle, with and without a job buffer. Given a fixed total capacity in the throttle (and thus a fixed admission rate of the throttle) and given a fixed amount of buffer space for jobs to allocate to a downstream queue and a job buffer in the throttle, the maximum throughput of jobs occurs when all the buffer capacity is allocated to the downstream queue, even though the admitted stream from the throttle is not smoothed by a job buffer. Similar results hold for systems with non-discrete flow, such as regulated Brownian motion and Markov modulated fluid models.Keywords
This publication has 15 references indexed in Scilit:
- The Brownian approximation for rate-control throttles and the G/G/1/C queueDiscrete Event Dynamic Systems, 1992
- Analysis and design of rate-based congestion control of high speed networks, I: stochastic fluid models, access regulationQueueing Systems, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Performance analysis of a rate-control throttle where tokens and jobs queueIEEE Journal on Selected Areas in Communications, 1991
- Monotonicity and convexity properties of rate control throttlesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queueProceedings of the IEEE, 1989
- Ordinary CLT and WLLN Versions of L = λWMathematics of Operations Research, 1988
- Brownian Motion and Stochastic Flow Systems.Journal of the Royal Statistical Society: Series D (The Statistician), 1987
- Comparing multi-server queues with finite waiting rooms, I: Same number of serversAdvances in Applied Probability, 1979
- Multiple channel queues in heavy traffic. II: sequences, networks, and batchesAdvances in Applied Probability, 1970