Enhance the Transfer Capacity of Multiplex Networks

Shao, Fei; Zhao, Wei; Cheng, Binghua

doi:https://doi.org/10.1155/2021/6687463

Complexity

On this page

Abstract Introduction Materials and Methods Results and Discussion Conclusions Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Green Computing in Complex Systems

View this Special Issue

Research Article | Open Access

Volume 2021 | Article ID 6687463 | https://doi.org/10.1155/2021/6687463

Enhance the Transfer Capacity of Multiplex Networks

Fei Shao,^1,2Wei Zhao,^1,2and Binghua Cheng¹

Academic Editor: Yongsheng Hao

Received20 Nov 2020

Revised22 Dec 2020

Accepted28 Dec 2020

Published13 Jan 2021

Abstract

Most complex real systems are found to have multiple layers of connectivity and required to be modelled as multiplex networks. One of the extremely critical problems is to reduce the congestion and enhance the transfer capacity, especially in real communication networks with a big data environment. A novel and effective strategy to improve traffic and control congestion is proposed by adding edges according to their weights which are defined by the topology structural properties. Furthermore, which layer is more effective when our strategy is applied is discussed based on its topology structure. Adding edges between nodes whose product of multiplex network betweenness is the highest is confirmed to be more effective, particularly in the layer with stronger community structure. Simulation experiments on both computer-generated and real-world networks demonstrate that our strategy can enhance the transfer capacity of multiplex networks significantly, which is in good agreement with our analysis.

1. Introduction

The complex real systems can be depicted as complex networks [1, 2] with small-world effects [1] or scale-free properties [2]. These complex systems, such as online social networks, biological systems, and the Internet, are abstracted as a graph, while nodes represent individuals and edges represent the interactions among them. In recent decades, due to the ever-increasing amount of information transfer on the Internet and online social networks, it is of paramount interest to explore the transfer capacity of complex networks [3–7]. Models of packet transfer process in computer networks are presented in many previous studies. In most of the models presented, all nodes in the network are both hosts and routers. Hosts generate packets to be sent to destination addresses and receive packets from other hosts or routers, while routers forward the packets to their destinations according to the specified routing strategy. At each time step, every node in the network generates a packet with a constant packet generated rate λ, with randomly chosen source and destination addresses. Once a packet is generated, it is placed at the tail of the queue with packets generated by itself or transferred from neighbours in the previous time steps. Meanwhile, the first C_i packets at the head of the queue of each node i are forwarded one step to their destinations and placed at the tail of the queues of the selected nodes. When a packet arrives at its final destination, it will be expelled from the network. The transfer capacity of each node is defined in different ways. In some models, it is considered to be the same in all nodes while to be proportional to its topology metrics such as degree or betweenness in other models. These former studies are focused on the critical value λ_c of the packet-generated rate [3, 5, 8]. We can obtain a phase transition from free state to congestion at the critical point λ_c along with the increase of the packet-generated rate. For λ < λ_c, the amount of generated and transferred packets is balanced and the whole network is in a steady free state. For λ > λ_c, it turns into a jammed state because the node cannot transfer the packet beyond its limited transfer capacity. This critical packet-generated rate λ_c can best reflect the maximum packet transfer capacity of a network. Therefore, it is used to estimate which routing strategy is of more validity. It may have a certain reference value for the real-world networks.

Along with the development of studies on the topology of complex networks, a mesoscopic description, community structure, is found in many networks [9–14]. It is presented that there is a tendency for nodes to divide into communities within which node-node connections are dense but between which connections are sparse. The modularity Q [12] is defined as a measure of the community structure which can specify a certain mesoscopic description of the network in terms of communities being more or less accurate. The larger value of Q means a more accurate division of community. The influence of community structure on packet transport and how to enhance the transfer capacity based on community structure are also investigated [4, 15, 16].

Traditional studies of complex networks usually assume that all nodes are linked to each other by a certain type of edge to produce a single-layer network. Recently, it has been recognized that lots of complex real systems are not composed by single network primitively, but by multiplex network [17–24]. They consist of a series of N nodes linked by L different kinds of interactions. All interactions of the same kind determine a unique layer/network of the multiplex network. Nodes have diverse neighbours in each layer. For example, the multiplex network of relationships existing among employees of the Computer Science Department of Aarhus University [23] contains 61 nodes (employees) and five different layers (five kinds of online or offline relationships): Facebook, Leisure, Work, Co-authorship, and Lunch. Generally, the routing strategy is based on the shortest-path algorithm in the single-layer network. However, in a multiplex network, there are two distinct kinds of shortest paths: paths that only use a single layer and paths that use more than one layer. The dynamic process in multiplex networks is becoming a hot spot of current research [17–20, 25–27].

