Class-based traffic engineering in an IP network
Techniques are described for class-based traffic engineering in an IP network. For example, routers of an IP network may establish one or more constrained traffic engineered paths using a link-state protocol (e.g., IGP) without using signaling protocols, such as RSVP or SPRING, or encapsulating pack...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Patent |
Sprache: | eng |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Beeram, Vishnu Pavan Saad, Tarek Torvi, Raveendra |
description | Techniques are described for class-based traffic engineering in an IP network. For example, routers of an IP network may establish one or more constrained traffic engineered paths using a link-state protocol (e.g., IGP) without using signaling protocols, such as RSVP or SPRING, or encapsulating packets over MPLS. For example, an egress router of the IP network may receive a capability message specifying the capability of routers to compute a constrained path to the egress router, wherein the capability message comprises path computation information including an identifier of a path computation algorithm to be used by the one or more of the plurality of network devices to reach the egress network device. The egress router may advertise a reachability message including a destination IP prefix and the identifier of the path computation algorithm to cause routers in the IP network to compute the constrained path to reach the egress router. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US11240142B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US11240142B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US11240142B23</originalsourceid><addsrcrecordid>eNrjZDBwzkksLtZNSixOTVEoKUpMS8tMVkjNS8_MS00tysxLV8jMU0jMU_AMUMhLLSnPL8rmYWBNS8wpTuWF0twMim6uIc4euqkF-fGpxQWJyalAlfGhwYaGRiYGhiZGTkbGxKgBACC-Kr4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Class-based traffic engineering in an IP network</title><source>esp@cenet</source><creator>Beeram, Vishnu Pavan ; Saad, Tarek ; Torvi, Raveendra</creator><creatorcontrib>Beeram, Vishnu Pavan ; Saad, Tarek ; Torvi, Raveendra</creatorcontrib><description>Techniques are described for class-based traffic engineering in an IP network. For example, routers of an IP network may establish one or more constrained traffic engineered paths using a link-state protocol (e.g., IGP) without using signaling protocols, such as RSVP or SPRING, or encapsulating packets over MPLS. For example, an egress router of the IP network may receive a capability message specifying the capability of routers to compute a constrained path to the egress router, wherein the capability message comprises path computation information including an identifier of a path computation algorithm to be used by the one or more of the plurality of network devices to reach the egress network device. The egress router may advertise a reachability message including a destination IP prefix and the identifier of the path computation algorithm to cause routers in the IP network to compute the constrained path to reach the egress router.</description><language>eng</language><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220201&DB=EPODOC&CC=US&NR=11240142B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76418</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220201&DB=EPODOC&CC=US&NR=11240142B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Beeram, Vishnu Pavan</creatorcontrib><creatorcontrib>Saad, Tarek</creatorcontrib><creatorcontrib>Torvi, Raveendra</creatorcontrib><title>Class-based traffic engineering in an IP network</title><description>Techniques are described for class-based traffic engineering in an IP network. For example, routers of an IP network may establish one or more constrained traffic engineered paths using a link-state protocol (e.g., IGP) without using signaling protocols, such as RSVP or SPRING, or encapsulating packets over MPLS. For example, an egress router of the IP network may receive a capability message specifying the capability of routers to compute a constrained path to the egress router, wherein the capability message comprises path computation information including an identifier of a path computation algorithm to be used by the one or more of the plurality of network devices to reach the egress network device. The egress router may advertise a reachability message including a destination IP prefix and the identifier of the path computation algorithm to cause routers in the IP network to compute the constrained path to reach the egress router.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDBwzkksLtZNSixOTVEoKUpMS8tMVkjNS8_MS00tysxLV8jMU0jMU_AMUMhLLSnPL8rmYWBNS8wpTuWF0twMim6uIc4euqkF-fGpxQWJyalAlfGhwYaGRiYGhiZGTkbGxKgBACC-Kr4</recordid><startdate>20220201</startdate><enddate>20220201</enddate><creator>Beeram, Vishnu Pavan</creator><creator>Saad, Tarek</creator><creator>Torvi, Raveendra</creator><scope>EVB</scope></search><sort><creationdate>20220201</creationdate><title>Class-based traffic engineering in an IP network</title><author>Beeram, Vishnu Pavan ; Saad, Tarek ; Torvi, Raveendra</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US11240142B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2022</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Beeram, Vishnu Pavan</creatorcontrib><creatorcontrib>Saad, Tarek</creatorcontrib><creatorcontrib>Torvi, Raveendra</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Beeram, Vishnu Pavan</au><au>Saad, Tarek</au><au>Torvi, Raveendra</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Class-based traffic engineering in an IP network</title><date>2022-02-01</date><risdate>2022</risdate><abstract>Techniques are described for class-based traffic engineering in an IP network. For example, routers of an IP network may establish one or more constrained traffic engineered paths using a link-state protocol (e.g., IGP) without using signaling protocols, such as RSVP or SPRING, or encapsulating packets over MPLS. For example, an egress router of the IP network may receive a capability message specifying the capability of routers to compute a constrained path to the egress router, wherein the capability message comprises path computation information including an identifier of a path computation algorithm to be used by the one or more of the plurality of network devices to reach the egress network device. The egress router may advertise a reachability message including a destination IP prefix and the identifier of the path computation algorithm to cause routers in the IP network to compute the constrained path to reach the egress router.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_US11240142B2 |
source | esp@cenet |
title | Class-based traffic engineering in an IP network |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T14%3A24%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Beeram,%20Vishnu%20Pavan&rft.date=2022-02-01&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS11240142B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |