|
|||||
|
|
| 一种基于DiffServ的拓扑抽象算法 | |
| 引用本文： | 贾志娟,胡明生,刘 思,洪 流. 一种基于DiffServ的拓扑抽象算法[J]. 计算机应用研究, 2012, 29(8): 3071-3073 |
| 作者姓名： | 贾志娟 胡明生 刘 思 洪 流 |
| 作者单位： | 1. 武汉理工大学计算机学院,武汉,430070 2. 郑州师范学院信息科学与技术学院,郑州,450044 3. 华中科技大学系统工程研究所,武汉,430074 |
| 基金项目： | 国家自然科学基金资助项目 （60903174）; 中央高校基本科研业务费资助项目（HUST：2010MS017, 2010QN016）; 河南省基础与前沿技术研究项目（092300410042）; 河南省教育厅自然科学研究计划项目（2008C520009） |
| 摘 要： | 针对网络规模增长所引起的拓扑抽象可扩展性问题,提出了一种新的QoS信息抽象算法(DSTA)。通过构建一种新的阶梯来表示原来的QoS信息阶梯,新阶梯根据DiffServ由有限数量的点确定,因而能够不依赖于网络规模的大小。OPNET仿真结果表明,DSTA算法具有较高的准确性和可扩展性。 |
| 关 键 词： | 拓扑抽象 QoS路由 DiffServ 阶梯 可扩展性 |
DiffServ-based topology aggregation algorithm |
|
| JIA Zhi-juan,HU Ming-sheng,LIU Si,HONG Liu. DiffServ-based topology aggregation algorithm[J]. Application Research of Computers, 2012, 29(8): 3071-3073 | |
| Authors: | JIA Zhi-juan HU Ming-sheng LIU Si HONG Liu |
| Affiliation: | 1. College of Computer, Wuhan University of Technology, Wuhan 430070, China; 2. College of Information Science & Technology, Zhengzhou Normal University, Zhengzhou 450044, China; 3. Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, China |
| Abstract: | Aiming at the scalability problem of topology aggregation caused by the rapid growth of network size, this paper proposed a novel algorithm DSTA for aggregating QoS information, which constructed a new staircase to represent the aggregated QoS information staircase. The new staircase was determined by a limited number of points according to DiffServ, so that could be independent of the network scale. Simulation results of OPNET show that the proposed algorithm has high accuracy and scalability. |
| Keywords: | topology aggregation QoS routing DiffServ staircase scalability |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 | |
| 点击此处可从《计算机应用研究》下载全文 | |