Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

Roberto Cominetti, José Correa, Neil Olver

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair, and each link has a per-time-unit capacity and a transit time. A dynamic equilibrium (or equilibrium flow over time) is a flow pattern over time such that no flow particle has incentives to unilaterally change its path. Although the model has been around for almost 50 years, only recently results regarding existence and characterization of equilibria have been obtained. In particular, the long-term behavior remains poorly understood. Our main result in this paper is to show that, under a natural (and obviously necessary) condition on the queuing capacity, a dynamic equilibrium reaches a steady state (after which queue lengths remain constant) in finite time. Previously, it was not even known that queue lengths would remain bounded. The proof is based on the analysis of a rather nonobvious potential function that turns out to be monotone along the evolution of the equilibrium. Furthermore, we show that the steady state is characterized as an optimal solution of a certain linear program. When this program has a unique solution, which occurs generically, the long-term behavior is completely predictable. On the contrary, if the linear program has multiple solutions, the steady state is more difficult to identify as it depends on the whole temporal evolution of the equilibrium.

Original languageEnglish
Pages (from-to)516-526
Number of pages11
JournalOperations Research
Volume70
Issue number1
DOIs
StatePublished - 1 Jan 2022
Externally publishedYes

Keywords

  • Dynamic equilibria
  • Flows over time
  • Steady state

Fingerprint

Dive into the research topics of 'Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks'. Together they form a unique fingerprint.

Cite this