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.

This paper presents a multi-commodity, discrete-
time, distributed and non-cooperative 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 to the network paths, two algorithms are
proposed: the former assumes that each commodity relies only on
measurements of the latencies associated to its own paths; the