File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: ILP formulations for non-simple p-cycle and p-trail design in WDM mesh networks

TitleILP formulations for non-simple p-cycle and p-trail design in WDM mesh networks
Authors
KeywordsFast span protection
p-Cycle (Preconfigured Protection Cycle)
p-Trail (Pre-Cross-Connected Trail)
WDM (Wavelength Division Multiplexing)
Issue Date2010
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comnet
Citation
Computer Networks, 2010, v. 54 n. 5, p. 716-725 How to Cite?
AbstractConventional simple p-cycle (Preconfigured Protection Cycle) concept allows fast and capacity-efficient span protection in WDM mesh networks. Unlike simple p-cycle, non-simple p-cycle can traverse a node or span multiple times. The recently proposed p-trail (Pre-Cross-Connected Trail) concept further removes the cycle constraint by allowing arbitrary protection trails, leading to the most flexible and general design. Although non-simple p-cycles and p-trails are expected to be more capacity-efficient than simple p-cycles, it is still unclear how much capacity gain they can achieve compared with simple p-cycles. In this paper, we first point out some unique features of non-simple p-cycles and p-trails which are not fully explored in previous studies. This motivates us to formulate a new suite of ILPs (Integer Linear Programs) for optimal design of non-simple p-cycles and p-trails, based on which the achievable capacity gain over simple p-cycles can be investigated. Different from all the previous studies, the proposed ILPs are free of candidate cycle/trail enumeration, and can truly achieve an optimal design of non-simple p-cycles and p-trails. Our numerical results show that the capacity gain can be significant in some small-size networks with lightly-loaded traffic, but is generally trivial as the network size and the traffic load increase. © 2009 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/139271
ISSN
2015 Impact Factor: 1.446
2015 SCImago Journal Rankings: 0.755
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorHo, PHen_HK
dc.date.accessioned2011-09-23T05:47:48Z-
dc.date.available2011-09-23T05:47:48Z-
dc.date.issued2010en_HK
dc.identifier.citationComputer Networks, 2010, v. 54 n. 5, p. 716-725en_HK
dc.identifier.issn1389-1286en_HK
dc.identifier.urihttp://hdl.handle.net/10722/139271-
dc.description.abstractConventional simple p-cycle (Preconfigured Protection Cycle) concept allows fast and capacity-efficient span protection in WDM mesh networks. Unlike simple p-cycle, non-simple p-cycle can traverse a node or span multiple times. The recently proposed p-trail (Pre-Cross-Connected Trail) concept further removes the cycle constraint by allowing arbitrary protection trails, leading to the most flexible and general design. Although non-simple p-cycles and p-trails are expected to be more capacity-efficient than simple p-cycles, it is still unclear how much capacity gain they can achieve compared with simple p-cycles. In this paper, we first point out some unique features of non-simple p-cycles and p-trails which are not fully explored in previous studies. This motivates us to formulate a new suite of ILPs (Integer Linear Programs) for optimal design of non-simple p-cycles and p-trails, based on which the achievable capacity gain over simple p-cycles can be investigated. Different from all the previous studies, the proposed ILPs are free of candidate cycle/trail enumeration, and can truly achieve an optimal design of non-simple p-cycles and p-trails. Our numerical results show that the capacity gain can be significant in some small-size networks with lightly-loaded traffic, but is generally trivial as the network size and the traffic load increase. © 2009 Elsevier B.V. All rights reserved.en_HK
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comneten_HK
dc.relation.ispartofComputer Networksen_HK
dc.subjectFast span protectionen_HK
dc.subjectp-Cycle (Preconfigured Protection Cycle)en_HK
dc.subjectp-Trail (Pre-Cross-Connected Trail)en_HK
dc.subjectWDM (Wavelength Division Multiplexing)en_HK
dc.titleILP formulations for non-simple p-cycle and p-trail design in WDM mesh networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1389-1286&volume=54&issue=5&spage=716&epage=725&date=2010&atitle=ILP+formulations+for+non-simple+p-cycle+and+p-trail+design+in+WDM+mesh+networks-
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.comnet.2009.09.019en_HK
dc.identifier.scopuseid_2-s2.0-77249113718en_HK
dc.identifier.hkuros195073en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77249113718&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume54en_HK
dc.identifier.issue5en_HK
dc.identifier.spage716en_HK
dc.identifier.epage725en_HK
dc.identifier.isiWOS:000276132400004-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridWu, B=35231472500en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridHo, PH=7402211578en_HK
dc.identifier.citeulike5948217-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats