This paper presents a discrete-time, distributed and non-cooperative 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.

Discrete-time selfish routing converging to the wardrop equilibrium

Ricciardi Celsi, Lorenzo
2019-01-01

Abstract

This paper presents a discrete-time, distributed and non-cooperative 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.
2019
Wardrop equilibrium
Lyapunov stability
selfish routing
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12606/23810
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
social impact