Revisiting Stochastic Loss Networks: Structures and Approximations

References

• [1] Anselmi J, Lu Y, Sharma M, Squillante MS (2009) Improved approximations for the Erlang loss model. Queueing Systems Theory Appl. 63(1–4):217–239.Crossref, Google Scholar
• [2] Baras JS, Perumal S, Tabatabaee V, Somasundaram K, Purkayastha P (2008) Loss network models and multiple metric performance sensitivity analysis for mobile wireless multi-hop networks. Proc. 4th Ann. Internat. Conf. Wireless Internet (Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, Brussels), Article No. 60.Crossref, Google Scholar
• [3] Berezner SA, Krzesinski AE, Taylor PG (1998) On the inverse of Erlang’s formula. J. Appl. Probab. 35(1):246–252.Crossref, Google Scholar
• [4] Bhadra S, Lu Y, Squillante MS (2007) Optimal capacity planning in stochastic loss networks with time-varying workloads. Proc. ACM SIGMETRICS Conf. Measurement Model. Comput. Systems (ACM Press, New York), 227–238.Crossref, Google Scholar
• [5] Bonald T (2006) The Erlang model with non-Poisson call arrivals. Proc. Joint SIGMETRICS/Performance Conf. Measurement Model. Comput. Systems (ACM Press, New York), 276–286.Crossref, Google Scholar
• [6] Burman DY, Lehoczky JP, Lim Y (1984) Insensitivity of blocking probabilities in a circuit-switching network. J. Appl. Probab. 21(04):850–859.Crossref, Google Scholar
• [7] Cao H, Hu J, Jiang C, Kumar T, Li TH, Liu Y, Lu Y, et al.. (2011) OnTheMark: Integrated stochastic resource planning of human capital supply chains. Interfaces 41(5):414–435.Link, Google Scholar
• [8] Choudhury GL, Leung KK, Whitt W (1995) An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models. Adv. Appl. Probab. 27(4):1104–1143.Crossref, Google Scholar
• [9] Cover TM, Thomas JA (2006) Elements of Information Theory, 2nd ed. (Wiley Interscience, New York).Google Scholar
• [10] Dembo A, Zeitouni O (1998) Large Deviations Techniques and Applications, 2nd ed. (Springer-Verlag, New York).Crossref, Google Scholar
• [11] Erlang AK (1948) Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Brockmeyer E, Halstrøm HL, Jensen A, eds. The Life and Works of A. K. Erlang (Academy of Technical Sciences, Copenhagen). First published 1917.Google Scholar
• [12] Hunt PJ, Kelly FP (1989) On critically loaded loss networks. Adv. Appl. Probab. 21(4):831–841.Crossref, Google Scholar
• [13] Jung K, Lu Y, Shah D, Sharma M, Squillante MS (2008) Revisiting stochastic loss networks: Structures and algorithms. Proc. ACM SIGMETRICS Conf. Measurement Model. Comput. Systems (ACM Press, New York), 407–418.Crossref, Google Scholar
• [14] Kelly FP (1979) Reversibility and Stochastic Networks (John Wiley & Sons, New York).Google Scholar
• [15] Kelly FP (1985) Stochastic models of computer communication systems. J. Royal Statist. Soc. Ser. B 47(3):379–395.Google Scholar
• [16] Kelly FP (1986) Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18(2):473–505.Crossref, Google Scholar
• [17] Kelly FP (1988) Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Adv. Appl. Probab. 20(1):112–144.Crossref, Google Scholar
• [18] Kelly FP (1991) Loss networks. Ann. Appl. Probab. 1(3):319–378.Crossref, Google Scholar
• [19] Lasserre JB (2001) Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11(3):796–817.Crossref, Google Scholar
• [20] Little JDC (1961) A proof of the queuing formula L=λW. Oper. Res. 9(3):383–387.Link, Google Scholar
• [21] Louth G, Mitzenmacher M, Kelly F (1994) Computational complexity of loss networks. Theoret. Comput. Sci. 125(1):45–59.Crossref, Google Scholar
• [22] Lu Y, Radovanović A, Squillante MS (2007) Optimal capacity planning in stochastic loss networks. Performance Evaluation Rev. 35(2):39–41.Crossref, Google Scholar
• [23] Luo ZQ, Tseng P (1992) On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30(2):408–425.Crossref, Google Scholar
• [24] Mitra D, Weinberger PJ (1984) Probabilistic models of database locking: Solutions, computational algorithms and asymptotics. J. ACM 31(4):855–878.Crossref, Google Scholar
• [25] Mitra D, Morrison JA, Ramakrishnan K.G. (1996) ATM network design and optimization: A multirate loss network framework. IEEE/ACM Trans. Networking 4(4):531–543.Crossref, Google Scholar
• [26] Momcilovic P, Squillante MS (2011) Linear loss networks. Queueing Systems Theory Appl. 68(2):111–131.Crossref, Google Scholar
• [27] Morrison JA (1994) Loss probabilities in a simple circuit-switched network. Adv. Appl. Probab. 26(2):456–473.Crossref, Google Scholar
• [28] Reiman MI (1991) A critically loaded multiclass Erlang loss system. Queueing Systems Theory Appl. 9(1-2):65–82.Crossref, Google Scholar
• [29] Ross KW (1995) Multiservice Loss Models for Broadband Telecommunication Networks (Springer-Verlag, New York).Crossref, Google Scholar
• [30] Sevastyanov BA (1957) An ergodic theorem for Markov processes and its application to telephone systems with refusals. Theoret. Probab. Appl. 2(1):104–112.Crossref, Google Scholar
• [31] Squillante MS (2011) Stochastic analysis and optimization of multiserver systems. Ardagna D, Zhang L, eds. Run-Time Models for Self-Managing Systems and Applications (Springer, Basel, Switzerland), 1–24.Google Scholar
• [32] Valiant L (1979) The complexity of computing the permanent. Theoret. Comput. Sci. 8(2):189–201.Crossref, Google Scholar
• [33] Whitt W (1985) Blocking when service is required from several facilities simultaneously. AT&T Tech. J. 64(8):1807–1856.Crossref, Google Scholar
• [34] Wilkinson RI (1956) Theory for toll traffic engineering in the USA. Bell Systems Tech. J. 35(2):421–513.Crossref, Google Scholar
• [35] Xu S, Song JS, Liu B (1999) Order fulfillment performance measures in an assemble-to-order system with stochastic leadtime. Oper. Res. 47(1):131–149.Link, Google Scholar
• [36] Zachary S, Ziedins I (1999) Loss networks and Markov random fields. J. Appl. Probab. 36(2):403–414.Crossref, Google Scholar
• [37] Ziedins IB, Kelly FP (1989) Limit theorems for loss networks with diverse routing. Adv. Appl. Probab. 21(4):804–830.Crossref, Google Scholar