The effect of data exchange policy on traffic flow between interconnected networks

In order to understand and achieve an optimal functioning in real traffic systems, the problem of congestion in complex networks takes an important place in many recent researches. In this paper, we study the effect of different types of interconnections between two scale free networks on the traffic flow. Two interconnection strategies are used: in the first, we create links between nodes chosen at random from the two subnets G(1) and G(2) and, while in the second one, we link nodes selected among the hubs of the subnets. The resulting network G is under a new routing strategy inspired from the minimal traffic model introduced in [D. De Martino, Phys. Rev. E 79, 015101 (2009); S. Lamzabi, S. Lazfi, H. Ez-Zahraouy, A. Benyoussef, A. Rachadi and S. Ziti, Int. J. Mod. Phys. C 25, 1450019 (2014)]. We find that in case of this routing method, the interconnection pattern has no effect on the results. Further, to control the exchange of packets between the subnets, we propose two adjusting parameters alpha(1) and alpha(2). The study of the variation of these parameters shows that the optimal network capacity is obtained when the two subnets are allowed to exchange data more openly.