欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在研究不确定业务量矩阵下的鲁棒路由时,为了能够保证网络的绝对性能（如最大链路使用率不大于某一门限值）,提出算法TSSA按照ISPs给定的链路使用率门限值r把业务量矩阵的变化范围D划分成K部分,对其中的K-1部分可以分别求出一套满足最大链路使用率不大于r的最佳路由方案。仿真结果显示,与使用针对单个TM求出的最佳路由方案对D进行分割相比,TSSA可以把D分割成更少的子集合。
英文摘要：
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.
同期刊论文项目
同项目期刊论文
Capacity and Optimal Power Allocation for Spectrum-Sharing with Primary Transmission Consideration i
A novel robust routing algorithm for multi-granularity connection requests in wavelength division mu
位置：