Adjusting the network topology structure, such as adding or deleting some edges, is effective to improve the network transfer capability of the single-layer network [4, 28, 29]. The multiplex network consists of two or more single-layer networks with different community structures. How to enhance the transfer capacity based on the interior topology characteristics attracts our attention. By adding edges in the light of the different definitions of edge weight, we present strategies to enhance the transfer capacity of the multiplex network. And the impacts of the nodes number N and the modularity Q of different layers on our strategies will be discussed.

The rest of this paper is organized as follows. Section 2 presents the proposed routing strategies method. Extensive simulation experiments are conducted to validate our routing strategies and make comparisons, and the results are reported in Section 3. Eventually, conclusions are made in Section 4.

2. Materials and Methods

The node betweenness b_i is widely used to access the possible traffic through node i under a specified routing strategy, in general, the shortest-path routing algorithm [30]. It is usually defined as follows:where is the amount of shortest paths connected nodes s and t while passing through node i and is the total amount of shortest paths connected nodes s and t. The likelihood that a generated packet will travel through node i is . Accordingly, the mean number of packets that node i receives at a certain time step is . When the number of incoming packets is no less than the packet transfer capacity of node i, that is, , the node is unable to forward all packets to their destination and it will produce a congestion in the network gradually. The critical packet generated rate λ_c is [3, 4]

When it turns to a multiplex network, there are two different types of shortest paths: intralayer paths and interlayer paths. When we investigate the dynamics of multiplex network, the number of shortest paths must be considered together with the intralayer paths and interlayer paths through a certain node. The critical packet injection rate of the multiplex network is as follows [19, 25, 27]:

where τ_i is the max node processing rate of node i, which is similar to the packet delivery capability C_i in the previous studies. In general, we suppose that all nodes have the same maximum processing rate τ_i and we set τ_i = 1 for simplicity. L is the layer number and B_i is the multiplex betweenness of node i. The critical injection rate ρ_c is used to estimate the maximum transfer capacity of a multiplex network.

In a system divided into m communities, a symmetric matrix E is used to calculate the modularity whose element e_ij is the portion of all edges in the system that connect nodes in two different communities, community i and community j. The modularity measure, Q, is as follows [12, 13]:where .

Different divisions of the network result in different Q, and the maximum is symbolized by Q_max. The greater modularity Q_max implies the stronger community structure inside the system. Multiplex networks always contain two or more single-layer networks with different community structures. Our strategies are as follows:

(1) In a certain single-layer network of multiplex network, we calculate the weight of all node pairs, W_ij, between nodes i and j, in different ways according to different definitions. In the MBP strategy, W_ij is equal to the product of their multiplex betweenness B_i∗B_j. In the SBP strategy, W_ij is equal to the product of their node betweenness b_i∗b_j using the shortest-path routing algorithm. In the DDP strategy, W_ij is equal to the product of their degree k_i∗k_j. (2) We sort the weights in decreasing order and add the edge between the node pair whose weight is at the top. If adding an edge will cause multiple edges between the node pair, we will not add the edge, but cope with the node pair rank next. (3) We renew the weight W_ij and duplicate step 2 until a certain f_e of edges are added.

In a simple network with N nodes, N∗(N−1)/2 edges are the maximum. If the mean degree is <k>, there exist N ∗ <k>/2 edges approximately. The number of edges we can add is N ∗ (N−1)/2- N ∗ <k>/2. We only add 10 percent of the edges we can add at most. A fraction f_e = 1 means 0.1 ∗ (N ∗ (N−1)/2- N ∗ <k>/2) edges are added. When each edge is added, we calculate the critical packet injection rate ρ_c of the new multiplex system and record the enhancement as ρ_c/ρ_c0 where ρ_c0 is the critical packet injection rate of the original multiplex system.

For comparison, we define the RAN strategy as adding edges randomly (also without multiple edges). And, the validity of our strategies on different layers will be discussed by adapting our strategies in different layers.

3. Results and Discussion

