×

An algorithm for network dimensioning under reliability considerations. (English) Zbl 0825.90377


MSC:

90B18 Communication networks in operations research
90-08 Computational methods for problems pertaining to operations research and mathematical programming
90B25 Reliability, availability, maintenance, inspection in operations research
90B06 Transportation, logistics and supply chain management
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] A. Girard and R. Pagé, Dimensioning of telephone networks with nonhierarchical routing and trunk reservation,Proc. IEEE 3rd Network Planning Symp., Innisbrook, Florida (1986).
[2] L. Fratta, M. Gerla and L. Kleinrock, The flow deviation algorithm: an approach to store-and-forward computer communication network design, Networks 3 (1973) 97–133. · Zbl 1131.90321 · doi:10.1002/net.3230030202
[3] D.P. Bertsekas, A class of optimal routing algorithms for communication networks,Proc. Int. Conf. on Circuits and Computers, Atlanta, Georgia (1980).
[4] B. Gavish and S.L. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Trans. Commun. COM-31 (1983) 1154–1161. · doi:10.1109/TCOM.1983.1095752
[5] M. Gerla and L. Kleinrock,, On the topological design of distributed computer networks, IEEE Trans. Commun. COM-25 (1977) 48–50. · doi:10.1109/TCOM.1977.1093709
[6] K. Maruyanna and D.T. Tang, Discrete link capacity assignment in communication networks,3rd ICC, Toronto (1976) pp. 97–97.
[7] B. Gavish and I. Newman, A system for routing and capacity assignment in computer communication networks, IEEE Trans. Commun. COM-37 (1989) 360–366. · doi:10.1109/26.20116
[8] B. Gavish, A general model for the topological design of computer networks,Proc. GLOBE-COM ’86, IEEE Global Telecommunication Conf. (1986).
[9] E. Rosenberg, A nonlinear programming heuristic for computing optimal link capacities in a multi-hours alternate routing communications network, Oper. Res. 3 (1987) 354–364. · Zbl 0627.90033 · doi:10.1287/opre.35.3.354
[10] L.J. Leblanc and R.V. Simmons, Continuous models for capacity design of large packet-switched telecommunication networks, ORSA J. Comput. 1 (1989) 271–286. · Zbl 0825.90394
[11] B. Gavish, P. Trudeau, M. Dror, M. Gendreau and L. Mason, Fiberoptic circuit network design under reliability constraints, IEEE J-SAC, Special issue on Telecommunications Network Design and Planning (1989) 1181–1187.
[12] I. Newman and B. Gavish, A new approach to reliable routing in computer networks,CORS/TIMES/ORSA Joint National Meeting, Vancouver (1989).
[13] B. Sansó, Fiabilité et routage dans un réseau de télécommunications, publication No. 605, Centre de recherche sur les transports, Université de Montréal (1988).
[14] B. Sansó, F. Soumis and M. Gendreau, On the evaluation of telecommunications network reliability using routing models, publication No. 623, Centre de recherche sur les transports, Université de Montréal (1989).
[15] A.A. Jagers and E.A. Van Doorn, On the continued Erlang loss function, Oper. Res. Lett. 5 (1986) 43–46. · Zbl 0595.60089 · doi:10.1016/0167-6377(86)90099-4
[16] C. Palme, Some observations on the Erlang formulae for busy-signal systems,TELE, English Edition, no. 1 (1957) pp. 1–168.
[17] E. Hansler, G.K. Mcauliffe and R.S. Wilkov, Exact calculation of computer network reliability, Networks 4 (1974) 95–112. · Zbl 0285.68031 · doi:10.1002/net.3230040202
[18] L. Fratta and U.G. Montanari, A Boolean algebra method for computing the terminal reliability in a communication network, IEEE Trans. Circuit Theory CT-20 (1973) 203–211.
[19] S. Provan and M.O. Ball, Computing network reliability in time polynomial in the number of cuts, Oper. Res. 2 (1984) 516–526. · Zbl 0544.90034 · doi:10.1287/opre.32.3.516
[20] M.O. Ball, Computing network reliability, Oper. Res. 27 (4) (1979) 823–838. · Zbl 0412.90030 · doi:10.1287/opre.27.4.823
[21] V.O.K. Li and J.A. Silvester, Performance analysis of networks with unreliable components, IEEE Trans. Commun. COM-32 (1984) 1105–1110. · doi:10.1109/TCOM.1984.1095978
[22] R.F. Gaebler and R.J. Chen, An efficient algorithm for enumerating states of a system with multimode unreliable components, working paper presented at theORSA-TIMS, St-Louis meeting (1987) talk TC30.5.
[23] R. Wong, Introduction and Recent Advances in network design: models and algorithms, in:Transportation Planning Models, ed. M. Florian (Elsevier Science/North-Holland, 1984) pp. 187–225.
[24] D.L. Jagerman, Some properties of the Erlang loss function, Bell Sys. Tech. J. 53 (1974) 525–551. · Zbl 0276.60092
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.