PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR

Described embodiments provide for restructuring a scheduling hierarchy of a network processor having a plurality of processing modules and a shared memory. The scheduling hierarchy schedules packets for transmission. The network processor generates tasks corresponding to each received packet associa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: SONNIER DAVID, AULAKH SHAILENDRA, SUNDARARAMAN BALAKRISHNAN, NEMAWARKAR SHASHANK, VESTAL ALLEN
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 SONNIER DAVID
AULAKH SHAILENDRA
SUNDARARAMAN BALAKRISHNAN
NEMAWARKAR SHASHANK
VESTAL ALLEN
description Described embodiments provide for restructuring a scheduling hierarchy of a network processor having a plurality of processing modules and a shared memory. The scheduling hierarchy schedules packets for transmission. The network processor generates tasks corresponding to each received packet associated with a data flow. A traffic manager receives tasks provided by one of the processing modules and determines a queue of the scheduling hierarchy corresponding to the task. The queue has a parent scheduler at each of one or more next levels of the scheduling hierarchy up to a root scheduler, forming a branch of the hierarchy. The traffic manager determines if the queue and one or more of the parent schedulers of the branch should be restructured. If so, the traffic manager drops subsequently received tasks for the branch, drains all tasks of the branch, and removes the corresponding nodes of the branch from the scheduling hierarchy.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2012020366A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2012020366A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2012020366A13</originalsourceid><addsrcrecordid>eNqNikEKwjAQAHPxIOofFjwLaQu9L-mmCbVJ2aSUnkqReBIt1P9jBR_gaWBm9mLoUDUUoWK0zroaNPsWEIIyVPXXrzGWGFmZEazbSmTU2ipo0WFNDF5v0lEcPDfQsVcUguej2N3nx5pOPx7EWVNU5pKW15TWZb6lZ3pPfchllstcFmWJWfHf9QE0ZTFO</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR</title><source>esp@cenet</source><creator>SONNIER DAVID ; AULAKH SHAILENDRA ; SUNDARARAMAN BALAKRISHNAN ; NEMAWARKAR SHASHANK ; VESTAL ALLEN</creator><creatorcontrib>SONNIER DAVID ; AULAKH SHAILENDRA ; SUNDARARAMAN BALAKRISHNAN ; NEMAWARKAR SHASHANK ; VESTAL ALLEN</creatorcontrib><description>Described embodiments provide for restructuring a scheduling hierarchy of a network processor having a plurality of processing modules and a shared memory. The scheduling hierarchy schedules packets for transmission. The network processor generates tasks corresponding to each received packet associated with a data flow. A traffic manager receives tasks provided by one of the processing modules and determines a queue of the scheduling hierarchy corresponding to the task. The queue has a parent scheduler at each of one or more next levels of the scheduling hierarchy up to a root scheduler, forming a branch of the hierarchy. The traffic manager determines if the queue and one or more of the parent schedulers of the branch should be restructured. If so, the traffic manager drops subsequently received tasks for the branch, drains all tasks of the branch, and removes the corresponding nodes of the branch from the scheduling hierarchy.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2012</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=20120126&amp;DB=EPODOC&amp;CC=US&amp;NR=2012020366A1$$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=20120126&amp;DB=EPODOC&amp;CC=US&amp;NR=2012020366A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SONNIER DAVID</creatorcontrib><creatorcontrib>AULAKH SHAILENDRA</creatorcontrib><creatorcontrib>SUNDARARAMAN BALAKRISHNAN</creatorcontrib><creatorcontrib>NEMAWARKAR SHASHANK</creatorcontrib><creatorcontrib>VESTAL ALLEN</creatorcontrib><title>PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR</title><description>Described embodiments provide for restructuring a scheduling hierarchy of a network processor having a plurality of processing modules and a shared memory. The scheduling hierarchy schedules packets for transmission. The network processor generates tasks corresponding to each received packet associated with a data flow. A traffic manager receives tasks provided by one of the processing modules and determines a queue of the scheduling hierarchy corresponding to the task. The queue has a parent scheduler at each of one or more next levels of the scheduling hierarchy up to a root scheduler, forming a branch of the hierarchy. The traffic manager determines if the queue and one or more of the parent schedulers of the branch should be restructured. If so, the traffic manager drops subsequently received tasks for the branch, drains all tasks of the branch, and removes the corresponding nodes of the branch from the scheduling hierarchy.</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>2012</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNikEKwjAQAHPxIOofFjwLaQu9L-mmCbVJ2aSUnkqReBIt1P9jBR_gaWBm9mLoUDUUoWK0zroaNPsWEIIyVPXXrzGWGFmZEazbSmTU2ipo0WFNDF5v0lEcPDfQsVcUguej2N3nx5pOPx7EWVNU5pKW15TWZb6lZ3pPfchllstcFmWJWfHf9QE0ZTFO</recordid><startdate>20120126</startdate><enddate>20120126</enddate><creator>SONNIER DAVID</creator><creator>AULAKH SHAILENDRA</creator><creator>SUNDARARAMAN BALAKRISHNAN</creator><creator>NEMAWARKAR SHASHANK</creator><creator>VESTAL ALLEN</creator><scope>EVB</scope></search><sort><creationdate>20120126</creationdate><title>PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR</title><author>SONNIER DAVID ; AULAKH SHAILENDRA ; SUNDARARAMAN BALAKRISHNAN ; NEMAWARKAR SHASHANK ; VESTAL ALLEN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2012020366A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2012</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>SONNIER DAVID</creatorcontrib><creatorcontrib>AULAKH SHAILENDRA</creatorcontrib><creatorcontrib>SUNDARARAMAN BALAKRISHNAN</creatorcontrib><creatorcontrib>NEMAWARKAR SHASHANK</creatorcontrib><creatorcontrib>VESTAL ALLEN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SONNIER DAVID</au><au>AULAKH SHAILENDRA</au><au>SUNDARARAMAN BALAKRISHNAN</au><au>NEMAWARKAR SHASHANK</au><au>VESTAL ALLEN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR</title><date>2012-01-26</date><risdate>2012</risdate><abstract>Described embodiments provide for restructuring a scheduling hierarchy of a network processor having a plurality of processing modules and a shared memory. The scheduling hierarchy schedules packets for transmission. The network processor generates tasks corresponding to each received packet associated with a data flow. A traffic manager receives tasks provided by one of the processing modules and determines a queue of the scheduling hierarchy corresponding to the task. The queue has a parent scheduler at each of one or more next levels of the scheduling hierarchy up to a root scheduler, forming a branch of the hierarchy. The traffic manager determines if the queue and one or more of the parent schedulers of the branch should be restructured. If so, the traffic manager drops subsequently received tasks for the branch, drains all tasks of the branch, and removes the corresponding nodes of the branch from the scheduling hierarchy.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2012020366A1
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title PACKET DRAINING FROM A SCHEDULING HIERARCHY IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T20%3A07%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=SONNIER%20DAVID&rft.date=2012-01-26&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2012020366A1%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