We generate a multiplex network that only consists of two Erdős–Rényi single-layer networks. In each single-layer network, we utilize a series of pseudorandom networks with N nodes and separate these nodes into m communities. Each node has the average number of edges, Z_in, connected to the nodes in the same community and Z_out connected to the nodes of any other communities, while the average degree <k> = Z_in + Z_out is constant. We can adjust Z_in for different community structures. In all simulations, we generate 100 multiplex networks randomly to calculate the average.

Firstly, we generate a multiplex network with 128 nodes which are separated into 4 equal communities while the average degree <k> is fixed to be 16. In layer 1, Z_in is fixed to be 8, which means the single-layer network in layer 1 is a totally random network. In layer 2, we change Z_in from 8 to 11 and 14 to get increasingly pronounced community structure. The results are exhibited in Figure 1.

(a)

(b)

(c)

As shown in Figure 1, when f_e is larger than zero, ρ_c/ρ_c0 is greater than 1. It means that when some edges are added, the critical packet injection rate of the new multiplex network is greater than that of the original multiplex network. Therefore, our strategies can enhance the transfer capacity of the multiplex network. In Figures 1(a)–1(c), the MBP strategy, adding edges with the highest product of multiplex betweenness, is the most effective one, while the enhancement as ρ_c/ρ_c0 of the MBP strategy is the highest. The modularity Q_max of the single network in layer 1 is about 0.2245. In layer 2, when Z_in is 8, the modularity Q_max is close to 0.2245. When Z_in increases to 11, the modularity Q_max is about 0.4404 and 0.6288 for Z_in = 14. By comparing Figures 1(a) with 1(b) and 1(c), we can discover that they are more effective in the network with stronger community structure, especially the MBP strategy.

Then, we apply our strategies in different layers to check the impact of community structure on our strategies. In layer 1, we set Z_in as 14, which means the single-layer network in layer 1 has a strong community structure. In layer 2, we change Z_in from 8 to 14 to obtain the results presented in Figure 2.

(a)

(b)

From Figure 2, we can observe that the MBP strategy is also the most effective among these strategies. And, when the layer where our strategies are applied has stronger community structure, our strategies are more effective. Comparing Figure 2(a) with Figure 1(c), we can discover that in a multiplex network consisting of two layers with different community structures, applying our strategies in the one with pronounced community structure yields better results.

Afterwards, we double the average degree <k> to 32 to check the influence of average degree <k>. Results are illustrated in Figure 3.

(a)

(b)

Due to the increase of the average degree <k>, the absolute number of edges we can add is rising. However, we keep the relative proportion of added edges fixed to 10 percent. The change of average degree almost has no influence on our strategies. Figure 3 also proves that the MBP strategy works better than the other strategies, particularly in the layer with strong community structure.

The impact of communities number m is presented in Figure 4.

(a)

(b)

From Figures 4(a) and 4(b), we can detect the enhancement of the MBP strategy is still the highest. The increase of communities number results in more accurate division of the network and the stronger community structure. In Figure 4(a), the modularity of layer 2 is about 0.3234, while in Figure 4(b), it is 0.6982. Hence, the enhancement in Figure 4(b) is nearly 268.48%, which is greater than 198.37% in Figure 4(a).

Finally, we check the influence of network size. We generate two-layer multiplex network with N = 256 nodes in m = 8 communities. The average degree <k> and the adjusting parameter of community structure Z_in are also increased accordingly. Results are shown in Figure 5.

(a)

(b)

The enhancement ρ_c/ρ_c0 of the MBP strategy is the highest as usual regardless of the expansion of network scale. The increase of adjusting parameter of community structure Z_in leads to stronger community structure. Figure 5 also validates that our strategies work more efficiently in the network with distinct community structures.

The incessant expansion of the network poses a new challenge to our strategies. Since most of the real networks are rather large with massive number of nodes and edges, it is of vital importance to consider the computational cost of the algorithm required to compute the multiplex network betweenness. The computational complexity of our strategies is mainly dominated by the calculation of the multiplex betweenness. The time complexity of computing betweenness centrality of unweighted multiplex networks is O (L∗N∗M) by using Breadth First Search [17] (M is the number of edges) which is acceptable under current circumstances.

The above simulations are run in computer-generated multiplex networks. Then, we verify our three strategies on real-world systems. We apply our strategies to the multiplex network of relationships among employees of the Computer Science Department of Aarhus University [23]. We choose two layers with Giant Components: the “Lunch” network and the “Work” network. The “Lunch” network has 193 edges and the modularity is 0.6548, while the “Work” network has 194 edges and the modularity is 0.4587. We apply our strategies in each layer to test them and get the simulations shown in Figure 6.

