Fair, efficient and low-latency packet scheduling using nested deficit round robin
In the emerging high-speed integrated-services packet-switched networks, packet scheduling algorithms in switches and routers play a critical role in providing the quality of-service (QoS) guarantees required by many applications. We present a new scheduling discipline called nested deficit round ro...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 10 |
|---|---|
| container_issue | |
| container_start_page | 6 |
| container_title | |
| container_volume | |
| creator | Kanhere, S.S. Sethu, H. |
| description | In the emerging high-speed integrated-services packet-switched networks, packet scheduling algorithms in switches and routers play a critical role in providing the quality of-service (QoS) guarantees required by many applications. We present a new scheduling discipline called nested deficit round robin (Nested-DRR), which is fair, efficient and in addition has a low latency bound. Nested-DRR splits each DRR round into one or more smaller rounds, within each of which we run a modified version of the DRR scheduling discipline. In this paper, we analytically prove that Nested-DRR results in a significant improvement in the latency bound in comparison to DRR, and in addition preserves the good properties of DRR such as the per-packet work complexity of O(1). Nested DRR also has the same relative fairness bound as DRR. |
| doi_str_mv | 10.1109/HPSR.2001.923594 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_923594</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>923594</ieee_id><sourcerecordid>923594</sourcerecordid><originalsourceid>FETCH-LOGICAL-c219t-df66f3aa2ff378db3e06b96f895f256fcd5a7f9e0515a61e2d15d42e40dc5ff73</originalsourceid><addsrcrecordid>eNotj01LAzEURQMiqG334io_wBnzMclMllKsFQqWquuSSd7T6JgpkwzSf9-Wehfnrs6FS8gtZyXnzDws12-bUjDGSyOkMtUFuWF1w6SuOedXZJbSNzumUpVsxDXZLGwY7ikgBhcgZmqjp13_V3Q2Q3R7urPuBzJN7gv82IX4Scd0YoSUwVMPJzHToR-P4tC3IU7JJdouwey_J-Rj8fQ-Xxar1-eX-eOqcIKbXHjUGqW1AlHWjW8lMN0ajY1RKJRG55Wt0QBTXFnNQXiufCWgYt4pxFpOyN15NwDAdjeEXzvst-fX8gC_Q06y</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fair, efficient and low-latency packet scheduling using nested deficit round robin</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kanhere, S.S. ; Sethu, H.</creator><creatorcontrib>Kanhere, S.S. ; Sethu, H.</creatorcontrib><description>In the emerging high-speed integrated-services packet-switched networks, packet scheduling algorithms in switches and routers play a critical role in providing the quality of-service (QoS) guarantees required by many applications. We present a new scheduling discipline called nested deficit round robin (Nested-DRR), which is fair, efficient and in addition has a low latency bound. Nested-DRR splits each DRR round into one or more smaller rounds, within each of which we run a modified version of the DRR scheduling discipline. In this paper, we analytically prove that Nested-DRR results in a significant improvement in the latency bound in comparison to DRR, and in addition preserves the good properties of DRR such as the per-packet work complexity of O(1). Nested DRR also has the same relative fairness bound as DRR.</description><identifier>ISBN: 0780367111</identifier><identifier>ISBN: 9780780367111</identifier><identifier>DOI: 10.1109/HPSR.2001.923594</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer aided instruction ; Delay ; Electronic mail ; Packet switching ; Quality of service ; Round robin ; Scheduling algorithm ; Sorting ; Switches ; Video on demand</subject><ispartof>2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552), 2001, p.6-10</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c219t-df66f3aa2ff378db3e06b96f895f256fcd5a7f9e0515a61e2d15d42e40dc5ff73</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/923594$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,4036,4037,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/923594$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kanhere, S.S.</creatorcontrib><creatorcontrib>Sethu, H.</creatorcontrib><title>Fair, efficient and low-latency packet scheduling using nested deficit round robin</title><title>2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)</title><addtitle>HPSR</addtitle><description>In the emerging high-speed integrated-services packet-switched networks, packet scheduling algorithms in switches and routers play a critical role in providing the quality of-service (QoS) guarantees required by many applications. We present a new scheduling discipline called nested deficit round robin (Nested-DRR), which is fair, efficient and in addition has a low latency bound. Nested-DRR splits each DRR round into one or more smaller rounds, within each of which we run a modified version of the DRR scheduling discipline. In this paper, we analytically prove that Nested-DRR results in a significant improvement in the latency bound in comparison to DRR, and in addition preserves the good properties of DRR such as the per-packet work complexity of O(1). Nested DRR also has the same relative fairness bound as DRR.</description><subject>Computer aided instruction</subject><subject>Delay</subject><subject>Electronic mail</subject><subject>Packet switching</subject><subject>Quality of service</subject><subject>Round robin</subject><subject>Scheduling algorithm</subject><subject>Sorting</subject><subject>Switches</subject><subject>Video on demand</subject><isbn>0780367111</isbn><isbn>9780780367111</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2001</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj01LAzEURQMiqG334io_wBnzMclMllKsFQqWquuSSd7T6JgpkwzSf9-Wehfnrs6FS8gtZyXnzDws12-bUjDGSyOkMtUFuWF1w6SuOedXZJbSNzumUpVsxDXZLGwY7ikgBhcgZmqjp13_V3Q2Q3R7urPuBzJN7gv82IX4Scd0YoSUwVMPJzHToR-P4tC3IU7JJdouwey_J-Rj8fQ-Xxar1-eX-eOqcIKbXHjUGqW1AlHWjW8lMN0ajY1RKJRG55Wt0QBTXFnNQXiufCWgYt4pxFpOyN15NwDAdjeEXzvst-fX8gC_Q06y</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Kanhere, S.S.</creator><creator>Sethu, H.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2001</creationdate><title>Fair, efficient and low-latency packet scheduling using nested deficit round robin</title><author>Kanhere, S.S. ; Sethu, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c219t-df66f3aa2ff378db3e06b96f895f256fcd5a7f9e0515a61e2d15d42e40dc5ff73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Computer aided instruction</topic><topic>Delay</topic><topic>Electronic mail</topic><topic>Packet switching</topic><topic>Quality of service</topic><topic>Round robin</topic><topic>Scheduling algorithm</topic><topic>Sorting</topic><topic>Switches</topic><topic>Video on demand</topic><toplevel>online_resources</toplevel><creatorcontrib>Kanhere, S.S.</creatorcontrib><creatorcontrib>Sethu, H.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kanhere, S.S.</au><au>Sethu, H.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fair, efficient and low-latency packet scheduling using nested deficit round robin</atitle><btitle>2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)</btitle><stitle>HPSR</stitle><date>2001</date><risdate>2001</risdate><spage>6</spage><epage>10</epage><pages>6-10</pages><isbn>0780367111</isbn><isbn>9780780367111</isbn><abstract>In the emerging high-speed integrated-services packet-switched networks, packet scheduling algorithms in switches and routers play a critical role in providing the quality of-service (QoS) guarantees required by many applications. We present a new scheduling discipline called nested deficit round robin (Nested-DRR), which is fair, efficient and in addition has a low latency bound. Nested-DRR splits each DRR round into one or more smaller rounds, within each of which we run a modified version of the DRR scheduling discipline. In this paper, we analytically prove that Nested-DRR results in a significant improvement in the latency bound in comparison to DRR, and in addition preserves the good properties of DRR such as the per-packet work complexity of O(1). Nested DRR also has the same relative fairness bound as DRR.</abstract><pub>IEEE</pub><doi>10.1109/HPSR.2001.923594</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0780367111 |
| ispartof | 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552), 2001, p.6-10 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_923594 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer aided instruction Delay Electronic mail Packet switching Quality of service Round robin Scheduling algorithm Sorting Switches Video on demand |
| title | Fair, efficient and low-latency packet scheduling using nested deficit round robin |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T08%3A20%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Fair,%20efficient%20and%20low-latency%20packet%20scheduling%20using%20nested%20deficit%20round%20robin&rft.btitle=2001%20IEEE%20Workshop%20on%20High%20Performance%20Switching%20and%20Routing%20(IEEE%20Cat.%20No.01TH8552)&rft.au=Kanhere,%20S.S.&rft.date=2001&rft.spage=6&rft.epage=10&rft.pages=6-10&rft.isbn=0780367111&rft.isbn_list=9780780367111&rft_id=info:doi/10.1109/HPSR.2001.923594&rft_dat=%3Cieee_6IE%3E923594%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=923594&rfr_iscdi=true |