Efficient and robust routing on scale-free networks

MFPT calculation for random walks in inhomogeneous networks

“…The authors of [24] have shown that inhomogeneous networks are more vulnerable to iterative path attacks and have shown in [25] how epidemic spreading is dependent on network homogeneity. In [26] and [27], network capacity is shown to decrease with network inhomogeneity. In animal motion it has been shown that the calculation for expected time needed for a predator to locate small patches of prey in a 2-D landscape has two components; random and directed [28].…”

“…They have shown that in optimal inhomogeneous search Network inhomogeneity has been defined in various ways in literature. The most common definition is the inhomogeneity in terms of node degree distribution [30,31,9,26]. One of the most common such network type that is studied in literature is the scale free (SF) networks [32] which show a power-law degree distribution [9,24].…”

Information theory perspective on network robustness

“…Several methodologies have been proposed to measure network robustness. Approaches based on information routing (Boginski et al, 2009;Pu et al, 2012bPu et al, , 2013, structural controllability (Liu et al, 2011;Pu et al, 2012a) or in the proposal of a more destructive attack strategy in networks (Arulselvan et al, 2009;Pu et al, 2015), can be found in the literature; being the most popular those based on percolation theory (Albert et al, 2000;Cohen et al, 2000;Callaway et al, 2000), and on the size of the biggest connected component (BC) (Holme et al, 2002;Allesina and Pascual, 2009;Salathé et al, 2010;Iyer et al, 2013). Although these measures showed to be useful in many cases, they are not as sensitive as they should, to the detection of failures that do not disconnect the network or that do not modify its diameter.…”

Efficient routing on small complex networks without buffers

“…Also, upgrading the infrastructure is often not economically feasible [1,2]. The performance of the communication systems can be improved by implementing the more appropriate routing protocols without changing the underlying network structure [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17], which is more realizable in the practice. Such work presents two problems.…”