Shadow prices for LLR and ALBA

IEEE/ACM Transactions on Networking

Volumn 4, Issue 5, 1996, Pages 796-807

  Vargas, Cesar ^b   Hegde, Manjunath V ^a,c   Naraghi Pour, Morteza ^a,c   Min, Paul S ^a,d  

^a IEEE

^b SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^c LOUISIANA STATE UNIVERSITY   (United States)

^d WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK TOPOLOGY; MATHEMATICAL MODELS; OPTIMIZATION; SWITCHING; TELECOMMUNICATION TRAFFIC;

ADAPTIVE ROUTING; AGGREGATE LEAST BUSY ALTERNATIVE; BLOCKING PROBABILITY; DYNAMICALLY CONTROLLED ROUTING; FIXED ALTERNATE ROUTING; FIXED POINT ALGORITHMS; LEAST LOADED ROUTING; RESIDUAL CAPACITY ADAPTIVE ROUTING; SHADOW PRICES;

SWITCHING NETWORKS;

EID: 0030259101     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.541327     Document Type: Article

References (30)

1. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. New York: Wiley, 1989.
2. G. R. Ash, R. H. Cardwell, and R. P. Murray, "Design and optimization of networks with dynamic routing," Bell System Tech. J., vol. 60, pp. 1787-1820, 1981.
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," in Teletraffic and Datatraffic in a Period of Change, A. Jensen, and V. B. Iversen, Eds. Amsterdam, The Netherlands: North-Holland: 1991.
4. G. R. Ash and B. D. Huang, "An analytical model for adaptive-routing networks," IEEE Trans. Commun., vol. 41, no. 11, pp. 1748-1759, 1993.
5. S. P. Chung, A. Kaspher, and K. W. Ross, "Computing approximate blocking probabilities for large loss networks with state-dependent routing," IEEE/ACM Trans. Networking, vol. 1, no. 1, pp. 105-115, Feb. 1993.
6. W. Fleming, Functions of Several Variables. Reading, MA: Addison-Wesley, 1965.
7. A. Farago, S. Blaabjerg, L. Ast, G. Gordos, and T. Henk, "A new degree of freedom in ATM network dimensioning: optimizing the logical configuration," IEEE J. Select. Areas Commun., vol. 13, no. 7, pp. 1199-1207, 1995.
8. P. B. Key and M. J. Whitehead, "Cost-effective use of networks employing dynamic alternative routing," Teletraffic Science for New Cost-Effective Systems, Networks and Services, ITC-12, 1989, pp. 987-997.
9. R. Gibbens and Whiting, "An investigation of implied cost methods for circuit-switched network optimization," in Proc. 5th UK Teletraffic Symp., 1988.
10. A. Girard, "Revenue optimization of telecommunication networks," IEEE Trans. Commun., vol. 41, no. 4, pp. 583-591, Apr. 1993.
11. _, Routing and Dimensioning in Circuit-Switched Networks. Reading, MA: Addison-Wesley, 1990.
12. R. J. Gibbens, F. P. Kelly, and S. R. E. Turner, "Dynamic routing in multiparented networks," IEEE/ACM Trans. Networking, vol. 1, no. 2, pp. 261-270, 1993.
13. R. J. Gibbens, and F. P. Kelly, "Dynamic routing in fully connected networks," IMA J. Mathematical Control Inform., vol. 7. pp. 77-111, 1990.
14. A. Girard, and M. A. Bell, "Blocking evaluation for networks with residual-capacity adaptive routing," IEEE Trans. Commun., vol. 37, no. 12, pp. 1372-1380, Dec. 1989.
15. F. P. Kelly, "Routing in circuit-switched networks: optimization, shadow prices and decentralization," Adv. Appl. Probability, vol. 20, pp. 112-144, 1988.
16. _, "Routing and capacity allocation in networks with trunk reservation," Math. Oper. Res., vol. 15, pp. 771-792, Nov. 1990.
17. K. R. Krishnan, "Performance evaluation of networks under state-dependent routing," Bellcore Symp. Performance Modeling, Livingston, NJ, May 1990.
18. K. R. Krishnan and T. J. Ott, "State-dependent routing for telephone traffic: theory and results," in 25th IEEE Control and Decision Conf., Athens, Greece, Dec. 1986, pp. 2124-2128.
19. E. Malinvaud, Lectures on Microeconomic Theory. Amsterdam, The Netherlands: North-Holland, 1972.
20. D. Mitra, R. J. Gibbens, and B. D. Huang, "State-dependent routing on symmetric loss networks with trunk reservations - I," IEEE Trans. Commun., vol. 41, no. 2, pp. 400-411, Feb. 1993.
21. S. Lakshmivarahan and S. D. Dhall, Analysis and Design of Parallel Algorithms; Arithmetic and Matrix Problems. New York: McGraw-Hill, 1990.
22. T. J. Ott and K. R. Krishnan, "State-dependent routing of telephone traffic and the use of separable routing schemes," Int. Teletraffic Congress, vol. 11, 1985, pp. 867-872.
23. G. V. Reklaitis, A. Ravindran, and K. M. Ragsdell, Engineering Optimization Methods and Applications. New York: Wiley, 1983, pp. 452-455.
24. A. Rayes and P. S. Min, "Capacity expansion in state dependent routing schemes," in Proc. 1994 Conf. Inform. Sci. Syst., Princeton, NJ, Mar. 1994, pp. 237-241.
25. A. Rayes and P. S. Min, "Application of shadow price in capacity expansion of state dependent routing," J. Network Syst. Management, Mar. 1996.
26. C. Vargas, M. V. Hegde, M. Naraghi-Pour, and P. Min, "Shadow prices for state dependent routing," in Proc. 1994 Annu. Conf. Inform., Sci. Syst., Princeton, NJ, Mar. 1994, pp. 243-248.
27. _, "Shadow prices for LLR and ALBA," Department of Electrical and Computer Engineering, Louisiana State University, Tech. Rep. TR-5125-95, Dec. 1995.
28. E. W. M. Wong and T. S. Yum, "Maximum free circuit routing in circuit-switched networks," in Proc. INFOCOM '90, 1990.
29. D. M. Wanamaker and D. A. Dorrance, "Dynamically controlled routing field trial experience," in Proc. Network Oper. Management Syst. Conf., New Orleans, LA, Mar. 1988.
30. E. Young, "Cost allocation," in Proc. Symp. Appl. Math., 1985, pp. 69-94.