MC-based algorithm for a telecommunication network under node and budget constraints (Q2383899)

Designing some performance indexes in order to measure the performance for a telecommunication network is an important issue from the point of view of quality management and decision making. The author constructed a multicommodity stochastic-flow network with unreliable nodes to model the telecommunication network. The system capacity is defined as the demand vector if the system meets at most the demand vector. The author utilizes minimal cuts to evaluate the performance for a multicommodity stochastic-flow network with unreliable nodes, but subject to the budget constraint. He focuses on a two-commodity stochastic-flow network and then extends to the multicommodity case. The paper defines the system capacity as a 2-tuple vector and then proposes a performance index, the probability that the upper bound of the system capacity equals a demand vector subject to the budget constraint. The minimal cuts-based algorithm proposed by Lin generates all upper boundary points in order to evaluate the proposed performance index. A telecommunication example is presented and it illustrates the proposed algorithm and how the performance index may be calculated. Time complexity and storage complexity of the algorithm are both analyzed by the author.