{"id":"https://openalex.org/W1506934075","doi":"https://doi.org/10.1109/iscn.2006.1662534","title":"Heart-like fair queuing algorithms (HLFQA)","display_name":"Heart-like fair queuing algorithms (HLFQA)","publication_year":2006,"publication_date":"2006-08-03","ids":{"openalex":"https://openalex.org/W1506934075","doi":"https://doi.org/10.1109/iscn.2006.1662534","mag":"1506934075"},"language":"en","primary_location":{"id":"doi:10.1109/iscn.2006.1662534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscn.2006.1662534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 International Symposium on Computer Networks","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doras.dcu.ie/15514/1/collier15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111110366","display_name":"Radu Drago\u0219","orcid":null},"institutions":[{"id":"https://openalex.org/I42934936","display_name":"Dublin City University","ror":"https://ror.org/04a1a1e81","country_code":"IE","type":"education","lineage":["https://openalex.org/I42934936"]},{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]},{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"R. Dragos","raw_affiliation_strings":["School of Electronic Engineering, University of Dublin, Ireland","Sch. of Electron. Eng., Dublin City Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electronic Engineering, University of Dublin, Ireland","institution_ids":["https://openalex.org/I100930933","https://openalex.org/I205274468"]},{"raw_affiliation_string":"Sch. of Electron. Eng., Dublin City Univ.#TAB#","institution_ids":["https://openalex.org/I42934936"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029543164","display_name":"Martin Collier","orcid":"https://orcid.org/0000-0002-6410-3899"},"institutions":[{"id":"https://openalex.org/I42934936","display_name":"Dublin City University","ror":"https://ror.org/04a1a1e81","country_code":"IE","type":"education","lineage":["https://openalex.org/I42934936"]},{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]},{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"M. Collier","raw_affiliation_strings":["School of Electronic Engineering, University of Dublin, Ireland","Sch. of Electron. Eng., Dublin City Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electronic Engineering, University of Dublin, Ireland","institution_ids":["https://openalex.org/I100930933","https://openalex.org/I205274468"]},{"raw_affiliation_string":"Sch. of Electron. Eng., Dublin City Univ.#TAB#","institution_ids":["https://openalex.org/I42934936"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111110366"],"corresponding_institution_ids":["https://openalex.org/I100930933","https://openalex.org/I205274468","https://openalex.org/I42934936"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07101618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"6"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8024742603302002},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6103990077972412},{"id":"https://openalex.org/keywords/weighted-fair-queueing","display_name":"Weighted fair queueing","score":0.5779448747634888},{"id":"https://openalex.org/keywords/fair-queuing","display_name":"Fair queuing","score":0.5626102089881897},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5472842454910278},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5397812128067017},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.49066007137298584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4881032407283783},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.3565387725830078},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.32050472497940063},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.20415976643562317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14295312762260437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09729260206222534},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07842177152633667}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8024742603302002},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6103990077972412},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.5779448747634888},{"id":"https://openalex.org/C143647952","wikidata":"https://www.wikidata.org/wiki/Q1392979","display_name":"Fair queuing","level":5,"score":0.5626102089881897},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5472842454910278},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5397812128067017},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.49066007137298584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4881032407283783},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.3565387725830078},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32050472497940063},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.20415976643562317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14295312762260437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09729260206222534},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07842177152633667},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/iscn.2006.1662534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscn.2006.1662534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 International Symposium on Computer Networks","raw_type":"proceedings-article"},{"id":"pmh:oai:doras.dcu.ie:15514","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401511","display_name":"Dublin City University Open Access Institutional Repository (Dublin City University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I42934936","host_organization_name":"Dublin City University","host_organization_lineage":["https://openalex.org/I42934936"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:http://www.rian.ie/42306/","is_oa":true,"landing_page_url":"http://doras.dcu.ie/15514/","pdf_url":"https://doras.dcu.ie/15514/1/collier15.pdf","source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I115570527","host_organization_name":"Dublin Institute of Technology","host_organization_lineage":["https://openalex.org/I115570527"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dragos, Radu-Calin and Collier, Martin  (2006) Heart-like fair queuing algorithms (HLFQA).  In: ISCN 2006 - International Symposium on Computer Networks, 16-18 June 2006, Istanbul, Turkey.  ISBN 1-4244-0491-6","raw_type":"Other"}],"best_oa_location":{"id":"pmh:http://www.rian.ie/42306/","is_oa":true,"landing_page_url":"http://doras.dcu.ie/15514/","pdf_url":"https://doras.dcu.ie/15514/1/collier15.pdf","source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I115570527","host_organization_name":"Dublin Institute of Technology","host_organization_lineage":["https://openalex.org/I115570527"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dragos, Radu-Calin and Collier, Martin  (2006) Heart-like fair queuing algorithms (HLFQA).  In: ISCN 2006 - International Symposium on Computer Networks, 16-18 June 2006, Istanbul, Turkey.  ISBN 1-4244-0491-6","raw_type":"Other"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W1506934075.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1538860972","https://openalex.org/W1651117873","https://openalex.org/W1977867261","https://openalex.org/W2073440460","https://openalex.org/W2097831241","https://openalex.org/W2099440788","https://openalex.org/W2115213453","https://openalex.org/W2116142303","https://openalex.org/W2121523570","https://openalex.org/W2139150553","https://openalex.org/W2139475785","https://openalex.org/W2158733823","https://openalex.org/W2168697986","https://openalex.org/W2172124633"],"related_works":["https://openalex.org/W2581865514","https://openalex.org/W2132767805","https://openalex.org/W1912482272","https://openalex.org/W4246924208","https://openalex.org/W3149321381","https://openalex.org/W2145963615","https://openalex.org/W4205575766","https://openalex.org/W1960238564","https://openalex.org/W2391505263","https://openalex.org/W2126330374"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2],"new":[3],"family":[4],"of":[5,16],"fair,":[6],"work":[7],"conserving":[8],"traffic":[9],"scheduling":[10],"mechanisms":[11],"that":[12],"imitate":[13],"the":[14,17,21,31],"behavior":[15],"human":[18],"heart":[19],"in":[20,55],"cardiovascular":[22],"system.":[23],"The":[24,47],"algorithms":[25,48],"have":[26],"MAX":[27,29],"(where":[28],"is":[30],"maximum":[32],"packet":[33],"size)":[34],"fairness":[35],"and":[36,40],"O(log":[37],"N)":[38],"complexity":[39],"thus":[41],"compare":[42],"favorably":[43],"with":[44],"existing":[45],"algorithms.":[46],"are":[49],"simple":[50],"enough":[51],"to":[52],"be":[53],"implemented":[54],"hardware":[56]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}