Bounds and Policies for Dynamic Routing in Loss Networks

References

• Ash G. R., Huang B. D. Comparative evaluation of dynamic routing strategies for a worldwide intelligent network. The Fundamental Role Teletraffic Evol. Telecomm. Networks, Proc. Internat. Telecomm. Conf. (1994) 14Crossref, Google Scholar
• Bertsimas D., Paschalidis I. Ch., Tsitsiklis J. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Ann. Appl. Probab. (1994) 4(1):43–75Crossref, Google Scholar
• Franks R. L., Rishel R. W. Optimum network call-carrying capacity. Bell System Tech. J. (1973) 52(7):1195–1214Crossref, Google Scholar
• Gibbens R. J., Kelly F. P. Dynamic routing in fully connected networks. IMA J. Math. Control & Inform. (1990) 7:77–111Crossref, Google Scholar
• Gibbens R. J., Kelly F. P. Network programming methods for loss networks. IEEE J. Selected Areas Comm. (1995) 13(7):1189–1198Crossref, Google Scholar
• Gibbens R. J., Kelly F. P., Key P. B. Dynamic alternative routing—Modelling and behaviour. Proc. 12th Internat. Teletraffic Congress (1988) North-Holland (Turin)Google Scholar
• Gibbens R. J., Kelly F. P., Turner S. R. E. Dynamic routing in multiparented networks. IEEE/ACM Trans. Networking (1993) 1(2):261–270Crossref, Google Scholar
• Heyman D. P., Sobel M. J.Stochastic Models in Operations Research (1984) ii:(McGraw-Hill, New York) . Stochastic OptimizationGoogle Scholar
• Hunt P. J., Laws C. N. Least busy alternative in queueing and loss networks. Probab. Engrg. Informational Sci. (1992) 6:439–456Crossref, Google Scholar
• Hunt P. J., Laws C. N. Asympotically optimal loss network control. Math. Oper. Res. (1993) 18:880–900Link, Google Scholar
• Advanced traffic control methods for circuit switched telecommunication networksIEEE Communications Magazine (1990) 28(10Google Scholar
• Inoue A., Yamamoto H., Harada Y. An advanced large-scale simulation system for telecommunication networks with dynamic routing. Networks (1989) 89:77–82Google Scholar
• Kelly F. P. Blocking probabilities in large circuitswitched networks. Adv. Appl. Probab. (1986) 18(2):473–505Crossref, Google Scholar
• Kelly F. P. Routing and capacity allocation in networks with trunk reservation. Math. Oper. Res. (1990) 14(4):771–793Link, Google Scholar
• Kelly F. P. Loss networks. Ann. Appl. Probab. (1991) 1:319–378Crossref, Google Scholar
• Kelly F. P. Bounds on the performance of dynamic routing schemes for highly connected networks. Math. Oper. Res. (1994) 19:1–20Link, Google Scholar
• Key P. B. Optimal control and trunk reservation in loss networks. Probab. Engrg. Informational Sci. (1990) 4:203–242Crossref, Google Scholar
• Lazarev V. G., Starobinets S. M. The use of dynamic programming for optimization of control in networks of communication of channels. Engrg. Cybern. (1977) 3:107–116Google Scholar
• Lippman S. A. Applying a new device in the optimization of exponential queueing systems. Oper. Res. (1975) 23:687–710Link, Google Scholar
• Louth G. M., Mitzenmacher M., Kelly F. P. Computational complexity of loss networks. Theoretical Comput. Sci. (1994) 125:45–59Crossref, Google Scholar
• Marbukh V. V. Asymptotic investigation of a complete communications network with a large number of points and bypass routes. Problemy Peradãaci Informacii (1981) 16:89–95Google Scholar
• Miller B. A queueing reward system with several customer classes. Management Sci. (1969) 16:234–245Link, Google Scholar
• Mitra D. Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking. Adv. Appl. Probab. (1987) 19:219–239Crossref, Google Scholar
• Mitra D., Gibbens R. J. State-dependent routing on symmetric loss networks with trunk reservations: Asymptotics, optimal design. Ann. Oper. Res. (1992) 35:3–30Crossref, Google Scholar
• Mitra D., Gibbens R. J., Huang B. D. State-dependent routing on symmetric loss networks with trunk reservations. IEEE Trans. Comm. (1993) 41(2):400–411Crossref, Google Scholar
• Mitra D., Seery J. B. Comparative evaluations of randomized and dynamic routing strategies for circuitswitched networks. IEEE Trans. Comm. (1991) 39:102–116Crossref, Google Scholar
• Ott T. J., Krishnan K. R. Separable routing: A scheme for state-dependent routing of circuit-switched telephone traffic. Ann. Oper. Res. (1992) 35:43–68Crossref, Google Scholar
• Pinsky E., Conway A. E. Computational algorithms for blocking probabilities in circuit-switched networks. Ann. Oper. Res. (1992) 35:31–42Crossref, Google Scholar
• Ross K. W. Multiservice loss models for broadband telecommunication networks. (1995) (Springer-Verlag)Google Scholar
• Ross K. W., Wang J. Monte-carlo summation applied to product-form loss networks. Probab. Engrg. Inform. Sci. (1992) 6:323–348Crossref, Google Scholar
• Stacey R. R., Songhurst D. J. Dynamic alternative routing in the British Telecom trunk network. International Switching Symposium (1987) (Phoenix, AZ)Google Scholar
• Weber J. H. A simulation study of routing and control in communication networks. Bell System Tech. (1964) 43:2639–2676Crossref, Google Scholar