Load balanced diffusive capture process on homophilic scale-free networks |
| |
Authors: | András Telcs Márton Csernai András Gulyás |
| |
Institution: | 1. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, 1117 Budapest, Hungary;2. Department of Quantitative Methods, Faculty of Economics, University of Pannonia, 8200 Veszprém, Hungary;3. MTA-BME Future Internet Research Group, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, 1117 Budapest, Hungary |
| |
Abstract: | Diffusive capture processes are known to be an effective method for information search on complex networks. The biased N lions–lamb model provides quick search time by attracting random walkers to high degree nodes, where most capture events take place. The price of the efficiency is extreme traffic concentration on top hubs. We propose traffic load balancing provided by type specific biased random walks. For that we introduce a multi-type scale-free graph generation model, which embeds homophily structure into the network by utilizing type dependent random walks. We show analytically and with simulations that by augmenting the biased random walk method with a simple type homophily rule, we can alleviate the traffic concentration on high degree nodes by spreading the load proportionally between hubs with different types of our generated multi-type scale-free topologies. |
| |
Keywords: | Random walk Diffusive capture process Scale-free network Community structure Information search Load balancing |
本文献已被 ScienceDirect 等数据库收录! |
|