A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks
ناشر:
سال
: 2014شناسه الکترونیک: 10.1109/TNET.2013.2257180
کلیدواژه(گان): computational complexity,integer programming,linear programming,optical fibre networks,polynomials,telecommunication network routing,telecommunication network topology,wavelength division multiplexing,2-edge connected subgraphs,2-node connected subgraphs,ILP formulations,NP-hard problem,WDM optical networks,general mesh network,heuristic algorithms,integer linear programming,link-disjoint lightpath pairs,minimum isolated-failure-immune networks,network topology,node-disjoint l
کالکشن
:
-
آمار بازدید
A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks
Show full item record
| contributor author | Guoliang Xue | |
| contributor author | Gottapu, Ravi | |
| contributor author | Xi Fang | |
| contributor author | Dejun Yang | |
| contributor author | Thulasiraman, Krishnaiyan | |
| date accessioned | 2020-03-12T18:23:40Z | |
| date available | 2020-03-12T18:23:40Z | |
| date issued | 2014 | |
| identifier issn | 1063-6692 | |
| identifier other | 6519289.pdf | |
| identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/956999?locale-attribute=fa | |
| format | general | |
| language | English | |
| publisher | IEEE | |
| title | A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks | |
| type | Journal Paper | |
| contenttype | Metadata Only | |
| identifier padid | 7989165 | |
| subject keywords | computational complexity | |
| subject keywords | integer programming | |
| subject keywords | linear programming | |
| subject keywords | optical fibre networks | |
| subject keywords | polynomials | |
| subject keywords | telecommunication network routing | |
| subject keywords | telecommunication network topology | |
| subject keywords | wavelength division multiplexing | |
| subject keywords | 2-edge connected subgraphs | |
| subject keywords | 2-node connected subgraphs | |
| subject keywords | ILP formulations | |
| subject keywords | NP-hard problem | |
| subject keywords | WDM optical networks | |
| subject keywords | general mesh network | |
| subject keywords | heuristic algorithms | |
| subject keywords | integer linear programming | |
| subject keywords | link-disjoint lightpath pairs | |
| subject keywords | minimum isolated-failure-immune networks | |
| subject keywords | network topology | |
| subject keywords | node-disjoint l | |
| identifier doi | 10.1109/TNET.2013.2257180 | |
| journal title | Networking, IEEE/ACM Transactions on | |
| journal volume | 22 | |
| journal issue | 2 | |
| filesize | 4525078 | |
| citations | 1 |