{"id":"https://openalex.org/W7099513006","doi":null,"title":"Abstract Efficient Fair Queuing using Deficit Round Robin","display_name":"Abstract Efficient Fair Queuing using Deficit Round Robin","publication_year":2008,"publication_date":"2008-02-07","ids":{"openalex":"https://openalex.org/W7099513006"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.3614","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.3614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ipoint.vlsi.uiuc.edu/wireless/papers-p/p231-shreedhar.pdf","raw_type":"text"},"volume":null,"type":"conference-abstract","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052152737","display_name":"M. Shreedhar","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Shreedhar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102730096","display_name":"George Varghese","orcid":"https://orcid.org/0000-0002-8218-5701","observed_orcids":["https://orcid.org/0000-0002-8218-5701","https://orcid.org/0000-0002-5327-2697"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"George Varghese","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fair-queuing","display_name":"fair queuing","score":0.9490000009536743},{"id":"https://openalex.org/keywords/deficit-round-robin","display_name":"deficit round robin","score":0.8510000109672546},{"id":"https://openalex.org/keywords/network-scheduling","display_name":"network scheduling","score":0.5139999985694885},{"id":"https://openalex.org/keywords/packet-scheduling","display_name":"packet scheduling","score":0.5590000152587891},{"id":"https://openalex.org/keywords/throughput-fairness","display_name":"throughput fairness","score":0.6600000262260437},{"id":"https://openalex.org/keywords/hardware-implementation","display_name":"hardware implementation","score":0.48100000619888306},{"id":"https://openalex.org/keywords/distributed-queues","display_name":"distributed queues","score":0.6169999837875366}],"concepts":[{"id":"https://openalex.org/C143647952","wikidata":"https://www.wikidata.org/wiki/Q1392979","display_name":"Fair queuing","level":5,"score":0.9341999888420105},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.8313000202178955},{"id":"https://openalex.org/C141306801","wikidata":"https://www.wikidata.org/wiki/Q7979905","display_name":"Weighted round robin","level":5,"score":0.7839000225067139},{"id":"https://openalex.org/C200651375","wikidata":"https://www.wikidata.org/wiki/Q5532503","display_name":"Generalized processor sharing","level":5,"score":0.7261999845504761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6959999799728394},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6674000024795532},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5411999821662903},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5145999789237976},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4715999960899353},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.46230000257492065},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44699999690055847},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.4300000071525574},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.42500001192092896},{"id":"https://openalex.org/C196095461","wikidata":"https://www.wikidata.org/wiki/Q576842","display_name":"Queuing delay","level":3,"score":0.4219000041484833},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.4081000089645386},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.40299999713897705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3553999960422516},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.35510000586509705},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.3490000069141388},{"id":"https://openalex.org/C2992947560","wikidata":"https://www.wikidata.org/wiki/Q5167661","display_name":"Fair share","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.3167000114917755},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.31060001254081726},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C113508815","wikidata":"https://www.wikidata.org/wiki/Q193446","display_name":"Packet switching","level":3,"score":0.298799991607666},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.3614","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.3614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ipoint.vlsi.uiuc.edu/wireless/papers-p/p231-shreedhar.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2171872428","https://openalex.org/W2097831241","https://openalex.org/W7095904546","https://openalex.org/W2172124633","https://openalex.org/W2149234685","https://openalex.org/W7095922931","https://openalex.org/W1965054635","https://openalex.org/W2077141205","https://openalex.org/W2115272462","https://openalex.org/W1968420854"],"abstract_inverted_index":{"Fair":[0],"queuing":[1,26,71],"is":[2,51,58,118,128],"a":[3,11,16,42,87,115],"technique":[4],"that":[5,27,72,93],"allows":[6],"each":[7],"flow":[8],"passing":[9],"through":[10],"network":[12,20],"device":[13],"to":[14,34,40,113,121,131,145],"have":[15,73],"fair":[17,25,70,91],"share":[18],"of":[19,54,69,90,107],"resources.":[21],"Previous":[22],"schemes":[23,46],"for":[24],"achieved":[28],"nearly":[29,102],"perfect":[30,103],"fairness":[31,104],"were":[32],"expensive":[33,59],"implement:":[35],"specifi-cally,":[36],"the":[37,52,64,77],"work":[38,112],"required":[39],"process":[41,114],"packet":[43],"in":[44,76,105,123],"these":[45],"was":[47],"O(log(n)),":[48],"where":[49,135],"n":[50],"number":[53],"active":[55],"flows.":[56],"This":[57],"at":[60],"high":[61],"speeds.":[62],"On":[63],"other":[65,132],"hand,":[66],"cheaper":[67],"approximations":[68],"been":[74],"reported":[75],"literature":[78],"exhibit":[79],"unfair":[80],"behavior.":[81],"In":[82],"this":[83],"paper,":[84],"we":[85,94],"describe":[86],"new":[88],"approximation":[89],"queuing,":[92],"call":[95],"Deficit":[96,125],"Round":[97,126],"Robin.":[98],"Our":[99],"scheme":[100],"achieves":[101],"terms":[106],"throughput,":[108],"requires":[109],"only":[110],"O(1)":[111],"packet,":[116],"and":[117,144],"simple":[119],"enough":[120],"implement":[122],"hardware.":[124],"Robin":[127],"also":[129],"applicable":[130],"scheduling":[133],"problems":[134],"servicing":[136],"cannot":[137],"be":[138],"broken":[139],"up":[140],"into":[141],"smaller":[142],"units,":[143],"distributed":[146],"queues.":[147],"1":[148]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-27T00:00:00"}