Survivable Traffic Cognition Algorithm with Joint Failure Probability in Flexible Bandwidth Optical Networks

This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition （STC） algorithm with joint failure probability. Survivable Traffic Assign- ment （STA） algorithm and Conventional T...

Full description

Saved in:
Bibliographic Details
Published in:中国通信 2013 (4), p.38-48
Main Author: ZHANG Jie CHEN Bowen ZHAO Yongli Jason P. Jue GU Wanyi
Format: Article
Language:Chinese
Subjects:
交通
光网络
分配算法
失效概率
存活
带宽
阻塞概率
频谱利用率
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition （STC） algorithm with joint failure probability. Survivable Traffic Assign- ment （STA） algorithm and Conventional Traf- fic Assignment （CTA） algorithm are added to illustrate the effectiveness of our proposed STC. We investigate the effect of joint failure probability on blocking probability, spectral utilization ratio, average joint failure probabil- ity, and the average hops. Simulation results show that our proposed STC not only achieves better performance in terms of blocking probability and spectral utilization ratio than CTA and STA, but also does not cause higher average joint failure probability or larger average hops compared with STA. As a result, STC makes the best use of spectral resources and does not cause large average joint failure probability.
ISSN:1673-5447