{"id":"https://openalex.org/W2172107226","doi":"https://doi.org/10.1109/rttas.2004.1317300","title":"Loss-tolerant QoS using firm constraints in guaranteed rate networks","display_name":"Loss-tolerant QoS using firm constraints in guaranteed rate networks","publication_year":2004,"publication_date":"2004-11-12","ids":{"openalex":"https://openalex.org/W2172107226","doi":"https://doi.org/10.1109/rttas.2004.1317300","mag":"2172107226"},"language":"en","primary_location":{"id":"doi:10.1109/rttas.2004.1317300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2004.1317300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","raw_type":"proceedings-article"},"type":"article","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/A5024626195","display_name":"Anis Koub\u00e2a","orcid":"https://orcid.org/0000-0003-3787-7423"},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"A. Koubaa","raw_affiliation_strings":["LORIA Research Laboratory, National Polytechnic Institute of Lorraine, France"],"affiliations":[{"raw_affiliation_string":"LORIA Research Laboratory, National Polytechnic Institute of Lorraine, France","institution_ids":["https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100662716","display_name":"Ye\u2010Qiong Song","orcid":"https://orcid.org/0000-0002-3949-340X"},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210164347","display_name":"Henri Poincar\u00e9 Institute","ror":null,"country_code":"FR","type":null,"lineage":["https://openalex.org/I4210164347"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ye-Qiong Song","raw_affiliation_strings":["LORIA Research Laboratory, Henri Poincar\u00e9 University, Nancy I, France","[LORIA Research Laboratory, Henri Poincar\u00e9 University, Nancy I, France]"],"affiliations":[{"raw_affiliation_string":"LORIA Research Laboratory, Henri Poincar\u00e9 University, Nancy I, France","institution_ids":["https://openalex.org/I4210164347","https://openalex.org/I90183372","https://openalex.org/I4210121838"]},{"raw_affiliation_string":"[LORIA Research Laboratory, Henri Poincar\u00e9 University, Nancy I, France]","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024626195"],"corresponding_institution_ids":["https://openalex.org/I4210121838"],"apc_list":null,"apc_paid":null,"fwci":1.9925,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89381988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"526","last_page":"533"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9990000128746033,"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/weighted-fair-queueing","display_name":"Weighted fair queueing","score":0.9530673027038574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7686156630516052},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6596492528915405},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5832511186599731},{"id":"https://openalex.org/keywords/network-calculus","display_name":"Network calculus","score":0.554044246673584},{"id":"https://openalex.org/keywords/packet-loss","display_name":"Packet loss","score":0.5327190160751343},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5029968619346619},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.45923978090286255},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4298551678657532},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4197510778903961},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39483335614204407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3487306833267212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11924976110458374}],"concepts":[{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.9530673027038574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7686156630516052},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6596492528915405},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5832511186599731},{"id":"https://openalex.org/C2778693205","wikidata":"https://www.wikidata.org/wiki/Q7000967","display_name":"Network calculus","level":3,"score":0.554044246673584},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.5327190160751343},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5029968619346619},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.45923978090286255},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4298551678657532},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4197510778903961},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39483335614204407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3487306833267212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11924976110458374},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/rttas.2004.1317300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2004.1317300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.539.52","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.539.52","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dei.isep.ipp.pt/~akoubaa/publications/RTAS04.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00099989v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00099989","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10th IEEE Real-Time and Embedded Technology and Applications - RTAS'04, 2004, Toronto, Canada, pp.526--535","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1521048538","https://openalex.org/W1867018545","https://openalex.org/W1982865788","https://openalex.org/W2005414916","https://openalex.org/W2007870654","https://openalex.org/W2041948769","https://openalex.org/W2073440460","https://openalex.org/W2093601931","https://openalex.org/W2096535721","https://openalex.org/W2098811885","https://openalex.org/W2100892891","https://openalex.org/W2121529758","https://openalex.org/W2132294014","https://openalex.org/W2139475785","https://openalex.org/W2140710806","https://openalex.org/W2143636443","https://openalex.org/W2144355217","https://openalex.org/W2147206873","https://openalex.org/W2158863575","https://openalex.org/W2612591435","https://openalex.org/W3163467684"],"related_works":["https://openalex.org/W1999278181","https://openalex.org/W2099129022","https://openalex.org/W2547929082","https://openalex.org/W2038057021","https://openalex.org/W2385305544","https://openalex.org/W1895935174","https://openalex.org/W2072018448","https://openalex.org/W2379743036","https://openalex.org/W2097921853","https://openalex.org/W4300520780"],"abstract_inverted_index":{"We":[0,54],"propose":[1],"a":[2,64,129],"trade-off":[3],"between":[4],"hard":[5],"and":[6,19,126],"soft":[7],"real-time":[8,35],"guarantees":[9,88],"to":[10,62,76,84,139],"maintain":[11],"an":[12],"acceptable":[13],"QoS":[14],"guarantee":[15,134],"in":[16],"overload":[17],"condition":[18],"maximize":[20],"efficiently":[21],"the":[22,40,56,72,80,109,115],"utilization":[23],"of":[24,29,58],"network":[25,95,103],"resources.":[26,96],"The":[27,97],"key":[28],"our":[30],"solution":[31],"is":[32,99],"that":[33],"many":[34],"applications":[36],"are":[37,51],"loss-tolerant,":[38],"but":[39],"loss":[41],"profile":[42],"must":[43],"be":[44],"well":[45],"defined":[46],"since":[47],"successive":[48],"packet":[49],"losses":[50],"not":[52],"suitable.":[53],"use":[55],"concept":[57],"(m,k)-firm":[59],"timing":[60,82],"constraints":[61,83],"define":[63],"novel":[65],"guaranteed":[66],"loss-tolerant":[67],"QoS.":[68],"Therefore,":[69],"we":[70],"extend":[71],"basic":[73],"WFQ":[74,141],"algorithm":[75,117,142],"take":[77],"into":[78],"account":[79],"firm":[81],"provide":[85],"lower":[86],"delay":[87,111,133],"without":[89,143],"violating":[90],"bandwidth":[91,146],"fairness":[92],"or":[93],"misusing":[94],"proposal":[98],"called":[100],"(m,k)-WFQ.":[101],"Using":[102],"calculus":[104],"formalism,":[105],"analytic":[106],"study":[107],"gives":[108],"deterministic":[110],"bound":[112],"provided":[113],"by":[114,136],"(m,k)-WFQ":[116,137],"for":[118],"upper":[119],"bounded":[120],"arrival":[121],"curve":[122],"traffic.":[123],"Theoretical":[124],"results":[125],"simulations":[127],"show":[128],"noticeable":[130],"improvement":[131],"on":[132],"made":[135],"compared":[138],"standard":[140],"much":[144],"degrading":[145],"fairness.":[147]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}