Application of shadow price in capacity expansion of state dependent routing

Journal of Network and Systems Management

Volumn 4, Issue 1, 1996, Pages 71-93

  Rayes, Ammar ^a   Min, Paul S ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Capacity expansion; Least busy alternate routing; State dependent routing

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; COSTS; ITERATIVE METHODS; PROBABILITY; TELECOMMUNICATION NETWORKS;

CAPACITY EXPANSION; LEAST BUSY ALTERNATE ROUTING; SHADOW PRICE; STATE DEPENDENT ROUTING;

TELECOMMUNICATION TRAFFIC;

EID: 0030110041     PISSN: 10647570     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02139048     Document Type: Article

References (27)

1. 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.
2. 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.
3. 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.
4. 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.
5. T. J. Ott and K. R. Krishnan, State-dependent routing of telephone traffic and the use of separable routing schemes, International Teletraffic Congress, Vol. 11, pp. 867-872, 1985.
6. 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.
7. 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.
8. 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.
9. A. Girard, Routing and Dimensioning in Circuit-Switched Networks, Addison-Wesley Publishing Company, 1990.
10. M. V. Hegde, P. S. Min, and A. Rayes, State dependent routing: traffic dynamics and performance benefits, Journal of Network and Systems Management, Vol. 2, No. 2, pp. 125-149, June 1994.
11. 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.
12. A. Girard and B. Liau, Dimensioning of adaptively routed networks, IEEE/ACM Transactions on Networking, Vol. 1, No. 4, pp. 460-468, August 1993.
13. 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.
14. D. Mitra, R. J. Gibbens, and B. D. Huang, Analysis and optimal design of aggregated least-busy-altemative routing on symmetric loss networks with trunk reservations, International Teletraffic Congress, 13, Copenhagen 1991, pp. 477-481.
15. N. T. Koussoulas, Performance analysis of circuit-switched networks with state-dependent routing, IEEE Transactions on Communications, Vol. 41, pp. 1647-1655, 1993.
16. V. Marbukh, An asymptotic study of a large fully connected communication network with reroutes, Problemy Pederachi Informatsii, Vol. 3, pp. 89-95, 1981.
17. E. W. M. Wong and T. S. Yum, Maximum free circuit routing in circuit-switched networks, Proc. IEEE INFOCOM 1990, pp. 934-937, 1990.
18. V. I. Istratescu, Fixed Point Theory, McGraw-Hill Book Company, 1982.
19. F. P. Kelly, Routing and capacity allocation in networks with trunk reservation, Mathematics of Operations Research, Vol. 15, No. 4, pp. 771-793, 1990.
20. F. P. Kelly, Routing in circuit-switched networks: optimization, shadow prices and decentralization, Advances in Applied Probability, Vol. 20, pp. 112-144, 1988.
21. 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.
22. A. Rayes, Analysis of state dependent routing in circuit-switched networks, Doctoral Thesis, Department of Electrical Engineering, Washington University, January 1994.
23. F. P. Kelly, Blocking probabilities in large circuit-switched networks, Advances in Applied Probability, Vol. 18, pp. 473-505, 1986.
24. D. Bertsekas and R. Gallager, Data Networks, Second Edition, Prentice-Hall Inc., 1992.
25. N. L. Johnson and S. Kotz, Discrete Distributions, John Wiley and Sons, 1969.
26. P. Borjesson and C. E. Sundberg, A class of analytical approximations of the error function Q(x), IEEE Transactions on Communications, March 1979.
27. R. I. Wilkinson, Theories for toll traffic engineering in the USA, Bell Systems Technical Journal, Vol. 35, pp. 421-514, 1956.