Speaker
Dr
Luca Dall'Asta
(Abdus Salam ICTP)
Description
Many efforts have been devoted to characterize the onset of
congestion in communication networks. Numerical simulations
performed using complex routing protocols have revealed that
congestion always occurs as an effect of traffic increase,
but with specific features that strictly depend on the
local routing scheme. (For instance, the continuous or
discontinuous character of the transition from free-flow to
congested regime.) To shed light on the nature of these
phenomena, we propose a minimal model of routing on networks
(traffic-aware random walks) that retains all the relevant
macroscopic properties, and can be analytically studied in
the ensembles of uncorrelated random graphs (homogeneous or
scale-free). The same approach also provides a recursive
method to study the phase diagram for single network
realizations.
