Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations
This manuscript presents optimization-based design models and algorithms for reliable backbone transport networks. Due to their efficiency in providing data services and high data rates, dense wavelength division multiplexing (DWDM) networks became the technology of choice for these transport networ...
Gespeichert in:
Veröffentlicht in: | Telecommunication systems 2009-06, Vol.41 (2), p.97-120 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 120 |
---|---|
container_issue | 2 |
container_start_page | 97 |
container_title | Telecommunication systems |
container_volume | 41 |
creator | Birkan, G. Kennington, J. |
description | This manuscript presents optimization-based design models and algorithms for reliable backbone transport networks. Due to their efficiency in providing data services and high data rates, dense wavelength division multiplexing (DWDM) networks became the technology of choice for these transport networks. DWDM networks achieve these high rates by enabling several wavelengths of light to be transmitted on a single strand of fiber. Optimization-based practical methods to design DWDM networks with both link-based and path-based shared protection schemes are introduced and compared in an empirical analysis. These design models address various restrictions inherent to DWDM technology including polarization mode dispersion and attenuation requirements. Furthermore, approximations are developed to determine unavailability for any given origin-destination pair in a DWDM network. Finally, path-based and link-based shared protection models are compared based on design costs and unavailability. |
doi_str_mv | 10.1007/s11235-009-9153-1 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_34861097</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1714497021</sourcerecordid><originalsourceid>FETCH-LOGICAL-c346t-a118bec2cf02662255e17b4cb38e626fb05a0d69d75b297b791d5a64a8fe7e1e3</originalsourceid><addsrcrecordid>eNp1kc1u1TAQhSMEEqXwAOwsFqwweJw4P-xQy59UiQ2sLduZ3Os2sYPHoZTn4UFxuEhISKxs63znaDynqp6CeAlCdK8IQNaKCzHwAVTN4V51BqqTfGgU3C93AT1v-rZ5WD0iuhZidw1n1c9LJH8IbE3R4bglJDbFxKxxNzYGZDmZQGtMmQXMtzHdELv1-cjoaBKOuy2jyz6G1yyu2S_-h9lf3Boq8hJHnOkFw-_GZWbCyI64JU_ZO2bmQ0wlain6rmzBfDN-NtbPPt8xF5d1y7_D6HH1YDIz4ZM_53n15d3bzxcf-NWn9x8v3lxxVzdt5gagt-ikm4RsWymVQuhs42zdYyvbyQplxNgOY6esHDrbDTAq0zamn7BDwPq8en7KLd_6uiFlvXhyOM8mYNxI12WBIIaugM_-Aa_jlkKZTUuQArq6VgWCE-RSJEo46TX5xaQ7DULv69en0nQpTe-laSgeefJQYcMB09_g_5t-AU3Wnuw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>212017335</pqid></control><display><type>article</type><title>Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations</title><source>SpringerLink Journals</source><creator>Birkan, G. ; Kennington, J.</creator><creatorcontrib>Birkan, G. ; Kennington, J.</creatorcontrib><description>This manuscript presents optimization-based design models and algorithms for reliable backbone transport networks. Due to their efficiency in providing data services and high data rates, dense wavelength division multiplexing (DWDM) networks became the technology of choice for these transport networks. DWDM networks achieve these high rates by enabling several wavelengths of light to be transmitted on a single strand of fiber. Optimization-based practical methods to design DWDM networks with both link-based and path-based shared protection schemes are introduced and compared in an empirical analysis. These design models address various restrictions inherent to DWDM technology including polarization mode dispersion and attenuation requirements. Furthermore, approximations are developed to determine unavailability for any given origin-destination pair in a DWDM network. Finally, path-based and link-based shared protection models are compared based on design costs and unavailability.</description><identifier>ISSN: 1018-4864</identifier><identifier>EISSN: 1572-9451</identifier><identifier>DOI: 10.1007/s11235-009-9153-1</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Artificial Intelligence ; Business and Management ; Computer Communication Networks ; Design ; Failure ; Heuristic ; Integer programming ; IT in Business ; Network security ; Optimization ; Probability Theory and Stochastic Processes ; Route optimization ; Software ; Studies ; Telecommunications systems</subject><ispartof>Telecommunication systems, 2009-06, Vol.41 (2), p.97-120</ispartof><rights>Springer Science+Business Media, LLC 2009</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c346t-a118bec2cf02662255e17b4cb38e626fb05a0d69d75b297b791d5a64a8fe7e1e3</citedby><cites>FETCH-LOGICAL-c346t-a118bec2cf02662255e17b4cb38e626fb05a0d69d75b297b791d5a64a8fe7e1e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11235-009-9153-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11235-009-9153-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Birkan, G.</creatorcontrib><creatorcontrib>Kennington, J.</creatorcontrib><title>Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations</title><title>Telecommunication systems</title><addtitle>Telecommun Syst</addtitle><description>This manuscript presents optimization-based design models and algorithms for reliable backbone transport networks. Due to their efficiency in providing data services and high data rates, dense wavelength division multiplexing (DWDM) networks became the technology of choice for these transport networks. DWDM networks achieve these high rates by enabling several wavelengths of light to be transmitted on a single strand of fiber. Optimization-based practical methods to design DWDM networks with both link-based and path-based shared protection schemes are introduced and compared in an empirical analysis. These design models address various restrictions inherent to DWDM technology including polarization mode dispersion and attenuation requirements. Furthermore, approximations are developed to determine unavailability for any given origin-destination pair in a DWDM network. Finally, path-based and link-based shared protection models are compared based on design costs and unavailability.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Business and Management</subject><subject>Computer Communication Networks</subject><subject>Design</subject><subject>Failure</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>IT in Business</subject><subject>Network security</subject><subject>Optimization</subject><subject>Probability Theory and Stochastic Processes</subject><subject>Route optimization</subject><subject>Software</subject><subject>Studies</subject><subject>Telecommunications systems</subject><issn>1018-4864</issn><issn>1572-9451</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kc1u1TAQhSMEEqXwAOwsFqwweJw4P-xQy59UiQ2sLduZ3Os2sYPHoZTn4UFxuEhISKxs63znaDynqp6CeAlCdK8IQNaKCzHwAVTN4V51BqqTfGgU3C93AT1v-rZ5WD0iuhZidw1n1c9LJH8IbE3R4bglJDbFxKxxNzYGZDmZQGtMmQXMtzHdELv1-cjoaBKOuy2jyz6G1yyu2S_-h9lf3Boq8hJHnOkFw-_GZWbCyI64JU_ZO2bmQ0wlain6rmzBfDN-NtbPPt8xF5d1y7_D6HH1YDIz4ZM_53n15d3bzxcf-NWn9x8v3lxxVzdt5gagt-ikm4RsWymVQuhs42zdYyvbyQplxNgOY6esHDrbDTAq0zamn7BDwPq8en7KLd_6uiFlvXhyOM8mYNxI12WBIIaugM_-Aa_jlkKZTUuQArq6VgWCE-RSJEo46TX5xaQ7DULv69en0nQpTe-laSgeefJQYcMB09_g_5t-AU3Wnuw</recordid><startdate>20090601</startdate><enddate>20090601</enddate><creator>Birkan, G.</creator><creator>Kennington, J.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20090601</creationdate><title>Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations</title><author>Birkan, G. ; Kennington, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c346t-a118bec2cf02662255e17b4cb38e626fb05a0d69d75b297b791d5a64a8fe7e1e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Business and Management</topic><topic>Computer Communication Networks</topic><topic>Design</topic><topic>Failure</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>IT in Business</topic><topic>Network security</topic><topic>Optimization</topic><topic>Probability Theory and Stochastic Processes</topic><topic>Route optimization</topic><topic>Software</topic><topic>Studies</topic><topic>Telecommunications systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Birkan, G.</creatorcontrib><creatorcontrib>Kennington, J.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Telecommunication systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Birkan, G.</au><au>Kennington, J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations</atitle><jtitle>Telecommunication systems</jtitle><stitle>Telecommun Syst</stitle><date>2009-06-01</date><risdate>2009</risdate><volume>41</volume><issue>2</issue><spage>97</spage><epage>120</epage><pages>97-120</pages><issn>1018-4864</issn><eissn>1572-9451</eissn><abstract>This manuscript presents optimization-based design models and algorithms for reliable backbone transport networks. Due to their efficiency in providing data services and high data rates, dense wavelength division multiplexing (DWDM) networks became the technology of choice for these transport networks. DWDM networks achieve these high rates by enabling several wavelengths of light to be transmitted on a single strand of fiber. Optimization-based practical methods to design DWDM networks with both link-based and path-based shared protection schemes are introduced and compared in an empirical analysis. These design models address various restrictions inherent to DWDM technology including polarization mode dispersion and attenuation requirements. Furthermore, approximations are developed to determine unavailability for any given origin-destination pair in a DWDM network. Finally, path-based and link-based shared protection models are compared based on design costs and unavailability.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s11235-009-9153-1</doi><tpages>24</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1018-4864 |
ispartof | Telecommunication systems, 2009-06, Vol.41 (2), p.97-120 |
issn | 1018-4864 1572-9451 |
language | eng |
recordid | cdi_proquest_miscellaneous_34861097 |
source | SpringerLink Journals |
subjects | Algorithms Artificial Intelligence Business and Management Computer Communication Networks Design Failure Heuristic Integer programming IT in Business Network security Optimization Probability Theory and Stochastic Processes Route optimization Software Studies Telecommunications systems |
title | Design procedures for backbone transport networks with shared protection: optimization-based models, exact and heuristic algorithms, and unavailability computations |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T06%3A54%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Design%20procedures%20for%20backbone%20transport%20networks%20with%20shared%20protection:%20optimization-based%20models,%20exact%20and%20heuristic%20algorithms,%20and%20unavailability%20computations&rft.jtitle=Telecommunication%20systems&rft.au=Birkan,%20G.&rft.date=2009-06-01&rft.volume=41&rft.issue=2&rft.spage=97&rft.epage=120&rft.pages=97-120&rft.issn=1018-4864&rft.eissn=1572-9451&rft_id=info:doi/10.1007/s11235-009-9153-1&rft_dat=%3Cproquest_cross%3E1714497021%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=212017335&rft_id=info:pmid/&rfr_iscdi=true |