A Formal Model for Path Set Attribute Calculation in Network Systems
Giovanni Fiaschi, Carlo Vitucci, Thomas Westerb\"ack, Daniel Sundmark, Thomas Nolte

TL;DR
This paper introduces a formal mathematical model for characterizing sets of paths in network systems, addressing the gap in analyzing multiple paths based on various properties for improved decision-making.
Contribution
It presents a novel functional model for path set attribute calculation, enhancing the understanding of multiple path properties in network analysis.
Findings
The model effectively characterizes path sets based on different properties.
It provides a framework for analyzing multiple paths in network systems.
The approach generalizes existing single-path evaluation methods.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Advanced Optical Network Technologies · Complexity and Algorithms in Graphs
