Capacity versus robustness: A tradeoff for link restoration in mesh networks

Steven S. Lumetta, Muriel Médard, Yung Ching Tseng

Research output: Contribution to journalArticlepeer-review


Link recovery in high-speed four-fiber networks can be achieved using dynamic searches, covers of rings, or generalized loopback. We present a method to provide link recovery for all links in a network without using all links for backup traffic transmission. The method extends generalized loopback to operate on a subgraph of the full backup graph. The backup capacity on such links can then be used to carry unprotected traffic, i.e., traffic that is not recovered in case of a failure, while primary fibers on the links retain failure protection. Although all primary fibers remain fully robust to single-link failures, reserving links for unprotected traffic reduces a network's ability to recover from multiple failures. We explore the tradeoff between capacity and robustness to two-link failures for several typical high-speed optical fiber networks, comparing the properties of three fink-restoration algorithms based on generalized loopback with the properties of covers of rings. Our results demonstrate robustness comparable or superior to that available with covers of rings while providing an additional unprotected traffic capacity of roughly 20% of the network's primary capacity.

Original languageEnglish (US)
Article number908723
Pages (from-to)1765-1775
Number of pages11
JournalJournal of Lightwave Technology
Issue number12
StatePublished - Dec 2000


  • Metropolitan area networks
  • Network reliability
  • Optical communication
  • Optical fiber communication
  • Robustness
  • Wavelength division multiplexing (WDM)
  • Wide area networks

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics


Dive into the research topics of 'Capacity versus robustness: A tradeoff for link restoration in mesh networks'. Together they form a unique fingerprint.

Cite this