Building Reliable Budget-Based Binary-State Networks

TL;DR

This paper introduces a new approach for designing reliable binary-state networks within a fixed budget, addressing limitations of previous methods that only considered minimal paths, and proposes an efficient algorithm for this purpose.

Contribution

It presents a novel concept for overall network reliability under budget constraints and an efficient BAT-based algorithm to optimize network design.

Findings

The proposed method effectively improves network reliability within budget.

The BAT-based algorithm demonstrates computational efficiency.

The approach addresses a gap in existing reliability studies.

Abstract

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 4G/5G; 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 binary-addition-tree algorithm (BAT) and stepwise vectors to solve the problem efficiently.