摘要
提出了一种依据网络自相似的特征,在扩展的Bellman-Ford算法的基础上构造了一种基于自相似网络流的QoS路由算法,该算法具有根据历史路由信息来指导路由的特点,避免了由于以往确定性路由算法的路由聚集性的不足。实验结果表明,该算法具有较好的性能指标,能自适应网络,使其负载均衡,同时具有较少的处理与协议开销。
Based on the extention of Bellman-Ford algorithm and self-similar network traffic, a new QoS routing algorithm is proposed. Taking advantage of the previous routing information, this scheme overcomes the deficiency of routing aggregation effect which exists in previous definitive routing algorithms. This simulation results show that the scheme, which involves only a little processing and protocol overhead, can effectively improve network performance with larger update threshold and network load balancing achieved.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2005年第19期18-20,共3页
Computer Engineering
基金
国家自然科学基金资助项目(10375024)
湖南省自然科学基金资助项目(03JJY4054)
关键词
QOS路由
自相似
多维目标
负载均衡
QoS routing
Self-similar
Multidimensional object
Load balancing
