• DocumentCode
    3552826
  • Title

    Robust traffic design for dynamic routing networks

  • Author

    Ash, G.R. ; Chang, F. ; Medhi, D.

  • Author_Institution
    AT&T Bell Lab., Holmdel, NJ, USA
  • fYear
    1991
  • fDate
    7-11 Apr 1991
  • Firstpage
    508
  • Abstract
    The authors present traffic restoration design algorithms to attain a robust network for any facility link or node failure. Some of these algorithms were implemented on network models to compute the cost for doing traffic restoration for different traffic restoration level objectives. From their simulation studies, the authors found that with efficient use of trunk group diversity and at a reasonable incremental cost, one can obtain a robust network to respond to a major facility link or a node failure and still meet the network objectives. A similar approach based on the algorithms presented in this work has been proposed for design of the worldwide intelligent network
  • Keywords
    reliability theory; switching theory; telecommunication traffic; dynamic routing networks; link failure; network models; node failure; robust network; traffic restoration design algorithms; trunk group diversity; worldwide intelligent network; Algorithm design and analysis; Ash; Circuits; Cities and towns; Degradation; Discrete event simulation; Robustness; Routing; Telecommunication traffic; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE
  • Conference_Location
    Bal Harbour, FL
  • Print_ISBN
    0-87942-694-2
  • Type

    conf

  • DOI
    10.1109/INFCOM.1991.147547
  • Filename
    147547