| 不确定业务量矩阵下鲁棒路由算法研究* |
| |
| 引用本文： | 王永光,王晟,王雄. 不确定业务量矩阵下鲁棒路由算法研究*[J]. 计算机应用研究, 2010, 27(5): 1921-1924. DOI: 10.3969/j.issn.1001-3695.2010.05.091 |
| |
| 作者姓名： | 王永光 王晟 王雄 |
| |
| 作者单位： | 电子科技大学,宽带光纤传输与通信网络技术重点实验室,成都,611731 |
| |
| 基金项目： | 国家自然科学基金重大研究计划资助项目（90604002） |
| |
| 摘 要： | 在研究不确定业务量矩阵下的鲁棒路由时，为了能够保证网络的绝对性能(如最大链路使用率不大于某一门限值)，提出算法TSSA按照ISPs给定的链路使用率门限值r把业务量矩阵的变化范围D划分成K部分，对其中的K-1部分可以分别求出一套满足最大链路使用率不大于r的最佳路由方案。仿真结果显示，与使用针对单个TM求出的最佳路由方案对D进行分割相比，TSSA可以把D分割成更少的子集合。
|
| 关 键 词： | 业务量矩阵； 业务量矩阵变化范围； 链路使用率门限值； 最佳路由方案； 业务量矩阵变化区域分割 |
Robust routing algorithm with unknown traffic matrices |
| |
| WANG Yong-guang,WANG Sheng,WANG Xiong. Robust routing algorithm with unknown traffic matrices[J]. Application Research of Computers, 2010, 27(5): 1921-1924. DOI: 10.3969/j.issn.1001-3695.2010.05.091 |
| |
| Authors: | WANG Yong-guang WANG Sheng WANG Xiong |
| |
| Affiliation: | (Key Laboratory of Broadband Optical Fiber Transmission & Communication Networks, University of Electronic Science & Technology of China, Chengdu 611731, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | traffic matrix changing region of traffic matrix link use ratio threshold optimal routing scheme separation of the changing region of traffic matrix |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
