{"id":"https://openalex.org/W7130318599","doi":"https://doi.org/10.1109/tencon66050.2025.11375027","title":"Age Optimal Scheduling for a Linear Multiflow Network with Transmission Constraints","display_name":"Age Optimal Scheduling for a Linear Multiflow Network with Transmission Constraints","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W7130318599","doi":"https://doi.org/10.1109/tencon66050.2025.11375027"},"language":null,"primary_location":{"id":"doi:10.1109/tencon66050.2025.11375027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon66050.2025.11375027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2025 - 2025 IEEE Region 10 Conference (TENCON)","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/A5066037472","display_name":"Teena Mary Treesa","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Teena Mary Treesa","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing,Dept. of Electronics and Communication Engg.,Kancheepuram,Chennai,India,600 127"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing,Dept. of Electronics and Communication Engg.,Kancheepuram,Chennai,India,600 127","institution_ids":["https://openalex.org/I39244652"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5126281803","display_name":"K. Premkumar","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Premkumar","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing,Dept. of Electronics and Communication Engg.,Kancheepuram,Chennai,India,600 127"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing,Dept. of Electronics and Communication Engg.,Kancheepuram,Chennai,India,600 127","institution_ids":["https://openalex.org/I39244652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39244652"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65578337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"679","last_page":"683"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9991000294685364,"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/T13553","display_name":"Age of Information Optimization","score":0.9991000294685364,"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":9.999999747378752e-05,"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/T12079","display_name":"IoT Networks and Protocols","score":9.999999747378752e-05,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6245999932289124},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5444999933242798},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.49300000071525574},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4880000054836273},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4674000144004822},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.46160000562667847},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4153999984264374},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4124000072479248}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6445000171661377},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6245999932289124},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6176000237464905},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5444999933242798},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.49300000071525574},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4880000054836273},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4674000144004822},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.46160000562667847},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4153999984264374},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4124000072479248},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.3431999981403351},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.3091000020503998},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.30250000953674316},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.28049999475479126},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.2578999996185303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tencon66050.2025.11375027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon66050.2025.11375027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2025 - 2025 IEEE Region 10 Conference (TENCON)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5053757429122925}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1993918491","https://openalex.org/W2908781995","https://openalex.org/W2962933829","https://openalex.org/W3083217593","https://openalex.org/W3137144115","https://openalex.org/W3186754945","https://openalex.org/W3212969987","https://openalex.org/W4205119721","https://openalex.org/W4239466562","https://openalex.org/W4379740692","https://openalex.org/W4405812193","https://openalex.org/W4411171722"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"Paper,":[2],"we":[3,64],"consider":[4],"a":[5,9,44,66,91,102,114,119,135,149],"scheduling":[6,36,123,146,159],"problem":[7,67,89,97],"in":[8,107],"network":[10,55],"with":[11,43,68,154],"three":[12],"nodes":[13],"and":[14,30,53,118,143],"two":[15],"flows":[16,27,33],"using":[17],"an":[18],"Age":[19,83],"of":[20,25,84,157],"Information":[21],"metric.":[22],"The":[23,96,128,140],"paths":[24],"the":[26,32,35,54,79,88,108,126,155],"are":[28,131],"different,":[29],"hence,":[31],"affect":[34],"metrics":[37],"differently.":[38],"Each":[39],"node":[40,74],"is":[41],"equipped":[42],"one-buffer":[45],"for":[46,125],"each":[47,73],"flow":[48],"that":[49,75,151],"passes":[50],"through":[51],"it,":[52],"has":[56],"general":[57],"interference":[58],"constraints.":[59],"For":[60],"stochastic":[61],"packet":[62],"arrivals,":[63],"pose":[65],"constraints":[69],"on":[70],"energy":[71],"at":[72],"aims":[76],"to":[77,133],"minimise":[78],"Expected":[80],"Weighted":[81],"Sum":[82],"Information.":[85],"We":[86,111],"formulate":[87],"as":[90],"Constrained":[92],"Markov":[93],"Decision":[94],"Process.":[95],"can":[98],"be":[99],"solved":[100],"by":[101],"linear":[103],"program,":[104],"which":[105],"results":[106],"optimal":[109],"policy.":[110],"also":[112],"propose":[113],"near-optimal":[115,136],"heuristic":[116,142],"policy":[117,124],"low-complexity":[120],"Drift-Plus-Penalty":[121],"based":[122,145],"problem.":[127],"proposed":[129,141],"policies":[130,147],"shown":[132],"have":[134,148],"average":[137],"age":[138],"performance.":[139],"Drift-PlusPenalty":[144],"complexity":[150],"increases":[152],"linearly":[153],"number":[156],"feasible":[158],"actions.":[160]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-19T00:00:00"}