Efficient distributed restoration path selection for shared mesh restoration
In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In light of these tradeoffs, path-based end-to-end shared mesh restoration provides a very attractive solution. However, efficien...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM transactions on networking 2003-10, Vol.11 (5), p.761-771 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 771 |
|---|---|
| container_issue | 5 |
| container_start_page | 761 |
| container_title | IEEE/ACM transactions on networking |
| container_volume | 11 |
| creator | Guangzhi Li Dongmei Wang Kalmanek, C. Doverspike, R. |
| description | In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In light of these tradeoffs, path-based end-to-end shared mesh restoration provides a very attractive solution. However, efficient use of bandwidth for shared mesh restoration strongly relies on the procedure for selecting restoration paths. We propose an efficient restoration path selection algorithm for restorable connections over shared bandwidth in a fully distributed MPLS/GMPLS architecture. We also describe how to extend MPLS/GMPLS signaling protocols to collect the necessary information efficiently. To evaluate the algorithm's performance, we compare it via simulation with two other well-known algorithms on a typical intercity backbone network. The key figure of merit for restoration bandwidth efficiency is restoration overbuild, i.e., the extra bandwidth required to meet the network restoration objective as a percentage of the bandwidth of the network with no restoration. Our simulation results show that our algorithm uses significantly less restoration overbuild (63%-68%) compared with the other two algorithms (83%-90%). |
| doi_str_mv | 10.1109/TNET.2003.819071 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28277708</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1237454</ieee_id><sourcerecordid>907980684</sourcerecordid><originalsourceid>FETCH-LOGICAL-c424t-1e7caa09800c28d043aae15a7eb1a440f061de3eb90d2707c342fbca4c96f3f43</originalsourceid><addsrcrecordid>eNqN0UtLxDAQB_AiCq6Pu-CleNBT18mjSXqUZX3Aopf1HNJ0wnbptmvSHvz2plZQPIinTOA3Mwz_JLkgMCcEitv183I9pwBsrkgBkhwkM5LnKqO5EIexBsEyIQp6nJyEsAUgDKiYJaulc7Wtse3Tqg69r8uhxyr1GPrOm77u2nRv-k0asEH7-XWdT8PG-Kh2GDY_6Vly5EwT8PzrPU1e75frxWO2enl4WtytMssp7zOC0hoDhQKwVFXAmTFIciOxJIZzcCBIhQzLAioqQVrGqSut4bYQjjnOTpObae7ed29D3K93dbDYNKbFbgg63h-HCzXK6z8lVUoBBfkPSKWUoCK8-gW33eDbeK5WihNGCplHBBOyvgvBo9N7X--Mf9cE9BiXHuPSY1x6iiu2XE4tNSJ-c8okzzn7AJ2SkSY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884131975</pqid></control><display><type>article</type><title>Efficient distributed restoration path selection for shared mesh restoration</title><source>IEEE Electronic Library (IEL)</source><creator>Guangzhi Li ; Dongmei Wang ; Kalmanek, C. ; Doverspike, R.</creator><creatorcontrib>Guangzhi Li ; Dongmei Wang ; Kalmanek, C. ; Doverspike, R.</creatorcontrib><description>In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In light of these tradeoffs, path-based end-to-end shared mesh restoration provides a very attractive solution. However, efficient use of bandwidth for shared mesh restoration strongly relies on the procedure for selecting restoration paths. We propose an efficient restoration path selection algorithm for restorable connections over shared bandwidth in a fully distributed MPLS/GMPLS architecture. We also describe how to extend MPLS/GMPLS signaling protocols to collect the necessary information efficiently. To evaluate the algorithm's performance, we compare it via simulation with two other well-known algorithms on a typical intercity backbone network. The key figure of merit for restoration bandwidth efficiency is restoration overbuild, i.e., the extra bandwidth required to meet the network restoration objective as a percentage of the bandwidth of the network with no restoration. Our simulation results show that our algorithm uses significantly less restoration overbuild (63%-68%) compared with the other two algorithms (83%-90%).</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2003.819071</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Bandwidth ; Bandwidths ; Computer networks ; Computer simulation ; Costs ; Finite element method ; Joints ; Multiprotocol label switching ; Networks ; Optical fiber networks ; Packet switching ; Product introduction ; Resource management ; Restoration ; Signal restoration ; Spine ; Studies ; Transport protocols</subject><ispartof>IEEE/ACM transactions on networking, 2003-10, Vol.11 (5), p.761-771</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c424t-1e7caa09800c28d043aae15a7eb1a440f061de3eb90d2707c342fbca4c96f3f43</citedby><cites>FETCH-LOGICAL-c424t-1e7caa09800c28d043aae15a7eb1a440f061de3eb90d2707c342fbca4c96f3f43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1237454$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1237454$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Guangzhi Li</creatorcontrib><creatorcontrib>Dongmei Wang</creatorcontrib><creatorcontrib>Kalmanek, C.</creatorcontrib><creatorcontrib>Doverspike, R.</creatorcontrib><title>Efficient distributed restoration path selection for shared mesh restoration</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In light of these tradeoffs, path-based end-to-end shared mesh restoration provides a very attractive solution. However, efficient use of bandwidth for shared mesh restoration strongly relies on the procedure for selecting restoration paths. We propose an efficient restoration path selection algorithm for restorable connections over shared bandwidth in a fully distributed MPLS/GMPLS architecture. We also describe how to extend MPLS/GMPLS signaling protocols to collect the necessary information efficiently. To evaluate the algorithm's performance, we compare it via simulation with two other well-known algorithms on a typical intercity backbone network. The key figure of merit for restoration bandwidth efficiency is restoration overbuild, i.e., the extra bandwidth required to meet the network restoration objective as a percentage of the bandwidth of the network with no restoration. Our simulation results show that our algorithm uses significantly less restoration overbuild (63%-68%) compared with the other two algorithms (83%-90%).</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Bandwidth</subject><subject>Bandwidths</subject><subject>Computer networks</subject><subject>Computer simulation</subject><subject>Costs</subject><subject>Finite element method</subject><subject>Joints</subject><subject>Multiprotocol label switching</subject><subject>Networks</subject><subject>Optical fiber networks</subject><subject>Packet switching</subject><subject>Product introduction</subject><subject>Resource management</subject><subject>Restoration</subject><subject>Signal restoration</subject><subject>Spine</subject><subject>Studies</subject><subject>Transport protocols</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqN0UtLxDAQB_AiCq6Pu-CleNBT18mjSXqUZX3Aopf1HNJ0wnbptmvSHvz2plZQPIinTOA3Mwz_JLkgMCcEitv183I9pwBsrkgBkhwkM5LnKqO5EIexBsEyIQp6nJyEsAUgDKiYJaulc7Wtse3Tqg69r8uhxyr1GPrOm77u2nRv-k0asEH7-XWdT8PG-Kh2GDY_6Vly5EwT8PzrPU1e75frxWO2enl4WtytMssp7zOC0hoDhQKwVFXAmTFIciOxJIZzcCBIhQzLAioqQVrGqSut4bYQjjnOTpObae7ed29D3K93dbDYNKbFbgg63h-HCzXK6z8lVUoBBfkPSKWUoCK8-gW33eDbeK5WihNGCplHBBOyvgvBo9N7X--Mf9cE9BiXHuPSY1x6iiu2XE4tNSJ-c8okzzn7AJ2SkSY</recordid><startdate>20031001</startdate><enddate>20031001</enddate><creator>Guangzhi Li</creator><creator>Dongmei Wang</creator><creator>Kalmanek, C.</creator><creator>Doverspike, R.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20031001</creationdate><title>Efficient distributed restoration path selection for shared mesh restoration</title><author>Guangzhi Li ; Dongmei Wang ; Kalmanek, C. ; Doverspike, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c424t-1e7caa09800c28d043aae15a7eb1a440f061de3eb90d2707c342fbca4c96f3f43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Bandwidth</topic><topic>Bandwidths</topic><topic>Computer networks</topic><topic>Computer simulation</topic><topic>Costs</topic><topic>Finite element method</topic><topic>Joints</topic><topic>Multiprotocol label switching</topic><topic>Networks</topic><topic>Optical fiber networks</topic><topic>Packet switching</topic><topic>Product introduction</topic><topic>Resource management</topic><topic>Restoration</topic><topic>Signal restoration</topic><topic>Spine</topic><topic>Studies</topic><topic>Transport protocols</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Guangzhi Li</creatorcontrib><creatorcontrib>Dongmei Wang</creatorcontrib><creatorcontrib>Kalmanek, C.</creatorcontrib><creatorcontrib>Doverspike, R.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</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>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Guangzhi Li</au><au>Dongmei Wang</au><au>Kalmanek, C.</au><au>Doverspike, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient distributed restoration path selection for shared mesh restoration</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2003-10-01</date><risdate>2003</risdate><volume>11</volume><issue>5</issue><spage>761</spage><epage>771</epage><pages>761-771</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In light of these tradeoffs, path-based end-to-end shared mesh restoration provides a very attractive solution. However, efficient use of bandwidth for shared mesh restoration strongly relies on the procedure for selecting restoration paths. We propose an efficient restoration path selection algorithm for restorable connections over shared bandwidth in a fully distributed MPLS/GMPLS architecture. We also describe how to extend MPLS/GMPLS signaling protocols to collect the necessary information efficiently. To evaluate the algorithm's performance, we compare it via simulation with two other well-known algorithms on a typical intercity backbone network. The key figure of merit for restoration bandwidth efficiency is restoration overbuild, i.e., the extra bandwidth required to meet the network restoration objective as a percentage of the bandwidth of the network with no restoration. Our simulation results show that our algorithm uses significantly less restoration overbuild (63%-68%) compared with the other two algorithms (83%-90%).</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2003.819071</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6692 |
| ispartof | IEEE/ACM transactions on networking, 2003-10, Vol.11 (5), p.761-771 |
| issn | 1063-6692 1558-2566 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28277708 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Algorithms Bandwidth Bandwidths Computer networks Computer simulation Costs Finite element method Joints Multiprotocol label switching Networks Optical fiber networks Packet switching Product introduction Resource management Restoration Signal restoration Spine Studies Transport protocols |
| title | Efficient distributed restoration path selection for shared mesh restoration |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T23%3A59%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20distributed%20restoration%20path%20selection%20for%20shared%20mesh%20restoration&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Guangzhi%20Li&rft.date=2003-10-01&rft.volume=11&rft.issue=5&rft.spage=761&rft.epage=771&rft.pages=761-771&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2003.819071&rft_dat=%3Cproquest_RIE%3E907980684%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884131975&rft_id=info:pmid/&rft_ieee_id=1237454&rfr_iscdi=true |