Show simple item record

A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks

contributor authorGuoliang Xue
contributor authorGottapu, Ravi
contributor authorXi Fang
contributor authorDejun Yang
contributor authorThulasiraman, Krishnaiyan
date accessioned2020-03-12T18:23:40Z
date available2020-03-12T18:23:40Z
date issued2014
identifier issn1063-6692
identifier other6519289.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/956999?locale-attribute=fa&show=full
formatgeneral
languageEnglish
publisherIEEE
titleA Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks
typeJournal Paper
contenttypeMetadata Only
identifier padid7989165
subject keywordscomputational complexity
subject keywordsinteger programming
subject keywordslinear programming
subject keywordsoptical fibre networks
subject keywordspolynomials
subject keywordstelecommunication network routing
subject keywordstelecommunication network topology
subject keywordswavelength division multiplexing
subject keywords2-edge connected subgraphs
subject keywords2-node connected subgraphs
subject keywordsILP formulations
subject keywordsNP-hard problem
subject keywordsWDM optical networks
subject keywordsgeneral mesh network
subject keywordsheuristic algorithms
subject keywordsinteger linear programming
subject keywordslink-disjoint lightpath pairs
subject keywordsminimum isolated-failure-immune networks
subject keywordsnetwork topology
subject keywordsnode-disjoint l
identifier doi10.1109/TNET.2013.2257180
journal titleNetworking, IEEE/ACM Transactions on
journal volume22
journal issue2
filesize4525078
citations1


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record