کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7374504 | 1480062 | 2018 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimizing robustness of complex networks with heterogeneous node functions based on the Memetic Algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimizing robustness of complex networks with heterogeneous node functions based on the Memetic Algorithm Optimizing robustness of complex networks with heterogeneous node functions based on the Memetic Algorithm](/preview/png/7374504.png)
چکیده انگلیسی
Cascading failure is an ubiquitous phenomenon in many types of complex networks, and it has attracted significant concerns in the past decade. In this paper, we consider a generic transmission network consisting of two kinds of nodes, i.e., hosts and routers, and only the hosts can generate and receive packets. In such a host-router network model, the network robustness against cascading failure is closely related to the hosts' locations. We employ the memetic algorithm (MA) to find a near-optimal way to locate the hosts, which remarkably improves the network robustness compared with three degree-based methods. Furthermore, we investigate the optimal configuration of the hosts given by the MA algorithm and put forward a faster method to select the hosts. This work provides a start point for systematically analyzing and optimizing network robustness of complex networks with heterogeneous node functions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 511, 1 December 2018, Pages 143-153
Journal: Physica A: Statistical Mechanics and its Applications - Volume 511, 1 December 2018, Pages 143-153
نویسندگان
Taocheng Wu, Jiajing Wu, Wei You,