ATM network design and optimization: A multirate loss network framework

IEEE/ACM Transactions on Networking

Volumn 4, Issue 4, 1996, Pages 531-543

  Mitra, Debasis ^a,b   Morrison, John A ^b   Ramakrishnan, K G ^b  

^a IEEE

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Asymptotic approximations; Effective bandwidth; EM algorithm; Erlang bounds; Fixed point equations; Flow bounds; Implied costs; Revenue maximization; Routing; Steepest ascent

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; CALCULATIONS; OPTIMIZATION; PROBABILITY; SWITCHING NETWORKS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

CONSTANT BIT RATE; ERLANG BOUNDS; FLOW BOUNDS; UNIFORM ASYMPTOTIC APPROXIMATION; VARIABLE BIT RATE;

ASYNCHRONOUS TRANSFER MODE;

EID: 0030211435     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.532863     Document Type: Article

References (29)

1. IEEE J. Select. Areas Commun., vol. 13, nos. 6-7, Aug.-Sept. 1995.
2. G. R. Ash, R. H. Cardwell, and R. P. Murray, "Design and optimization of networks with dynamic routing," Bell Syst. Tech. J., vol. 60, no. 8, pp. 1787-1820, Oct. 1981.
3. A. Girard, Routing and Dimensioning in Circuit-Switched Networks. Reading, MA: Addison-Wesley, 1990.
4. A. Elwalid, D. Mitra, and R. H. Wentworth, "A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node," IEEE J. Select. Areas Commun., vol. 13, no. 6, pp. 1115-1127, Aug. 1995.
5. D. Mitra and J. A. Morrison, "Erlang capacity and uniform approximations for shared unbuffered resources," IEEE/ACM Trans. Networking, vol. 2, pp. 558-570, 1994.
6. P. J. Hunt and F. P. Kelly, "On critically loaded loss networks," Adv. Appl. Prob., vol. 21, pp. 831-841, 1989.
7. M. I. Reiman, "A critically loaded multiclass Erlang loss system," Queueing Syst., vol. 9, pp. 65-82, 1991.
8. S. P. Evans, "Optimal bandwidth management and capacity provision in a broadband network using virtual paths," Perform. Eval., vol. 13, pp. 27-43, 1991.
9. P. Gazdzicki, I. Lambadaris, and R. R. Mazumdar, "Blocking probabilities for large multirate Erlang loss systems," Adv. Appl. Prob., vol. 25, pp. 997-1009, 1993.
10. J. S. Kaufman, "Blocking in a shared resource environment," IEEE Trans. Commun., vol. COM-29, pp. 1474-1481, 1981.
11. J. W. Roberts, "Teletraffic models for the Telecom 1 integrated services network," in Proc. Internet Teletraffic Congress-10, Session 1.1, paper #2.
12. F. P. Kelly, "Loss networks," Ann. Appl. Prob., vol. 1, pp. 319-378, 1991.
13. W. Whitt, "Blocking when service is required from several facilities simultaneously," AT&T Tech. J., vol. 64, pp. 1807-1856, 1985.
14. K. W. Ross, Multirate Loss Models for Broadband Telecommunications Networks. New York: Springer, 1995.
15. P. J. Hunt, "Implied costs in loss networks," Adv. Appl. Prob., vol. 21, pp. 661-680, 1989.
16. J. A. Morrison, "Loss probabilities in a simple circuit-switched network," Adv. Appl. Prob., vol. 26, pp. 456-473, 1994.
17. F. P. Kelly, "Routing in circuit-switched networks: Optimization, shadow prices and decentralization," Adv. Appl. Prob., vol. 20, pp. 112-144, Mar. 1988.
18. F. P. Kelly, "Fixed point models of loss networks," J. Austr. Math. Soc. Ser. B, vol. 31, pp. 204-218, 1989.
19. A. Faragó, 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-1206, Sept. 1995.
20. S.-P. Chung and K. W. Ross, "Reduced load approximations for multirate loss networks," IEEE Trans. Commun., vol. 41, pp. 1222-1231, 1993.
21. A. Girard and M. T. Ho, Optimization of ISDN Networks with Partial Sharing, in J. Labetoulle and J. W. Roberts, Eds. New York: Elsevier, 1994. pp. 1251-1260.
22. J.-F. P. Labourdette and G. W. Hart, "Blocking probabilities in multirate loss systems: Insensitivity, asymptotic behavior and approximations," IEEE Trans. Commun., vol. 40, pp. 1355-1366, 1992.
23. R. Siebenhaar, "Optimized ATM virtual path bandwidth management under fairness constraints," IEEE GLOBECOM'94, pp. 924-928, 1994.
24. L. E. Baum, T. Petrie, G. Soules, and N, Weiss, "A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains," Ann. Math. Statist., vol. 41, pp. 141-171, 1970.
25. A. P. Dempster, N. M. Laird, and D. P. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. R. Statist. Soc. B, vol. 39, pp. 1-38, 1977.
26. Y. Vardi and D. Lee, "From image deblurring to optimal investments: Maximum likelihood solutions for positive linear inverse problems," J. R. Statist. Soc. B, vol. 55, no. 3, pp. 569-612, 1993.
27. Y. Vardi, "Applications of the EM algorithm to linear inverse problems with positivity constraints," preprint, 1994.
28. D. Mitra, J. A. Morrison, and K. G. Ramakrishnan, "Unified approach to multirate ATM network design and optimization," in Proc. 9th ITC Specialists Seminar, Teletraffic Modeling and Measurement in Broadband and Mobile Communication, Leidschendam, The Netherlands, Nov. 1995.
29. R. J. Gibbens, "Dynamic routing in circuit-switched networks: The dynamic alternative routing strategy," Ph.D dissertation, University of Cambridge, U.K., July 1988.