Robust routing algorithm with unknown traffic matrices
不确定业务量矩阵下鲁棒路由算法研究*

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.