• DocumentCode
    1911979
  • Title

    CFP: Cooperative Fast Protection

  • Author

    Wu, Bin ; Ho, Pin-Han ; Yeung, Kwan L. ; Tapolcai, Janos ; Mouftah, Hussein T.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON
  • fYear
    2009
  • fDate
    19-25 April 2009
  • Firstpage
    2606
  • Lastpage
    2610
  • Abstract
    We introduce cooperative fast protection (CFP) as a novel protection scheme in WDM networks. CFP achieves capacity-efficient fast protection with the features of node-autonomy and failure-independency. It differs from p-cycle by reusing the released working capacity of the disrupted lightpaths (i.e. stubs) in a cooperative manner. This is achieved by allowing all the failure-aware nodes to switch the traffic, such that the disrupted lightpaths can be protected even if the end nodes of the failed link are not on the protecting cycles. CFP also differs from FIPP p-cycle by not requiring the source node of the disrupted lightpath on the protecting cycle. By jointly optimizing both working and spare capacity placement, we formulate an ILP for CFP design. Numerical results show that CFP significantly outperforms p-cycle by achieving faster protection with much higher capacity efficiency.
  • Keywords
    integer programming; linear programming; wavelength division multiplexing; ILP; WDM network; cooperative fast protection; integer linear programming; wavelength division multiplexing; Communications Society; Design optimization; Informatics; Optical network units; Peer to peer computing; Protection; Switches; Telecommunication traffic; WDM networks; Wavelength division multiplexing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM 2009, IEEE
  • Conference_Location
    Rio de Janeiro
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-3512-8
  • Type

    conf

  • DOI
    10.1109/INFCOM.2009.5062196
  • Filename
    5062196