Optimal double-resource assignment for the robust design problem in multistate computer networks

This paper proposes a novel approach to get the exact optimal double-resource assignment for the robust design problem in multistate computer networks. A multistate computer network consists of links and vertices where both kinds of resources may have several states due to failure, partial failure or maintenance. Therefore, each link (vertex) in the network should be assigned sufficient capacity to keep the network functioning normally. The robust design problem (RDP) in a multistate computer network (MCN) is to search for the minimum capacity assignment of each link and vertex such that the network still survived even under both kinds of failures. However, how to optimally assign the capacity to each resource is not an easy task. This paper proposes an efficient approach to do such assignment and illustrates the efficiency of the proposed approach by some numerical examples.