Building reliable budget-based binary-state networks

Everyday life is driven by various network, such as supply chains for distributing raw materials, semi-finished product goods, and final products; Internet of Things (IoT) for connecting and exchanging data; utility networks for transmitting fuel, power, water, electricity, and 4 G/5 G; and social networks for sharing information and connections. The binary-state network is a basic network, where the state of each component is either success or failure, i.e., the binary-state. Network reliability plays an important role in evaluating the performance of network planning, design, and management. Because more networks are being set up in the real world currently, there is a need for their reliability. It is necessary to build a reliable network within a limited budget. However, existing studies are focused on the budget limit for each minimal path (MP) in networks without considering the total budget of the entire network. We propose a novel concept to consider how to build a more reliable binary-state network under the budget limit. In addition, we propose an algorithm based on the binaryaddition-tree algorithm (BAT) and stepwise vectors to solve the problem efficiently.

Automated summary

Everyday life is heavily reliant on various types of networks, and network reliability plays a crucial role in evaluating network performance. Existing studies mainly focus on the budget limit for each minimal path without considering the total budget of the entire network. This study proposes a novel concept and algorithm to build a more reliable binary-state network under the budget limit.