检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张杰 陈伯文 赵永利 Jason P.Jue 顾畹仪
机构地区:[1]State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications [2]Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas
出 处:《China Communications》2013年第4期38-48,共11页中国通信(英文版)
基 金:supported in part by 973 Program under Grants No. 2010CB328204,No. 2012CB315604;863 Program under Grant No. 2012AA011301;National Natural Science Foundation of China under Grants No. 61271189,No. 61201154, No. 60932004;RFDP Project under Grants No. 20090005110013,No. 20120005120019;the Fundamental Research Funds for the Central Universities;the State Scholarship Fund
摘 要: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 Assignment (STA) algorithm and Conventional Traffic 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 probability, 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.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.
关 键 词:flexibleworks SURVIVABILITY failure probabilitybandwidth optical net-traffic cognition JOINT
分 类 号:TN929.1[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222