Abstract
We consider a single server queue shared by N different classes of jobs. Class i jobs arrive at the queue in a Poisson fashion with a class dependent rate. The total number of class i jobs allowed to wait in the queue is wi, the window size of this class. A class i job that arrives to find wi class i jobs in the shared queue is forced to wait in an input queue. There is one input queue for each class. All classes receive the same service at the shared queue, which is exponentially distributed. We analyze the two-class model numerically. For more than two classes, we obtain an approximate decomposition algorithm that utilizes the two-class numerical procedure. Validation tests showed that the approximation procedure is fairly accurate.
Supported in part by a grant from AIRMICS through the Center for Communications and Signal Processing, NC State University, and by the National Science Foundation under grant no. CCR-87-02258
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Fdida, H.G. Perros and A. Wilks, Semaphore Queues: Modeling Multilayered Window Flow Control Mechanisms, Tech. Rep., Computer Science, 1988, North Carolina State University
A. Krzesinski and P. Teunissen, Multiclass Queueing Networks with Population Constrained Subnetworks, Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Austin TX, August 1985, 128–139
S.S. Lam, Queueing Networks with Population Size Constraints, IBM J. Res. Dev., 370–378, July 1977
E.D. Lazowska and J. Zahorjan, Multiple Class Memory Constrained Queueing Networks, Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, Seattle WA, August 1982, 130–140
M. Reiser, A Queueing Network Analysis of Computer Communications Network with Window Flow Control, IEEE Trans. Comm., COM 27, 1199–1209, 1979
M. Reiser, Performance Evaluation of Data Communications Systems, Proc. IEEE, 70, 171–196, 1982
A. Thomasian and P. Bay, Analysis of Queueing Network Models with Population Size Constraints and Delayed Blocked Customers, Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, Cambridge, 202–216, 1984
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Plenum Press, New York
About this chapter
Cite this chapter
Onvural, R.O., Perros, H.G., Koerner, U. (1989). On a Multiclass Queue with Class Dependent Window-Flow Control. In: Puigjaner, R., Potier, D. (eds) Modeling Techniques and Tools for Computer Performance Evaluation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0533-0_13
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0533-0_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-7853-5
Online ISBN: 978-1-4613-0533-0
eBook Packages: Springer Book Archive