File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Most reliable routing in WDM mesh networks with arbitrary risk distribution

TitleMost reliable routing in WDM mesh networks with arbitrary risk distribution
Authors
Issue Date2007
Citation
Ieee International Conference On Communications, 2007, p. 2198-2203 How to Cite?
AbstractAssume the reliability of a connection is- determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrary risk distribution in this paper. We first focus on the min-risk single path (MRSP) problem, in which a single most reliable path is to be established between a given source-destination pair. To solve MRSP, a simple label-setting (Simple-LS) algorithm is proposed by iteratively setting every node with a diminishing path-risk set (i.e. the label of a node). We then extend Simple-LS to find up to K lowest risk paths in each iteration, called K-path LS algorithm. Comparing to existing algorithms, we show that K-path LS can find paths with much fewer risks. We then define the original most reliable path pair (MRPP) problem. In MRPP, a pair of risk-disjoint paths must be established for each connection request. Unlike existing path pair routing problems, absolute priority is given to minimizing the risk number on active path. To solve MRPP, we extend K-path LS algorithm to K-pair LS, in which a joint search for risk-disjoint and most reliable path pairs is conducted. Comparing with algorithms with similar nature, we show that K-pair LS finds more risk-disjoint paths and with fewer risks. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99533
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorLi, Jen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2010-09-25T18:34:19Z-
dc.date.available2010-09-25T18:34:19Z-
dc.date.issued2007en_HK
dc.identifier.citationIeee International Conference On Communications, 2007, p. 2198-2203en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99533-
dc.description.abstractAssume the reliability of a connection is- determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrary risk distribution in this paper. We first focus on the min-risk single path (MRSP) problem, in which a single most reliable path is to be established between a given source-destination pair. To solve MRSP, a simple label-setting (Simple-LS) algorithm is proposed by iteratively setting every node with a diminishing path-risk set (i.e. the label of a node). We then extend Simple-LS to find up to K lowest risk paths in each iteration, called K-path LS algorithm. Comparing to existing algorithms, we show that K-path LS can find paths with much fewer risks. We then define the original most reliable path pair (MRPP) problem. In MRPP, a pair of risk-disjoint paths must be established for each connection request. Unlike existing path pair routing problems, absolute priority is given to minimizing the risk number on active path. To solve MRPP, we extend K-path LS algorithm to K-pair LS, in which a joint search for risk-disjoint and most reliable path pairs is conducted. Comparing with algorithms with similar nature, we show that K-pair LS finds more risk-disjoint paths and with fewer risks. © 2007 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.titleMost reliable routing in WDM mesh networks with arbitrary risk distributionen_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.2007.370en_HK
dc.identifier.scopuseid_2-s2.0-38549103849en_HK
dc.identifier.hkuros134500en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-38549103849&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage2198en_HK
dc.identifier.epage2203en_HK
dc.identifier.scopusauthoridLi, J=8699153700en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats