Link state network having weighted control message processing

A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: CHOUDHURY GAGAN LAL, MAUNDER ANURAG S
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 CHOUDHURY GAGAN LAL
MAUNDER ANURAG S
description A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US7548514B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US7548514B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US7548514B13</originalsourceid><addsrcrecordid>eNrjZLD1yczLViguSSxJVchLLSnPL8pWyEgsy8xLVyhPzUzPKElNUUjOzyspys9RyE0tLk5MT1UoKMpPBjKBangYWNMSc4pTeaE0N4OCm2uIs4duakF-fGpxQWJyKtDQ-NBgc1MTC1NDEydDYyKUAAD9GTCC</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Link state network having weighted control message processing</title><source>esp@cenet</source><creator>CHOUDHURY GAGAN LAL ; MAUNDER ANURAG S</creator><creatorcontrib>CHOUDHURY GAGAN LAL ; MAUNDER ANURAG S</creatorcontrib><description>A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; MULTIPLEX COMMUNICATION ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2009</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=20090616&amp;DB=EPODOC&amp;CC=US&amp;NR=7548514B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,778,883,25547,76298</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20090616&amp;DB=EPODOC&amp;CC=US&amp;NR=7548514B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>CHOUDHURY GAGAN LAL</creatorcontrib><creatorcontrib>MAUNDER ANURAG S</creatorcontrib><title>Link state network having weighted control message processing</title><description>A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>MULTIPLEX COMMUNICATION</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2009</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLD1yczLViguSSxJVchLLSnPL8pWyEgsy8xLVyhPzUzPKElNUUjOzyspys9RyE0tLk5MT1UoKMpPBjKBangYWNMSc4pTeaE0N4OCm2uIs4duakF-fGpxQWJyKtDQ-NBgc1MTC1NDEydDYyKUAAD9GTCC</recordid><startdate>20090616</startdate><enddate>20090616</enddate><creator>CHOUDHURY GAGAN LAL</creator><creator>MAUNDER ANURAG S</creator><scope>EVB</scope></search><sort><creationdate>20090616</creationdate><title>Link state network having weighted control message processing</title><author>CHOUDHURY GAGAN LAL ; MAUNDER ANURAG S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US7548514B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2009</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>MULTIPLEX COMMUNICATION</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>CHOUDHURY GAGAN LAL</creatorcontrib><creatorcontrib>MAUNDER ANURAG S</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>CHOUDHURY GAGAN LAL</au><au>MAUNDER ANURAG S</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Link state network having weighted control message processing</title><date>2009-06-16</date><risdate>2009</risdate><abstract>A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US7548514B1
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
MULTIPLEX COMMUNICATION
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Link state network having weighted control message processing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T11%3A22%3A41IST&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=CHOUDHURY%20GAGAN%20LAL&rft.date=2009-06-16&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS7548514B1%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