{"id":"https://openalex.org/W7143531100","doi":"https://doi.org/10.1109/access.2026.3678615","title":"A CQF Scheduling Algorithm Based on ACO in Time-Sensitive Networking","display_name":"A CQF Scheduling Algorithm Based on ACO in Time-Sensitive Networking","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7143531100","doi":"https://doi.org/10.1109/access.2026.3678615"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3678615","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3678615","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3678615","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130913857","display_name":"Fei Fang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210165038","display_name":"University of Chinese Academy of Sciences","ror":"https://ror.org/05qbk4x57","country_code":"CN","type":"education","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210165038"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fei Fang","raw_affiliation_strings":["University of Chinese Academy of Sciences, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0002-2449-4589","affiliations":[{"raw_affiliation_string":"University of Chinese Academy of Sciences, Beijing, China","institution_ids":["https://openalex.org/I4210165038"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130932275","display_name":"Hanghang Hou","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101356","display_name":"Beijing Founder Electronics (China)","ror":"https://ror.org/00nwrzz95","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210101356"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hanghang Hou","raw_affiliation_strings":["Beijing Qiaohe Technology Company Ltd., Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Qiaohe Technology Company Ltd., Beijing, China","institution_ids":["https://openalex.org/I4210101356"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36081432,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"49655","last_page":"49665"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12216","display_name":"Network Time Synchronization Technologies","score":0.9491999745368958,"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/T12216","display_name":"Network Time Synchronization Technologies","score":0.9491999745368958,"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.01119999960064888,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.0038999998942017555,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6514000296592712},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5099999904632568},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4088999927043915},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3953999876976013},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.28700000047683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7634999752044678},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6514000296592712},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5099999904632568},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4025000035762787},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3953999876976013},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.357699990272522},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.33799999952316284},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3285999894142151},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3122999966144562},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.28700000047683716},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28529998660087585},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2556000053882599},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3678615","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3678615","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:4b19213ad81a489297787f6752b3ca12","is_oa":true,"landing_page_url":"https://doaj.org/article/4b19213ad81a489297787f6752b3ca12","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 14, Pp 49655-49665 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3678615","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3678615","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,140,171],"booming":[1],"development":[2,20],"of":[3,12,66,80,87,111,157,183,195],"intelligent":[4],"manufacturing":[5],"has":[6,76],"increasingly":[7],"demanded":[8],"scalability":[9],"and":[10,25,34,45,54,57,73,94,160,168,187],"flexibility":[11],"industrial":[13,16,19],"networks.":[14],"Dedicated":[15],"networks":[17],"hinder":[18],"due":[21,83],"to":[22,29,84,118,124],"rigid":[23],"architecture":[24],"incompatible":[26],"protocols,":[27],"unable":[28],"support":[30],"low-cost":[31],"production":[32],"adjustments":[33],"cross-unit":[35],"collaboration.":[36],"Time-Sensitive":[37],"Networking":[38],"(TSN)":[39],"delivers":[40],"device":[41],"interconnection,":[42],"flexible":[43],"adaptation":[44],"low-latency":[46],"transmission":[47],"with":[48],"standardized":[49],"Ethernet,":[50],"dynamic":[51],"resource":[52,188],"allocation":[53,163],"deterministic":[55],"scheduling,":[56],"is":[58,199],"regarded":[59],"as":[60],"the":[61,67,78,109,112,119,192],"optimal":[62],"solution.":[63],"As":[64],"one":[65],"core":[68,151],"scheduling":[69,89,100,184],"mechanisms,":[70],"Cyclic":[71],"Queuing":[72],"Forwarding":[74],"(CQF)":[75],"become":[77],"focus":[79],"current":[81],"research":[82],"its":[85,196],"advantages":[86],"concise":[88],"logic,":[90],"low":[91],"implementation":[92],"cost,":[93],"predictable":[95],"latency.":[96],"Although":[97],"existing":[98],"heuristic":[99,179],"algorithms":[101,180],"for":[102],"CQF":[103,133],"can":[104],"quickly":[105],"provide":[106],"feasible":[107],"solutions,":[108],"quality":[110],"solutions":[113],"depends":[114],"on":[115,137,149],"their":[116],"fitness":[117],"problem,":[120],"which":[121],"may":[122],"lead":[123],"local":[125],"optima.":[126],"In":[127],"this":[128],"study,":[129],"we":[130],"propose":[131],"a":[132,143],"Scheduling":[134],"Algorithm":[135],"based":[136,148],"ACO":[138],"(ACO-CQF).":[139],"algorithm":[141],"utilizes":[142],"spatiotemporal":[144],"2-dimensional":[145],"optimization":[146,156],"framework":[147],"coupled":[150],"decision":[152],"variables,":[153],"achieving":[154],"joint":[155],"multi-path":[158],"selection":[159,167],"injection":[161],"slot":[162],"through":[164],"roulette":[165],"wheel":[166],"pheromone":[169],"guidance.":[170],"experimental":[172],"results":[173],"show":[174],"that":[175],"ACO-CQF":[176],"outperforms":[177],"traditional":[178],"in":[181],"terms":[182],"success":[185],"rate":[186,194],"utilization":[189],"rate,":[190],"while":[191],"growth":[193],"time":[197],"consumption":[198],"within":[200],"an":[201],"acceptable":[202],"range.":[203]},"counts_by_year":[],"updated_date":"2026-04-04T06:10:10.580331","created_date":"2026-03-31T00:00:00"}