{"id":"https://openalex.org/W4414539054","doi":"https://doi.org/10.1109/icc52391.2025.11161465","title":"Theory Guided Data-Driven Method for Scalable Scheduling in Time-Sensitive Network","display_name":"Theory Guided Data-Driven Method for Scalable Scheduling in Time-Sensitive Network","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4414539054","doi":"https://doi.org/10.1109/icc52391.2025.11161465"},"language":"en","primary_location":{"id":"doi:10.1109/icc52391.2025.11161465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11161465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2025 - IEEE International Conference on Communications","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/A5101315059","display_name":"Renhong Lu","orcid":"https://orcid.org/0009-0001-9997-5400"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ruotian Lu","raw_affiliation_strings":["Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023426901","display_name":"Qimin Xu","orcid":"https://orcid.org/0000-0001-9678-6295"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qimin Xu","raw_affiliation_strings":["Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100671567","display_name":"Yanzhou Zhang","orcid":"https://orcid.org/0000-0003-1610-4544"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanzhou Zhang","raw_affiliation_strings":["Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038267080","display_name":"Cailian Chen","orcid":"https://orcid.org/0000-0001-6533-8713"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Cailian Chen","raw_affiliation_strings":["Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018486987","display_name":"Lei Xu","orcid":"https://orcid.org/0000-0002-4894-804X"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lei Xu","raw_affiliation_strings":["Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Department of Automation,Shanghai,P. R. China,200240","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5101315059"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32425384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3581","last_page":"3586"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12216","display_name":"Network Time Synchronization Technologies","score":0.9638000130653381,"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.9638000130653381,"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/T13062","display_name":"Cognitive Computing and Networks","score":0.920199990272522,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6787999868392944},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6628000140190125},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.45899999141693115},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4438999891281128},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.42649999260902405},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.42289999127388},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4163999855518341},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4036000072956085}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8014000058174133},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6787999868392944},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6628000140190125},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6581000089645386},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.45899999141693115},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4438999891281128},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.42649999260902405},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.42289999127388},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4163999855518341},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4036000072956085},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.39160001277923584},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.34940001368522644},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.33090001344680786},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.30160000920295715},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.29899999499320984},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27410000562667847},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc52391.2025.11161465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11161465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2025 - IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2884726459","https://openalex.org/W2899152924","https://openalex.org/W2983260997","https://openalex.org/W3047177858","https://openalex.org/W4206103431","https://openalex.org/W4293193894","https://openalex.org/W4295916563","https://openalex.org/W4297798719","https://openalex.org/W4365790250","https://openalex.org/W4386243260","https://openalex.org/W4391583829","https://openalex.org/W4395680661","https://openalex.org/W4402806130"],"related_works":[],"abstract_inverted_index":{"Time-Sensitive":[0],"Networking":[1],"(TSN)":[2],"has":[3],"emerged":[4],"as":[5,128],"a":[6,74,98,105,113,132,159],"vital":[7],"networking":[8],"paradigm":[9],"for":[10,26,151],"timely":[11],"and":[12,33,51,57,64,87,93,148],"reliable":[13],"data":[14],"transmission.":[15],"Recently,":[16],"researchers":[17],"are":[18],"increasingly":[19],"focusing":[20],"on":[21,36,213],"the":[22,43,60,125,129,142,156,168,176,192,210,214],"scalability":[23],"of":[24,45,48,66,108,171,194],"algorithms":[25],"scheduling":[27,76,143,157,169,195],"problems":[28],"over":[29,89],"diverse":[30],"network":[31,99,163],"topologies":[32],"flows":[34,179],"based":[35],"deep":[37],"reinforcement":[38],"learning":[39],"methods":[40],"(DRL).":[41],"However,":[42],"lack":[44],"reasonable":[46,106],"characterization":[47,107,127],"flow":[49,80,91,109,115,146],"conflicts":[50,110],"dependencies":[52,177],"leads":[53],"to":[54,103,137,166,188,220],"limited":[55],"generalization":[56,86],"schedulability":[58,88],"under":[59],"discrepancies":[61],"in":[62,141,205],"characteristics":[63,92],"number":[65],"flows.":[67],"To":[68],"address":[69],"those":[70],"issues,":[71],"we":[72,96],"propose":[73],"data-driven":[75,133],"method":[77,134],"guided":[78],"by":[79,111,200],"sequence":[81,116,170],"conflict":[82],"theory,":[83],"which":[84,174],"improves":[85],"different":[90,181],"topologies.":[94],"Specifically,":[95],"design":[97],"feature":[100],"encoding":[101],"scheme":[102],"formulate":[104],"integrating":[112],"graph-based":[114],"representation":[117],"model":[118],"with":[119,180],"graph":[120],"attention":[121],"networks":[122],"(GATs).":[123],"Regarding":[124],"abovementioned":[126],"acknowledge":[130],"embedding,":[131],"is":[135,164,198,216],"designed":[136,165],"learn":[138],"two":[139],"sub-policies":[140],"process,":[144,158],"including":[145],"selection":[147],"solution":[149],"searching":[150],"each":[152],"selected":[153],"flow.":[154],"Within":[155],"multi-head":[160],"attention-based":[161],"neural":[162],"generate":[167],"variable":[172],"length,":[173],"characterizes":[175],"between":[178],"numbers.":[182],"Simulation":[183],"results":[184],"demonstrate":[185],"that":[186],"compared":[187,219],"existing":[189],"DRL-based":[190],"methods,":[191],"runtime":[193],"at":[196,201],"scale":[197],"increased":[199],"least":[202],"100":[203],"%":[204],"complex":[206],"traffic":[207],"scenarios":[208],"while":[209],"slot":[211],"utilization":[212],"links":[215],"also":[217],"improved":[218],"other":[221],"methods.":[222]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}