Back to Search
Start Over
Discrete-Time Selfish Routing Converging to the Wardrop Equilibrium.
- Source :
-
IEEE Transactions on Automatic Control . Mar2019, Vol. 64 Issue 3, p1288-1294. 7p. - Publication Year :
- 2019
-
Abstract
- This paper presents a discrete-time distributed and noncooperative routing algorithm, which is proved, via Lyapunov arguments, to asymptotically converge to a specific equilibrium condition among the traffic flows over the network paths, known as Wardrop equilibrium. This convergence result improves the discrete-time algorithms in the literature, which achieve approximate convergence to the Wardrop equilibrium. Numerical simulations show the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 64
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 135081713
- Full Text :
- https://doi.org/10.1109/TAC.2018.2847602