Ricerc@Sapienza

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.