• DocumentCode
    2469847
  • Title

    Spare capacity assignment in telecom networks using path restoration

  • Author

    Veerasamy, Jeyakesavan ; Venkatesan, S. ; Shah, J.C.

  • Author_Institution
    Comput. Sci. Program, Texas Univ., Dallas, TX, USA
  • fYear
    1995
  • fDate
    18-20 Jan 1995
  • Firstpage
    370
  • Lastpage
    374
  • Abstract
    Path restoration scheme can be used in augmenting existing telecommunication networks with adequate spare capacity to achieve a desired level of protection against link failures. Path restoration planning corresponds to the multi-commodity flow problem, which is computationally hard. In this paper, we present the details of an approximation scheme for the path based restoration planning problem and an implementation. We then compare the performance of link and path restoration schemes. These schemes have been incorporated into the network planning tool under development at Alcatel Network Systems
  • Keywords
    planning; resource allocation; telecommunication network management; approximation scheme; link failures; multi-commodity flow problem; network planning tool; path based restoration planning problem; path restoration planning; spare capacity; spare capacity assignment; telecom networks; telecommunication networks; Capacity planning; Circuit faults; Computer science; Intelligent networks; Network topology; Path planning; Protection; Spine; Telecommunication computing; Telecommunication traffic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1995. MASCOTS '95., Proceedings of the Third International Workshop on
  • Conference_Location
    Durham, NC
  • Print_ISBN
    0-8186-6902-0
  • Type

    conf

  • DOI
    10.1109/MASCOT.1995.378644
  • Filename
    378644