Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Automatic Control, p. 1-1, 2020

DOI: 10.1109/tac.2020.2981906

Links

Tools

Export citation

Search in Google Scholar

Wardrop Equilibrium in Discrete-Time Selfish Routing with Time-Varying Bounded Delays

Journal article published in 2020 by Alessandro Giuseppi ORCID, Antonio Pietrabissa ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

This article presents a multicommodity, discrete-time, distributed, and noncooperative routing algorithm, which is proved to converge to an equilibrium in the presence of heterogeneous, unknown, time-varying but bounded delays. Under mild assumptions on the latency functions, which describe the cost associated with the network paths, two algorithms are proposed: The former assumes that each commodity relies only on measurements of the latencies associated with its own paths; the latter assumes that each commodity has (at least indirectly) access to the measures of the latencies of all the network paths. Both algorithms are proven to drive the system state to an invariant set that approximates and contains the Wardrop equilibrium, defined as a network state in which no traffic flow over the network paths can improve its routing unilaterally, with the latter achieving a better reconstruction of the Wardrop equilibrium. Numerical simulations show the effectiveness of the proposed approach.