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

  • Authors:
  • Weiyi Zhang;Farah Kandah;Xiaojiang Du;Chonggang Wang

  • Affiliations:
  • Department of Computer Science, North Dakota State University, Fargo, ND58105, U.S.A.;Department of Computer Science, North Dakota State University, Fargo, ND58105, U.S.A.;Department of Computer and Information Sciences, Temple University, Philadelphia, PA19122, U.S.A.;NEC Laboratories America, Princeton, NJ08540, U.S.A.

  • Venue:
  • Security and Communication Networks
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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. Copyright © 2012 John Wiley & Sons, Ltd. (In this paper, we presented a necessary and sufficient condition for constructing a p-cycle with link capacity consideration, to guarantee that each link on the connection path is p-cycle protected. Simulation results demonstrated that our p-cycle provisioning scheme is comparable with traditional path protection scheme.)