Abstract
Consider a multiclass stochastic network with state-dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load balancing schemes. Given Poisson arrival and exponential service requirements, the number of customers in the network evolves as a multi-dimensional birth-and-death process on a finite subset of ℕk. We assume that the death (i.e., service) rates and the birth rates depending on the whole state of the system satisfy a local balance condition. This makes the resulting network a Whittle network, and the stochastic process describing the state of the network is reversible with an explicit stationary distribution that is in fact insensitive to the service time distribution. Given routing constraints, we are interested in the optimal performance of such networks. We first construct bounds for generic performance criteria that can be evaluated using recursive procedures, these bounds being attained in the case of a unique arrival process. We then study the case of several arrival processes, focusing in particular on the instance with admission control only. Building on convexity properties, we characterize the optimal policy, and give criteria on the service rates for which our bounds are again attained.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bonald, T.: Insensitive traffic models for communication networks. Discrete Event Dyn. Syst. 17(3), 405–421 (2007)
Bonald, T., Proutière, A.: Insensitivity in processor-sharing networks. Perform. Eval. 49, 193–209 (2002)
Bonald, T., Proutière, A.: Insensitive bandwidth sharing in data networks. Queueing Syst. 44(1), 69–100 (2003)
Bonald, T., Jonckheere, M., Proutière, A.: Insensitive load balancing. In: Perf. Eval. Review: Proc. ACM Sigmetrics/Performance 2004, pp. 367–377 (2004)
Bonald, T., Massoulié, L., Proutière, A., Virtamo, J.: A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst. 53(1–2), 65–84 (2006)
Erlang, A.K.: Solutions of some problems in the theory of probabilities of significance in automatic telephone exchange. In: Brockmeyer, E., Halstrom, H.L., Jensen, A. (eds.) The Life and Works of A.K. Erlang (1948). 1917 in Danish
Hordijk, A., van Dijk, N.M.: Networks of queues, part 1: Job-local-balance and the adjoint process; part 2: General routing and service characteristics. Lect. Notes Control Inf. Sci. 60, 158–205 (1983)
Kelly, F.: Reversibility and Stochastic Networks. Wiley, New York (1979)
Leino, J., Virtamo, J.: Insensitive load balancing in data networks. Comput. Netw. 50(8), 1059–1068 (2006)
Pla, V., Virtamo, J., Martínez-Bauset, J.: Optimal robust policies for bandwidth allocation and admission control in wireless networks. Comput. Netw. 52, 3258–3272 (2008)
Robert, P.: Stochastic Networks and Queues. Springer, Berlin (2003)
Roberts, J.W.: A survey on statistical bandwidth sharing. Comput. Netw. 45, 319–332 (2004)
Ross, K.W.: Multiservice Loss Models for Broadband Telecommunication Networks. Springer, Berlin (1995)
Serfozo, R.: Introduction to Stochastic Networks. Springer, Berlin (1999)
Whittle, P.: Systems in Stochastic Equilibrium. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. Wiley, New York (1986)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Jonckheere, M., Mairesse, J. Towards an Erlang formula for multiclass networks. Queueing Syst 66, 53–78 (2010). https://doi.org/10.1007/s11134-010-9185-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-010-9185-y