引用本文:杨挺,孙雨耕,胡华东,孙永进.QoS供应体系中的新型网络改进算法.软件学报,2005,16(7):1352-1358
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4309次   下载 6260 本文二维码信息
码上扫一扫!
分享到: 微信 更多
QoS供应体系中的新型网络改进算法
杨挺1, 孙雨耕1, 胡华东1, 孙永进1
天津大学,电气与自动化学院,天津,300072
摘要:
将流量工程技术应用于网络规划(网络改进)以构建满足业务流量多QoS需求的高性能网络,这是传统网络改进通过设备扩容方法难以有效解决的NPC问题,并在此基础上提出基于流量工程的新型网络改进算法.算法采用网络连通扩充启发式算法保证拓扑约束,基于多QoS约束路由算法满足流量工程约束,并使用遗传算法策略全局寻求改进费用最小网络及容量分配.通过仿真研究表明,该算法构建的网络在满足各网络约束的同时,具有网络负载分配均衡,避免存在局域拥塞的较高网络运行性能.
关键词:  服务质量  网络规划  网络改进  流量工程  遗传算法  可靠性
DOI:
分类号:
基金项目:Supported by the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No.20030056007 (国家教育部博士点基金)
A New Network Improvement Algorithm in QoS Providing System
YANG Ting,SUN Yu-Geng,HU Hua-Dong,SUN Yong-Jin
Abstract:
This paper integrates traffic engineering (TE) in network planning (network improvement) to build high performance networks, which achieve traffic’s multi-constrained quality of service (QoS). It is a NP complete problem that cannot be efficiently solved by traditional network improvement with extending equipments’ capability. A new network improvement algorithm based on TE is proposed. A heuristic algorithm of graph’s connectivity augmentation is presented to satisfy the topological constraint, a static routing algorithm based on multi-QoS requirements is adopted to satisfy TE constraints, and a genetic algorithm is used to globally search the network with minimum improvement cost and with its capacity of rational allocation. With the simulation analysis, while achieving network’s multi-constraint, rebuilding networks by the new network improvement algorithm is only a traffic balancing, but not a local blocking of the existing high performance networks.
Key words:  quality of service  network planning  network improvement  traffic engineering  genetic algorithm  reliability

引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载  
分享到: 微信 更多
摘要:
关键词:  
DOI:
分类号:
基金项目:
Abstract:
Key words: