• DocumentCode
    1867711
  • Title

    A simple traffic independent scheme for enabling restoration oblivious routing of resilient connections

  • Author

    Kodialam, Murali ; Lakshman, T.V. ; Sengupta, Sudipta

  • Author_Institution
    Bell Labs, Lucent Technol., Holmdel, NJ, USA
  • Volume
    4
  • fYear
    2004
  • fDate
    7-11 March 2004
  • Firstpage
    2329
  • Abstract
    Fast restoration is an important feature of both MPLS and optical networks. The main mechanism for achieving fast restoration is by locally routing around failures using pre-setup detour paths. Signaling and routing protocol extensions to implement this local bypass ability are currently being standardized. To make use of this ability, dynamic schemes that jointly route primary paths and all link detours for links used by the primary paths have been previously proposed. These schemes also permit sharing of reserved restoration capacity for achieving efficiency. However, this joint computation places a significantly larger computational load on the network elements than that imposed by the shortest path computation variants typically used for unprotected network connection routing. We propose a new scheme that is operationally much simpler, shares capacity used for restoration, and permits the network to route the primary paths in a manner that is oblivious to restoration needs. Restoration of all carried traffic is guaranteed by a new link capacity partitioning scheme that maximizes the working capacity of the network without requiring any knowledge of the traffic that will be imposed on the network. Being traffic independent for a priori link capacity partitioning and being oblivious to restoration needs for on-line network routing makes this scheme operationally simple and desirable in the sense of placing no additional routing load on the constrained computing resources at the network nodes. To compute the link capacity partitions, we develop a fast combinatorial algorithm that uses only iterative shortest path computations, and is a fully polynomial time approximation scheme (FPTAS), i.e., it achieves a (1 + ε)-factor approximation for any ε> 0 and runs in time polynomial in the input size and 1/ε.The approximation scheme also allows link detour paths to be hop constrained if needed so as to bound restoration latency in optical networks.
  • Keywords
    iterative methods; multiprotocol label switching; optical fibre networks; optical links; polynomial approximation; routing protocols; telecommunication signalling; telecommunication traffic; MPLS network; fast combinatorial algorithm; iterative shortest path computation; link capacity partitioning scheme; multiprotocol label switching; on-line network routing; optical network; polynomial time approximation scheme; pre-setup detour path; routing protocol; traffic independent scheme; Approximation algorithms; Computer networks; Multiprotocol label switching; Optical computing; Optical fiber networks; Partitioning algorithms; Polynomials; Routing protocols; Signal restoration; Telecommunication traffic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies
  • ISSN
    0743-166X
  • Print_ISBN
    0-7803-8355-9
  • Type

    conf

  • DOI
    10.1109/INFCOM.2004.1354655
  • Filename
    1354655