Advertisement

Journal of Network and Systems Management

, Volume 3, Issue 3, pp 265–294 | Cite as

Optimization and performance of restoration schemes for wide-area teletraffic networks

  • D. Medhi
  • R. Khurana
Papers

Abstract

In the event of a major network outage such as a fiber cable cut, a network can experience significant deterioration of network performance. To address such a situation, a network can be equipped with restoration capacity. We present here a mathematical model and design algorithm for determination of transmission network restoration capacity. We then present models for two restoration options-connection-based restoration and load directed restoration (for restoration of bundle of circuits)-and consider their impact on a wide-area dynmic call routing teletraffic network when the restoration capacity is limited (tight). Our network simulation of failure and restoration of a dynamic call routing teletraffic network shows that the load directed approach generally performs better than the connection based approach.

Key Words

Wide area networks dynamic call routing teletraffic networks restoration capacity design restoration rerouting multi-commodity flow models network restoration performance 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    IEEE Comm. Mag., Issue on surviving disaster, Vol. 28, No. 6, June 1990.Google Scholar
  2. 2.
    D. Medhi and S. Sankarappan, Impact of a transmission facility link failure on dynamic call routing circuit-switched networks under various circuit layout policies.,Journal of Network and Systems Management, Vol. 1, pp. 143–169, 1993.Google Scholar
  3. 3.
    G. R. Ash, R. H. Cardwell, and R. P. Murray, Design and optimization of networks with dynamic routing,Bell Sys. Tech. Journal, Vol. 60, pp. 1787–1820, 1981.Google Scholar
  4. 4.
    B. R. Hurley, C. J. R. Seidl, and W. F. Sewell, A survey of dynamic routing methods for circuit-switched traffic,IEEE Comm. Mag., Vol. 25, No. 9, pp. 13–21, 1987.Google Scholar
  5. 5.
    A. Girard,Routing and Dimensioning in Circuit-Switched Networks, Addison-Wesley, Readings, Massachusetts, 1990.Google Scholar
  6. 6.
    IEEE Comm. Mag. Issue on Dynamic Routing, Vol. 28, No. 10, October 1990.Google Scholar
  7. 7.
    T.-H. Wu, D. Kolar, and R. Cardwell, Survivable network architectures for broad-band fiber optic networks: model and performance comparison,IEEE J. of Lightwave Technology, Vol. 6, pp. 1698–1709 1988.Google Scholar
  8. 8.
    C. L. Monma and D. F. Shallcross, Methods for designing communications networks with certain two-connected survivability constraints,Operations Research, Vol. 37, pp. 531–541, 1989.Google Scholar
  9. 9.
    B. Gavish, P. Trudeau, M. Dror, M. Gendreau, and L. Mason: Fiber optic circuit network design under reliability constraints,IEEE J. on Selected Areas in Comm. Vol. 8, pp. 1181–1187, 1989.Google Scholar
  10. 10.
    R. H. Cardwell, C. L. Monma, and T.-H. Wu, Computer-aided design procedure for survivable fiber optic networks,IEEE J. on Selected Areas in Comm., Vol. 7, No. 8, pp. 1188–1197, 1989.Google Scholar
  11. 11.
    Y. K. Agarwal, An algorithm for designing survivable networksAT&T Technical Journal, Vol. 68, No. 3, pp. 64–76, 1989.Google Scholar
  12. 12.
    G. R. Ash, F. Chang, and D. Medhi, Robust traffic design for dynamic routing networks, inProc. of IEEE Conf. on Computer Comm. (INFOCOM), Bal Harbour, Florida, pp. 508–514. April 1991.Google Scholar
  13. 13.
    T.-H. Wu,Fiber Network Service Survivability, Artech House, Boston, Massachusetts, 1992.Google Scholar
  14. 14.
    O. J. Wasem, T.-H. Wu, and R. H. Cardwell, Survivable SONET networks-design methodology,IEEE J. Selected Areas in Comm., Vol. 12, pp. 205–212, 1994.Google Scholar
  15. 15.
    D. Medhi, A unified approach to network survivability for teletraffic networks: models, algorithms and analysis,IEEE Trans. on Comm., Vol. 42, pp. 534–548, 1994.Google Scholar
  16. 16.
    D. Mitra and J. B. Seery, Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks,IEEE Trans. Comm., Vol. 39, pp. 102–115, 1991.Google Scholar
  17. 17.
    G. R. Ash, J.-S. Chen, A. E. Frey, and B.-D. Huang, Real-time network routing in a dynamic class-of-service network,13th Int'l. Teletraffic Congress, Copanhagen, Denmark, 1991.Google Scholar
  18. 18.
    R. J. Gibbens, F. P. Kelly, and P. B. Key, Dynamic alternate routing, in M. Streenstrup (ed.),Routing in Comm. Networks, Prentice Hall, Englewood Cliffs, New Jersey, pp. 13–47, 1995.Google Scholar
  19. 19.
    D. Tipper, J. Hammond, S. Sharma, A. Khetan, K. Balakrishnan, and S. Menon, An analysis of the congestion effects of link failures in wide area networks,IEEE J. Selected Areas in Comm., Vol. 12, pp. 179–192, 1994.Google Scholar
  20. 20.
    B. A. Coan, W. E. Leland, M. P. Vecchi, A. Weinrib, and L. T. Wu, Using distributed topology update and preplanned configurations to achieve trunk network survivability,IEEE Trans. on Reliability, Vol. 40, No. 4, pp. 404–416 1991.Google Scholar
  21. 21.
    R. Kawamura, K.-i. Sato, and I. Tokizawa, Self-healing ATM networks based on virtual path concept,IEEE J. Selected Areas in Comm., Vol. 12, pp. 120–127, 1994.Google Scholar
  22. 22.
    D. A. Dunn, W. D. Grover, and M. H. MacGregor, Comparison ofK-shortest paths and maximum flow routing for network facility restoration,IEEE J. Selected Areas in Comm., Vol. 12, pp. 88–99, 1994.Google Scholar
  23. 23.
    R. D. Doverspike and B. J. Wilson, Comparison of capacity efficiency of DCS network restoration routing techniques,Journal of Network and Systems Management, Vol. 2, pp. 95–123, 1994.Google Scholar
  24. 24.
    K. Balakrishnan, D. Tipper, and J. Hammond, An analysis of the timing of traffic restoration in wide area communication networks,Proc. of 14th Int'l. Teletraffic Congress, Antibes, France, pp. 1505–1515, June 1994.Google Scholar
  25. 25.
    G. R. Ash, K. K. Chan, and J-F. Labourdette, Analysis and design of fully shared networks,Proc. of 14th Int'l. Teletraffic Congress, Antibes, France, pp. 1311–1320, June 1994.Google Scholar
  26. 26.
    K. R. Krishnan, R. D. Doverspike, and C. D. Pack, Unified models of survivability for multitechnology networks,Proc. of 14th Int'l. Teletraffic Congress, pp. 655–666, Antibes, France, June 1994.Google Scholar
  27. 27.
    G. R. Ash and S. D. Schwartz, Network routing evolution, in A. Kershenbaum, M. Malek and M. Hall (eds.),Network Management and Control, Plenum Press, New York, pp. 357–367, 1990.Google Scholar
  28. 28.
    T1 Committee Report,A Technical Report on Network Survivability Performance, Report No. 24, October 1993.Google Scholar
  29. 29.
    R. F. Rey (ed.),Engineering and Operations in the Bell System, Bell Telephone Laboratories, 1983.Google Scholar
  30. 30.
    D. Bertsekas and R. Gallager,Data Networks, 2nd Edition, Prentice Hall, Englewood Cliffs, New Jersey, 1992.Google Scholar
  31. 31.
    T. Chujo, H. Komine, K. Miyazaki, T. Ogura, and T. Soejima, The design and simulation of an intelligent transport network with distributed control,Network Operations and Management Symposium, San Diego, February 1990.Google Scholar
  32. 32.
    B. A. Murtagh and M. A. Saunders, MINOS 5.0 User's Guide, Techical Report #SOL 83-20, Department of Operations Research, Stanford University, Stanford, California, December 1983.Google Scholar
  33. 33.
    J. H. Weber, A simulation study of routing and control in communications networks,Bell Sys. Tech. Journal, Vol. 43, pp. 2639–2676. 1964.Google Scholar
  34. 34.
    R. S. Krupp, Stabilization of alternate routing networks,Proc. of IEEE Int'l. Conf. on Comm. (ICC), pp. 31.2.1.–31.2.5, Philadelphia, June 1982.Google Scholar
  35. 35.
    J. M. Akinpelu, The overload performance of engineered networks with nonhierarchical and hierarchical routing,AT&T Bell Labs Tech. Journal, Vol. 63, No. 7, pp. 1261–1281, 1984.Google Scholar
  36. 36.
    G. R. Ash, Use of a trunk status map for real-time DNHR,11th Int'l. Teletraffic Congress, Kyoto, Japan, 1985.Google Scholar
  37. 37.
    G. R. Ash and E. Oberer, Dynamic routing in the AT&T network-improved service quality at lower cost,Proc. of GLOBECOM, Dallas, Texas, pp. 303–308, November 1989.Google Scholar
  38. 38.
    W. H. Cameron, J. Regnier, P. Galloy, and A.-M. Savoie, Dynamic routing for intercity telephone network,10th Int'l Teletraffic Congress, Montreal, Canada, 1983.Google Scholar
  39. 39.
    R. Khurana, Optimization and performance analysis of network restoration schemes for teletraffic networks, M.S. Thesis, University of Missouri-Kansas City, Kansas City, Missouri, June 1994.Google Scholar
  40. 40.
    M. De Prycker, ATM switching on demand,IEEE Network, Vol. 6, No. 2, pp. 25–28, March 1992.Google Scholar
  41. 41.
    D. Mdhi, Multi-hour, multi-traffic class network design for VP-based wide-area dynamically reconfigurable ATM networks,Proc. of IEEE Conf. on Computer Comm. (INFOCOM), Boston, Massachusetts, pp. 900–907, April 1995;IEEE/ACM Tran. Networking (extended version to appear).Google Scholar

Copyright information

© Plenum Publishing Corporation 1995

Authors and Affiliations

  • D. Medhi
    • 1
  • R. Khurana
    • 1
  1. 1.Computer Science Telecommunications ProgramUniversity of Missouri-Kansas CityKansas City

Personalised recommendations