File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: ILP formulation for p-cycle construction based on flow conservation

TitleILP formulation for p-cycle construction based on flow conservation
Authors
KeywordsFast protection
ILP
P-cycle
WDMmesh networks
Issue Date2007
PublisherIEEE.
Citation
Globecom - Ieee Global Telecommunications Conference, 2007, p. 2310-2314 How to Cite?
AbstractThe concept of p-cycle (Preconfigured Protection Cycle) allows fast and efficient span protection in WDM mesh networks. To construct p-cycles, conventional algorithms need to enumerate all the candidate cycles in the network before ILP (Integer Linear Program) can be applied to find the optimal solution. To reduce the size of the candidate set and thus speed up the optimization process, heuristic algorithms are proposed for candidate cycle pre-selection at the cost of lower solution quality. Recently, some interesting ILP formulations were proposed to construct p-cycles without candidate cycle enumeration/preselection. But they tend to require a long running time. Following the approach of no candidate cycle enumeration, we formulate a new ILP based on flow conservation in this paper. Numerical results show that our new ILP runs much faster than the existing ones. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99373
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorXu, Sen_HK
dc.date.accessioned2010-09-25T18:27:19Z-
dc.date.available2010-09-25T18:27:19Z-
dc.date.issued2007en_HK
dc.identifier.citationGlobecom - Ieee Global Telecommunications Conference, 2007, p. 2310-2314en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99373-
dc.description.abstractThe concept of p-cycle (Preconfigured Protection Cycle) allows fast and efficient span protection in WDM mesh networks. To construct p-cycles, conventional algorithms need to enumerate all the candidate cycles in the network before ILP (Integer Linear Program) can be applied to find the optimal solution. To reduce the size of the candidate set and thus speed up the optimization process, heuristic algorithms are proposed for candidate cycle pre-selection at the cost of lower solution quality. Recently, some interesting ILP formulations were proposed to construct p-cycles without candidate cycle enumeration/preselection. But they tend to require a long running time. Following the approach of no candidate cycle enumeration, we formulate a new ILP based on flow conservation in this paper. Numerical results show that our new ILP runs much faster than the existing ones. © 2007 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofGLOBECOM - IEEE Global Telecommunications Conferenceen_HK
dc.subjectFast protectionen_HK
dc.subjectILPen_HK
dc.subjectP-cycleen_HK
dc.subjectWDMmesh networksen_HK
dc.titleILP formulation for p-cycle construction based on flow conservationen_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/GLOCOM.2007.440en_HK
dc.identifier.scopuseid_2-s2.0-39349090652en_HK
dc.identifier.hkuros140165en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-39349090652&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage2310en_HK
dc.identifier.epage2314en_HK
dc.identifier.scopusauthoridWu, B=24605804500en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridXu, S=16205805300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats