%0 Journal Article
%T Robust routing algorithm with unknown traffic matrices<br>不确定业务量矩阵下鲁棒路由算法研究*
%A WANG Yong-guang
%A WANG Sheng
%A WANG Xiong
%A <br>王永光
%A 王晟
%A 王雄
%J 计算机应用研究
%D 2010
%I 
%X When doing research on robust routing with unknown traffic matrices, in order to guarantee the absolute performance of the network(eg.the maximum link use ratio no bigger than a given threshold), this paper proposed an algorithm TSSA which could divide the changing region of traffic matrix D into K subsets according to the link use ratio threshold r, for the K-1 subsets TSSA could compute an optiaml routing that could guarantee the maximum link use ratio no bigger than r respectively.The simulation results demonstrate that comparing with separating D with optimal routing scheme corresponding to one TM, TSSA can divide D into less subsets.
%K traffic matrix
%K changing region of traffic matrix
%K link use ratio threshold
%K optimal routing scheme
%K separation of the changing region of traffic matrix<br>业务量矩阵
%K 业务量矩阵变化范围
%K 链路使用率门限值
%K 最佳路由方案
%K 业务量矩阵变化区域分割
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=AA6BCD1758D44833F62B5EB16D1F4235&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=94C357A881DFC066&sid=8827E7669C34610F&eid=FEE377A727789A99&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10