A disjoint path selection scheme with shared risk link groups in GMPLS networks
This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when th...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2002-09, Vol.6 (9), p.406-408 |
|---|---|
| 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 | 408 |
|---|---|
| container_issue | 9 |
| container_start_page | 406 |
| container_title | IEEE communications letters |
| container_volume | 6 |
| creator | Oki, E. Matsuura, N. Shiomoto, K. Yamanaka, N. |
| description | This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm. |
| doi_str_mv | 10.1109/LCOMM.2002.803477 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LCOMM_2002_803477</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1033207</ieee_id><sourcerecordid>28257088</sourcerecordid><originalsourceid>FETCH-LOGICAL-c383t-8afddfe7ce11c8a4c042372ea6bcdd15301919a790e940d0319d0be7f519302e3</originalsourceid><addsrcrecordid>eNp9kU9LAzEQxRdR8O8HEC9BUE9bZ5JdkxylaBVaKqjnkGZnbdrtbk22iN_erS0oHrzMDMPvPZh5SXKK0EMEfT3sj0ejHgfgPQUik3InOcA8Vynvym43g9KplFrtJ4cxzgBA8RwPkvEtK3ycNb5u2dK2UxapItf6pmbRTWlB7MOvt1MbqGDBxzmrfD1nb6FZLSPzNRuMnobPrKb2ownzeJzslbaKdLLtR8nr_d1L_yEdjgeP_dth6oQSbapsWRQlSUeITtnMQcaF5GRvJq4oMBeAGrWVGkhnUIBAXcCEZJmjFsBJHCVXG99laN5XFFuz8NFRVdmamlU0GqS-Qcx1R17-S_LuERKU6sDzP-CsWYW6u8IolWUKZLZ2ww3kQhNjoNIsg1_Y8GkQzDoJ852EWSdhNkl0moutsY3OVmWwtfPxRyg05iDzjjvbcJ6IfvkKwUGKL2k-kGs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884480749</pqid></control><display><type>article</type><title>A disjoint path selection scheme with shared risk link groups in GMPLS networks</title><source>IEEE Electronic Library (IEL)</source><creator>Oki, E. ; Matsuura, N. ; Shiomoto, K. ; Yamanaka, N.</creator><creatorcontrib>Oki, E. ; Matsuura, N. ; Shiomoto, K. ; Yamanaka, N.</creatorcontrib><description>This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2002.803477</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Bandwidth ; Computer networks ; Costs ; Electronic mail ; Exact sciences and technology ; Intelligent networks ; Laboratories ; Links ; Multiprotocol label switching ; Network topology ; Networks ; Optical control ; Optical fibers ; Risk ; Routing protocols ; Shortest-path problems ; Switching ; Switching theory ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teletraffic</subject><ispartof>IEEE communications letters, 2002-09, Vol.6 (9), p.406-408</ispartof><rights>2002 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2002</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c383t-8afddfe7ce11c8a4c042372ea6bcdd15301919a790e940d0319d0be7f519302e3</citedby><cites>FETCH-LOGICAL-c383t-8afddfe7ce11c8a4c042372ea6bcdd15301919a790e940d0319d0be7f519302e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1033207$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1033207$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=13915075$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Oki, E.</creatorcontrib><creatorcontrib>Matsuura, N.</creatorcontrib><creatorcontrib>Shiomoto, K.</creatorcontrib><creatorcontrib>Yamanaka, N.</creatorcontrib><title>A disjoint path selection scheme with shared risk link groups in GMPLS networks</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Bandwidth</subject><subject>Computer networks</subject><subject>Costs</subject><subject>Electronic mail</subject><subject>Exact sciences and technology</subject><subject>Intelligent networks</subject><subject>Laboratories</subject><subject>Links</subject><subject>Multiprotocol label switching</subject><subject>Network topology</subject><subject>Networks</subject><subject>Optical control</subject><subject>Optical fibers</subject><subject>Risk</subject><subject>Routing protocols</subject><subject>Shortest-path problems</subject><subject>Switching</subject><subject>Switching theory</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teletraffic</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kU9LAzEQxRdR8O8HEC9BUE9bZ5JdkxylaBVaKqjnkGZnbdrtbk22iN_erS0oHrzMDMPvPZh5SXKK0EMEfT3sj0ejHgfgPQUik3InOcA8Vynvym43g9KplFrtJ4cxzgBA8RwPkvEtK3ycNb5u2dK2UxapItf6pmbRTWlB7MOvt1MbqGDBxzmrfD1nb6FZLSPzNRuMnobPrKb2ownzeJzslbaKdLLtR8nr_d1L_yEdjgeP_dth6oQSbapsWRQlSUeITtnMQcaF5GRvJq4oMBeAGrWVGkhnUIBAXcCEZJmjFsBJHCVXG99laN5XFFuz8NFRVdmamlU0GqS-Qcx1R17-S_LuERKU6sDzP-CsWYW6u8IolWUKZLZ2ww3kQhNjoNIsg1_Y8GkQzDoJ852EWSdhNkl0moutsY3OVmWwtfPxRyg05iDzjjvbcJ6IfvkKwUGKL2k-kGs</recordid><startdate>20020901</startdate><enddate>20020901</enddate><creator>Oki, E.</creator><creator>Matsuura, N.</creator><creator>Shiomoto, K.</creator><creator>Yamanaka, N.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20020901</creationdate><title>A disjoint path selection scheme with shared risk link groups in GMPLS networks</title><author>Oki, E. ; Matsuura, N. ; Shiomoto, K. ; Yamanaka, N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c383t-8afddfe7ce11c8a4c042372ea6bcdd15301919a790e940d0319d0be7f519302e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Bandwidth</topic><topic>Computer networks</topic><topic>Costs</topic><topic>Electronic mail</topic><topic>Exact sciences and technology</topic><topic>Intelligent networks</topic><topic>Laboratories</topic><topic>Links</topic><topic>Multiprotocol label switching</topic><topic>Network topology</topic><topic>Networks</topic><topic>Optical control</topic><topic>Optical fibers</topic><topic>Risk</topic><topic>Routing protocols</topic><topic>Shortest-path problems</topic><topic>Switching</topic><topic>Switching theory</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teletraffic</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Oki, E.</creatorcontrib><creatorcontrib>Matsuura, N.</creatorcontrib><creatorcontrib>Shiomoto, K.</creatorcontrib><creatorcontrib>Yamanaka, N.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Oki, E.</au><au>Matsuura, N.</au><au>Shiomoto, K.</au><au>Yamanaka, N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A disjoint path selection scheme with shared risk link groups in GMPLS networks</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2002-09-01</date><risdate>2002</risdate><volume>6</volume><issue>9</issue><spage>406</spage><epage>408</epage><pages>406-408</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2002.803477</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2002-09, Vol.6 (9), p.406-408 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_LCOMM_2002_803477 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Applied sciences Bandwidth Computer networks Costs Electronic mail Exact sciences and technology Intelligent networks Laboratories Links Multiprotocol label switching Network topology Networks Optical control Optical fibers Risk Routing protocols Shortest-path problems Switching Switching theory Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic |
| title | A disjoint path selection scheme with shared risk link groups in GMPLS 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-27T06%3A59%3A26IST&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=A%20disjoint%20path%20selection%20scheme%20with%20shared%20risk%20link%20groups%20in%20GMPLS%20networks&rft.jtitle=IEEE%20communications%20letters&rft.au=Oki,%20E.&rft.date=2002-09-01&rft.volume=6&rft.issue=9&rft.spage=406&rft.epage=408&rft.pages=406-408&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2002.803477&rft_dat=%3Cproquest_RIE%3E28257088%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=884480749&rft_id=info:pmid/&rft_ieee_id=1033207&rfr_iscdi=true |