Abstract
We develop a capacity expansion method for state dependent routing which utilizes the concept of shadow price. To cope with the computational complexity which is inherent with the capacity expansion process, special forms of fixed point iteration are developed for network blocking evaluation. The proposed capacity expansion method is illustrated through the example of a well known state dependent routing, namely Least Busy Alternate Routing. We verify the method in simulated networks and the resulting network cost is seen to be quite close to the ones derived from the methods with much higher computational complexity. The proposed method also results in a network design that satisfies the prescribed network blocking probability very accurately.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. M. Wanamaker and D. A. Dorrance, Dynamically controlled routing field trial experience,Proc. of the Network Operations and Management Systems Conference, New Orleans, March 1988.
R. J. Gibbens and F. P. Kelly, Dynamic routing in fully connected networks.IMA Journal of Mathematical Control and Information, Vol. 7, pp. 77–111, 1990.
G. R. Ash, J. S. Chen, A. E. Frey, and B. D. Huang, Real-time network routing in a dynamic class-of-service network,Teletraffic and Datatraffic in a Period of Change, A. Jensen and V. B. Iversen, (eds.) North-Holland, 1991.
K. R. Krishnan and T. J. Ott, State-dependent routing for telephone traffic: theory and results,25th IEEE Control and Decision Conference, Athens, pp. 2124–2128, December 1986.
T. J. Ott and K. R. Krishbnan, State-dependent routing of telephone traffic and the use of separable routing schemes.International Teletraffic Congress, Vol. 11, pp. 867–872, 1985.
K. R. Krishnan and T. J. Ott, Forward-looking routing: a new state-dependent routing scheme,International Teletraffic Congress 12, paper 3.4A4, Torino 1988.
V. P. Chaudhary, K. R. Krishnan, and C. D. Pack, Implementing dynamic routing in the local telephone companies of USA,International Teletraffic Congress, ITC-13, 1991.
G. R. Ash, R. H. Cardwell, and R. P. Murray, Design and optimization of networks with dynamic routing.Bell System Technical Journal, Vol. 60, pp. 1787–1820, 1981.
A. Girard,Routing and Dimesioning in Circuit-Switched Networks, Addison-Wesley Publishing Company, 1990.
M. V. Hegde, P. S. Min, and A. Rayes, State dependent routing: traffic dynamic and performance benefits.Journal of Network and Systems Management, Vol. 2, No. 2, pp. 125–149, June 1994.
A. Maunder and P. S. Min, Routing for multi-rate traffic with multiple qualities of service,Proc. of the Third Int'l Conf. on Computer Communications and Networks, San Francisco, pp. 104–108, September 1994.
A. Girard and B. Liau, Dimensioning of adaptively routed networks.IEEE/ACM Transactions on Networking, Vol. 1, No. 4, pp. 460–468, August 1993.
S. P. Chung, A. Kashper, and K. Ross, Computing approximate blocking probabilities for large loss networks with state-dependent routing.IEEE/ACM Transactions on Networking, Vol. 1, No. 1, pp. 105–115, February 1994.
D. Mitra, R. J. Gibbens, and B. D. Huang, Analysis and optimal design of aggregated leastbusy-alternative routing on symmetric loss networks with trunk reservations,International Teletraffic Congress, 13, Copenhagen 1991, pp. 477–481.
N. T. Koussoulas, Performance analysis of circuit-switched networks with state-dependent routing.IEEE Transactions on Communications, Vol. 41, pp. 1647–1655, 1993.
V. Marbukh, An asymptotic study of a large fully connected communication network with reroutes,Problemy Pederachi Informatsii, Vol. 3, pp. 89–95, 1981.
E. W. M. Wong and T. S. Yum, Maximum free circuit routing in circuit-switched networks,Proc. IEEE INFOCOM 1990, pp. 934–937, 1990.
V. I. Istratescu,Fixed Point Theory, McGraw-Hill Book Company, 1982.
F. P. Kelly, Routing and capacity allocation in networks with trunk reservation.Mathematics of Operations Research, Vol. 15, No. 4, pp. 771–793, 1990.
F. P. Kelly, Routing in circuit-switched networks: optimization, shadow prices and decentralization.Advances in Applied Probability, Vol. 20, pp. 112–144, 1988.
P. B. Key, Implied cost methodology and software tools for a fully connected network with DAR and trunk reservation.British Telecom Tech. Journal, Vol. 6, No. 3, pp. 42–65, July 1988.
A. Rayes, Analysis of state dependent routing in circuit-switched networks, Doctoral Thesis, Department of Electrical Engineering, Washington University, January 1994.
F. P. Kelly, Blocking probabilities in large circuit-switched networks.Advances in Applied Probability, Vol. 18, pp. 473–505 1986.
D. Bertsekas and R. Gallager,Data Networks, Second Edition, Prentice-Hall Inc., 1992.
N. L. Johnson and S. Kotz,Discrete Distributions, John Wiley and Sons, 1969.
P. Borjesson and C. E. Sundberg, A class of analytical approximations of the error functionQ(x), IEEE Transactions on Communications, March 1979.
R. I. Wilkinson, Theories for toll traffic engineering in the USA,Bell Systems Technical Journal, Vol. 35, pp. 421–514, 1956.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rayes, A., Min, P.S. Application of shadow price in capacity expansion of state dependent routing. J Netw Syst Manage 4, 71–93 (1996). https://doi.org/10.1007/BF02139048
Issue Date:
DOI: https://doi.org/10.1007/BF02139048