A Formal Model for Path Set Attribute Calculation in Network Systems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914142603968512 |
|---|---|
| author | Fiaschi, Giovanni Vitucci, Carlo Westerbäck, Thomas Sundmark, Daniel Nolte, Thomas |
| author_facet | Fiaschi, Giovanni Vitucci, Carlo Westerbäck, Thomas Sundmark, Daniel Nolte, Thomas |
| contents | In graph theory and its practical networking applications, e.g., telecommunications and transportation, the problem of finding paths has particular importance. Selecting paths requires giving scores to the alternative solutions to drive a choice. While previous studies have provided comprehensive evaluation of single-path solutions, the same level of detail is lacking when considering sets of paths. This paper emphasizes that the path characterization strongly depends on the properties under consideration. While property-based characterization is also valid for single paths, it becomes crucial to analyse multiple path sets. From the above consideration, this paper proposes a mathematical approach, defining a functional model that lends itself well to characterizing the path set in its general formulation. The paper shows how the functional model contextualizes specific attributes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_05334 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Formal Model for Path Set Attribute Calculation in Network Systems Fiaschi, Giovanni Vitucci, Carlo Westerbäck, Thomas Sundmark, Daniel Nolte, Thomas Networking and Internet Architecture F.2.2; G.2.2 In graph theory and its practical networking applications, e.g., telecommunications and transportation, the problem of finding paths has particular importance. Selecting paths requires giving scores to the alternative solutions to drive a choice. While previous studies have provided comprehensive evaluation of single-path solutions, the same level of detail is lacking when considering sets of paths. This paper emphasizes that the path characterization strongly depends on the properties under consideration. While property-based characterization is also valid for single paths, it becomes crucial to analyse multiple path sets. From the above consideration, this paper proposes a mathematical approach, defining a functional model that lends itself well to characterizing the path set in its general formulation. The paper shows how the functional model contextualizes specific attributes. |
| title | A Formal Model for Path Set Attribute Calculation in Network Systems |
| topic | Networking and Internet Architecture F.2.2; G.2.2 |
| url | https://arxiv.org/abs/2511.05334 |