Allocation of protection domains in dynamic WDM mesh networks
In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of short leap shared protection (SLSP). A novel algorithm called cascaded diverse routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 189 |
|---|---|
| container_issue | |
| container_start_page | 188 |
| container_title | |
| container_volume | |
| creator | Pin-Han Ho Mouftah, H.T. |
| description | In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of short leap shared protection (SLSP). A novel algorithm called cascaded diverse routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks with dynamic traffic for the purpose of shared protection, called iterative two-step-approach (ITSA). Simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparison between ordinary shared protection schemes and the SLSP scheme. Simulation results show that the best performance can be achieved with well-designed diameter of protection domains for every connection request according to the size and topology of the network. |
| doi_str_mv | 10.1109/ICNP.2002.1181400 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1181400</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1181400</ieee_id><sourcerecordid>1181400</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-34f00584a62388b99e06080a5554da7110a8e6136e1fbb1c188108b81fe615ed3</originalsourceid><addsrcrecordid>eNotj8tOwzAURC0eEm3hAxAb_0DKvX7lZsGiCq9K5bEAsaycxBGGJK7iSKh_jwVdzZyRZqRh7BJhiQjF9bp8fl0KAJGQUAEcsZkwSmZSgjxmc8hNoZG0yU_YLBVEhkbRGZvH-JVaIHI5Yzerrgu1nXwYeGj5bgyTq_-oCb31Q-Q-2f1ge1_zj9sn3rv4yQc3_YTxO56z09Z20V0cdMHe7-_eysds8_KwLlebzGOup0yqFkCTskZIoqooHBggsFpr1dg8vbHkDErjsK0qrJEIgSrCNqXaNXLBrv53vXNuuxt9b8f99nBb_gLCUkhe</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Allocation of protection domains in dynamic WDM mesh networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Pin-Han Ho ; Mouftah, H.T.</creator><creatorcontrib>Pin-Han Ho ; Mouftah, H.T.</creatorcontrib><description>In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of short leap shared protection (SLSP). A novel algorithm called cascaded diverse routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks with dynamic traffic for the purpose of shared protection, called iterative two-step-approach (ITSA). Simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparison between ordinary shared protection schemes and the SLSP scheme. Simulation results show that the best performance can be achieved with well-designed diameter of protection domains for every connection request according to the size and topology of the network.</description><identifier>ISSN: 1092-1648</identifier><identifier>ISBN: 0769518567</identifier><identifier>ISBN: 9780769518565</identifier><identifier>EISSN: 2643-3303</identifier><identifier>DOI: 10.1109/ICNP.2002.1181400</identifier><language>eng</language><publisher>IEEE</publisher><subject>Iterative algorithms ; Iterative methods ; Mesh networks ; Network topology ; Protection ; Routing ; Telecommunication traffic ; Traffic control ; Wavelength division multiplexing ; WDM networks</subject><ispartof>10th IEEE International Conference on Network Protocols, 2002. Proceedings, 2002, p.188-189</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1181400$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1181400$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Pin-Han Ho</creatorcontrib><creatorcontrib>Mouftah, H.T.</creatorcontrib><title>Allocation of protection domains in dynamic WDM mesh networks</title><title>10th IEEE International Conference on Network Protocols, 2002. Proceedings</title><addtitle>ICNP</addtitle><description>In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of short leap shared protection (SLSP). A novel algorithm called cascaded diverse routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks with dynamic traffic for the purpose of shared protection, called iterative two-step-approach (ITSA). Simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparison between ordinary shared protection schemes and the SLSP scheme. Simulation results show that the best performance can be achieved with well-designed diameter of protection domains for every connection request according to the size and topology of the network.</description><subject>Iterative algorithms</subject><subject>Iterative methods</subject><subject>Mesh networks</subject><subject>Network topology</subject><subject>Protection</subject><subject>Routing</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><subject>Wavelength division multiplexing</subject><subject>WDM networks</subject><issn>1092-1648</issn><issn>2643-3303</issn><isbn>0769518567</isbn><isbn>9780769518565</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2002</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tOwzAURC0eEm3hAxAb_0DKvX7lZsGiCq9K5bEAsaycxBGGJK7iSKh_jwVdzZyRZqRh7BJhiQjF9bp8fl0KAJGQUAEcsZkwSmZSgjxmc8hNoZG0yU_YLBVEhkbRGZvH-JVaIHI5Yzerrgu1nXwYeGj5bgyTq_-oCb31Q-Q-2f1ge1_zj9sn3rv4yQc3_YTxO56z09Z20V0cdMHe7-_eysds8_KwLlebzGOup0yqFkCTskZIoqooHBggsFpr1dg8vbHkDErjsK0qrJEIgSrCNqXaNXLBrv53vXNuuxt9b8f99nBb_gLCUkhe</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Pin-Han Ho</creator><creator>Mouftah, H.T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2002</creationdate><title>Allocation of protection domains in dynamic WDM mesh networks</title><author>Pin-Han Ho ; Mouftah, H.T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-34f00584a62388b99e06080a5554da7110a8e6136e1fbb1c188108b81fe615ed3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Iterative algorithms</topic><topic>Iterative methods</topic><topic>Mesh networks</topic><topic>Network topology</topic><topic>Protection</topic><topic>Routing</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><topic>Wavelength division multiplexing</topic><topic>WDM networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Pin-Han Ho</creatorcontrib><creatorcontrib>Mouftah, H.T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pin-Han Ho</au><au>Mouftah, H.T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Allocation of protection domains in dynamic WDM mesh networks</atitle><btitle>10th IEEE International Conference on Network Protocols, 2002. Proceedings</btitle><stitle>ICNP</stitle><date>2002</date><risdate>2002</risdate><spage>188</spage><epage>189</epage><pages>188-189</pages><issn>1092-1648</issn><eissn>2643-3303</eissn><isbn>0769518567</isbn><isbn>9780769518565</isbn><abstract>In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of short leap shared protection (SLSP). A novel algorithm called cascaded diverse routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks with dynamic traffic for the purpose of shared protection, called iterative two-step-approach (ITSA). Simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparison between ordinary shared protection schemes and the SLSP scheme. Simulation results show that the best performance can be achieved with well-designed diameter of protection domains for every connection request according to the size and topology of the network.</abstract><pub>IEEE</pub><doi>10.1109/ICNP.2002.1181400</doi><tpages>2</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1092-1648 |
| ispartof | 10th IEEE International Conference on Network Protocols, 2002. Proceedings, 2002, p.188-189 |
| issn | 1092-1648 2643-3303 |
| language | eng |
| recordid | cdi_ieee_primary_1181400 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Iterative algorithms Iterative methods Mesh networks Network topology Protection Routing Telecommunication traffic Traffic control Wavelength division multiplexing WDM networks |
| title | Allocation of protection domains in dynamic WDM mesh networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T04%3A09%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Allocation%20of%20protection%20domains%20in%20dynamic%20WDM%20mesh%20networks&rft.btitle=10th%20IEEE%20International%20Conference%20on%20Network%20Protocols,%202002.%20Proceedings&rft.au=Pin-Han%20Ho&rft.date=2002&rft.spage=188&rft.epage=189&rft.pages=188-189&rft.issn=1092-1648&rft.eissn=2643-3303&rft.isbn=0769518567&rft.isbn_list=9780769518565&rft_id=info:doi/10.1109/ICNP.2002.1181400&rft_dat=%3Cieee_6IE%3E1181400%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1181400&rfr_iscdi=true |