Speaker
Dr
Chi Ho Yeung
(Aston University)
Description
Optimal paths connecting randomly selected node pairs, as
well as multiple nodes and their fixed routers are studied
analytically in the presence of non-linear overlap cost that
penalizes congestion or encourages aggregation. Routing
becomes more difficult as the number of selected nodes
increases and exhibits interesting physical phenomena such
as ergodicity breaking. The ground state of such systems
reveals non-monotonic complex behaviors in average path-
length and algorithmic convergence, depending on the
network topology, and densities of communicating nodes
and routers. Distributed linearly-scalable algorithms are also
devised for various routing senarios based on the cavity and
replica approach.
Primary author
Dr
Chi Ho Yeung
(Aston University)
Co-author
Prof.
David Saad
(Aston University)
