摘要
介绍经典的最小干扰路由算法MIRA及WSC,针对其在进行链路权重定位时仅考虑单个网络最大流的缺点,提出一种用以实现最小干扰路由的算法MWSC。MWSC能够考虑多个网络最大流的情况,从而准确定位关键路径。仿真实验结果表明,MWSC具有比MIRA和WSC更低的用户请求拒绝率。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第8期64-66,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60173041)
