Techniques for flooding optimization for link state protocols in a network topology

Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier con...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: MIRTORABI SINA, ROY ABHAY
Format: Patent
Sprache:eng
Schlagworte:
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 MIRTORABI SINA
ROY ABHAY
description Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier contains information indicating node connectivity for each of the node devices. A selected node device is then identified. The selected node device is one of the node devices in the network that has a lowest identifier value indicating a lowest number of connected node devices to the selected node device in the network. The selected node device is classified as a root flooding tree node device. A flooding tree is generated by performing a shortest path first operation from the selected node device to the plurality of node devices in the network.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN104521192A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN104521192A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN104521192A3</originalsourceid><addsrcrecordid>eNqNizEOwjAQBN1QIOAPxwOQcICCEkUgKhrSR1Y4J6cYr4kPIXg9CPEAqilmZmzOFTddlNudM3kM5ANwkdgSkspVXk4F8WuCxJ6yOmVKAxQNQiaJ5CiyPjD0pEgIaJ9TM_IuZJ79ODHzw74qjwtOqDkn1_BnqcuTXa43hbXbYrf6p3kDuFk5Hw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Techniques for flooding optimization for link state protocols in a network topology</title><source>esp@cenet</source><creator>MIRTORABI SINA ; ROY ABHAY</creator><creatorcontrib>MIRTORABI SINA ; ROY ABHAY</creatorcontrib><description>Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier contains information indicating node connectivity for each of the node devices. A selected node device is then identified. The selected node device is one of the node devices in the network that has a lowest identifier value indicating a lowest number of connected node devices to the selected node device in the network. The selected node device is classified as a root flooding tree node device. A flooding tree is generated by performing a shortest path first operation from the selected node device to the plurality of node devices in the network.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2015</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=20150415&amp;DB=EPODOC&amp;CC=CN&amp;NR=104521192A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20150415&amp;DB=EPODOC&amp;CC=CN&amp;NR=104521192A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>MIRTORABI SINA</creatorcontrib><creatorcontrib>ROY ABHAY</creatorcontrib><title>Techniques for flooding optimization for link state protocols in a network topology</title><description>Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier contains information indicating node connectivity for each of the node devices. A selected node device is then identified. The selected node device is one of the node devices in the network that has a lowest identifier value indicating a lowest number of connected node devices to the selected node device in the network. The selected node device is classified as a root flooding tree node device. A flooding tree is generated by performing a shortest path first operation from the selected node device to the plurality of node devices in the network.</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>2015</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNizEOwjAQBN1QIOAPxwOQcICCEkUgKhrSR1Y4J6cYr4kPIXg9CPEAqilmZmzOFTddlNudM3kM5ANwkdgSkspVXk4F8WuCxJ6yOmVKAxQNQiaJ5CiyPjD0pEgIaJ9TM_IuZJ79ODHzw74qjwtOqDkn1_BnqcuTXa43hbXbYrf6p3kDuFk5Hw</recordid><startdate>20150415</startdate><enddate>20150415</enddate><creator>MIRTORABI SINA</creator><creator>ROY ABHAY</creator><scope>EVB</scope></search><sort><creationdate>20150415</creationdate><title>Techniques for flooding optimization for link state protocols in a network topology</title><author>MIRTORABI SINA ; ROY ABHAY</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN104521192A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2015</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>MIRTORABI SINA</creatorcontrib><creatorcontrib>ROY ABHAY</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>MIRTORABI SINA</au><au>ROY ABHAY</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Techniques for flooding optimization for link state protocols in a network topology</title><date>2015-04-15</date><risdate>2015</risdate><abstract>Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier contains information indicating node connectivity for each of the node devices. A selected node device is then identified. The selected node device is one of the node devices in the network that has a lowest identifier value indicating a lowest number of connected node devices to the selected node device in the network. The selected node device is classified as a root flooding tree node device. A flooding tree is generated by performing a shortest path first operation from the selected node device to the plurality of node devices in the network.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_CN104521192A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Techniques for flooding optimization for link state protocols in a network 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-10T09%3A49%3A00IST&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=MIRTORABI%20SINA&rft.date=2015-04-15&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN104521192A%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