Effective Gravitation Path Routing Strategy on Scale-Free Networks

Abstract

Information routing strategy is a hot issue in the study of complex network traffic dynamics. In this paper, we define a new gravitational centrality and introduce parameter α 1 to control the centrality of nodes. When α 1 are appropriate values, the gravitational centrality have the function of dividing the centrality of the same degree nodes. According to the gravitational centrality, we propose an effective gravitation path routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates gravitational centrality of nodes in paths. The purpose of this strategy is to improve network traffic capacity. The simulation results on the scale-free network show that our routing strategy is more effective than the efficient routing strategy proposed by Yan et al. [Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top. 73, 046108 (2006)].INDEX TERMS Complex networks, scale-free network, congestion, traffic capacity.

An effective routing strategy using congestion signaling for various types of communication networks

“…( 4), if the node i and j are the same nodes, f ij takes k i . Equation (5) weightly summarizes the number of paths between nodes i and j over l hops. In this study, we set the maximum value of l to 50 by considering the size of the networks.…”

“…In addition, real-time information is defined as dynamically changing information, such as the number of stored packets in the networks. Because the real-time information can only sometimes be available in practical systems, the conventional routing strategies [4,5] assigned newly defined costs without using the real-time information to the links in the communication network and transmitted the packets using the shortest paths based on these costs to mitigate network congestion. Reference [5] proposed an Effective Gravitation Path Routing (EGPR) strategy by using gravitational centrality (GC), which uses the global information, that successfully distinguishes the centralities of nodes if the nodes have the same degree in the networks.…”

“…Because the real-time information can only sometimes be available in practical systems, the conventional routing strategies [4,5] assigned newly defined costs without using the real-time information to the links in the communication network and transmitted the packets using the shortest paths based on these costs to mitigate network congestion. Reference [5] proposed an Effective Gravitation Path Routing (EGPR) strategy by using gravitational centrality (GC), which uses the global information, that successfully distinguishes the centralities of nodes if the nodes have the same degree in the networks. Although the EGPR strategy well mitigated the congestion of packets in the communication networks with the scale-free property, our numerical experiments showed that this strategy [5] further mitigated the congestion if the real-time information, such as the number of stored packets at the adjacent nodes, was available when transmitting the packets.…”

“…Reference [5] proposed an Effective Gravitation Path Routing (EGPR) strategy by using gravitational centrality (GC), which uses the global information, that successfully distinguishes the centralities of nodes if the nodes have the same degree in the networks. Although the EGPR strategy well mitigated the congestion of packets in the communication networks with the scale-free property, our numerical experiments showed that this strategy [5] further mitigated the congestion if the real-time information, such as the number of stored packets at the adjacent nodes, was available when transmitting the packets. However, as mentioned above, the real-time information might not be instantaneously available in practical systems.…”