Journal of Network and Systems Management

, Volume 1, Issue 2, pp 143–169 | Cite as

Impact of a transmission facility link failure on dynamic call routing circuit-switched networks under various circuit layout policies

  • D. Medhi
  • S. Sankarappan


A major transmission facility failure such as a fiber cut can significantly deteriorate the performance of a network by affecting multiple trunk groups in the network. To improve network performance various restoration options (pre-planned or real-time) in the traffic and/or the transmission facility network can be addressed. In this paper, we address the implication of various pre-planned circuit layout policies (based on trunk group diversity) on dynamic routing circuit-switched networks in the event of a failure. Using a network based on realistic data, we give results on comparative network performance under different circuit layout policies and on the effect of a failure depending on the time of the day it occurs. We observe that in the event of a failure, a network with trunk group diversity provides load balancing in terms of pairwise blocking and avoids isolation of traffic pairs compared to a network without trunk group diversity. However, in some instances, the overall network blocking may not be lower in a network with trunk group diversity compared to a network without trunk group diversity.

Key words

Circuit-switched network dynamic call routing circuit layout trunk group diversity network failure 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. F. Rey (ed.),Engineering and Operations in the Bell System, Bell Telephone Laboratories, 1983.Google Scholar
  2. 2.
    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
  3. 3.
    G. R. Ash, F. Chang, and D. Medhi, Robust traffic design for dynamic routing networks,Proc. of IEEE Conf. on Computer Comm. (INFOCOM'91), Bal Harbour, Florida, pp. 508–514, April 1991.Google Scholar
  4. 4.
    D. Medhi, A unified framework for survivable telecommunications network design,Proc. of IEEE Int'l. Conf. on Comm. (ICC'92), Chicago, Illinois, pp. 411–415, June 1992.Google Scholar
  5. 5.
    A. Girard,Routing and Dimensioning in Circuit-Switched Networks, Addison-Wesley, 1990.Google Scholar
  6. 6.
    IEEE Communications Magazine, October 1990.Google Scholar
  7. 7.
    G. R. Ash and V. S. Mummert, AT&T curves new routes in its nationwide network,AT&T Bell Lab. Record, August 1984.Google Scholar
  8. 8.
    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
  9. 9.
    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, Copenhagen, Denmark, 1991.Google Scholar
  10. 10.
    G. R. Ash, Personal communication, June 1992.Google Scholar
  11. 11.
    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
  12. 12.
    R. Huberman, S. Hurtubise, A. S. Le Nir, and T. Drwiega, Multi-hour dimensioning for a dynamic routed network,11th Int'l. Teletraffic Congress, Kyoto, Japan, 1985.Google Scholar
  13. 13.
    J. Regnier and W. H. Cameron, State-dependent dynamic traffic management for telephone networks,IEEE Communications Magazine, Vol. 28, No. 10, pp. 42–53, October 1990.Google Scholar
  14. 14.
    K. S. Narendra, R. A. Wright, and L. G. Mason, Application of learning automata to telephone traffic routing problems,IEEE Trans. on Systems, Man and Cybernetics, Vol. SMC-7, pp. 785–792, 1977.Google Scholar
  15. 15.
    K. S. Narendra and D. M. McKenna, Simulation study of telephone traffic routing using learning algorithms, Report No. 7806, Department of Engineering and Applied Science, Yale University, 1978.Google Scholar
  16. 16.
    P. R. Srikantakumar, Learning Models and Adaptive Routing in Communication Networks, Ph.D. dissertation, Yale University, 1980.Google Scholar
  17. 17.
    R. J. Gibbens, Some aspects of dynamic routing in circuit-switched telecommunications networks, Rayleigh Prize Essay, University of Cambridge, England, 1986.Google Scholar
  18. 18.
    R. J. Gibbens, F. P. Kelley, and P. B. Key, Dynamic alternate routing-modeling and behavior,12th Int'l. Teletraffic Congress, Torino, Italy, pp. 1019–1025, 1988.Google Scholar
  19. 19.
    R. S. Krupp, Stabilization of alternate routing networks,Proc. of IEEE Int'l. Conf. on Comm. (ICC'82), Philadelphia, pp. 31.2.1–31.2.5, June 1982.Google Scholar
  20. 20.
    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
  21. 21.
    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
  22. 22.
    T. J. Ott and K. R. Krishnan, State dependent routing of telephone traffic and the use of separable routing schemes,11th Int'l. Teletraffic Congress, pp. 867–871, 1985.Google Scholar
  23. 23.
    A. Girard, Y. Cote, and Y. Ouiment, A comparative study of non-hierarchical alternate routing in circuit-switched networks,Proc. of Second Int'l. Network Planning Symp., pp. 70–74, March 1983.Google Scholar
  24. 24.
    T.-K. G. Yum and M. Schwartz, Comparison of routing procedures for circuit-switched traffic in non-hierarchical networks,IEEE Trans. Comm., Vol. 35, pp. 535–544, May 1987.Google Scholar
  25. 25.
    B. Yaged, Jr. Minimum cost routing for static routing models,Networks, Vol. 1, pp. 139–172, 1971.Google Scholar
  26. 26.
    B. Yaged, Jr. Minimum cost routing for dynamic network models,Networks, Vol. 3, pp. 315–331, 1973.Google Scholar
  27. 27.
    D.-N. Lee, K. T. Medhi, J. L. Strand, R. G. Cox, and S. Chen, Solving large telecommunication network loading problems,AT&T Technical Journal, Vol. 68, No. 3, pp. 48–56, 1989.Google Scholar
  28. 28.
    D.-N. Lee, K. T. Medhi, J. L. Strand, and H.-S. J. Tsao, Diversity: modeling and constraint reduction for large telecommunications networks,Program of the 31st Joint National Meeting, TIMS/ORSA, Nashville, Tennessee, May 1991.Google Scholar
  29. 29.
    D. Medhi, Diverse routing for survivability in a fiber-based sparse network,Proc. of IEEE Int'l. Conf. on Comm. (ICC'91), Denver, Colorado, pp. 672–676, June 1991.Google Scholar
  30. 30.
    T.-H. Wu,Fiber Network Service Survivability, Artech House, Boston, Massachusetts, 1992.Google Scholar
  31. 31.
    J. W. Suurballe, Disjoint paths in a network,Networks, Vol. 4, pp. 125–145, 1974.Google Scholar
  32. 32.
    J. W. Suurballe and R. E. Tarjan, A quick method for finding shortest pairs of disjoint paths,Networks, Vol. 14, pp. 325–336, 1984.Google Scholar
  33. 33.
    T.-H. Wu, D. Kolar, and R. Cardwell, Survivable network architectures for broadband fiber optic netowrks: model and performance comparison,IEEE J. of Lightwave Technology, Vol. 6, pp. 1698–1709, 1988.Google Scholar
  34. 34.
    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
  35. 35.
    R. H. Cardwell, C. L. Monma and T.-H. Wu, Computer-aided design procedure for survivable fiber optic netowrks,IEEE J. on Selected Areas in Comm., Vol. 7, No. 8, pp. 1188–1197, 1989.Google Scholar
  36. 36.
    Y. K. Agarwal, An algorithm for designing survivable networks,AT&T Technical Journal, Vol. 68, No. 3, pp. 64–76, 1989.Google Scholar
  37. 37.
    D. Medhi, A unified approach to survivable teletraffic network design: models, algorithms and analysis, submitted for publication toIEEE Trans. on Comm., December 1991 (Revised, resubmitted February 1993).Google Scholar
  38. 38.
    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,Proc. of IEEE Conf. on Computer Comm. (INFOCOM'93), San Francisco, California, pp. 1042–1050, March–April 1993.Google Scholar
  39. 39.
    H. D. Schwetman, CSIM: A C-based, process-oriented simulation language,Procs. of the Winter Simulation Conf., pp. 387–396, 1986.Google Scholar
  40. 40.
    H. D. Schwetman,CSIM Reference Manual (Revision 14, Microelectronics and Computer Technology Corporation, Austin, Texas, March 1990.Google Scholar
  41. 41.
    A. Law and W. D. Kelton,Simulation Modeling and Analysis, McGraw-Hill, 1982.Google Scholar
  42. 42.
    S. Sankarappan, Impact of Trunk Group Diversity on the Performance of Dynamic Routing Teletraffic Networks under a Transmission Link Failure, M.S. Thesis, Computer Science Telecommunications Program, University of Missouri, Kansas City, Missouri, July 1992.Google Scholar
  43. 43.
    P. K. Bohacek, Guest editorial,IEEE Communications Magazine, Vol. 28, No. 6, p. 8, June 1990.Google Scholar

Copyright information

© Plenum Publishing Corporation 1993

Authors and Affiliations

  • D. Medhi
    • 1
  • S. Sankarappan
    • 2
  1. 1.Computer Science Telecommunications ProgramUniversity of Missouri—Kansas CityKansas City
  2. 2.DAVID Systems, Inc.Sunnyvale

Personalised recommendations