(a)

(b)

As shown in Figure 6(a), the MBP strategy can almost triple the transfer capacity when it is applied in the “Work” network whose modularity is 0.4587. In Figure 6(b), the enhancement is up to 333.4% when the MBP strategy is used in the “Lunch” network with stronger modularity of 0.6548. It indicates that our strategies are of practical value in enhancing transfer capacity in real multiplex networks.

Adding edges between nodes with the highest product of multiplex betweenness will make the two nodes to connect directly to each other. In general, it will reduce the load of those nodes with high multiplex betweenness. Stronger community structure will result in more nodes with high multiplex betweenness. That is why our strategies are more effective in the network with pronounced community structure. To uncover how our strategies work, we conduct further research on the initial and final multiplex betweenness. We employ the MBP strategy on the computer-generated multiplex network with N = 128, m = 4, <k> = 16, and Z_in = 8 in layer 1 and Z_in = 14 in layer 2 (the same simulation environment as Figure 1(c)) and the real CS-Aarhus multiplex network (the same simulation environment as Figure 6(b)). The multiplex betweennesses plot against the node index is presented in Figure 7.

(a)

(b)

Initially, in the original multiplex network, the multiplex betweennesses are distributed over a pretty wide range (see the square in Figure 7). After applying the MBP strategy, in the ultimate multiplex network, the multiplex betweennesses are restricted to an extremely narrow region (see the plus sign in Figure 7). There is a significant decrease in the highest multiplex betweenness of all nodes. The multiplex betweennesses are more uniformly distributed after our strategies are applied. In Figure 7(b), there are a few nodes with comparatively high multiplex betweenness. The sharp declines of these nodes lead to a higher increase of network transfer capacity.

In our strategies, we add edges between nodes which will result in shortcuts between nodes. Therefore, the average path length will be reduced and the small-world phenomenon is still maintained.

4. Conclusions

In order to enhance the transfer capacity of multiplex systems, we propose some strategies by adding edges according to different weights. By checking the critical packet injection rate of the multiplex network, we discover that our strategies are capable of enhancing the transfer capacity significantly. The MBP which adds edges with the highest product of multiplex betweenness is more effective than the others. The impacts of different topology characteristics, such as the community structure, the average degree, the communities number, and the nodes number, are explored to find that our strategies are more effective in multiplex networks with pronounced community structure. And in a two-layer network with different community structures, applying our strategies in the layer with the stronger community structure can yield better results. Our strategies are proved to be very effective by simulation results of computer-generated networks and real-world systems. The time complexity of our strategies is also acceptable which means our strategies might be helpful in developing more efficient transfer networks and routing strategies.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

F. SHAO thanks Dr. Albert Solé Ribalta of the Complex Systems group at IN3 for sharing the source code of references [17] and [25] to validate the betweenness of the multiplex network. This research was funded by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (Grant nos. 17KJA520001, 18KJA520003, and 19KJA510004) and the National Natural Science Foundation of China (No. 61375121). Also, the APC was funded by Jinling Institute of Technology.

References

