Loop-free traffic engineering with path protection in MPLS VPNs
In this paper we present a new approach for VPN (virtual private network) traffic engineering with path protection in Multiprotocol Label Switching networks carrying QoS and best effort traffic. Our approach eliminates the path cycles, a problem often encountered in link-based traffic engineering me...
Gespeichert in:
| Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2008-08, Vol.52 (12), p.2360-2372 |
|---|---|
| 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 | 2372 |
|---|---|
| container_issue | 12 |
| container_start_page | 2360 |
| container_title | Computer networks (Amsterdam, Netherlands : 1999) |
| container_volume | 52 |
| creator | Naraghi-Pour, Mort Desai, Vinay |
| description | In this paper we present a new approach for VPN (virtual private network) traffic engineering with path protection in Multiprotocol Label Switching networks carrying QoS and best effort traffic. Our approach eliminates the path cycles, a problem often encountered in link-based traffic engineering methods. It also allows for control of the maximum path length and the size of the label space in each label switch router. We consider off-line computation of the working and backup paths using a link-based approach. Two cases of 1
+
1 and 1:1 path protection are considered. Numerical results are presented to show the efficacy of the algorithm in calculating link-disjoint and node-disjoint primary and backup paths for the QoS traffic. |
| doi_str_mv | 10.1016/j.comnet.2008.04.015 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_199607492</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128608001382</els_id><sourcerecordid>1510388821</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-81fe7cee31764c2b8e2f3246af476fbda31c2d6aca84aafaa4e0c113a3959c7a3</originalsourceid><addsrcrecordid>eNp9kMtOwzAQRSMEEqXwBywiJJYJftVxNiBU8ZICVOKxtabOuLhqnWKnIP6eRKlYspmZxb13Zk6SnFKSU0LlxTI3zdpjmzNCVE5ETuhkLxlRVbCsILLc72auyowyJQ-ToxiXhBAhmBolV1XTbDIbENM2gLXOpOgXziMG5xfpt2s_0g30JTQtmtY1PnU-fZxVL-n77CkeJwcWVhFPdn2cvN3evE7vs-r57mF6XWWGS95milosDCKnhRSGzRUyy5mQYEUh7bwGTg2rJRhQAsACCCSGUg68nJSmAD5Ozobc7o7PLcZWL5tt8N1KTctSkkKUrBOJQWRCE2NAqzfBrSH8aEp0T0ov9UBK96Q0Eboj1dnOd9kQDaxsAG9c_PMyMpHlRPXxl4MOu0e_HAYdjUNvsHahQ6Prxv2_6BemJIBV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199607492</pqid></control><display><type>article</type><title>Loop-free traffic engineering with path protection in MPLS VPNs</title><source>Elsevier ScienceDirect Journals</source><creator>Naraghi-Pour, Mort ; Desai, Vinay</creator><creatorcontrib>Naraghi-Pour, Mort ; Desai, Vinay</creatorcontrib><description>In this paper we present a new approach for VPN (virtual private network) traffic engineering with path protection in Multiprotocol Label Switching networks carrying QoS and best effort traffic. Our approach eliminates the path cycles, a problem often encountered in link-based traffic engineering methods. It also allows for control of the maximum path length and the size of the label space in each label switch router. We consider off-line computation of the working and backup paths using a link-based approach. Two cases of 1
+
1 and 1:1 path protection are considered. Numerical results are presented to show the efficacy of the algorithm in calculating link-disjoint and node-disjoint primary and backup paths for the QoS traffic.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2008.04.015</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Access methods and protocols, osi model ; Algorithms ; Applied sciences ; Exact sciences and technology ; Interconnected networks ; Miscellaneous ; MPLS ; Network switching ; Networks and services in france and abroad ; Path protection ; Protocol ; Quality of service ; Studies ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Teletraffic ; Traffic congestion ; Traffic control ; Traffic engineering ; Traffic flow ; Virtual private networks</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2008-08, Vol.52 (12), p.2360-2372</ispartof><rights>2008 Elsevier B.V.</rights><rights>2008 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Aug 22, 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-81fe7cee31764c2b8e2f3246af476fbda31c2d6aca84aafaa4e0c113a3959c7a3</citedby><cites>FETCH-LOGICAL-c363t-81fe7cee31764c2b8e2f3246af476fbda31c2d6aca84aafaa4e0c113a3959c7a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1389128608001382$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20569582$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Naraghi-Pour, Mort</creatorcontrib><creatorcontrib>Desai, Vinay</creatorcontrib><title>Loop-free traffic engineering with path protection in MPLS VPNs</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>In this paper we present a new approach for VPN (virtual private network) traffic engineering with path protection in Multiprotocol Label Switching networks carrying QoS and best effort traffic. Our approach eliminates the path cycles, a problem often encountered in link-based traffic engineering methods. It also allows for control of the maximum path length and the size of the label space in each label switch router. We consider off-line computation of the working and backup paths using a link-based approach. Two cases of 1
+
1 and 1:1 path protection are considered. Numerical results are presented to show the efficacy of the algorithm in calculating link-disjoint and node-disjoint primary and backup paths for the QoS traffic.</description><subject>Access methods and protocols, osi model</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Interconnected networks</subject><subject>Miscellaneous</subject><subject>MPLS</subject><subject>Network switching</subject><subject>Networks and services in france and abroad</subject><subject>Path protection</subject><subject>Protocol</subject><subject>Quality of service</subject><subject>Studies</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Teletraffic</subject><subject>Traffic congestion</subject><subject>Traffic control</subject><subject>Traffic engineering</subject><subject>Traffic flow</subject><subject>Virtual private networks</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp9kMtOwzAQRSMEEqXwBywiJJYJftVxNiBU8ZICVOKxtabOuLhqnWKnIP6eRKlYspmZxb13Zk6SnFKSU0LlxTI3zdpjmzNCVE5ETuhkLxlRVbCsILLc72auyowyJQ-ToxiXhBAhmBolV1XTbDIbENM2gLXOpOgXziMG5xfpt2s_0g30JTQtmtY1PnU-fZxVL-n77CkeJwcWVhFPdn2cvN3evE7vs-r57mF6XWWGS95milosDCKnhRSGzRUyy5mQYEUh7bwGTg2rJRhQAsACCCSGUg68nJSmAD5Ozobc7o7PLcZWL5tt8N1KTctSkkKUrBOJQWRCE2NAqzfBrSH8aEp0T0ov9UBK96Q0Eboj1dnOd9kQDaxsAG9c_PMyMpHlRPXxl4MOu0e_HAYdjUNvsHahQ6Prxv2_6BemJIBV</recordid><startdate>20080822</startdate><enddate>20080822</enddate><creator>Naraghi-Pour, Mort</creator><creator>Desai, Vinay</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080822</creationdate><title>Loop-free traffic engineering with path protection in MPLS VPNs</title><author>Naraghi-Pour, Mort ; Desai, Vinay</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-81fe7cee31764c2b8e2f3246af476fbda31c2d6aca84aafaa4e0c113a3959c7a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Access methods and protocols, osi model</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Interconnected networks</topic><topic>Miscellaneous</topic><topic>MPLS</topic><topic>Network switching</topic><topic>Networks and services in france and abroad</topic><topic>Path protection</topic><topic>Protocol</topic><topic>Quality of service</topic><topic>Studies</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Teletraffic</topic><topic>Traffic congestion</topic><topic>Traffic control</topic><topic>Traffic engineering</topic><topic>Traffic flow</topic><topic>Virtual private networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Naraghi-Pour, Mort</creatorcontrib><creatorcontrib>Desai, Vinay</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</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><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Naraghi-Pour, Mort</au><au>Desai, Vinay</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Loop-free traffic engineering with path protection in MPLS VPNs</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2008-08-22</date><risdate>2008</risdate><volume>52</volume><issue>12</issue><spage>2360</spage><epage>2372</epage><pages>2360-2372</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>In this paper we present a new approach for VPN (virtual private network) traffic engineering with path protection in Multiprotocol Label Switching networks carrying QoS and best effort traffic. Our approach eliminates the path cycles, a problem often encountered in link-based traffic engineering methods. It also allows for control of the maximum path length and the size of the label space in each label switch router. We consider off-line computation of the working and backup paths using a link-based approach. Two cases of 1
+
1 and 1:1 path protection are considered. Numerical results are presented to show the efficacy of the algorithm in calculating link-disjoint and node-disjoint primary and backup paths for the QoS traffic.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2008.04.015</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1389-1286 |
| ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2008-08, Vol.52 (12), p.2360-2372 |
| issn | 1389-1286 1872-7069 |
| language | eng |
| recordid | cdi_proquest_journals_199607492 |
| source | Elsevier ScienceDirect Journals |
| subjects | Access methods and protocols, osi model Algorithms Applied sciences Exact sciences and technology Interconnected networks Miscellaneous MPLS Network switching Networks and services in france and abroad Path protection Protocol Quality of service Studies Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Teletraffic Traffic congestion Traffic control Traffic engineering Traffic flow Virtual private networks |
| title | Loop-free traffic engineering with path protection in MPLS VPNs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T14%3A21%3A57IST&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=Loop-free%20traffic%20engineering%20with%20path%20protection%20in%20MPLS%20VPNs&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Naraghi-Pour,%20Mort&rft.date=2008-08-22&rft.volume=52&rft.issue=12&rft.spage=2360&rft.epage=2372&rft.pages=2360-2372&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2008.04.015&rft_dat=%3Cproquest_cross%3E1510388821%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=199607492&rft_id=info:pmid/&rft_els_id=S1389128608001382&rfr_iscdi=true |