{"id":"https://openalex.org/W4312742685","doi":"https://doi.org/10.1109/etfa52439.2022.9921474","title":"MALOC: Building an adaptive scheduling and routing framework for rate-constrained TSN traffic","display_name":"MALOC: Building an adaptive scheduling and routing framework for rate-constrained TSN traffic","publication_year":2022,"publication_date":"2022-09-06","ids":{"openalex":"https://openalex.org/W4312742685","doi":"https://doi.org/10.1109/etfa52439.2022.9921474"},"language":"en","primary_location":{"id":"doi:10.1109/etfa52439.2022.9921474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa52439.2022.9921474","pdf_url":null,"source":{"id":"https://openalex.org/S4363607916","display_name":"2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)","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/A5004591026","display_name":"Neetin Desai","orcid":"https://orcid.org/0000-0002-1763-9041"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Nitin Desai","raw_affiliation_strings":["M&#x00E4;lardalen University,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M&#x00E4;lardalen University,Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042061810","display_name":"Radu Dobrin","orcid":"https://orcid.org/0000-0002-3336-0091"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Radu Dobrin","raw_affiliation_strings":["M&#x00E4;lardalen University,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M&#x00E4;lardalen University,Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040670014","display_name":"Sasikumar Punnekkat","orcid":"https://orcid.org/0000-0001-5269-3900"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sasikumar Punnekkat","raw_affiliation_strings":["M&#x00E4;lardalen University,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M&#x00E4;lardalen University,Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12216","display_name":"Network Time Synchronization Technologies","score":1.0,"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":1.0,"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.9983999729156494,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9779999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.7534921169281006},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6044297218322754},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5906964540481567},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.525068461894989},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5031151175498962},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.41822952032089233},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14117997884750366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07585030794143677}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7534921169281006},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6044297218322754},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5906964540481567},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.525068461894989},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5031151175498962},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41822952032089233},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14117997884750366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07585030794143677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa52439.2022.9921474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa52439.2022.9921474","pdf_url":null,"source":{"id":"https://openalex.org/S4363607916","display_name":"2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)","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":18,"referenced_works":["https://openalex.org/W2109488193","https://openalex.org/W2145132630","https://openalex.org/W2883236982","https://openalex.org/W2896338163","https://openalex.org/W2896413768","https://openalex.org/W2902780753","https://openalex.org/W2908567143","https://openalex.org/W2908866813","https://openalex.org/W3008548740","https://openalex.org/W3015209250","https://openalex.org/W3121555301","https://openalex.org/W3145249850","https://openalex.org/W3182733970","https://openalex.org/W3186001225","https://openalex.org/W3199704247","https://openalex.org/W4200622245","https://openalex.org/W4225656824","https://openalex.org/W6801053373"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W4301044568","https://openalex.org/W1587123803","https://openalex.org/W2128075414","https://openalex.org/W2952867832","https://openalex.org/W2571039174"],"abstract_inverted_index":{"Time":[0],"Sensitive":[1],"Networking":[2],"(TSN)":[3],"is":[4],"a":[5,48,101,117,125],"set":[6],"of":[7,23,89,120],"standards":[8],"aimed":[9],"at":[10],"providing":[11],"real-time":[12],"guarantees":[13],"over":[14],"existing":[15],"Ethernet":[16],"standards.":[17],"Worst-case":[18],"traversal":[19,55],"time":[20],"(WCTT)":[21],"analyses":[22,33],"network":[24,127],"traffic":[25,39,92],"are":[26,57],"traditionally":[27],"used":[28,64],"in":[29,93],"schedulability":[30],"and":[31,61,72,87,107],"routing":[32,71,86],"to":[34,59,105],"determine":[35],"feasible":[36],"routes":[37],"for":[38,70,85],"streams.":[40],"However,":[41],"worst-case":[42],"conditions":[43],"happen":[44],"quite":[45],"rarely":[46],"from":[47],"probabilistic":[49],"perspective.":[50],"The":[51,97],"typical":[52],"or":[53,80],"average-case":[54],"times":[56],"easier":[58],"compute":[60],"can":[62],"be":[63],"as":[65],"an":[66],"effective":[67],"design":[68],"tool":[69],"scheduling.":[73],"In":[74],"this":[75],"paper,":[76],"we":[77],"present":[78],"\"MaLoC\"":[79],"Maximally":[81],"Loaded":[82],"Common":[83],"links":[84],"scheduling":[88],"rate-constrained":[90],"(RC)":[91],"time-sensitive":[94],"networks":[95],"(TSN).":[96],"proposed":[98,122],"framework":[99],"employs":[100],"fully":[102],"decentralized":[103],"approach":[104,123],"route":[106],"schedule":[108],"generation":[109],"with":[110],"only":[111],"switch-local":[112],"information.":[113],"We":[114],"further":[115],"provide":[116],"preliminary":[118],"evaluation":[119],"the":[121],"using":[124],"simple":[126],"topology.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
