METHOD FOR ROUTING PACKETS IN A COMMUNICATION NETWORK HAVING A VARIABLE AND PREDICTABLE TOPOLOGY

METHOD FOR ROUTING PACKETS IN A COMMUNICATION NETWORK HAVING A VARIABLE AND PREDICTABLE TOPOLOGY

A method (100) for routing packets in a communication network (10) having a variable and predictable topology. The network includes a plurality of nodes, and each node can be connected, at least temporarily, to one or more other nodes in the network. The packets are transmitted from a source node (2...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: CLAUDE, Bertrand, AUGER, Antoine, IHAMOUINE, Raphaël
Format: Patent
Sprache:eng
Schlagworte:
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
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 CLAUDE, Bertrand
AUGER, Antoine
IHAMOUINE, Raphaël
description A method (100) for routing packets in a communication network (10) having a variable and predictable topology. The network includes a plurality of nodes, and each node can be connected, at least temporarily, to one or more other nodes in the network. The packets are transmitted from a source node (21) to a destination node (23). An orchestration entity (25) determines (101) a plurality of temporary paths (31) between the source node and the destination node for several successive time periods (Pi), the existence of a temporary path being guaranteed for the time period with which it is associated. The orchestration entity (25) generates (102) a table (T) of label stacks (LSi), in which table each label stack corresponds to the temporary path defined for one of the successive time periods, and each label (Lj, i) corresponds to a node of the temporary path.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2023179514A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2023179514A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2023179514A13</originalsourceid><addsrcrecordid>eNqNysEKgkAQgGEvHaJ6h4HOQWohHafdVRd1Z1lnjU4msZ2iBHt_ougBOv388M2jS6O4JAk5OXDkWZsCLIpKcQvaAIKgpvFGC2RNBoziE7kKSuw-EqFDp_FYK0AjwTolteDvM1mqqTgvo9ltuE9h9esiWueKRbkJ47MP0zhcwyO8et8m2ySNs8M-3mGc_qfePNI0RQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>METHOD FOR ROUTING PACKETS IN A COMMUNICATION NETWORK HAVING A VARIABLE AND PREDICTABLE TOPOLOGY</title><source>esp@cenet</source><creator>CLAUDE, Bertrand ; AUGER, Antoine ; IHAMOUINE, Raphaël</creator><creatorcontrib>CLAUDE, Bertrand ; AUGER, Antoine ; IHAMOUINE, Raphaël</creatorcontrib><description>A method (100) for routing packets in a communication network (10) having a variable and predictable topology. The network includes a plurality of nodes, and each node can be connected, at least temporarily, to one or more other nodes in the network. The packets are transmitted from a source node (21) to a destination node (23). An orchestration entity (25) determines (101) a plurality of temporary paths (31) between the source node and the destination node for several successive time periods (Pi), the existence of a temporary path being guaranteed for the time period with which it is associated. The orchestration entity (25) generates (102) a table (T) of label stacks (LSi), in which table each label stack corresponds to the temporary path defined for one of the successive time periods, and each label (Lj, i) corresponds to a node of the temporary path.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2023</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&amp;date=20230608&amp;DB=EPODOC&amp;CC=US&amp;NR=2023179514A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230608&amp;DB=EPODOC&amp;CC=US&amp;NR=2023179514A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>CLAUDE, Bertrand</creatorcontrib><creatorcontrib>AUGER, Antoine</creatorcontrib><creatorcontrib>IHAMOUINE, Raphaël</creatorcontrib><title>METHOD FOR ROUTING PACKETS IN A COMMUNICATION NETWORK HAVING A VARIABLE AND PREDICTABLE TOPOLOGY</title><description>A method (100) for routing packets in a communication network (10) having a variable and predictable topology. The network includes a plurality of nodes, and each node can be connected, at least temporarily, to one or more other nodes in the network. The packets are transmitted from a source node (21) to a destination node (23). An orchestration entity (25) determines (101) a plurality of temporary paths (31) between the source node and the destination node for several successive time periods (Pi), the existence of a temporary path being guaranteed for the time period with which it is associated. The orchestration entity (25) generates (102) a table (T) of label stacks (LSi), in which table each label stack corresponds to the temporary path defined for one of the successive time periods, and each label (Lj, i) corresponds to a node of the temporary path.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNysEKgkAQgGEvHaJ6h4HOQWohHafdVRd1Z1lnjU4msZ2iBHt_ougBOv388M2jS6O4JAk5OXDkWZsCLIpKcQvaAIKgpvFGC2RNBoziE7kKSuw-EqFDp_FYK0AjwTolteDvM1mqqTgvo9ltuE9h9esiWueKRbkJ47MP0zhcwyO8et8m2ySNs8M-3mGc_qfePNI0RQ</recordid><startdate>20230608</startdate><enddate>20230608</enddate><creator>CLAUDE, Bertrand</creator><creator>AUGER, Antoine</creator><creator>IHAMOUINE, Raphaël</creator><scope>EVB</scope></search><sort><creationdate>20230608</creationdate><title>METHOD FOR ROUTING PACKETS IN A COMMUNICATION NETWORK HAVING A VARIABLE AND PREDICTABLE TOPOLOGY</title><author>CLAUDE, Bertrand ; AUGER, Antoine ; IHAMOUINE, Raphaël</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2023179514A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2023</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>CLAUDE, Bertrand</creatorcontrib><creatorcontrib>AUGER, Antoine</creatorcontrib><creatorcontrib>IHAMOUINE, Raphaël</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>CLAUDE, Bertrand</au><au>AUGER, Antoine</au><au>IHAMOUINE, Raphaël</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>METHOD FOR ROUTING PACKETS IN A COMMUNICATION NETWORK HAVING A VARIABLE AND PREDICTABLE TOPOLOGY</title><date>2023-06-08</date><risdate>2023</risdate><abstract>A method (100) for routing packets in a communication network (10) having a variable and predictable topology. The network includes a plurality of nodes, and each node can be connected, at least temporarily, to one or more other nodes in the network. The packets are transmitted from a source node (21) to a destination node (23). An orchestration entity (25) determines (101) a plurality of temporary paths (31) between the source node and the destination node for several successive time periods (Pi), the existence of a temporary path being guaranteed for the time period with which it is associated. The orchestration entity (25) generates (102) a table (T) of label stacks (LSi), in which table each label stack corresponds to the temporary path defined for one of the successive time periods, and each label (Lj, i) corresponds to a node of the temporary path.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2023179514A1
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title METHOD FOR ROUTING PACKETS IN A COMMUNICATION NETWORK HAVING A VARIABLE AND PREDICTABLE TOPOLOGY
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T19%3A21%3A33IST&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=CLAUDE,%20Bertrand&rft.date=2023-06-08&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2023179514A1%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