Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical Mechanics and its …, 2012 - Elsevier
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
[PDF][PDF] Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical Mechanics and its …, 2012 - core.ac.uk
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical Mechanics and its …, 2012 - infona.pl
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
Efficient packet routing strategy in complex networks
H Kawamoto - Physica A: Statistical Mechanics and its Applications, 2012 - cir.nii.ac.jp
抄録 We investigate a new efficient packet routing strategy which mitigates traffic congestion
on complex networks. In order to avoid congestion, we minimize the maximum …
on complex networks. In order to avoid congestion, we minimize the maximum …
Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical Mechanics and its …, 2012 - ideas.repec.org
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
[PDF][PDF] Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical Mechanics and its …, 2012 - Citeseer
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical …, 2012 - repository.kulib.kyoto-u.ac.jp
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical Mechanics …, 2012 - econpapers.repec.org
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A Statistical Mechanics …, 2012 - ui.adsabs.harvard.edu
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
complex networks. In order to avoid congestion, we minimize the maximum betweenness …
[引用][C] Efficient packet routing strategy in complex networks
H Kawamoto, A Igarashi - Physica A: Statistical Mechanics and its …, 2012 - cir.nii.ac.jp