D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
View at: Publisher Site | Google Scholar
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
View at: Publisher Site | Google Scholar
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, 2005.
View at: Publisher Site | Google Scholar
R. Guimerà, A. Díaz-Guilera, F. Vega-Redondo et al., “Optimal network topologies for local search with congestion,” Physical Review Letters, vol. 89, no. 24, pp. 248–701, 2002.
View at: Publisher Site | Google Scholar
G. Yan, T. Zhou, B. Hu et al., “Efficient routing on complex networks,” Physical Review E, vol. 73, no. 4, Article ID 046108, 2006.
View at: Publisher Site | Google Scholar
Z. Toroczkai and K. E. Bassler, “Jamming is limited in scale-free systems,” Nature, vol. 428, no. 6984, p. 716, 2004.
View at: Publisher Site | Google Scholar
R. Ding, “The complex network theory-based urban land-use and transport interaction studies,” Complexity, vol. 2019, 2019.
View at: Google Scholar
G.-Q. Zhang, S. Zhou, D. Wang, G. Yan, and G.-Q. Zhang, “Enhancing network transmission capacity by efficiently allocating node capability,” Physica A: Statistical Mechanics and Its Applications, vol. 390, no. 2, pp. 387–391, 2011.
View at: Publisher Site | Google Scholar
A. Solé-Ribalta, C. Granell, S. Gómez, and A. Arenas, “Information transfer in community structured multiplex networks,” Frontiers in Physics, vol. 3, no. 61, 2015.
View at: Publisher Site | Google Scholar
M. E. J. Newman, “Communities, modules and large-scale structure in networks,” Nature Physics, vol. 8, no. 1, pp. 25–31, 2012.
View at: Publisher Site | Google Scholar
S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3-5, pp. 75–174, 2010.
View at: Publisher Site | Google Scholar
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.
View at: Publisher Site | Google Scholar
M. E. J. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E, vol. 69, no. 6, Article ID 066133, 2004.
View at: Publisher Site | Google Scholar
M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences, vol. 99, no. 12, pp. 7821–7826, 2002.
View at: Publisher Site | Google Scholar
L. Danon, A. Arenas, and A. Díaz-Guilera, “Impact of community structure on information transfer,” Physical Review E, vol. 77, no. 3, Article ID 036103, 2008.
View at: Publisher Site | Google Scholar
J. Cai, Y. Wang, Y. Liu, J.-Z. Luo, W. Wei, and X. Xu, “Enhancing network capacity by weakening community structure in scale-free network,” Future Generation Computer Systems, vol. 87, pp. 765–771, 2018.
View at: Publisher Site | Google Scholar
A. Solé-Ribalta, M. D. Domenico, S. Gómez, and A. Arenas, “Centrality rankings in multiplex networks,” in Proceedings of the 2014 ACM Conference on Web Science, ACM, Bloomington, IN, USA, June 2014.
View at: Google Scholar
G. F. d. Arruda, F. A. Rodrigues, and Y. Moreno, “Fundamentals of spreading processes in single and multilayer complex networks,” Physics Reports, vol. 756, 2018.
View at: Google Scholar
A. Solé-Ribalta, S. Gómez, and A. Arenas, “Congestion induced by the structure of multiplex networks,” Physical Review Letters, vol. 116, no. 10, Article ID 108701, 2016.
View at: Publisher Site | Google Scholar
M. D. Domenico, C. Granell, M. A. Porter, and A. Arenas, “The physics of spreading processes in multilayer networks,” Nature Physics, vol. 12, no. 10, p. 901, 2016.
View at: Google Scholar
E. Cozzo and Y. Moreno, “Characterization of multiple topological scales in multiplex networks through supra-Laplacian eigengaps,” Physical Review E, vol. 94, no. 5, 2016.
View at: Publisher Site | Google Scholar
M. D. Domenico, A. Solé-Ribalta, E. Cozzo et al., “Mathematical formulation of multilayer networks,” Physical Review X, vol. 3, no. 4, Article ID 041022, 2013.
View at: Google Scholar
L. Rossi and M. Magnani, “Towards effective visual analytics on multiplex and multilayer networks,” Chaos, Solitons & Fractals, vol. 72, pp. 68–76, 2015.
View at: Publisher Site | Google Scholar
X. Zhu, J. Ma, X. Su et al., “Information spreading on weighted multiplex social network,” Complexity, vol. 2019, no. 15, Article ID 5920187, 2019.
View at: Publisher Site | Google Scholar
A. Solé-Ribalta, A. Arenas, and S. Gómez, “Effect of shortest path multiplicity on congestion of multiplex networks,” New Journal of Physics, vol. 21, no. 3, Article ID 035003, 2019.
View at: Publisher Site | Google Scholar
C. Rahmede, J. Iacovacci, A. Arenas, and G. Bianconi, “Centralities of nodes and influences of layers in large multiplex networks,” Journal of Complex Networks, vol. 6, no. 5, pp. 733–752, 2017.
View at: Publisher Site | Google Scholar
A. Solé-Ribalta, M. De Domenico, S. Gómez, and A. Arenas, “Random walk centrality in interconnected multilayer networks,” Physica D: Nonlinear Phenomena, vol. 323-324, pp. 73–79, 2016.
View at: Publisher Site | Google Scholar
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.
View at: Publisher Site | Google Scholar
A. Arenas, A. Díaz-Guilera, and R. Guimerà, “Communication in networks with hierarchical branching,” Physical Review Letters, vol. 86, no. 14, pp. 3196–3199, 2001.
View at: Publisher Site | Google Scholar
L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry, vol. 40, no. 1, pp. 35–41, 1977.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2021 Fei Shao 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.

PDF Download Citation

Download other formats

Order printed copies

Views

280

Downloads

855

Citations