Abstract
We consider the problem of how best to assign the service capacity in a queueing network in order to minimize the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting-time distributions. Thus we shall approach the optimal allocation problem using an approximation technique: specifically, the residual-life approximation for the distribution of queueing times. This work generalizes results of Kleinrock, who studied networks with exponentially distributed service times. We illustrate our results with reference to data networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Akimaru and K. Kawashima, Teletraffic: Theory and Applications, 2nd edition(Springer-Verlag, London, 1999).
G. Bloch, S. Greiner, H. de Meer and K. Trivedi, Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications (Wiley, New York, 1998).
T. Brown, Some Distributional Approximations for Random Measures, PhD thesis, University of Cambridge, 1979.
T. Brown and P. Pollett, Some distributional approximations in Markovian networks, Adv. Appl. Probab. 14(1982), 654–671.
T. Brown and P. Pollett, Poisson approximations for telecommunications networks, J. Austral. Math. Soc., 32 (1991), 348–364.
X. Chao, M. Miyazawa and M. Pinedo,Queueing Networks: Customers, Signals and Product Form Solutions(Wiley, New York, 1999).
J. Jackson, Jobshop-like queueing systems, Mgmt. Sci. 10 (1963), 131–142.
F. Kelly, Networks of queues with customers of different types, J. Appl. Probab. 12 (1975), 542–554.
F. Kelly, Networks of queues, Adv. Appl. Probab. 8 (1976),416–432.
F. Kelly, Reversibility and Stochastic Networks (Wiley, Chichester, 1979).
L. Kleinrock, Communication Nets (McGraw-Hill, New York, 1964).
E. Koenigsberg, Cyclic queues, Operat. Res. Quart. 9 (1958), 22–35.
P. Pollett, Distributional Approximations for Networks of Queues, PhD thesis, University of Cambridge, 1982.
P. Pollett, Residual life approximations in general queueing networks, Elektron. Informationsverarb. Kybernet. 20 (1984), 41–54.
K. Ross, Multiservice Loss Models for Broadband Telecommunication Networks (Springer-Verlag, London, 1995).
R. Serfozo, Introduction to Stochastic Networks (Springer-Verlag, New York, 1999).
J. Taylor and R. Jackson, An application of the birth and death process to the provision of spare machines, Operat. Res. Quart. 5 (1954), 95–108.
W. Turin, Digital Transmission Systems: Performance Analysis and Modelling, 2nd edition (McGraw-Hill, New York, 1998).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Pollett, P. (2009). Optimal capacity assignment in general queueing networks. In: Pearce, C., Hunt, E. (eds) Optimization. Springer Optimization and Its Applications, vol 32. Springer, New York, NY. https://doi.org/10.1007/978-0-387-98096-6_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-98096-6_14
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98095-9
Online ISBN: 978-0-387-98096-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)