IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v74y2020i1d10.1007_s11235-019-00637-w.html
   My bibliography  Save this article

Improved double cycle and link pair methods for two-link failure protection

Author

Listed:
  • Pallavi Athe

    (Indian Institute of Technology)

  • Yatindra Nath Singh

    (Indian Institute of Technology)

Abstract

In this paper, we have proposed Link Pair Method (LPM) and Improved Double Cycle (IDB) method based on pre-Configured Cycles (p-cycles) for two-link failure protection in optical networks. We have compared Double Cycle (DB), IDB and LPM method on the basis of spare capacity and computation time. We have observed a reduction in the required spare capacity for IDB as compared to the DB method. We achieved this reduction by assigning priority to the p-cycles of the protection pair for each link. We also found that assigning priority reduces the number of variables and constraints required to formulate the integer linear program of IDB as compared to the DB method thereby reducing the computational resources. The LPM method considers all the possible pair of links in the optical network and selects the non-intersecting sets of p-cycles for each pair of links. Our complexity analysis and simulation result shows that the LPM requires significantly less number of variables and computational time compared to the DB and IDB methods. We also show that LPM method is capable to compute spare capacity of larger networks for which DB and IDB methods fail.

Suggested Citation

  • Pallavi Athe & Yatindra Nath Singh, 2020. "Improved double cycle and link pair methods for two-link failure protection," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 74(1), pages 83-93, May.
  • Handle: RePEc:spr:telsys:v:74:y:2020:i:1:d:10.1007_s11235-019-00637-w
    DOI: 10.1007/s11235-019-00637-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-019-00637-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-019-00637-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:74:y:2020:i:1:d:10.1007_s11235-019-00637-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.