APPARATUS AND METHOD FOR CONTROLLING QUEUING OF DATA AT A NODE ON A NETWORK

An approach to queuing data at a network switching node includes assigning a queue value such as a priority value or a weight to each of a plurality of queues which temporarily store data packets to be forwarded toward a link on the network. A bandwidth value related to a maximum amount of data to b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: SCHWARTZ, STEVEN, J, KEEGAN, LEO, J, SCHRAMM, KAREN, M, PEDUEL, YUVAL
Format: Patent
Sprache:eng ; fre ; ger
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 SCHWARTZ, STEVEN, J
KEEGAN, LEO, J
SCHRAMM, KAREN, M
PEDUEL, YUVAL
description An approach to queuing data at a network switching node includes assigning a queue value such as a priority value or a weight to each of a plurality of queues which temporarily store data packets to be forwarded toward a link on the network. A bandwidth value related to a maximum amount of data to be transferred on the link is defined. A data limit value is assigned to each of the queues to limit the amount of data that can be forwarded from each queue. The data limit value is derived from the bandwidth value for the link. By placing bandwidth-related limits on the queues, low-priority queues are prevented from being dominated by high-priority queues, that is, low-priority queues are not prevented from forwarding their data by the priority structure. Also, the bandwidth-related limits allow for control of traffic flow to prevent overloading lower-capacity links on the network.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP1312187A2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP1312187A2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP1312187A23</originalsourceid><addsrcrecordid>eNrjZPB2DAhwDHIMCQ1WcPRzUfB1DfHwd1Fw8w9ScPb3Cwny9_Hx9HNXCAx1DQXR_m4KLo4hjgqOIQqOCn7-Lq4K_n4glmtIuH-QNw8Da1piTnEqL5TmZlBwcw1x9tBNLciPTy0uSExOzUstiXcNMDQ2NDK0MHc0MiZCCQD6xSyy</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>APPARATUS AND METHOD FOR CONTROLLING QUEUING OF DATA AT A NODE ON A NETWORK</title><source>esp@cenet</source><creator>SCHWARTZ, STEVEN, J ; KEEGAN, LEO, J ; SCHRAMM, KAREN, M ; PEDUEL, YUVAL</creator><creatorcontrib>SCHWARTZ, STEVEN, J ; KEEGAN, LEO, J ; SCHRAMM, KAREN, M ; PEDUEL, YUVAL</creatorcontrib><description>An approach to queuing data at a network switching node includes assigning a queue value such as a priority value or a weight to each of a plurality of queues which temporarily store data packets to be forwarded toward a link on the network. A bandwidth value related to a maximum amount of data to be transferred on the link is defined. A data limit value is assigned to each of the queues to limit the amount of data that can be forwarded from each queue. The data limit value is derived from the bandwidth value for the link. By placing bandwidth-related limits on the queues, low-priority queues are prevented from being dominated by high-priority queues, that is, low-priority queues are not prevented from forwarding their data by the priority structure. Also, the bandwidth-related limits allow for control of traffic flow to prevent overloading lower-capacity links on the network.</description><edition>7</edition><language>eng ; fre ; ger</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2003</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=20030521&amp;DB=EPODOC&amp;CC=EP&amp;NR=1312187A2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25555,76308</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20030521&amp;DB=EPODOC&amp;CC=EP&amp;NR=1312187A2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SCHWARTZ, STEVEN, J</creatorcontrib><creatorcontrib>KEEGAN, LEO, J</creatorcontrib><creatorcontrib>SCHRAMM, KAREN, M</creatorcontrib><creatorcontrib>PEDUEL, YUVAL</creatorcontrib><title>APPARATUS AND METHOD FOR CONTROLLING QUEUING OF DATA AT A NODE ON A NETWORK</title><description>An approach to queuing data at a network switching node includes assigning a queue value such as a priority value or a weight to each of a plurality of queues which temporarily store data packets to be forwarded toward a link on the network. A bandwidth value related to a maximum amount of data to be transferred on the link is defined. A data limit value is assigned to each of the queues to limit the amount of data that can be forwarded from each queue. The data limit value is derived from the bandwidth value for the link. By placing bandwidth-related limits on the queues, low-priority queues are prevented from being dominated by high-priority queues, that is, low-priority queues are not prevented from forwarding their data by the priority structure. Also, the bandwidth-related limits allow for control of traffic flow to prevent overloading lower-capacity links on 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>2003</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPB2DAhwDHIMCQ1WcPRzUfB1DfHwd1Fw8w9ScPb3Cwny9_Hx9HNXCAx1DQXR_m4KLo4hjgqOIQqOCn7-Lq4K_n4glmtIuH-QNw8Da1piTnEqL5TmZlBwcw1x9tBNLciPTy0uSExOzUstiXcNMDQ2NDK0MHc0MiZCCQD6xSyy</recordid><startdate>20030521</startdate><enddate>20030521</enddate><creator>SCHWARTZ, STEVEN, J</creator><creator>KEEGAN, LEO, J</creator><creator>SCHRAMM, KAREN, M</creator><creator>PEDUEL, YUVAL</creator><scope>EVB</scope></search><sort><creationdate>20030521</creationdate><title>APPARATUS AND METHOD FOR CONTROLLING QUEUING OF DATA AT A NODE ON A NETWORK</title><author>SCHWARTZ, STEVEN, J ; KEEGAN, LEO, J ; SCHRAMM, KAREN, M ; PEDUEL, YUVAL</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP1312187A23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2003</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>SCHWARTZ, STEVEN, J</creatorcontrib><creatorcontrib>KEEGAN, LEO, J</creatorcontrib><creatorcontrib>SCHRAMM, KAREN, M</creatorcontrib><creatorcontrib>PEDUEL, YUVAL</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SCHWARTZ, STEVEN, J</au><au>KEEGAN, LEO, J</au><au>SCHRAMM, KAREN, M</au><au>PEDUEL, YUVAL</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>APPARATUS AND METHOD FOR CONTROLLING QUEUING OF DATA AT A NODE ON A NETWORK</title><date>2003-05-21</date><risdate>2003</risdate><abstract>An approach to queuing data at a network switching node includes assigning a queue value such as a priority value or a weight to each of a plurality of queues which temporarily store data packets to be forwarded toward a link on the network. A bandwidth value related to a maximum amount of data to be transferred on the link is defined. A data limit value is assigned to each of the queues to limit the amount of data that can be forwarded from each queue. The data limit value is derived from the bandwidth value for the link. By placing bandwidth-related limits on the queues, low-priority queues are prevented from being dominated by high-priority queues, that is, low-priority queues are not prevented from forwarding their data by the priority structure. Also, the bandwidth-related limits allow for control of traffic flow to prevent overloading lower-capacity links on the network.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; fre ; ger
recordid cdi_epo_espacenet_EP1312187A2
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title APPARATUS AND METHOD FOR CONTROLLING QUEUING OF DATA AT A NODE ON A 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-15T00%3A15%3A17IST&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=SCHWARTZ,%20STEVEN,%20J&rft.date=2003-05-21&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP1312187A2%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