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

Ziyu  Shao; Jian  Ni; Zhengbin Li

1st International ICST Conference on Communications and Networking in China

Research Article

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

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2006.344824,
    author={Ziyu  Shao and Jian  Ni and Zhengbin Li},
    title={Blocking Probability Computation of Optical Networks: A Factor Graph Model Approach},
    proceedings={1st International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2007},
    month={4},
    keywords={},
    doi={10.1109/CHINACOM.2006.344824}
}

Ziyu Shao
Jian Ni
Zhengbin Li
Year: 2007
Blocking Probability Computation of Optical Networks: A Factor Graph Model Approach
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2006.344824

Ziyu Shao¹^,*, Jian Ni²^,*, Zhengbin Li³^,*

1: Department of Electrical Engineering, Peking University, Beijing 100871, China
2: Department of Electrical Engineering, Yale University, New Haven, CT 06520, USA
3: Department of Electrical Engineering, Peking University

*Contact email: ziyu.shao@gmail.com, jian.ni@yale.edu, lizhengbin@pku.edu.cn

Abstract

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

Published: 2007-04-10
Publisher: IEEE

: http://dx.doi.org/10.1109/CHINACOM.2006.344824