Hierarchical packet fair queueing algorithms

We propose to use the idealized hierarchical generalized processor sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design hierarchical packet fair queueing (H-PFQ) algorithms to approximate H-GPS by using one-l...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on networking 1997-10, Vol.5 (5), p.675-689
Hauptverfasser: Bennett, J.C.R., Hui Zhang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 689
container_issue 5
container_start_page 675
container_title IEEE/ACM transactions on networking
container_volume 5
creator Bennett, J.C.R.
Hui Zhang
description We propose to use the idealized hierarchical generalized processor sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design hierarchical packet fair queueing (H-PFQ) algorithms to approximate H-GPS by using one-level variable-rate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variable-rate servers. We develop techniques to analyze delay and fairness properties of variable-rate and hierarchical PFQ servers. We demonstrate that in order to provide tight delay bounds with an H-PFQ server, it is essential for the one-level PFQ servers to have small worst-case fair indices (WFI). We propose a new PFQ algorithm called WF/sup 2/Q+ that is the first to have all the following three properties: (1) providing the tightest delay bound among all PFQ algorithms; (2) having the smallest WFI among all PFQ algorithms; and (3) having a relatively low asymptotic complexity of O(log N). Simulation results are presented to evaluate the delay and link-sharing properties of H-WF/sup 2/Q+, H-WFQ, H-SFQ, and H-SCFQ.
doi_str_mv 10.1109/90.649568
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28941812</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>649568</ieee_id><sourcerecordid>28329464</sourcerecordid><originalsourceid>FETCH-LOGICAL-c432t-fd356d679e189b115d9dd3efa8e20ca100e569d8c409ba451ce132d2f28d00e93</originalsourceid><addsrcrecordid>eNqNkEFLAzEQRoMoWKsHr572IILg1kmyiclRilqh4EXPIU0mbXTbrcn24L83sqVnTzPwvfkYHiGXFCaUgr7XMJGNFlIdkREVQtVMSHlcdpC8llKzU3KW8ycA5cDkiNzNIiab3Co621Zb676wr4KNqfre4Q7jZlnZdtml2K_W-ZycBNtmvNjPMfl4fnqfzur528vr9HFeu4azvg6eC-nlg0aq9IJS4bX3HINVyMBZCoBCaq9cA3phG0EdUs48C0z5kmk-JjdD7zZ15Y3cm3XMDtvWbrDbZcOUbqii7B8gZ7qRTQFvB9ClLueEwWxTXNv0YyiYP3FGgxnEFfZ6X2pzkRKS3biYDwcMFBSzBbsasIiIh3Tf8Qsnj3PF</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28329464</pqid></control><display><type>article</type><title>Hierarchical packet fair queueing algorithms</title><source>IEEE Electronic Library (IEL)</source><creator>Bennett, J.C.R. ; Hui Zhang</creator><creatorcontrib>Bennett, J.C.R. ; Hui Zhang</creatorcontrib><description>We propose to use the idealized hierarchical generalized processor sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design hierarchical packet fair queueing (H-PFQ) algorithms to approximate H-GPS by using one-level variable-rate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variable-rate servers. We develop techniques to analyze delay and fairness properties of variable-rate and hierarchical PFQ servers. We demonstrate that in order to provide tight delay bounds with an H-PFQ server, it is essential for the one-level PFQ servers to have small worst-case fair indices (WFI). We propose a new PFQ algorithm called WF/sup 2/Q+ that is the first to have all the following three properties: (1) providing the tightest delay bound among all PFQ algorithms; (2) having the smallest WFI among all PFQ algorithms; and (3) having a relatively low asymptotic complexity of O(log N). Simulation results are presented to evaluate the delay and link-sharing properties of H-WF/sup 2/Q+, H-WFQ, H-SFQ, and H-SCFQ.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/90.649568</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Applied sciences ; Bandwidth ; Delay estimation ; Exact sciences and technology ; Global Positioning System ; Intserv networks ; Quality of service ; Resource management ; Scheduling algorithm ; Telecommunication traffic ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Traffic control ; Valuation and optimization of characteristics. Simulation</subject><ispartof>IEEE/ACM transactions on networking, 1997-10, Vol.5 (5), p.675-689</ispartof><rights>1998 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c432t-fd356d679e189b115d9dd3efa8e20ca100e569d8c409ba451ce132d2f28d00e93</citedby><cites>FETCH-LOGICAL-c432t-fd356d679e189b115d9dd3efa8e20ca100e569d8c409ba451ce132d2f28d00e93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/649568$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/649568$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=2080155$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bennett, J.C.R.</creatorcontrib><creatorcontrib>Hui Zhang</creatorcontrib><title>Hierarchical packet fair queueing algorithms</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>We propose to use the idealized hierarchical generalized processor sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design hierarchical packet fair queueing (H-PFQ) algorithms to approximate H-GPS by using one-level variable-rate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variable-rate servers. We develop techniques to analyze delay and fairness properties of variable-rate and hierarchical PFQ servers. We demonstrate that in order to provide tight delay bounds with an H-PFQ server, it is essential for the one-level PFQ servers to have small worst-case fair indices (WFI). We propose a new PFQ algorithm called WF/sup 2/Q+ that is the first to have all the following three properties: (1) providing the tightest delay bound among all PFQ algorithms; (2) having the smallest WFI among all PFQ algorithms; and (3) having a relatively low asymptotic complexity of O(log N). Simulation results are presented to evaluate the delay and link-sharing properties of H-WF/sup 2/Q+, H-WFQ, H-SFQ, and H-SCFQ.</description><subject>Algorithm design and analysis</subject><subject>Applied sciences</subject><subject>Bandwidth</subject><subject>Delay estimation</subject><subject>Exact sciences and technology</subject><subject>Global Positioning System</subject><subject>Intserv networks</subject><subject>Quality of service</subject><subject>Resource management</subject><subject>Scheduling algorithm</subject><subject>Telecommunication traffic</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Traffic control</subject><subject>Valuation and optimization of characteristics. Simulation</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqNkEFLAzEQRoMoWKsHr572IILg1kmyiclRilqh4EXPIU0mbXTbrcn24L83sqVnTzPwvfkYHiGXFCaUgr7XMJGNFlIdkREVQtVMSHlcdpC8llKzU3KW8ycA5cDkiNzNIiab3Co621Zb676wr4KNqfre4Q7jZlnZdtml2K_W-ZycBNtmvNjPMfl4fnqfzur528vr9HFeu4azvg6eC-nlg0aq9IJS4bX3HINVyMBZCoBCaq9cA3phG0EdUs48C0z5kmk-JjdD7zZ15Y3cm3XMDtvWbrDbZcOUbqii7B8gZ7qRTQFvB9ClLueEwWxTXNv0YyiYP3FGgxnEFfZ6X2pzkRKS3biYDwcMFBSzBbsasIiIh3Tf8Qsnj3PF</recordid><startdate>19971001</startdate><enddate>19971001</enddate><creator>Bennett, J.C.R.</creator><creator>Hui Zhang</creator><general>IEEE</general><general>Association for Computing Machinery</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7SP</scope></search><sort><creationdate>19971001</creationdate><title>Hierarchical packet fair queueing algorithms</title><author>Bennett, J.C.R. ; Hui Zhang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c432t-fd356d679e189b115d9dd3efa8e20ca100e569d8c409ba451ce132d2f28d00e93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Algorithm design and analysis</topic><topic>Applied sciences</topic><topic>Bandwidth</topic><topic>Delay estimation</topic><topic>Exact sciences and technology</topic><topic>Global Positioning System</topic><topic>Intserv networks</topic><topic>Quality of service</topic><topic>Resource management</topic><topic>Scheduling algorithm</topic><topic>Telecommunication traffic</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Traffic control</topic><topic>Valuation and optimization of characteristics. Simulation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bennett, J.C.R.</creatorcontrib><creatorcontrib>Hui Zhang</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Electronics &amp; Communications Abstracts</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bennett, J.C.R.</au><au>Hui Zhang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hierarchical packet fair queueing algorithms</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>1997-10-01</date><risdate>1997</risdate><volume>5</volume><issue>5</issue><spage>675</spage><epage>689</epage><pages>675-689</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>We propose to use the idealized hierarchical generalized processor sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design hierarchical packet fair queueing (H-PFQ) algorithms to approximate H-GPS by using one-level variable-rate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variable-rate servers. We develop techniques to analyze delay and fairness properties of variable-rate and hierarchical PFQ servers. We demonstrate that in order to provide tight delay bounds with an H-PFQ server, it is essential for the one-level PFQ servers to have small worst-case fair indices (WFI). We propose a new PFQ algorithm called WF/sup 2/Q+ that is the first to have all the following three properties: (1) providing the tightest delay bound among all PFQ algorithms; (2) having the smallest WFI among all PFQ algorithms; and (3) having a relatively low asymptotic complexity of O(log N). Simulation results are presented to evaluate the delay and link-sharing properties of H-WF/sup 2/Q+, H-WFQ, H-SFQ, and H-SCFQ.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/90.649568</doi><tpages>15</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-6692
ispartof IEEE/ACM transactions on networking, 1997-10, Vol.5 (5), p.675-689
issn 1063-6692
1558-2566
language eng
recordid cdi_proquest_miscellaneous_28941812
source IEEE Electronic Library (IEL)
subjects Algorithm design and analysis
Applied sciences
Bandwidth
Delay estimation
Exact sciences and technology
Global Positioning System
Intserv networks
Quality of service
Resource management
Scheduling algorithm
Telecommunication traffic
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Traffic control
Valuation and optimization of characteristics. Simulation
title Hierarchical packet fair queueing algorithms
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T08%3A04%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hierarchical%20packet%20fair%20queueing%20algorithms&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Bennett,%20J.C.R.&rft.date=1997-10-01&rft.volume=5&rft.issue=5&rft.spage=675&rft.epage=689&rft.pages=675-689&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/90.649568&rft_dat=%3Cproquest_RIE%3E28329464%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28329464&rft_id=info:pmid/&rft_ieee_id=649568&rfr_iscdi=true