TY - JOUR
T1 - Optimal resource allocation for network functionality
AU - Patron, Amikam
AU - Cohen, Reuven
N1 - Publisher Copyright: © 2020 The Author(s). Published by IOP Publishing Ltd on behalf of the Institute of Physics and Deutsche Physikalische Gesellschaft.
PY - 2020/7
Y1 - 2020/7
N2 - The traditional approach to network robustness, is based on comparing network parameters before and after an event of nodes removal, such as the change in network diameter, the change in giant component size and the existence of giant component. Compared to the traditional approach, there is a later and innovative approach to network robustness, where the network functionality during its entire life span (during the node removal event) is considered. This approach considers nodes removal due to aging-non functionality of nodes when their survival time duration-their lifetime-is passed. Accordingly, a problem that has to be solved is: In the network design stage, how to allocate a budget of lifetime between the network's nodes, such that the network functionality during all the stages of nodes removal due to aging, is maximized. To date, the problem has been solved only partially and numerically. In this paper we solve the problem analytically. Based on a local information only on the network's degree distribution p k without knowing the network's structure and topology, we derive a criterion for choosing the right set of nodes on which the total lifetime budget should be allocated, and find analytically the optimal way of allocating the lifetime budget between the chosen set's nodes, such that the network robustness with consideration to its functionality in the entire life span, is maximized.
AB - The traditional approach to network robustness, is based on comparing network parameters before and after an event of nodes removal, such as the change in network diameter, the change in giant component size and the existence of giant component. Compared to the traditional approach, there is a later and innovative approach to network robustness, where the network functionality during its entire life span (during the node removal event) is considered. This approach considers nodes removal due to aging-non functionality of nodes when their survival time duration-their lifetime-is passed. Accordingly, a problem that has to be solved is: In the network design stage, how to allocate a budget of lifetime between the network's nodes, such that the network functionality during all the stages of nodes removal due to aging, is maximized. To date, the problem has been solved only partially and numerically. In this paper we solve the problem analytically. Based on a local information only on the network's degree distribution p k without knowing the network's structure and topology, we derive a criterion for choosing the right set of nodes on which the total lifetime budget should be allocated, and find analytically the optimal way of allocating the lifetime budget between the chosen set's nodes, such that the network robustness with consideration to its functionality in the entire life span, is maximized.
KW - Complex networks
KW - Network robustness
KW - Networks optimization
KW - Percolation on networks
UR - http://www.scopus.com/inward/record.url?scp=85091451388&partnerID=8YFLogxK
U2 - https://doi.org/10.1088/1367-2630/ab8e15
DO - https://doi.org/10.1088/1367-2630/ab8e15
M3 - مقالة
SN - 1367-2630
VL - 22
JO - New Journal of Physics
JF - New Journal of Physics
IS - 7
M1 - 073011
ER -