摘要
研究IP网络中带宽约束和时延约束条件下的路径选择问题 ,提出基于业务量工程的带宽约束和时延约束的服务质量路由算法 .通过计算机仿真 ,比较SPF ,SDPF和SEDPF三种算法在相同的物理网络拓扑结构、不同的链路带宽资源下的性能 .结果表明 。
The path selection with bandwidth and delay constraints in IP networks was researched. Two algorithms were proposed for QoS routing with bandwidth and delay constrains based on traffic engineering. By computer simulation, the probabilities of the algorithms in the networks were compared with the same topology and different link bandwidths. The result showed that SEDPF algorithm was better than others.
出处
《华中科技大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2004年第10期86-88,共3页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家高技术研究发展计划资助项目 (2 0 0 1AA12 2 0 2 3)