Computational techniques for accurate performance evaluation of multirate, multihop communication networks

IEEE/ACM Transactions on Networking

Volumn 5, Issue 2, 1997, Pages 266-277

  Greenberg, Albert G ^a,b   Srikant, R ^a,c  

^a IEEE   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Blocking probabilities; Circuit switched networks; Integrated services networks; Reduced load approximations

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; PERFORMANCE; PROBABILITY; SWITCHING NETWORKS; TELECOMMUNICATION CONTROL; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

BLOCKING PROBABILITY; CIRCUIT SWITCHED NETWORKS; REDUCED LOAD APPROXIMATIONS; STATE DEPENDENT ADMISSION CONTROL;

VOICE/DATA COMMUNICATION SYSTEMS;

EID: 0031124470     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.588101     Document Type: Review

References (27)

1. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, "On-line machine scheduling with applications to load balancing and virtual circuit routing," in Proc. 25th Annu. ACM Symp. Theory of Computing, May 1993, pp. 623-631.
2. N. Bean, R. J. Gibbens, and S. Zachary, "The performance of single resource loss systems in multiservice networks," in Proc. 14th Int. Teletraffic Cong, 1994.
3. _, "Analysis of large single resource loss systems under heavy traffic, with applications to integrated networks," Adv. Appl. Prob., Mar. 1995.
4. A. Beguelin, J. Dongarra, A. Geist, R. Manchek, K. Moore, and V. Sunderam, "PVM and HeNCE: Tools for heterogeneous network computing," in Software for Parallel Computation, (vol. 106 of NATO ASI Ser. F), J. S. Kowalik and L. Grandinetti, Eds. New York: Springer-Verlag, 1993.
5. E. Boros and A. Prekópa, "Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur," Math. Oper. Res., vol. 14, pp. 317-342, 1989.
6. E. Boros, A. Prekópa, and K. Lih, "The use of binomial moments for bounding network reliability," in DIMACS Series in Discrete Mathematics, vol. 5, 1991, pp. 197-212.
7. S. P. Chung, A. Kashper, and K. W. Ross, "Computing approximate blocking probabilities for large loss networks with state-dependent routing," IEEE/ACM Trans. Networking, vol. 1, pp. 105-115, Feb. 1993.
8. S.P. Chung and K.W. Ross, "Reduced load approximations for multirate loss networks," IEEE Trans. Commun., vol. 41, pp. 1222-1231, Aug. 1993.
9. C.J. Colbourn. The Combinatorics of Network Reliability. Oxford, U.K.: Oxford Univ. Press, 1987.
10. A. DeSimone and S. Sibal, "Controlling alternate routing in general-mesh packet flow networks," in Proc. SIGCOMM'94.
11. A. Gersht and K.J. Lee, "A bandwidth management strategy in ATM networks," GTE Lab., preprint, 1990.
12. A. G. Greenberg and V. Marbukh, "A state dependent, cost-based routing and trunk reservation strategy for multirate loss networks," presented at the INFORMS Conf. Telcommun., Mar. 1995.
13. A. G. Greenberg, A. M. Odlyzko, J. Rexford, and D. Espinosa, "Fast parallel solution of fixed-point equations for the performance evaluation of circuit-switched networks," in Proc. Performance'93.
14. J. Y. Hui, "Resource allocation for broadband networks," IEEE J. Select. Areas Commun., vol. 6, pp. 1598-1608, 1988.
15. _, Switching and Traffic Theory for Integrated Broadband Networks. Boston, MA: Kluwer, 1990.
16. C. Jacobaeus, "A study of congestion in link system," Ericsson Techniques, vol. 48, pp. 1-68, 1950.
17. S. Katz, "Statistical performance analysis of a switched communications network," in Proc. 5th Int. Teletraffic Congr., 1967, pp. 566-575.
18. J. S. Kaufman, "Blocking in a shared resource environment," IEEE Trans. Commun., vol. COM-29, pp. 1474-1481, Oct. 1981.
19. F. P. Kelly, "Loss networks," Ann. App. Prob., vol. 1, pp. 319-378, Aug. 1991.
20. C. Y. Lee, "Analysis of switching networks," Bell Syst. Tech. J., vol. 36, pp. 1287-1315, Nov. 1955.
21. A. Prekópa. "Boole-Bonferroni inequalities and linear programming," Oper. Res., vol. 36, pp. 145-162, 1988.
22. _, "The discrete moment problem and linear programming," Discrete Appl. Math., vol. 27, pp. 235-254, 1990.
23. _, "Sharp bounds on probabilities using linear programming," Oper. Res., vol. 38, pp. 227-239, 1990.
24. F. Roberts, F. Hwang, and C. Monma, Eds., Reliability of Computer and Communication Networks, Vol. 5 (Ser. in Discrete Math. and Theoretical Comput. Sci.). Providence, RI: Amer. Math. Soc., 1989.
25. J. W. Roberts, "A service system with heterogeneous service requirements," Performance of Data Commun. Syst. Appl., pp. 423-431, 1981.
26. W. Whitt, "Blocking when service is required from several facilities simultaneously," AT&T Tech. J., pp. 1807-1856, 1985.
27. R.I. Wilkinson, "Theory of teletraffic engineering in the USA," Bell Syst. Tech. J., vol. 35, pp. 421-513, 1956.