File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A new ILP-based p-cycle construction algorithm without candidate cycle enumeration

TitleA new ILP-based p-cycle construction algorithm without candidate cycle enumeration
Authors
KeywordsFast Span Protection
ILP (Integer Linear Program)
P-Cycle
Wdm (Wavelength Division Multiplexing)
Issue Date2007
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
The 2007 IEEE International Conference on Communications (ICC 2007), Glasgow, Scotland, UK., 24-28 June 2007. In Conference Proceedings, 2007, p. 2236-2241 How to Cite?
AbstractThe notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle construction algorithms need to enumerate/pre-select candidate cycles before ILP (Integer Linear Program) can be applied. In this paper, we propose a new algorithm which is only based on ILP. When the required number of p-cycles is not too large, our ILP can generate optimal/suboptimal solutions in reasonable amount of running time. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158491
ISSN
2023 SCImago Journal Rankings: 0.861
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_US
dc.contributor.authorYeung, KLen_US
dc.contributor.authorLui, KSen_US
dc.contributor.authorXu, Sen_US
dc.date.accessioned2012-08-08T08:59:55Z-
dc.date.available2012-08-08T08:59:55Z-
dc.date.issued2007en_US
dc.identifier.citationThe 2007 IEEE International Conference on Communications (ICC 2007), Glasgow, Scotland, UK., 24-28 June 2007. In Conference Proceedings, 2007, p. 2236-2241en_US
dc.identifier.issn0536-1486en_US
dc.identifier.urihttp://hdl.handle.net/10722/158491-
dc.description.abstractThe notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle construction algorithms need to enumerate/pre-select candidate cycles before ILP (Integer Linear Program) can be applied. In this paper, we propose a new algorithm which is only based on ILP. When the required number of p-cycles is not too large, our ILP can generate optimal/suboptimal solutions in reasonable amount of running time. © 2007 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104-
dc.relation.ispartofIEEE International Conference on Communications (ICC)en_US
dc.rights©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectFast Span Protectionen_US
dc.subjectILP (Integer Linear Program)en_US
dc.subjectP-Cycleen_US
dc.subjectWdm (Wavelength Division Multiplexing)en_US
dc.titleA new ILP-based p-cycle construction algorithm without candidate cycle enumerationen_US
dc.typeConference_Paperen_US
dc.identifier.emailWu, B: binwu@eee.hku.hken_US
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_US
dc.identifier.emailLui, KS:kslui@eee.hku.hk-
dc.identifier.authorityYeung, KL=rp00204en_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/ICC.2007.376en_US
dc.identifier.scopuseid_2-s2.0-38549157778en_US
dc.identifier.hkuros134496-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-38549157778&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage2236en_US
dc.identifier.epage2241en_US
dc.publisher.placeUnited States-
dc.identifier.scopusauthoridWu, B=24605804500en_US
dc.identifier.scopusauthoridYeung, KL=7202424908en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US
dc.identifier.scopusauthoridXu, S=16205805300en_US
dc.customcontrol.immutablesml 151016 - merged-
dc.identifier.issnl0536-1486-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats