Skip to main content
Log in

Sequential and Parallel Approaches to Incorporate Reliability in the Synthesis of Computer Networks

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

This paper presents a scenario-orientedoptimization model and solution algorithm to solve thejoint routing/capacity assignment problem for computernetworks. The advantage of this model is that failures are directly dealt with at the design stage.The model helps to find a suitable trade-off betweencapacity assignment and performance in the event offailures. As accounting for major failures can be very time consuming, we introduce parallelism as atool to solve this type of problem. Two parallelversions of the algorithm were implemented. Bothparallel versions were found to be extremely efficientin reducing computational time, the one presentingtwo levels of parallelization was found more suitablefor larger networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. B. Sansó, M. Gendreau, and F. Soumis, An algorithm for network dimensioning under reliability considerations, Annals of Operations Research, Vol. 36, pp. 263–274, 1992.

    Google Scholar 

  2. L. Fratta, M. Gerla, and L. Kleinrock, The flow deviation method: An approach to store-and-forward communication network design, Networks, Vol. 3, pp. 97–133, 1973.

    Google Scholar 

  3. B. Gavish and I. Neuman, System for routing and capacity assignment in computer communication networks, IEEE Transactions on Communications, Vol. 37, No.4, pp. 360–366, 1989.

    Google Scholar 

  4. B. Gavish and K. Altinkemer, Backbone design tools with economic tradeoffs, ORSA Journal on Computing, Vol. 2, No.3, pp. 236–251, 1990.

    Google Scholar 

  5. A. Dutta and J.-I. Lim, A multiperiod capacity planning model for backbone computer communication networks, Operations Research, Vol. 40, No.4, pp. 689–705, 1992.

    Google Scholar 

  6. T. M. J. Ng and D. B. Hoang, Joint optimization of capacity and flow assignment in a packet-switched communication network, IEEE Transactions on Communications, Vol. 35, No.2, pp. 202–209, 1987.

    Google Scholar 

  7. L. LeBlanc and R. Simmons, Continuous models for capacity design of large packet-switched telecommunication networks, ORSA Journal on Computing, Vol. 1, pp. 271–286, 1989.

    Google Scholar 

  8. M. O. Ball, C. J. Colbourn, and J. S. Provan, Network reliability. M. O. Ball, T. L. Magnanti, and G. L. Nemhauser (eds.), Network models, Handbook of Operations Research and Management Science, Vol. 8, Elsevier, 1995.

  9. T. Flanagan, Fiber network survivability, IEEE Communication Magazine, Vol. 28, No.6, pp. 46–53, 1990.

    Google Scholar 

  10. Y. K. Agarwal, An algorithm for designing survivable networks, AT&T Technical Journal, Vol. 63, No.8, pp. 64–76, 1989.

    Google Scholar 

  11. R. Cardwell, C. L. Monma, and T.-H. Wu, Computer-aided design procedures for survivable fiber optic networks, IEEE Journal on Selected Areas in Communications, Vol. 7, No.8, pp. 1188–1197, 1989.

    Google Scholar 

  12. C. L. Monma and D. F. Shallcross, Methods for designing communications networks with certain two-connected survivability constraints, Operations Research, Vol. 37, No.4, pp. 531–541, 1989.

    Google Scholar 

  13. C. H. Yang and S. Hasegawa, FITNESS: Failure Immunization Technology for Network Service Survivability, Proceedings of GLOBECOM’88, pp. 1549–1554, 1988.

  14. W. D. Grover, Case study of survivable ring, mesh and mesh-arc hybrid networks, Proceedings of GLOBECOM’92, pp. 633–638, 1992.

  15. M. O. Ball, Computing network reliability, Operations Research, Vol. 27, No.4, pp. 823–838, 1979.

    Google Scholar 

  16. K. Maruyama, Designing reliable packet-switched communication networks, Proceedings of the ICC’78, pp. 493–498, 1978.

  17. I. Rubin, On reliable topological structures for packet-switching communication networks, IEEE Transaction on Communications, Vol. 26, No.1, pp. 62–73, 1978.

    Google Scholar 

  18. B. Gavish, P. Trudeau, M. Dror, M. Gendreau, and L. Mason, Fiberoptic circuit network design under reliability constraints, IEEE Journal on Selected Areas in Communications, Vol. 7, No.8, pp. 1181–1187, 1989.

    Google Scholar 

  19. L. Leblanc and R. Reddoch, Reliable link topology/capacity design and routing in backbone telecommunication networks, Owen Graduate School of Management, Vanderbilt University, Working Paper, 90-08, 1990.

  20. Z. Zhang and H. L. Hartmann, Enhanced engineering of packet-switching networks subject to capacity and reliability constraints, Archiv fur Electronik und Uebertragungste chnik, Vol. 47, No.5-6, pp. 459–465, 1993.

    Google Scholar 

  21. A. Al-Rumaih, R. E. Ahmed, S. H. Bakry, and A. Al-Dhelaan, A methodology for network topology design with link and node failures tolerance, International Journal of Network Management, Vol. 6, No.1, pp. 42–64, 1995.

    Google Scholar 

  22. V. O. K. Li and J. A. Silvester, Performance analysis of networks with unreliable components, IEEE Transactions on Communications, Vol. 32, No.10, pp. 1105–1110, 1984.

    Google Scholar 

  23. Y. F. Lam and V. O. K. Li, An improved algorithm for performance analysis of networks with unreliable components, IEEE Transactions on Communications, Vol. 34, No.5, pp. 496–497, 1986.

    Google Scholar 

  24. S. Chiou and V. O. K. Li, Reliability analysis of a communication network with multimode components, IEEE Journal on Selected Areas in Communications, Vol. 4, No.7, pp. 1156–1161, 1986.

    Google Scholar 

  25. D. R. Shier, A new algorithm for performance analysis of communication systems, IEEE Transactions on Communications, Vol. 36, No.4, pp. 516–519, 1988.

    Google Scholar 

  26. C. L. Yang and P. Kubat, Efficient computation of most probable states for communication networks with multimode components, IEEE Transactions on Communications, Vol. 37, No.5, pp. 535–538, 1989.

    Google Scholar 

  27. C. L. Yang and P. Kubat, An algorithm for network reliability bounds, ORSA Journal on Computing, Vol. 2, No.4, pp. 336–345, 1990.

    Google Scholar 

  28. Y. Lim, Minimum-cost dimensioning model for common channel signaling networks under joint performance and reliability constraints, IEEE Journal on Selected Areas in Communications, Vol. 8, No.9, pp. 1658–1666, 1990.

    Google Scholar 

  29. T. Yokohira, M. Sugano, T. Nishida, and H. Miyahara, Fault tolerant packet-switched network design and its sensitivity, IEEE Transactions on Reliability, Vol. 40, No.4, pp. 452–459, 1991.

    Google Scholar 

  30. C. L. Monma and D. Sheng, Backbone network design and performance analysis: a methodology for packet switching networks, IEEE Journal on Selected Areas in Communications, Vol. 4, No.6, pp. 946–965, 1986.

    Google Scholar 

  31. B. Sansó, F. Soumis, and M. Gendreau, On the evaluation of telecommunication networks reliability using routing models, IEEE Transactions on Communications, Vol. 39, No.10, pp. 1494–1501, 1991.

    Google Scholar 

  32. W. D. Grover, T. D. Bilodeau, and B. D. Venables, Near optimal space capacity planning in a mesh restorable network, Proceedings of GLOBECOM’91, pp. 2007–2012, 1991.

  33. G. R. Ash, F. Chang, and D. Medhi, Robust traffic design for dynamic routing networks, Proceedings of INFOCOM’91, pp. 508–514, 1991.

  34. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, 1992.

  35. V. Paxson and S. Floyd, Wide area traffic: the failure of Poisson Modeling, IEEE/ACM Transactions on Networking, Vol. 3, No.3, 1995.

  36. M. Gendreau, B. Sansó, and D. A. Stanford, Optimizing routing in packet switched networks with non-Poisson offered traffic, Telecommunication Systems, Vol. 5, pp. 323–340, 1996.

    Google Scholar 

  37. Special Issue: Routing in Broadband Networks—Part I, Journal of Network and Systems Management, Vol. 3, No.4, 1995.

  38. Special Issue: Routing in Broadband Networks—Part II, Journal of Network and Systems Management, Vol. 4, No.2, 1996.

  39. B. Sansó and F. Soumis, Communication and transportation networks reliability using routing models, IEEE Transactions on Reliability, Vol. 40, No.1, pp. 29–38, 1991.

    Google Scholar 

  40. D. Medhi and S. Sankarappan, Impact of a Transmission facility link failure in dynamic call routing circuit-switched networks under various layout policies, Journal of Network and Systems Management, Vol. 1, No.2, pp. 143–169, 1993.

    Google Scholar 

  41. D. Medhi, A unified approach to network survivability for teletraffic networks: models, algorithms and analysis, IEEE Transactions on Communications, Vol. 42, pp. 534–548, 1994.

    Google Scholar 

  42. A Girard and B. Sansó, Multicommodity flow modes, failure propagation and reliable network design, GERAD, Working Paper, G96-24, 1996.

  43. B. Gavish and L. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Transactions on Communications, Vol. 31, No.10, pp. 1154–1159, 1983.

    Google Scholar 

  44. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM 3 user’s guide and reference manual, Oak Ridge National Laboratory, Working Paper, TM-12187, 1993.

  45. R. S. Barr and B. L. Hichmann, Reporting computational experiments with parallel algorithms: Issues, measures, and experts opinion’s, ORSA Journal on Computing, Vol. 5, No.1, pp. 2–18, 1993.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chamberland, S., Sanso, B. Sequential and Parallel Approaches to Incorporate Reliability in the Synthesis of Computer Networks. Journal of Network and Systems Management 5, 131–157 (1997). https://doi.org/10.1023/A:1018718827282

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018718827282

Keywords

Navigation