Achieving fair bandwidth allocation without per-flow state

In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per flow state. Edge routers divide each flow into a set of layers using a linear encoding scheme and insert an appropriate label into each packet header. Core routers maintai...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhai Mingyu, Gu Guanqun
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Bandwidth
Channel allocation
Computer networks
Computer science
Computer science education
Encoding
High-speed networks
Laboratories
Scalability
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 143
container_issue
container_start_page 137
container_title
container_volume
creator Zhai Mingyu
Gu Guanqun
description In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per flow state. Edge routers divide each flow into a set of layers using a linear encoding scheme and insert an appropriate label into each packet header. Core routers maintain a dropping threshold at each router; packets with a label greater than the threshold are dropped. In order to determine the dropping threshold, we only need to know queue occupancy information and do few comparison operations in core routers (so we call our scheme Queue Length based Fair Queueing (QLFQ)). We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ.
doi_str_mv 10.1109/ICCNMC.2001.962588
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_962588</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>962588</ieee_id><sourcerecordid>962588</sourcerecordid><originalsourceid>FETCH-LOGICAL-i174t-df03b5d20760f894c108b67a00385e0aece4e8d6c89fcb2b4aefa5a1e996d7423</originalsourceid><addsrcrecordid>eNotj8tKxDAYRgMiKGNfYFZ5gdbcmou7oXgZGHWj6-Fv8sdGaju00eLbWxi_zdkdzkfIlrOKc-Zu903z8txUgjFeOS1qay9I4YxlRruaS8vFFSnm-ZOtk05JLq_J3c53CX_S8EEjpIm2MIQlhdxR6PvRQ07jQJeUu_E70xNOZezHhc4ZMt6Qywj9jMU_N-T94f6teSoPr4_7ZncoEzcqlyEy2dZBrBUsWqc8Z7bVBtYGWyMD9KjQBu2ti74VrQKMUANH53QwSsgN2Z69CRGPpyl9wfR7PB-Uf-NCRxg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Achieving fair bandwidth allocation without per-flow state</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhai Mingyu ; Gu Guanqun</creator><creatorcontrib>Zhai Mingyu ; Gu Guanqun</creatorcontrib><description>In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per flow state. Edge routers divide each flow into a set of layers using a linear encoding scheme and insert an appropriate label into each packet header. Core routers maintain a dropping threshold at each router; packets with a label greater than the threshold are dropped. In order to determine the dropping threshold, we only need to know queue occupancy information and do few comparison operations in core routers (so we call our scheme Queue Length based Fair Queueing (QLFQ)). We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ.</description><identifier>ISBN: 9780769513812</identifier><identifier>ISBN: 0769513816</identifier><identifier>DOI: 10.1109/ICCNMC.2001.962588</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Bandwidth ; Channel allocation ; Computer networks ; Computer science ; Computer science education ; Encoding ; High-speed networks ; Laboratories ; Scalability</subject><ispartof>Proceedings 2001 International Conference on Computer Networks and Mobile Computing, 2001, p.137-143</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/962588$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/962588$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhai Mingyu</creatorcontrib><creatorcontrib>Gu Guanqun</creatorcontrib><title>Achieving fair bandwidth allocation without per-flow state</title><title>Proceedings 2001 International Conference on Computer Networks and Mobile Computing</title><addtitle>ICCNMC</addtitle><description>In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per flow state. Edge routers divide each flow into a set of layers using a linear encoding scheme and insert an appropriate label into each packet header. Core routers maintain a dropping threshold at each router; packets with a label greater than the threshold are dropped. In order to determine the dropping threshold, we only need to know queue occupancy information and do few comparison operations in core routers (so we call our scheme Queue Length based Fair Queueing (QLFQ)). We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ.</description><subject>Algorithm design and analysis</subject><subject>Bandwidth</subject><subject>Channel allocation</subject><subject>Computer networks</subject><subject>Computer science</subject><subject>Computer science education</subject><subject>Encoding</subject><subject>High-speed networks</subject><subject>Laboratories</subject><subject>Scalability</subject><isbn>9780769513812</isbn><isbn>0769513816</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2001</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj8tKxDAYRgMiKGNfYFZ5gdbcmou7oXgZGHWj6-Fv8sdGaju00eLbWxi_zdkdzkfIlrOKc-Zu903z8txUgjFeOS1qay9I4YxlRruaS8vFFSnm-ZOtk05JLq_J3c53CX_S8EEjpIm2MIQlhdxR6PvRQ07jQJeUu_E70xNOZezHhc4ZMt6Qywj9jMU_N-T94f6teSoPr4_7ZncoEzcqlyEy2dZBrBUsWqc8Z7bVBtYGWyMD9KjQBu2ti74VrQKMUANH53QwSsgN2Z69CRGPpyl9wfR7PB-Uf-NCRxg</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Zhai Mingyu</creator><creator>Gu Guanqun</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>Achieving fair bandwidth allocation without per-flow state</title><author>Zhai Mingyu ; Gu Guanqun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i174t-df03b5d20760f894c108b67a00385e0aece4e8d6c89fcb2b4aefa5a1e996d7423</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Algorithm design and analysis</topic><topic>Bandwidth</topic><topic>Channel allocation</topic><topic>Computer networks</topic><topic>Computer science</topic><topic>Computer science education</topic><topic>Encoding</topic><topic>High-speed networks</topic><topic>Laboratories</topic><topic>Scalability</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhai Mingyu</creatorcontrib><creatorcontrib>Gu Guanqun</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 Online</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>Zhai Mingyu</au><au>Gu Guanqun</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Achieving fair bandwidth allocation without per-flow state</atitle><btitle>Proceedings 2001 International Conference on Computer Networks and Mobile Computing</btitle><stitle>ICCNMC</stitle><date>2001</date><risdate>2001</risdate><spage>137</spage><epage>143</epage><pages>137-143</pages><isbn>9780769513812</isbn><isbn>0769513816</isbn><abstract>In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per flow state. Edge routers divide each flow into a set of layers using a linear encoding scheme and insert an appropriate label into each packet header. Core routers maintain a dropping threshold at each router; packets with a label greater than the threshold are dropped. In order to determine the dropping threshold, we only need to know queue occupancy information and do few comparison operations in core routers (so we call our scheme Queue Length based Fair Queueing (QLFQ)). We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ.</abstract><pub>IEEE</pub><doi>10.1109/ICCNMC.2001.962588</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9780769513812
ispartof Proceedings 2001 International Conference on Computer Networks and Mobile Computing, 2001, p.137-143
issn
language eng
recordid cdi_ieee_primary_962588
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Bandwidth
Channel allocation
Computer networks
Computer science
Computer science education
Encoding
High-speed networks
Laboratories
Scalability
title Achieving fair bandwidth allocation without per-flow state
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T23%3A27%3A19IST&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=Achieving%20fair%20bandwidth%20allocation%20without%20per-flow%20state&rft.btitle=Proceedings%202001%20International%20Conference%20on%20Computer%20Networks%20and%20Mobile%20Computing&rft.au=Zhai%20Mingyu&rft.date=2001&rft.spage=137&rft.epage=143&rft.pages=137-143&rft.isbn=9780769513812&rft.isbn_list=0769513816&rft_id=info:doi/10.1109/ICCNMC.2001.962588&rft_dat=%3Cieee_6IE%3E962588%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i174t-df03b5d20760f894c108b67a00385e0aece4e8d6c89fcb2b4aefa5a1e996d7423%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=962588&rfr_iscdi=true