Local Information Based Algorithms for Packet Transport in Complex Networks

Abstract

Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time of packets sent down each edge to each destination and the time since an edge last transmitted a packet. On scale-free networks all our algorithms are considerably more efficient and can handle a larger load than the random walk algorithm. We consider in detail various attributes of our algorithms, for instance we show that an algorithm that bases its decisions on the mean delivery time jams unless it incorporates information about the degree of the destination node.

Preferential behaviour and scaling in diffusive dynamics on networks

“…Hence the nodes on the network are visited at a rate proportional of their connectivity, and hence nodes with a high connectivity are often visited by moving packets. Implementation of a navigation algorithm [18,1] will create a bias in the use of nodes and edges on a given topology. Here we consider one such navigation algorithm, referred to as the CD algorithm, that introduces a preference for less used edges in the traffic history [18].…”

“…Implementation of a navigation algorithm [18,1] will create a bias in the use of nodes and edges on a given topology. Here we consider one such navigation algorithm, referred to as the CD algorithm, that introduces a preference for less used edges in the traffic history [18]. In particular, a node i that is processing a packet at time step t selects one of its neighbour nodes, j, that has the minimum value of the quantity s ij (t) defined as the product…”

“…At the same time, an unequal use of edges appears, that is measured by the packet flow on them. Note that this property of the navigation rules may reduce jamming problems at high traffic density, which often occur on scale-free networks in algorithms based on the shortest paths [18]. We consider low packet density by keeping a low posting rate R, which is much below the jamming rate for this network's structure and navigation rules, in order to minimize the potential effects of long queues and to retain the stationarity of the traffic time series.…”

“…4b). We investigate this question further by considering a simplified, probabilistic version of the edge-preferred navigation, called D algorithm [18], in which a packet moves from node i to its neighbour j with probability…”

Efficient routing strategies in scale-free networks with limited bandwidth

“…Sreenivasan et al introduced a hub avoidance protocol that works particularly well when the packet-generating rate is close to the limitation * Electronic address: tangminghuang521@hotmail.com † Electronic address: zhutou@ustc.edu [16]. Wang et al [17] and Kujawski et al [18] designed the dynamical routing strategies. Systems with limited queuing length were also considered [19][20][21][22][23][24][25].…”