{"id":"https://openalex.org/W2100407564","doi":"https://doi.org/10.1109/iwqos.2004.1309364","title":"Delay bound Guarantees with WFQ-based CBQ discipline","display_name":"Delay bound Guarantees with WFQ-based CBQ discipline","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2100407564","doi":"https://doi.org/10.1109/iwqos.2004.1309364","mag":"2100407564"},"language":"en","primary_location":{"id":"doi:10.1109/iwqos.2004.1309364","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos.2004.1309364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5058822904","display_name":"Anne Millet","orcid":null},"institutions":[{"id":"https://openalex.org/I134560555","display_name":"Universit\u00e9 Toulouse III - Paul Sabatier","ror":"https://ror.org/02v6kpv12","country_code":"FR","type":"education","lineage":["https://openalex.org/I134560555"]},{"id":"https://openalex.org/I4210119061","display_name":"Institut de Recherche en Informatique de Toulouse","ror":"https://ror.org/01rx4qw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I205747304","https://openalex.org/I4210119061","https://openalex.org/I4210152422","https://openalex.org/I4405258862","https://openalex.org/I4405259414"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Millet","raw_affiliation_strings":["IRIT and Paul Sabatier University, France","IRIT, Paul Sabatier Univ., France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIT and Paul Sabatier University, France","institution_ids":["https://openalex.org/I134560555","https://openalex.org/I4210119061"]},{"raw_affiliation_string":"IRIT, Paul Sabatier Univ., France","institution_ids":["https://openalex.org/I134560555","https://openalex.org/I4210119061"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058093080","display_name":"Zoubir Mammeri","orcid":"https://orcid.org/0000-0003-4164-9597"},"institutions":[{"id":"https://openalex.org/I134560555","display_name":"Universit\u00e9 Toulouse III - Paul Sabatier","ror":"https://ror.org/02v6kpv12","country_code":"FR","type":"education","lineage":["https://openalex.org/I134560555"]},{"id":"https://openalex.org/I4210119061","display_name":"Institut de Recherche en Informatique de Toulouse","ror":"https://ror.org/01rx4qw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I205747304","https://openalex.org/I4210119061","https://openalex.org/I4210152422","https://openalex.org/I4405258862","https://openalex.org/I4405259414"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Z. Mammeri","raw_affiliation_strings":["IRIT and Paul Sabatier University, France","IRIT, Paul Sabatier Univ., France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIT and Paul Sabatier University, France","institution_ids":["https://openalex.org/I134560555","https://openalex.org/I4210119061"]},{"raw_affiliation_string":"IRIT, Paul Sabatier Univ., France","institution_ids":["https://openalex.org/I134560555","https://openalex.org/I4210119061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15625163,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"106","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"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.9998000264167786,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8410715460777283},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.7530049085617065},{"id":"https://openalex.org/keywords/network-calculus","display_name":"Network calculus","score":0.7352980375289917},{"id":"https://openalex.org/keywords/weighted-fair-queueing","display_name":"Weighted fair queueing","score":0.6840292811393738},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5310022830963135},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5127495527267456},{"id":"https://openalex.org/keywords/generalized-processor-sharing","display_name":"Generalized processor sharing","score":0.5024845600128174},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47619688510894775},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4565108120441437},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4543234407901764},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43599626421928406},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43490609526634216},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40002748370170593},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3821130692958832},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24838891625404358},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.1792013943195343},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.16586673259735107},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.16130244731903076},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09405910968780518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07667380571365356}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8410715460777283},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.7530049085617065},{"id":"https://openalex.org/C2778693205","wikidata":"https://www.wikidata.org/wiki/Q7000967","display_name":"Network calculus","level":3,"score":0.7352980375289917},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.6840292811393738},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5310022830963135},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5127495527267456},{"id":"https://openalex.org/C200651375","wikidata":"https://www.wikidata.org/wiki/Q5532503","display_name":"Generalized processor sharing","level":5,"score":0.5024845600128174},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47619688510894775},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4565108120441437},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4543234407901764},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43599626421928406},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43490609526634216},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40002748370170593},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3821130692958832},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24838891625404358},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.1792013943195343},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.16586673259735107},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.16130244731903076},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09405910968780518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07667380571365356},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iwqos.2004.1309364","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos.2004.1309364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W53500378","https://openalex.org/W1655359704","https://openalex.org/W1977867261","https://openalex.org/W2058819785","https://openalex.org/W2083550667","https://openalex.org/W2098375698","https://openalex.org/W2147206873","https://openalex.org/W2150395520","https://openalex.org/W2163931546","https://openalex.org/W4253826867","https://openalex.org/W4285719527","https://openalex.org/W6636989516"],"related_works":["https://openalex.org/W2379707329","https://openalex.org/W2107682335","https://openalex.org/W3151854040","https://openalex.org/W1566006727","https://openalex.org/W4205575766","https://openalex.org/W1867018545","https://openalex.org/W2581865514","https://openalex.org/W2132767805","https://openalex.org/W1912482272","https://openalex.org/W1895935174"],"abstract_inverted_index":{"Class":[0],"Based":[1],"Queueing":[2],"(CBQ)":[3],"is":[4,18,28,52,111],"a":[5,23,55,82,99,128],"packet":[6],"scheduling":[7],"discipline":[8,39],"that":[9,60,130],"enables":[10],"hierarchical":[11],"link-sharing.":[12],"Compared":[13],"to":[14,40,97,125,137],"other":[15,47],"algorithms,":[16],"it":[17,95],"modular":[19],"and":[20,26,30,85,119],"intuitive":[21],"in":[22,54,81],"first":[24],"approach,":[25],"so":[27],"implemented":[29],"used":[31],"nowadays.":[32],"In":[33],"this":[34],"paper,":[35],"we":[36,104,120],"adapt":[37],"the":[38,90,139],"schedule":[41],"critical":[42],"real-time":[43],"flows":[44],"mixed":[45],"with":[46,86],"kinds":[48],"of":[49,92,117,141],"traffic,":[50],"as":[51],"necessary":[53],"DiffServ":[56],"environment":[57],"This":[58],"requires":[59],"some":[61,106],"guarantees":[62],"must":[63],"be":[64],"provided":[65],"deterministically,":[66],"particularly":[67],"on":[68,114],"queueing":[69],"delay":[70,74],"bounds.":[71],"Yet":[72],"theoretical":[73],"bounds":[75],"for":[76],"CBQ":[77],"were":[78],"never":[79],"expressed":[80],"general":[83],"case":[84,101],"end-to-end":[87],"derivation,":[88],"because":[89],"nesting":[91],"mechanisms":[93],"makes":[94],"hard":[96],"predict":[98],"worst":[100],"scenario.":[102],"Here":[103],"study":[105],"cases":[107],"where":[108],"an":[109],"analysis":[110],"possible,":[112],"focusing":[113],"two":[115],"variants":[116],"CBQ,":[118],"use":[121],"network":[122],"calculus":[123],"technique":[124],"set":[126],"up":[127],"bound":[129],"seems":[131],"realistic.":[132],"We":[133],"then":[134],"show":[135],"simulations":[136],"check":[138],"precision":[140],"our":[142],"results.":[143]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}