A congestion awareness routing strategy for scale-free networks with tunable clustering

Traffic dynamics based on a traffic awareness routing strategy on scale-free networks

“…[7] in which the result shows that the extent of improvement becomes clearer in the more clustered network. This is due to the fact that a gradually increasing packet process is simulated in this paper while the stationary regime is explored in Ref.…”

“…This is due to the fact that a gradually increasing packet process is simulated in this paper while the stationary regime is explored in Ref. [7]. Remarkably, there are two obviously different behaviors for the onset of traffic jams.…”

“…Let us assume that node s holds a packet that should be delivered to node t. We first compute the weight d i of a neighbor node i of s. This weight, which can be viewed as the cost of each packet to pass through node i, is defined as [6,7] …”

“…To alleviate the congestion, a feasible and effective way is to bypass such high-degree nodes in the traffic-routing design. Recently, a general protocol that incorporated local traffic information is designed through a tunable parameter [6,7]. Combining with the knowledge of the topology and the local traffic information of the network, the traffic awareness protocol behaves more efficiently compared with the shortest path routing protocol.…”

Information transport in multiplex networks

“…Wang et al [31] proposed a dynamic routing strategy, which considers both the degrees and loads of neighbor nodes. There are many other efficient routing strategies which consider the waiting time of packets in the queue [32], the distance of the destinations from the neighbor nodes [33,34], and so on.…”