Information and Modeling in ComplexityView this Special Issue
Review Article | Open Access
Shengyong Chen, Wei Huang, Carlo Cattani, Giuseppe Altieri, "Traffic Dynamics on Complex Networks: A Survey", Mathematical Problems in Engineering, vol. 2012, Article ID 732698, 23 pages, 2012. https://doi.org/10.1155/2012/732698
Traffic Dynamics on Complex Networks: A Survey
Traffic dynamics on complex networks are intriguing in recent years due to their practical implications in real communication networks. In this survey, we give a brief review of studies on traffic routing dynamics on complex networks. Strategies for improving transport efficiency, including designing efficient routing strategies and making appropriate adjustments to the underlying network structure, are introduced in this survey. Finally, a few open problems are discussed in this survey.
Large real communication networked systems have become a hot research topic for a rather long time. Typical examples include the Internet, which is an enormous network of many routers connected by physical or wireless links with information packets flowing on them, and high-way network, which is composed of cities and high-ways between cities. The rapid development of society causes the immense increase of traffic amounts in many real networked communication systems. Congestion may firstly occur on some communication units (such as routers on the Internet [1, 2] or cities in high-way networks) and then spread to more other units. Therefore, it is important to recover the free-flow state from the congested state, and therefore, demands for high transport efficiency are becoming more stringent in recent years. Up till now, there have been many studies on understanding and controlling traffic congestion on communication systems [3–18]. However, many early studies only assumed that the communication networked systems are completely random or even ignored the existence of network structure. Since the pioneering discovery of small-world phenomena  and scale-free feature [20, 21] at the end of 20th century, researchers began to realize that traffic dynamics are highly relevant to the underlying network structure. For example, in 2005, Zhao et al. found that for two networks with different network structures, even when the two networks have the same average connectivity, the same delivering capacity of each node, and the same number of nodes, traffic congestion may tend to occur in one network than in another . Therefore, traffic dynamics on complex network have attracted a lot of interest in both applied physics and computational science.
Actually, many empirical studies have revealed that the transport performances are not only relevant to the characteristics of underlying network structure, but also significantly affected by routing strategies. In this light, in order to improve transport performances on real networks, one can either design efficient routing strategies, or make appropriate changes to the underlying network structure. Designing efficient routing strategies is considered to be “soft” strategies, because it does not require any topological changes. Making changes to network structure is considered to be “hard” strategies, because it requires topological changes. One can add a few links to existing networks or delete a few links from existing networks to realize the modification of network structure.
In this survey, we mainly review recent progresses for traffic dynamics on complex networks. We have to mention that this survey is mainly from the perspective of physics. The remainder of this survey is organized as follows. In Section 2, we introduce some basic models and concepts for traffic routing dynamics. In Sections 3 and 4, we present some important work on “soft” strategies and “hard” strategies, respectively. Finally, conclusions are drawn in Section 5 with a brief discussion for future work.
2. Models and Concepts for Traffic Dynamics
2.1. Traffic Routing Model
Processes of random walk on complex networks have been extensively studied recently due to its wide applications in real networks [19, 23, 24]. However, the accumulation of packets on routers is not involved in the process of random walk, and therefore, the process of random walk cannot reflect real traffic system completely. Under the background of complex network, a basic traffic dynamics model has been proposed and frequently used to mimic the traffic transport in communication networked systems [7, 22, 25–27]. In this basic model, all nodes in a network are equally considered as hosts and routers [26, 28] for generating and delivering packets. The whole traffic dynamics model is an iterated process. In a general setting, packets are generated with a give rate at randomly selected nodes at each time step. Each packet is designated with a randomly chosen node, different from its source, as the destination to which the packet will be delivered. Each packet is delivered from one node to another following a given routing strategy. Each node has its own delivering capacity C, that is, the maximal number of packets each node can deliver at one time step. An arrived packet will be placed at the end of the queue if this node already has some packets to be delivered to their respective destinations. The packets in queue, which may be created locally at some previous time steps or they are delivered by other nodes in an earlier time, work on a “first-in-first-out” basis. Finally, a packet will be removed from the network once it reaches its destination.
The basic model has also been generalized to more realistic models, which incorporate the fact that hub nodes usually have high delivering capacities or can generate more packets at each unit time step than those low-degree nodes can do. For example, degree-dependent delivering capacity was assumed in the form  or [22, 30]. In [30, 31], the author assumed that degree-dependent packet generation rate in the form . In [32, 33], the authors assumed that the bandwidth B of each link, that is, the maximal capacity of each link for delivering packets, is limited and varies from link to link. Moreover, in , the authors assumed that sources and destinations are not homogeneously selected. They considered two situations of packet generation: (i) packets are more likely generated at high-degree nodes and (ii) packets are more likely generated at low-degree nodes. Similarly, they considered two situations of packet destination: (a) packets are more likely to go to high-degree nodes and (b) packets are more likely to go to low-degree nodes.
2.2. Traffic Capacity
One of the most important measurements for transport performance of traffic is the traffic capacity , that is, the critical packet generation rate. At , the network undergoes a phase transition from free-flow state to congested state. When the packet generation rate is below , the number of generated and delivered packets are balanced, and therefore, the network is in free-flow state. But when goes beyond , the number of packets keeps on increasing with time and can lead to congestion finally, simply because nodes cannot delivering too many packets at each time step due to limited delivering capacity. The traffic capacity is usually described by an order parameter  where and , the average over time windows of width . is denoted as the number of packets in the network, and is the network size. When , , and , this indicates that the network system is under the free-flow state. On the other hand, when , is above zero, which indicates that packets are accumulating in the network and the network will become congested. Thus, is the maximal packet generation rate under which the network system can remain in the free-flow state.
2.3. Effective Betweenness
In order to provide a theoretical estimate of traffic capacity, the concept “betweenness” is introduced here. Betweenness centrality [35–38], or betweenness for short, measures how central a node is in the network. Originally, the betweenness of a node is defined as the number of total shortest paths that pass through the node . Let be the number of paths going through node and following the shortest paths between node and node . The node betweenness, , can be expressed as , where . Later on, the definition of node betweenness was extended. The path between any two distinct nodes may not be along the shortest path between the two nodes but is guided by a given searching algorithm. This is the so-called effective node betweenness [26, 39]. When the searching algorithm is able to find the shortest path between any two distinct nodes, the effective node betweenness recovers the original definition of node betweenness [35–38]. The effective node betweenness can be defined as [26, 39] where is the average times that a packet generated at and with destination that passes through . In a network with nodes, we define According to [26, 39], where I is an identity matrix and where is the probability that a packet whose destination points to node goes from node to a new node in the next movement. Under the transportation rule regulated, from [26, 39], we have where is the element in the adjacency matrix of the network ( if there is a direct edge between node and node ; otherwise, ) and is the delta function. It should be noted that for all , which means that a packet will be removed from the network when it reaches its destination, and for all , which means a packet will be directly forwarded to the destination node if node is a direct neighbor of node .
Then, we can make a theoretical estimate for the traffic capacity . The number of packets that arrive at node is, on average, . If , packets will be accumulated on the node , and congestion will thereafter occur. To avoid congestion on the network, should hold for each node. Therefore, the traffic capacity can be estimated as [22, 26] where is the maximal effective betweenness in the network.
3. “Soft” Strategies
3.1. Shortest Path Routing Strategy
Under the shortest path routing strategy, each packet is always transported along the topological shortest path between the packet’s source and destination. Different from routing strategies with stochastic factors, under the shortest path routing strategy, each packet has a fixed delivering path once the network is constructed. Therefore, the shortest path routing strategy is widely used in real communication systems [2, 40–42] due to its economical and technical costs. However, under the shortest path routing strategy, packets are easy to pass through hub nodes, which can easily lead to congestions on hub nodes [29, 43, 44]. This fact consequently motivates the designing of many other efficient routing strategies, which will be introduced in the following part.
3.2. Review of Improved Routing Strategies for Traffic Dynamics
It has been demonstrated that networks cannot handle heavy traffic if packets are always transported along the shortest path from source and destination [29, 43, 44]. To improve transport efficiency of packets in the network, Echenique et al. proposed a strategy in [45, 46], called traffic-awareness strategy, in which the factor of waiting time at the neighboring nodes is also considered in addition to the fact of shortest path length from the neighboring node to destination. The waiting time is regarded as the number of packets in the queue at a neighboring node at the time of decision [45, 46]. The authors investigated the maximal time it takes for a packet to travel from its source to destination and the traffic capacity in complex heterogeneous networks. Results show that compared to the shortest path routing strategy, is shortened and is enhanced by using the traffic-awareness strategy. Moreover, in , the authors mentioned that under the shortest path routing strategy, traffic jams appear and grow smoothly, as the amount of generated packets increases. However, as soon as traffic awareness conditions are taken into account, the jamming transition is reminiscent of a first-order phase transition. Therefore, we can say that traffic-awareness routing strategy can delay the appearance of congestion at the cost of a sudden jump to a highly jammed phase due to the lack of early warnings.
Later on, Zhang et al. in  proposed an efficient routing strategy that is based on the projected waiting time along the shortest path from a neighboring node to the destination. Figure 1 illustrates the comparing results of three routing strategies in heterogeneous complex networks. and are parameters related to degree-dependent packet generation rate and degree-dependent packet delivering capacity. Results show that jamming is harder to occur using the strategy in , when compared with both the shortest path strategy and traffic-awareness strategy [45, 46]. The strategy in  has the advantage of spreading the packets among the nodes according to the degree of nodes.
In , the authors incorporated both the global shortest path length information and local degree information in the transport process of traffic, via two tunable parameters, and , to guide the routing of packets. In detail, at each time step, all packets move from their current position, i, to the next node in their path, j, with a probability defined as where is the set of neighboring nodes of , is the degree of node , and is the shortest path length between node and node . The parameters α and β are tunable parameters with varying range and . Through numerical simulations, the authors in  showed that with appropriate selection of the tunable parameters, the strategy in  is superior to the shortest path routing strategy in enhancing the traffic capacity. Furthermore, the authors of  pointed out that the strategy in [45, 46] is sensitive to the total number of tasks assigned to the networks. In the case of heavy traffic, the contribution of shortest path length for delivering packets can be ignored, because the diameter of most real communication networks grows only logarithmically with system size  and shortest path length is only bound to the diameter value. However, the strategy in  is insensitive to the amount of traffic flow in the network. In , based on the strategy which considered both shortest path length ingredient and degree ingredient in heterogeneous networks, the authors proposed an improved routing strategy with memory information in scale-free networks. This result was inspired by , in which researchers found that when studying local search in power-law communication networks, the search efficiency can be effectively enhanced if retracing the last step is disallowed in random networks. In the strategy with memory information , when node receives a new packet from node , node has to record that the new packet is from node . At the next time step, the packet node is forbidden to be forwarded back to node . In this way, the chance that packets are transported back and forth between two distinct nodes is greatly reduced. Figure 2 shows the results of performances in enhancing traffic capacity for both strategies with and without memory information. In Figure 2, α regulates the degree ingredient involved for forwarding packets, and β regulates the shortest path length ingredient involved for forwarding packets. γ denotes the degree exponent of scale-free networks. Results show that traffic capacity can be effectively enhanced by using the strategy with memory information.
In , the authors proposed a kind of efficient routing strategy. In order to find the optimal routing strategy, the authors define “the efficient path.” For any path between node and node as , define where is the degree of node and is a tunable parameter. The efficient path between i and j is corresponding to the route that makes the sum minimal. It is obvious that recovers the shortest path routing strategy. It is expected that the system behaves better under the routing rule with than under the shortest path routing strategy. In , the authors concerns how , that is, the critical number of generated packets at each time step, varies with . Here, . The simulation results for the critical value as a function of on BA scale-free networks are illustrated in Figure 3. It can be found that firstly increases with and then decreases, with the maximal corresponding to . As compared to the shortest path routing strategy (), the traffic capacity is greatly improved, from when to when , more than ten times. However, the authors also found that the average total delivering path length is maximal when . Therefore, they concluded that the system capability in processing information is considerably enhanced at the cost of increasing the average total delivering path length when using the strategy .
The routing strategies mentioned above, allow each node to have the whole network’s global topological information, which may be practical for small or medium size networks but not for large real communication such as the Internet, WWW , peer-to-peer networks [25, 49], or urban transportation system [50, 51]. However, strategies based on local information (each node only knows the information of its neighbors) are favored in large networks due to heavy communication cost on searching global information in networks. Inspired by the study on network search or network navigation on complex networks [47, 52–55], the authors in [56, 57] present a traffic model in which packets are routed only based on local topological information with a single tunable parameter α. The optimized value of α was sought out to maximize the traffic capacity. In this model, each node performs a local search among its neighbors. If the packet’s destination is within the searched area, it is delivered directly to its destination. Otherwise, it is forwarded to a node , one of the neighbors of the searching node, according to the preferential probability where the sum runs over all neighbors of the searing node , is the degree of node , and α is a tunable parameter. With the delivering capacity of each node set as a constant , the simulation results show that the optimal performance of the system corresponds to , which can be observed from Figure 4. Theoretical analyses for the optimal value were obtained in . The authors of  also pointed out that choosing the optimal not only maximizes the traffic capacity but also minimizes the average delivering time. When the delivering capacity of each node is proportional to its degree , the optimal value of α changes to , as demonstrated in Figure 5. This result indicates that under the conditions of heterogeneous delivering capacity of each node, the random walks strategy is the best choice for routing packets.
Actually, the area of information that each router can access can significantly affect the performances of local routing strategy in traffic transport on complex networks. References [58, 59] found that the next-to-nearest routing algorithm can perform much better than the nearest routing algorithm under the random routing strategy. The next-to-near routing algorithm means that a packet can directly be delivered to its destination if the destination is one of the next-to-nearest neighbors of the searching node.
The strategy in [56, 57] is only based on local static information, which can only enhance the traffic capacity but cannot considerably reduce the transport time. In , the authors proposed a new routing strategy based on local static and dynamical information in scale-free networks. In the routing model of , it was assumed that each node has an identical delivering capacity . A packet is directly delivered to its destination if the destination is one of the direct neighbors of the searing node . Otherwise, the probability of a neighbor node to which the packet will be delivered is where the sum runs over all neighbors of the searching node , is the number of packets in the queue of and β is a tunable parameter. Also, this model considers the effect of transmission delay on the traffic dynamics. The delay is defined as the number of time steps in receiving updated dynamical information from the neighbors . Figure 6 shows that in the case of no delay, the traffic capacity is considerably reduced when decreasing β until . The maximal traffic capacity is only 23 when choosing under the case of only adopting local topological information [56, 57]. Results show that the traffic capacity is further improved by using the strategy in  as compared to the strategy in [56, 57]. The average transport time is reported in Figure 7. It can be seen that by adopting the strategy in [56, 57], is approximately independent of . When is not too large, is much shorter by adopting the strategy in  than the strategy in [56, 57]. In real communication system, the local dynamical information can be obtained by using the keep-alive messages that router continuously exchange with their peers .
In , the authors proposed another global routing strategy which considers both global topological information and queue length of each node. In this global strategy, the packets are delivered along the path in which the sum of queue length of nodes is a minimum. The path between node (source) and node (destination) can be denoted as where is the queue length of node and is the path length. Figures 8(a)–8(c) show the evolution of the total packet number under the shortest path strategy [29, 43, 44], the efficient strategy proposed in , and the global dynamic paths with the network size and average degree . Figure 8(d) compares the relation of order parameter η versus under the three routing strategies. It can be seen that the traffic capacity under the shortest path strategy [29, 43, 44] is . The efficient strategy in  has and the global dynamic strategy can reach up to . Therefore, the global dynamic strategy can achieve the highest traffic capacity.
Figure 9 shows the relation of traffic capacity versus the average degree and versus the network size under the three routing strategies . Results show that the traffic capacity under the global dynamic routing strategy is the largest. Because the node queue length changes from time to time, it is computationally time consuming to find the global paths at each time step. Therefore, the authors in  introduced a time delay for the update of the global queue information and the corresponding paths. They found that with the increment of time delay, the traffic capacity remains almost the same, but the total packet number in system, the traveling time, and the waiting time will increase.
4. “Hard” Strategies
4.1. Removing Links
“Hard” strategies mean network topological structure is appropriately changed so that transport efficiency can be improved. Adding or rewiring links are more costly than soft strategies (i.e., designing efficient routing strategies), because adding or rewiring links usually have to consume much financial, manpower or even energy cost. On the contrary, removing links from networks is usually easy to be implemented at low cost. For example, in a high-way network system, some road ways are usually closed at rush hours to alleviate congestion, especially when crowds of people are rushing to offices in the morning or rushing back home in the afternoon. To realize the closure of roadways, traffic administrators need only to block the entries to the roadways, which is easy to be implemented. Another example is the Internet. Network administrators can easily isolate some connections among computers through computer software.
In fact, the link removal strategy has been extensively studied to enhance or optimize dynamics of different kinds on complex networks. In , the authors pointed out that the removals of nodes or links could alleviate or even mitigate cascades of overloading on networks. In , the link-removal strategy was applied in the metabolic network. They pointed out that the removals of metabolic reactions, which represent links in the metabolic network, could improve metabolic performances and rescue defective metabolic networks. In , the authors found that the removals of links could also help to enhance synchronization in complex networks of dynamical systems.
Literatures on enhancing transport capacity by removing links in communication networks have also been reported. The strategies in [64, 65] were proposed to enhance the traffic capacity by removing certain links among hub nodes in scale-free networks. The strategy proposed in , also called high-degree-first (HDF) strategy, first ranks the links according to the value of the product (), where and are the links’ end-node degrees. Then, links are closed according to this order from large to small. Because hub nodes are usually more important and bear more traffic loads, the links with larger values of () are easier to jam. Hence, removing highly congested links can lead to the redistribution of traffic loads along links so as to enhance the overall packet handling and delivering capacity. For convenience, the number of removed links was denoted as . Figure 10 shows the increment of versus under the shortest path routing strategy. Results show that on closing the links according to the order of , traffic capacity can be remarkably enhanced.
The authors of  also investigated the relationship of versus under the local routing strategy . As shown in Figure 11, when increases from 0 to 600, the maximal traffic capacity always emerges at , but its value decreases from 10 to 5. However, when α is far from −1, increases with the number of removed links. In Internet, it has been found that there are fluctuations in information flow . Therefore, the link-removal strategy can be applied to alleviate traffic congestion at times of high flux, and links can be recovered at times of low flux. The essence of the strategy in , also called high-betweenness-first (HBF) strategy, is much the same as that of the strategy in , but the strategy in  ranks the links according to the value of (), where and are the links’ end-node betweennesses.
In , the authors pointed out the strategies of [64, 65] to identify the links to be removed in scale-free networks is far from optimal. On the basis of optimizing results which are obtained by using the SA (simulated annealing) algorithm [67, 68], the authors of  proposed a link-removal strategy. This new strategy, called variance-of-neighbor-degree-reduction (VNDR) strategy, not only considers the important role of hub nodes, but also balances the amount of packets from each node to its neighbors by reducing the variances of neighbors’ degrees of some nodes. For node , if the relative variance of neighbors’ degrees (RVND), defined as is large ( is the neighborhood set of node ), then packets are more likely to be routed to hub nodes under the shortest path routing strategy. In (4.1), Hence, the hubs nodes are more likely to be congested. If the link between the hub node and the node with high RVND is removed, for example, the link between node and node is removed in the left figure of Figure 12, the distribution of neighbors’ degree of the node with high RVND will become more even, and therefore, traffic amounts are balanced in the network. Finally, the traffic capacity is enhanced.
The VNDR link-removal strategy to enhance traffic capacity in scale-free networks is carried out as follows. For each node in the initial network , the authors in  defined Choose the node with the maximal value of . Then, choose the node with the highest degree from the neighborhood set of node . Remove the link connecting node and node . Then a new network is generated. For the network , recompute for all nodes and choose nodes and in the same way. The whole link-removal process is repeated until a predefined fraction of the links is removed. All nodes have to be in one component in the whole process. If the removal of a link causes certain nodes to be disconnected from the original network, the process is no longer executed. Instead, go to deal with the link that connects the node with the variable ranked next and the node with the highest degree in the neighborhood set of node . The results using SA algorithm are also reported.
The performance of the VNDR strategy is evaluated by comparing it with the high-degree-first (HDF) strategy  and the high-betweenness-first (HBF) strategy . In conducting the SA searching, the initial and final temperatures are set to 10 and , respectively. The temperature decreasing coefficient is set to . For simplicity, the fraction of removed links is denoted as . The results of traffic capacity and average shortest path length versus under the shortest path routing strategy are shown in Figure 13. It can be found that the VNDR strategy is superior to HDF and HBF link-removal strategies in enhancing the traffic capacity. The superiority of VNDR strategy over HDF and HBF strategies in enhancing traffic capacity under the shortest path routing strategy is rationalized in . Furthermore, the authors in  also pointed out that under the shortest path routing strategy, the VNDR strategy can also reduce the average transport time as compared to the HDF and HBF strategies.
4.2. Adding Links
Link-removal strategy is operationally convenient and economical in real communication networks to enhance transport efficiency. However, with the rapid development of society, the sizes of real communication networks are consistently increasing, which brings new challenges to network administrators in charge of network communications. For instance, the numbers of roadways and cities keep on increasing in highway networks, and the number of computers is also increasing explosively in the Internet. But due to the cost incurred in adding new nodes and links to existing networks, real network designers have to be cautious when preparing to add new nodes and links to a given communication network. Otherwise, if new nodes and links are added to an existing network in an improper way, the new links may not be helpful for enhancing transport efficiency while packets are generated on both existing nodes and new nodes, which may aggravate congestion in the network. More links then need to be added into the networks to alleviate congestion with extra cost. Thus, it is necessary to investigate how to add nodes and links in an efficient way so that the traffic capacity can be enhanced maximally.
In , the authors proposed a strategy that can effectively enhance the traffic capacity via the process of adding nodes and links. They consider two cases. (1). The number of nodes is kept unchanged and only the number of links is allowed to be increased. (2) Both nodes and links are allowed to be added to the existing network. In the strategy of , shortcut links are added among nodes that have the longest shortest path lengths. The shortcut links are placed in proper positions to avoid packets flowing through hub nodes so that there are not too many packets accumulated on hub nodes.
In a scale-free network with nodes and links, for simplicity, the authors of  denote the fraction of new added links over the total existing links as . Figure 14 shows the traffic capacity and the average shortest path length versus under the shortest path routing strategy. From Figure 14(a), it is found that both the strategy of  and the random strategy can enhance the traffic capacity when links are added into networks. But the traffic capacity is enhanced more using the strategy of  than using the random strategy.
For the case that both nodes and links are allowed to be added into networks under the shortest path routing strategy, the authors of  compared their strategy with the “degree preferential attachment” mechanism and the low-degree-first strategy. The results are shown in Figure 15. Results show that in the process of adding nodes and links to existing networks under the shortest path routing strategy, the strategy in  can effectively enhance the traffic capacity of networks at the cost of lengthening the average shortest path lengths.
It is worth noting that there is an underlying relation between cascading dynamic [70–73] and congestion of packet traffic . Cascading dynamics means that breakdown on a global scale can be triggered by small failures on nodes through the mechanism of cascading. Typical examples include large-scale blackouts of power grids and heavy congestion on the Internet and so forth. In , the authors pointed out that the smaller is, the more robust a network is against cascades. On the other hand, the traffic capacity, , can be estimated as  This means that the maximal node betweenness can determine both the robustness against cascades and the traffic capacity of a network. Removing or adding links has been proved to be able to effectively enhance the traffic capacity, which means that can be effectively reduced. Therefore, the robustness against cascades of a network can also be effectively enhanced by using appropriate link-removal or link-adding strategies.
The key purpose of studying routing is to study performances of networks such as delay, admission control, and resource allocation [14, 15]. That is particularly true in real-time systems. Thus, this survey is only a conventional part of contents from a view of computer science. The recent contents are associated with network calculus. Moreover, the performances of networks for traffic transport are highly related to the scales observed. Interested reader can refer to [14–18] for their further studies.
5. Concluding Remarks
The heavy traffic loads in real networked communication systems motivate the intense study of traffic dynamics on complex networks in recent years. The main goal is to enhance transport efficiency so that traffic congestions on complex networks can be alleviated. Generally speaking, the strategies which can enhance the traffic capacity can be categorized into two classes: designing efficient routing strategies and making appropriate adjustments to network structures. Many strategies have been proved to be able to enhance the transport efficiency and are helpful for people in understanding and controlling traffic congestion in real networks.
Although the issues of enhancing transport efficiency have been extensively reported in the literatures, there are still many open questions to be studied. Real communication networks are usually much more complicated than the traffic routing model. Other dynamics such as the virus prevalence and cascading breakdown, may also be mixed with the traffic routing dynamics. A few open questions to be solved in future work are listed as follows.(1)The cascading breakdown dynamics can be incorporated with the traffic routing dynamics. A node or a link may lose its function in delivering packets due to traffic congestion on this node or link. Therefore, the node or the link will be removed from the network. As a result, the traffic capacity may be reduced. Under this circumstance, it is thus interesting to study the relationship between the two kinds of dynamics.(2)It is not always the case in real communication networks that each node in the network can generate packets. Some nodes (i.e., generators) may only generate and send packets to other nodes but do not receive packets from elsewhere. The rest of nodes (i.e., receivers) only receive packets from elsewhere but do not generate and send packets to other nodes. The positions of generators may have impacts on the transport efficiency of packets. It is neccesary, therefore, to study how to place generators and receivers in networks so that the transport efficiency can be maximized.(3)Most current studies about traffic routing dynamics on complex networks is based on traffic routing models. However, due to complexity of real communication networks, traffic routing models cannot fully reflect the characteristics of real communication networks. More attention should be focused on revealing new characteristics of real communication networks rather than only study traffic routing models.
This work was supported by the National Natural Science Foundation of China and Microsoft Research Asia (NSFC-61173096, 60802087), Zhejiang Provincial S&T Department (2010R10006, 2010C33095), and Zhejiang Provincial Natural Science Foundation (R1110679).
- R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: A Statistical Physics Approach, Cambridge University Press, Cambridge, UK, 2004.
- R. Pastor-Satorras, A. Vázquez, and A. Vespignani, “Dynamical and correlation properties of the internet,” Physical Review Letters, vol. 87, no. 25, Article ID 258701, 4 pages, 2001.
- H. Li and M. Maresca, “Polymorphic-torus network,” IEEE Transactions on Computers, vol. 38, no. 9, pp. 1345–1351, 1989.
- W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, “On the self-similar nature of Ethernet traffic,” Computer Communication Review, vol. 23, article 283, 1993.
- T. Ohira and R. Sawatari, “Phase transition in a computer network traffic model,” Physical Review E, vol. 58, no. 1, pp. 193–195, 1998.
- A. Arenas, A. Díaz-Guilerà, and R. Guimerà, “Communication in networks with hierarchical branching,” Physical Review Letters, vol. 86, no. 14, pp. 3196–3199, 2001.
- R. Guimerà, A. Arenas, A. Díaz-Guilerà, and F. Giralt, “Dynamical properties of model communication networks,” Physical Review E, vol. 66, no. 2, Article ID 026704, 8 pages, 2002.
- T. M. Janaki and N. Gupte, “Connectivity strategies to enhance the capacity of weight-bearing networks,” Physical Review E, vol. 67, no. 2, Article ID 021503, 6 pages, 2003.
- R. V. Solé and S. Valverde, “Information transfer and phase transitions in a model of internet traffic,” Physica A, vol. 289, no. 3-4, pp. 595–605, 2001.
- S. Valverde and R. V. Solé, “Self-organized critical traffic in parallel computer networks,” Physica A, vol. 312, no. 3-4, pp. 636–648, 2002.
- D. K. Arrowsmith, R. J. Mondragon, J. M. Pittsy, and M. Woolf, Report 08 Institut Mittag-Leffler, Stockholm, Sweden, 2004.
- M. S. Taqqu, W. Willinger, and R. Sherman, “Proof of a fundamental result in self-similar traffic modeling,” vol. 27, article 5.
- M. E. Crovella and A. Bestavros, “Self-similarity in world wide web traffic: evidence and possible causes,” IEEE/ACM Transactions on Networking, vol. 5, no. 6, pp. 835–846, 1997.
- X. Jia, W. Zhao, and J. Li, “An integrated routing and admission control mechanism for real-time multicast connections in ATM networks,” IEEE Transactions on Communications, vol. 49, no. 9, pp. 1515–1519, 2001.
- M. Li and W. Zhao, “Asymptotic identity in min-plus algebra: a report on CPNS,” Computational and Mathematical Methods in Medicine, vol. 2012, Article ID 154038, 11 pages, 2012.
- M. Li and W. Zhao, “Visiting power laws in cyber-physical networking systems,” Mathematical Problems in Engineering, vol. 2012, 2012.
- E. G. Bakhoum and C. Toma, “Specific mathematical aspects of dynamics generated by coherence functions,” Mathematical Problems in Engineering, vol. 2011, Article ID 436198, 10 pages, 2011.
- E. G. Bakhoum and C. Toma, “Dynamical aspects of macroscopic and quantum transitions due to coherence function and time series events,” Mathematical Problems in Engineering, vol. 2010, Article ID 428903, 13 pages, 2010.
- D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
- A. L. Barabási, R. Albert, and A. Vespignani, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
- A. L. Barabási, R. Albert, and H. Jeong, “Mean-field theory for scale-free random networks,” Physica A, vol. 272, no. 1, pp. 173–187, 1999.
- L. Zhao, Y. C. Lai, K. Park, and N. Ye, “Onset of traffic congestion in complex networks,” Physical Review E, vol. 71, no. 2, Article ID 026125, 8 pages, 2005.
- J. D. Noh and H. Rieger, “Random walks on complex networks,” Physical Review Letters, vol. 92, no. 11, Article ID 118701, 4 pages, 2004.
- Z. Eisler and J. Kertész, “Random walks on complex networks with inhomogeneous impact,” Physical Review E, vol. 71, no. 5, Article ID 057104, pp. 1–4, 2005.
- B. Tadić, S. Thurner, and G. J. Rodgers, “Traffic on complex networks: towards understanding global statistical properties from microscopic density fluctuations,” Physical Review E, vol. 69, no. 3, Article ID 036102, 5 pages, 2004.
- R. Guimerà, A. Díaz-Guilerà, F. Vega-Redondo, A. Cabrales, and A. Arenas, “Optimal network topologies for local search with congestion,” Physical Review Letters, vol. 89, no. 24, Article ID 248701, 4 pages, 2002.
- G. Mukherjee and S. S. Manna, “Phase transition in a directed traffic flow network,” Physical Review E, vol. 71, no. 6, Article ID 066108, pp. 1–6, 2005.
- T. Zhou, G. Yan, B. H. Wang et al., “Traffic dynamics on complex networks,” Dynamics of Continuous, Discrete and Impulsive Systems Series B, vol. 13, no. 3-4, pp. 463–469, 2006.
- Z. Wu, G. Peng, W. Wong, and K. Yeung, “Improved routing strategies for data traffic in scale-free networks,” Journal of Statistical Mechanics, vol. 2008, no. 11, Article ID P11002, 2008.
- H. Zhang, Z. H. Liu, M. Tang, and P. M. Hui, “An adaptive routing strategy for packet delivery in complex networks,” Physics Letters, Section A, vol. 364, no. 3-4, pp. 177–182, 2007.
- Z. Chen and X. Wang, “Effects of network structure and routing strategy on network capacity,” Physical Review E, vol. 73, no. 3, Article ID 036107, pp. 1–5, 2006.
- M. B. Hu, B. H. Wang, R. Jiang, Q. S. Wu, and Y. H. Wu, “The effect of bandwidth in scale-free network traffic,” Europhysics Letters, vol. 79, no. 1, Article ID 14003, 2007.
- M. B. Hu, R. Jiang, Y. H. Wu, and Q. S. Wu, “The effect of link and node capacity on traffic dynamics in weighted scale-free networks,” in Proceedings of the International Conference on Complex Sciences, vol. 4, part 1 of Lecture Notes of the Institute for Computer Sciences and Telecommunications, pp. 580–588, Springer, Berling Heidelberg, Germany, 2009.
- R. Jiang, M. B. Hu, W. X. Wang, G. Yan, Q. S. Wu, and B. H. Wang, “Traffic dynamics of packets generated with none-homogeneously selected sources and destinations in scale-free networks,” Dynamics of Continuous, Discrete and Impulsive Systems B Supplement, vol. 14, supplement 7, pp. 51–54, 2007.
- M. E. J. Newman, “Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality,” Physical Review E, vol. 64, no. 1, Article ID 016132, 2001.
- M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, Article ID 026113, 2004.
- K. I. Goh, B. Kahng, and D. Kim, “Universal behavior of load distribution in scale-free networks,” Physical Review Letters, vol. 98, article 278701, 2004.
- M. Barthélemy, “Betweenness centrality in large complex networks,” European Physical Journal B, vol. 38, no. 2, pp. 163–168, 2004.
- W. Huang and T. W. S. Chow, “Investigation of both local and global topological ingredients on transport efficiency in scale-free networks,” Chaos, vol. 19, no. 4, Article ID 043124, 2009.
- D. Krioukov, K. Fall, and X. Yang, “Compact routing on internet-like graphs,” in Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 209–219, March 2004.
- A. S. Tanenbaum, Computer Network, Prentice Hall Press, 1996.
- C. Huitema, Routing in the Internet, Prentice Hall, Up per Saddle River, NJ, USA, 2000.
- B. Danila, Y. Yu, J. A. Marsh, Z. Toroczkai, and K. E. Bassler, “Transport optimization on complex networks,” Chaos, vol. 17, no. 2, Article ID 026102, 2007.
- G. Yan, T. Zhou, B. Hu, Z. Q. Fu, and B. H. Wang, “Efficient routing on complex networks,” Physical Review E, vol. 73, no. 4, Article ID 046108, pp. 1–5, 2006.
- P. Echenique, J. Gomez-Gardenes, and Y. Moreno, “Improved routing strategies for Internet traffic delivery,” Physical Review E, vol. 70, no. 5, Article ID 056105, 2004.
- P. Echenique, J. Gomez-gardenes, and Y. Moreno, “Dynamics of jamming transitions in complex networks,” Europhysics Letters, vol. 71, no. 2, pp. 325–331, 2005.
- L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, “Search in power-law networks,” Physical Review E, vol. 64, no. 4, Article ID 046135, 2001.
- R. Albert, H. Jeong, and A. L. Barabási, “Diameter of the world-wide web,” Nature, vol. 401, no. 6749, pp. 130–131, 1999.
- W. X. Wang, C. Y. Yin, G. Yan, and B. H. Wang, “Integrating local static and dynamic information for routing traffic,” Physical Review E, vol. 74, no. 1, Article ID 016101, 2006.
- M. B. Hu, R. Jiang, Y. H. Wu, W. X. Wang, and Q. S. Wu, “Urban traffic from the perspective of dual graph,” European Physical Journal B, vol. 63, no. 1, pp. 127–133, 2008.
- S. Scellato, L. Fortuna, M. Frasca, J. Gómez-Gardeñes, and V. Latora, “Traffic optimization in transport networks based on local routing,” European Physical Journal B, vol. 73, no. 2, pp. 303–308, 2010.
- J. M. Kleinberg, “Navigation in a small world,” Nature, vol. 406, article 845, 2000.
- B. J. Kim, C. N. Yoon, S. K. Han, and H. Jeong, “Path finding strategies in scale-free networks,” Physical Review E, vol. 65, no. 2, Article ID 027103, 2002.
- C. P. Herrero, “Self-avoiding walks on scale-free networks,” Physical Review E, vol. 71, no. 1, Article ID 016103, 2005.
- S. J. Yang, “Exploring complex networks by walking on them,” Physical Review E, vol. 71, no. 1, Article ID 016107, 2005.
- W. X. Wang, B. H. Wang, C. Y. Yin, Y. B. Xie, and T. Zhou, “Traffic dynamics based on local routing protocol on a scale-free network,” Physical Review E, vol. 73, no. 2, Article ID 026111, 2006.
- C. Y. Yin, B. H. Wang, W. X. Wang, T. Zhou, and H. J. Yang, “Efficient routing on scale-free networks based on local information,” Physics Letters, Section A, vol. 351, no. 4-5, pp. 220–224, 2006.
- B. Tadić and G. J. Rodgers, “Packet transport on scale-free networks,” Advances in Complex Systems, vol. 5, article 445, 2002.
- B. Tadić and S. Thurner, “Information super-diffusion on structured networks,” Physica A, vol. 332, no. 1–4, pp. 566–584, 2004.
- X. Ling, M. B. Hu, R. Jiang, and Q. S. Wu, “Global dynamic routing for scale-free networks,” Physical Review E, vol. 81, no. 1, Article ID 016113, 2010.
- A. E. Motter, “Cascade control and defense in complex networks,” Physical Review Letters, vol. 93, no. 9, Article ID 98701, 2004.
- A. E. Motter, N. Gulbahce, E. Almaas, and A. L. Barabási, “Predicting synthetic rescues in metabolic networks,” Molecular Systems Biology, vol. 4, article 168, 2008.
- T. Nishikawa and A. E. Motter, “Network synchronization landscape reveals compensatory structures, quantization, and the positive effect of negative interactions,” The Proceedings of the National Academy of Sciences USA, vol. 107, no. 23, Article ID 10342, 2010.
- Z. Liu, M. B. Hu, R. Jiang, W. X. Wang, and Q. S. Wu, “Method to enhance traffic capacity for scale-free networks,” Physical Review E, vol. 76, no. 3, Article ID 037101, 2007.
- G. Q. Zhang, D. Wang, and G. J. Li, “Enhancing the transmission efficiency by edge deletion in scale-free networks,” Physical Review E, vol. 76, no. 1, Article ID 017101, 2007.
- W. Huang and T. W. S. Chow, “An efficient strategy for enhancing traffic capacity by removing links in scale-free networks,” Journal of Statistical Mechanics, vol. 2010, no. 1, Article ID P01016, 2010.
- T. J. P. Penna, “Traveling salesman problem and Tsallis statistics,” Physical Review E, vol. 51, no. 1, pp. R1–R3, 1995.
- D. A. Stariolo and C. Tsallis, Annual Review of Computational Physics II, Edited by D. Stauffer, World Scientific, Singapore, 1994.
- W. Huang and T. W. S. Chow, “Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network,” Chaos, vol. 20, no. 3, Article ID 033123, 2010.
- A. E. Motter and Y. C. Lai, “Cascade-based attacks on complex networks,” Physical Review E, vol. 66, no. 6, Article ID 065102, 2002.
- L. Zhao, K. Park, and Y. C. Lai, “Attack vulnerability of scale-free networks due to cascading breakdown,” Physical Review E, vol. 70, no. 3, Article ID 035101, 2004.
- A. E. Motter, “Cascade control and defense in complex networks,” Physical Review Letters, vol. 93, no. 9, Article ID 098701, 2004.
- L. Zhang, K. Park, Y. C. Lai, and N. Ye, “Tolerance of scale-free networks against attack-induced cascades,” Physical Review E, vol. 72, no. 2, Article ID 025104, pp. 1–4, 2005.
- R. Yang, W. X. Wang, Y. C. Lai, and G. Chen, “Optimal weighting scheme for suppressing cascades and traffic congestion in complex networks,” Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, vol. 79, no. 2, Article ID 026112, 2009.
Copyright © 2012 Shengyong Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.