Convergence of a Packet Routing Model to Flows Over Time
Leon Sering, Laura Vargas Koch, Theresa Ziemke

TL;DR
This paper establishes a mathematical connection between discrete packet routing models and continuous flow over time models, proving convergence and implications for equilibria, thus providing a theoretical foundation for traffic simulation tools like MATSim.
Contribution
It introduces a packet routing model that converges to flow over time models and formalizes the connection, enhancing understanding of traffic dynamics and equilibria.
Findings
Proves convergence of packet routing to flow over time models.
Demonstrates existence of approximate equilibria in the packet routing model.
Provides a formal mathematical foundation for the MATSim simulation environment.
Abstract
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories, the connection between these approaches was poorly understood so far. In this work we build this connection by specifying a (competitive) packet routing model, which is discrete in terms of flow and time, and by proving its convergence to the intensively studied model of flows over time with deterministic queuing. More precisely, we prove that the limit of the convergence process, when decreasing the packet size and time step length in the packet routing model, constitutes a flow over time with multiple commodities. In addition, we show that the convergence result implies the existence of approximate equilibria in the competitive version of the packet…
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.
