Self-protecting networking using dynamic p-cycle construction within link capacity constraint

Weiyi Zhang, Farah Kandah, Xiaojiang Du, Chonggang Wang

Research output: Contribution to journalArticlepeer-review

Abstract

The p-cycle design problem has been extensively studied because it can provide both ring-like fast self-protection speed and spare capacity efficiency of path protection scheme. However, p-cycle provisioning for dynamic traffic has not been fully addressed. Most related works have not considered link capacity in the construction of p-cycles, which may cause problems in practice because the protection paths may not have enough backup bandwidth. In this paper, with the consideration of link capacity, we present a sufficient and necessary condition that guarantees p-cycles for providing enough protection bandwidth. Based on this condition, we propose an effective solution to provide connections for dynamic requests with the property that each link used for a connection is protected by a p-cycle. Simulation results show that our dynamic p-cycle provisioning solution outperforms the traditional path protection scheme.

Original languageEnglish
Pages (from-to)689-708
Number of pages20
JournalSecurity and Communication Networks
Volume5
Issue number6
DOIs
StatePublished - Jun 2012

Keywords

  • Link capacity
  • Network protection and restoration
  • P-cycle
  • Self-protecting networking
  • Survivable path provisioning

Fingerprint

Dive into the research topics of 'Self-protecting networking using dynamic p-cycle construction within link capacity constraint'. Together they form a unique fingerprint.

Cite this