Blocking Probability Computation of Optical Networks: A Factor Graph Model Approach

How to compute the blocking probability of optical networks quickly and exactly is an open problem. Thus many exact and approximate methods are proposed to tackle this problem. In this paper, we introduce the factor graph model approach . The relationship between network topology and corresponding factor graph representation is also discussed. Simulation results show that in cyclic factor graph representation, the proposed approach outperforms the reduced load approximation scheme, a commonly used method in the field of optical network