File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A comparative study of fast protection schemes in WDM mesh networks

TitleA comparative study of fast protection schemes in WDM mesh networks
Authors
KeywordsFast protection
ILP
p-cycle
PXT
WDM
Issue Date2008
PublisherIEEE.
Citation
Ieee International Conference On Communications, 2008, p. 5160-5164 How to Cite?
AbstractThe concept of p-cycle (Preconfigured Protection Cycle) allows fast and efficient span protection in WDM mesh networks. Compared to a simple p-cycle, a non-simple p-cycle can traverse a node or span multiple times. As a result, non-simple p-cycles can better explore mesh connectivity of a network. On the other hand, the recently proposed PXT (Pre-Cross-Connected Trail) concept removes the cycle constraint by allowing arbitrary protection trails. In this paper, we carry out a comparative study among these fast protection schemes, and formulate ILPs (Integer Linear Programs) for non-simple p-cycle and PXT design. As far as we know, our ILP for non-simple p-cycle design is the first one without candidate cycle enumeration, and our ILP for PXT design is the first one proposed in this area. Based on our ILPs, we find simple, non-simple p-cycle and PXT solutions for a simple network. We show that the required spare capacity for 100% protection in each scheme is reduced in the same order above. ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99503
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorHo, PHen_HK
dc.date.accessioned2010-09-25T18:33:05Z-
dc.date.available2010-09-25T18:33:05Z-
dc.date.issued2008en_HK
dc.identifier.citationIeee International Conference On Communications, 2008, p. 5160-5164en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99503-
dc.description.abstractThe concept of p-cycle (Preconfigured Protection Cycle) allows fast and efficient span protection in WDM mesh networks. Compared to a simple p-cycle, a non-simple p-cycle can traverse a node or span multiple times. As a result, non-simple p-cycles can better explore mesh connectivity of a network. On the other hand, the recently proposed PXT (Pre-Cross-Connected Trail) concept removes the cycle constraint by allowing arbitrary protection trails. In this paper, we carry out a comparative study among these fast protection schemes, and formulate ILPs (Integer Linear Programs) for non-simple p-cycle and PXT design. As far as we know, our ILP for non-simple p-cycle design is the first one without candidate cycle enumeration, and our ILP for PXT design is the first one proposed in this area. Based on our ILPs, we find simple, non-simple p-cycle and PXT solutions for a simple network. We show that the required spare capacity for 100% protection in each scheme is reduced in the same order above. ©2008 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.subjectFast protectionen_HK
dc.subjectILPen_HK
dc.subjectp-cycleen_HK
dc.subjectPXTen_HK
dc.subjectWDMen_HK
dc.titleA comparative study of fast protection schemes in WDM mesh networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICC.2008.969en_HK
dc.identifier.scopuseid_2-s2.0-51249094311en_HK
dc.identifier.hkuros140162en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51249094311&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage5160en_HK
dc.identifier.epage5164en_HK
dc.identifier.scopusauthoridWu, B=24605804500en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridHo, PH=7402211578en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats