交通网络性能界限演算（路网演算）的代数方法
Algebraic Approach for Performance Bound Calculus on Transportation Networks (Road Network Calculus)
摘要：
我们提出了在这篇文章中的确定性网络演算理论的道路交通流理论的基本技术的适应。网络演算是一种基于最小加代数的理论。它使用代数技术来计算通信网络中的性能界限，例如最大端到端延迟和积压。这篇文章的目的是研究应用这些技术来确定道路网络的性能界限，如行程时间的最大界限。将网络演算理论应用于道路网络的主要困难在于对道路内汽车的相互作用，或者更准确地说是对拥堵阶段的建模。提出了一个与网络微积分理论相兼容的单车道无超车的交通模型。该模型允许导出的最大范围的旅行时间的汽车通过道路。然后，基于该模型，我们解释了如何扩展该方法来建模交叉口和大规模网络。
英文摘要：
We propose in this article an adaptation of the basic techniques of the deterministic network calculus theory to the road traffic flow theory. Network calculus is a theory based on min-plus algebra. It uses algebraic techniques to compute performance bounds in communication networks, such as maximum end-to-end delays and backlogs. The objective of this article is to investigate the application of such techniques for determining performance bounds on road networks, such as maximum bounds on travel times. The main difficulty to apply the network calculus theory on road networks is the modeling of interaction of cars inside one road, or more precisely the congestion phase. We propose a traffic model for a single-lane road without passing, which is compatible with the network calculus theory. The model permits to derive a maximum bound of the travel time of cars through the road. Then, basing on that model, we explain how to extend the approach to model intersections and large-scale networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
