AI 中文总结
研究网络系统中路径集属性计算问题，提出计算路径集割集的优化算法并验证性能，还引入矢量化计算框架，为基于路径集结构属性定义属性的模型奠定实践基础。
AI 中文摘要
在图论及其在电信或运输等网络领域的应用中，路径查找是核心问题。单路径算法成熟，多路径集处理方法发展不足。之前一篇论文引入基于路径集结构属性定义属性的形式模型，本文解决其实践实现问题。提出计算路径集割集的优化算法，并通过不同复杂度网络模拟的系统基准测试验证其性能。还引入将属性计算表示为矩阵运算的矢量化计算框架。这些为相关模型奠定实践基础，证明其实现可行且执行时间可预测、可接受。
英文摘要
In graph theory and its applications to networking, such as telecommunications or transportation, path-finding is a central problem. While single-path algorithms are well established, methods for handling sets of multiple paths are less developed. A companion paper introduced a formal model for defining attributes over sets of paths based on their structural properties; this paper addresses that model's practical implementation. We present an optimized algorithm for computing cut sets of a path set, a nontrivial task that can be infeasible without efficient methods, and validate its performance via systematic benchmarks on network simulations of varying complexity. Additionally, we introduce a vectorized computational framework that expresses property calculations as matrix operations, enabling concise implementations in array-oriented languages. Together, these contributions establish practical foundations for the companion model, demonstrating that its implementation is both feasible and characterized by predictable, acceptable execution times.
Comments8 pages, 2 figures, to be published in the proceedings of The 2026 International Conference on Computer, Information and Telecommunication Systems (CITS 2026), July 22-24, 2026, Piraeus-Athens, Greece
