Abstract:
This paper introduces classical minimum interference routing algorithm MIRA and WSC, they locate link weight only by considering a single network maximum flow. Therefore, a new minimum interference routing algorithm named MWSC is presented. MWSC algorithm takes muti-network maximum flow into account. It can locate link weight more accurate. Simulation result shows that MWSC has lower request rejection rate than MIRA and WSC.
Key words:
minimum interference routing,
MIRA algorithm,
WSC algorithm,
maximum flow,
MWSC algorithm
摘要： 介绍经典的最小干扰路由算法MIRA及WSC，针对其在进行链路权重定位时仅考虑单个网络最大流的缺点，提出一种用以实现最小干扰路由的算法MWSC。MWSC能够考虑多个网络最大流的情况，从而准确定位关键路径。仿真实验结果表明，MWSC具有比MIRA和WSC更低的用户请求拒绝率。
关键词:
最小干扰路由,
MIRA算法,
WSC算法,
最大流,
MWSC算法
CLC Number:
LIANG Jian-Wu, LI Yang- , ZHANG Lei. New Minimum Interference Routing Algorithm with Lower Rejection Rate[J]. Computer Engineering, 2011, 37(8): 64-66.
梁建武, 李英 , 张雷. 一种低拒绝率最小干扰路由算法[J]. 计算机工程, 2011, 37(8): 64-66.