{"id":"https://openalex.org/W4416514211","doi":"https://doi.org/10.1109/isncc66965.2025.11250449","title":"A Formal Model for Path Set Attribute Calculation in Network Systems","display_name":"A Formal Model for Path Set Attribute Calculation in Network Systems","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W4416514211","doi":"https://doi.org/10.1109/isncc66965.2025.11250449"},"language":null,"primary_location":{"id":"doi:10.1109/isncc66965.2025.11250449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isncc66965.2025.11250449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Symposium on Networks, Computers and Communications (ISNCC)","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/A5041823398","display_name":"Giovanni Fiaschi","orcid":null},"institutions":[{"id":"https://openalex.org/I1306339040","display_name":"Ericsson (Sweden)","ror":"https://ror.org/05a7rhx54","country_code":"SE","type":"company","lineage":["https://openalex.org/I1306339040"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Giovanni Fiaschi","raw_affiliation_strings":["Radio New Concept and Algorithms Ericsson AB,Stockholm,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radio New Concept and Algorithms Ericsson AB,Stockholm,Sweden","institution_ids":["https://openalex.org/I1306339040"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089234861","display_name":"Carlo Vitucci","orcid":"https://orcid.org/0000-0003-2598-6796"},"institutions":[{"id":"https://openalex.org/I1306339040","display_name":"Ericsson (Sweden)","ror":"https://ror.org/05a7rhx54","country_code":"SE","type":"company","lineage":["https://openalex.org/I1306339040"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Carlo Vitucci","raw_affiliation_strings":["Technology Management Ericsson AB,Stockholm,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technology Management Ericsson AB,Stockholm,Sweden","institution_ids":["https://openalex.org/I1306339040"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106560308","display_name":"Thomas Westerb\u00e4ck","orcid":null},"institutions":[{"id":"https://openalex.org/I2799978770","display_name":"X-Fab (Germany)","ror":"https://ror.org/030bh9196","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799978770"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Westerb\u00e4ck","raw_affiliation_strings":["M&#x00E4;lardalen University,Division of Mathematics and Physics,V&#x00E4;ster&#x00E5;s,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M&#x00E4;lardalen University,Division of Mathematics and Physics,V&#x00E4;ster&#x00E5;s,Sweden","institution_ids":["https://openalex.org/I2799978770"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066654973","display_name":"Daniel Sundmark","orcid":"https://orcid.org/0000-0002-5032-2310"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Sundmark","raw_affiliation_strings":["M&#x00E4;lardalen University,Computer Science and Software Enigineering,V&#x00E4;ster&#x00E5;s,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M&#x00E4;lardalen University,Computer Science and Software Enigineering,V&#x00E4;ster&#x00E5;s,Sweden","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047385412","display_name":"Thomas Nolte","orcid":"https://orcid.org/0000-0001-6132-7945"},"institutions":[{"id":"https://openalex.org/I4210145666","display_name":"Embedded Systems (United States)","ror":"https://ror.org/04742eh45","country_code":"US","type":"company","lineage":["https://openalex.org/I4210145666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Nolte","raw_affiliation_strings":["M&#x00E4;lardalen University,Division of Networked and Embedded Systems,V&#x00E4;ster&#x00E5;s,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M&#x00E4;lardalen University,Division of Networked and Embedded Systems,V&#x00E4;ster&#x00E5;s,Sweden","institution_ids":["https://openalex.org/I4210145666"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43198497,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.3176000118255615,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.3176000118255615,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.14350000023841858,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.05009999871253967,"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/path","display_name":"Path (computing)","score":0.6899999976158142},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.644599974155426},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.4546000063419342},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4221999943256378},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41190001368522644},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.364300012588501}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6899999976158142},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.644599974155426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6218000054359436},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4302999973297119},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41190001368522644},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.3490999937057495},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C2985583900","wikidata":"https://www.wikidata.org/wiki/Q722617","display_name":"Formal description","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3215000033378601},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31060001254081726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30399999022483826},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.29580000042915344},{"id":"https://openalex.org/C26320393","wikidata":"https://www.wikidata.org/wiki/Q597053","display_name":"Functional dependency","level":3,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isncc66965.2025.11250449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isncc66965.2025.11250449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Symposium on Networks, Computers and Communications (ISNCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320307330","display_name":"Knowledge Foundation","ror":"https://ror.org/00v64cg28"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W16002891","https://openalex.org/W1698699930","https://openalex.org/W1989569146","https://openalex.org/W2011282943","https://openalex.org/W2014944565","https://openalex.org/W2048705422","https://openalex.org/W2099236627","https://openalex.org/W2111999854","https://openalex.org/W2127366419","https://openalex.org/W2154434560","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2296055404","https://openalex.org/W2735816714","https://openalex.org/W2770729327","https://openalex.org/W2926043732","https://openalex.org/W3142588439","https://openalex.org/W4210463984","https://openalex.org/W4253091331","https://openalex.org/W4401630766"],"related_works":[],"abstract_inverted_index":{"In":[0],"graph":[1],"theory":[2],"and":[3,10],"its":[4,110],"practical":[5],"networking":[6],"applications,":[7],"e.g.,":[8],"telecommunications":[9],"transportation,":[11],"the":[12,26,43,59,65,87,106,117],"problem":[13],"of":[14,40,46,53],"finding":[15],"paths":[16,21],"has":[17],"particular":[18],"importance.":[19],"Selecting":[20],"requires":[22],"giving":[23],"scores":[24],"to":[25,29,81,104],"alternative":[27],"solutions":[28],"drive":[30],"a":[31,93,97],"choice.":[32],"While":[33,69],"previous":[34],"studies":[35],"have":[36],"provided":[37],"comprehensive":[38],"evaluation":[39],"single-path":[41],"solutions,":[42],"same":[44],"level":[45],"detail":[47],"is":[48,72],"lacking":[49],"when":[50],"considering":[51],"sets":[52],"paths.":[54],"This":[55],"paper":[56,91,114],"emphasizes":[57],"that":[58,100],"path":[60,84,107],"characterization":[61,71],"strongly":[62],"depends":[63],"on":[64],"properties":[66],"under":[67],"consideration.":[68],"property-based":[70],"also":[73],"valid":[74],"for":[75],"single":[76],"paths,":[77],"it":[78],"becomes":[79],"crucial":[80],"analyse":[82],"multiple":[83],"sets.":[85],"From":[86],"above":[88],"consideration,":[89],"this":[90],"proposes":[92],"mathematical":[94],"approach,":[95],"defining":[96],"functional":[98,118],"model":[99,119],"lends":[101],"itself":[102],"well":[103],"characterizing":[105],"set":[108],"in":[109],"general":[111],"formulation.":[112],"The":[113],"shows":[115],"how":[116],"contextualizes":[120],"specific":[121],"attributes.":[122]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-23T00:00:00"}
