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

Weiyi Zhang, Xiaojiang Du, Kendall Nygard, Tie Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

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
Title of host publicationProceedings - 2009 IEEE International Conference on Communications, ICC 2009
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Communications, ICC 2009 - Dresden, Germany
Duration: 14 Jun 200918 Jun 2009

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Conference

Conference2009 IEEE International Conference on Communications, ICC 2009
Country/TerritoryGermany
CityDresden
Period14/06/0918/06/09

Keywords

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

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