基于流量均衡的路由优化问题研究
|
摘要
传统IP路由协议中最短路径优先的路由模式容易导致较短路径上产生拥塞,而其它链路相对空闲。因此,在传统路由模式下,加强路由的控制能力,实现流量均衡分配成为路由优化算法研究的重点之一。
论文针对目前网络的传输拥塞问题,结合国家863计划探索导向课题“一种基于节点势能导向的多路由产生机制”的研究进展,立足于现有IP网络数据单下一跳转发的普遍情况,提出并研究了基于网络整体流量均衡的路由多选一优化方案。首先对最短路径优先(OSPF)协议中存在等价多路径可选的情况进行了分析和优化;进而将可选下一跳链路集合进行扩充,研究多下一跳路由机制下的优化算法;最后给出多下一跳路由的在线切换算法,达到负载均衡,避免突发流量引起的拥塞。概括起来,主要工作如下:
1.提出一种基于链路关键度的等价多路径路由优化算法LCER。该算法通过链路关键度表征链路在网络中的平均任务负载,在等价路径之间选择平均任务负载最轻的路径,使得各节点对之间的路由冲突最小化的同时,也避免了报文乱序。仿真表明LCER算法比随机选择算法和分流算法降低了“热点”链路的竞争,在吞吐量、报文保序、平均时延等方面性能也有所提高。
2.提出了基于距离和链路关键度的多下一跳路由优化算法DLCR。该算法在提供所有可行下一跳资源的前提下,具有较短路径和较低链路关键度的下一跳链路将被优先选择,从而降低了网络资源消耗,避免了路由冲突。仿真表明该算法避免了路径在“热点”链路的竞争,为接纳更多路径请求,保障服务质量创造了条件,改善了丢包率和吞吐量性能。算法参数可根据优化目标的不同灵活进行设置。
3.设计了一种基于流量均衡的多下一跳路由切换算法TBMS。该算法针对突发流量可能引起的部分链路拥塞问题,利用多下一跳路由机制丰富的候选路径集合,在链路利用率达到触发条件时,及时切换到其它路径,避免了链路过载产生的拥塞。由于对切换时机进行了严格定义,可达到较好的报文保序性能,同时避免了频繁切换路径出现路由振荡。仿真结果表明,该方案在获得良好的丢包率和吞吐量性能的同时,链路利用率的均衡性相对DLCR算法也有所改善。
The shortest-path-first routing mode in traditional IP routing protocols easily leads to create congestion in the hot-spot links, and relatively leisure of other links. Therefore, based on the traditional route, strengthening the control ability of routing algorithms, to balance the distribution of traffic is one focus of the routing optimization problem study.
Combined with the national 863 project―a multi-next-hop routing mechanism based on node potential orientation‖, this dissertation analyzed the existing technologies of traffic balancing, and then proposed route optimization problem strategy. The Equal-Cost-Multi-Path in OSPF protocol which has multiple paths, is optimized firstly; then the candidate path set was extended, and the routing optimization problem under the Multi-next-hop routing mechanism was studied. At last a routing switching algorithm to avoid the routing congestion of links was proposed. To sum up, the main work is as follows:
1. A link-criticality-based ECMP routing algorithm, named LCER, was proposed. The algorithm selected a specific path with relatively light average load to forward the traffic, according to the task in the network, so as to minimize the interference between the node pairs. Single path forwarding avoids the out of order problem caused by multi-path forwarding. Simulation results show that LCER algorithm could aviod the interference on the hots-pot links, achieve better performance of throughput, average delay and packet in order than random selection and traffic splitting algorithm.
2. Combined with the optimization objective of reducing the network consumption and avoiding the interference between the routing requests this paper proposed a multi-next-hop routing algorithm based on distance-and-link-criticality, named DLCR. Simulation results show that the algorithm could achieve better performance in decrease packet-loss-ratio, and increase network throughput, and played a certain role in avoiding interference because the utilization of hot link was decreased than other algorithms. Parameter can be set flexibly according to different optimization objectives.
3. An online routing switching algorithm is designed to avoid the link congestion. This algorithm was a complement of DLCR. To avoid route oscillation caused by frequent routing switch and serious out of order problem caused by traffic splitting, the strategy of the algorithm made strict definition of switching time. The analysis demonstrated that under the premise of that the message length is greater than the maximum of all path delay difference, the receiver can avoid out of order problem. Simulation results show that the algorithm could mitigate packet loss caused by competition of network resources, significantly increased network throughput, and made a markedly improvement on the distribution of the network traffic, compared with the DLCR algorithm.
论文针对目前网络的传输拥塞问题,结合国家863计划探索导向课题“一种基于节点势能导向的多路由产生机制”的研究进展,立足于现有IP网络数据单下一跳转发的普遍情况,提出并研究了基于网络整体流量均衡的路由多选一优化方案。首先对最短路径优先(OSPF)协议中存在等价多路径可选的情况进行了分析和优化;进而将可选下一跳链路集合进行扩充,研究多下一跳路由机制下的优化算法;最后给出多下一跳路由的在线切换算法,达到负载均衡,避免突发流量引起的拥塞。概括起来,主要工作如下:
1.提出一种基于链路关键度的等价多路径路由优化算法LCER。该算法通过链路关键度表征链路在网络中的平均任务负载,在等价路径之间选择平均任务负载最轻的路径,使得各节点对之间的路由冲突最小化的同时,也避免了报文乱序。仿真表明LCER算法比随机选择算法和分流算法降低了“热点”链路的竞争,在吞吐量、报文保序、平均时延等方面性能也有所提高。
2.提出了基于距离和链路关键度的多下一跳路由优化算法DLCR。该算法在提供所有可行下一跳资源的前提下,具有较短路径和较低链路关键度的下一跳链路将被优先选择,从而降低了网络资源消耗,避免了路由冲突。仿真表明该算法避免了路径在“热点”链路的竞争,为接纳更多路径请求,保障服务质量创造了条件,改善了丢包率和吞吐量性能。算法参数可根据优化目标的不同灵活进行设置。
3.设计了一种基于流量均衡的多下一跳路由切换算法TBMS。该算法针对突发流量可能引起的部分链路拥塞问题,利用多下一跳路由机制丰富的候选路径集合,在链路利用率达到触发条件时,及时切换到其它路径,避免了链路过载产生的拥塞。由于对切换时机进行了严格定义,可达到较好的报文保序性能,同时避免了频繁切换路径出现路由振荡。仿真结果表明,该方案在获得良好的丢包率和吞吐量性能的同时,链路利用率的均衡性相对DLCR算法也有所改善。
The shortest-path-first routing mode in traditional IP routing protocols easily leads to create congestion in the hot-spot links, and relatively leisure of other links. Therefore, based on the traditional route, strengthening the control ability of routing algorithms, to balance the distribution of traffic is one focus of the routing optimization problem study.
Combined with the national 863 project―a multi-next-hop routing mechanism based on node potential orientation‖, this dissertation analyzed the existing technologies of traffic balancing, and then proposed route optimization problem strategy. The Equal-Cost-Multi-Path in OSPF protocol which has multiple paths, is optimized firstly; then the candidate path set was extended, and the routing optimization problem under the Multi-next-hop routing mechanism was studied. At last a routing switching algorithm to avoid the routing congestion of links was proposed. To sum up, the main work is as follows:
1. A link-criticality-based ECMP routing algorithm, named LCER, was proposed. The algorithm selected a specific path with relatively light average load to forward the traffic, according to the task in the network, so as to minimize the interference between the node pairs. Single path forwarding avoids the out of order problem caused by multi-path forwarding. Simulation results show that LCER algorithm could aviod the interference on the hots-pot links, achieve better performance of throughput, average delay and packet in order than random selection and traffic splitting algorithm.
2. Combined with the optimization objective of reducing the network consumption and avoiding the interference between the routing requests this paper proposed a multi-next-hop routing algorithm based on distance-and-link-criticality, named DLCR. Simulation results show that the algorithm could achieve better performance in decrease packet-loss-ratio, and increase network throughput, and played a certain role in avoiding interference because the utilization of hot link was decreased than other algorithms. Parameter can be set flexibly according to different optimization objectives.
3. An online routing switching algorithm is designed to avoid the link congestion. This algorithm was a complement of DLCR. To avoid route oscillation caused by frequent routing switch and serious out of order problem caused by traffic splitting, the strategy of the algorithm made strict definition of switching time. The analysis demonstrated that under the premise of that the message length is greater than the maximum of all path delay difference, the receiver can avoid out of order problem. Simulation results show that the algorithm could mitigate packet loss caused by competition of network resources, significantly increased network throughput, and made a markedly improvement on the distribution of the network traffic, compared with the DLCR algorithm.
引文
[1] Z. Wang, J. Crowcrofi. Quality-of-service Routing for Supporting Multimedia Applications[J]. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 1228-1234.
[2] Z. Khan, H. Hassanein. QoS constrained IP Routing[J]. IEEE Electrical and Computer Engineering, 2003, 2: 1051-1054.
[3] X. M. Bruin, M. Yannuzzi, J. D. Pascual. Research Challenges in QoS Routing[J]. IEEE Computer Communications, 2006, 29: 563-581.
[4] A. Chakrabarti, G. Manimaran. Reliability Constrained Routing in QoS Networks[J]. IEEE ACM Transactions on Networking, 2005, 13(3): 662-675.
[5] M. Chiang, S. H. Low, R. A. Calderbank, and J. C. Doyle, Layering as optimization decomposition[A]. Proceedings of the IEEE[C], January 2007, Vol. 95, no.1,pp.255-273.
[6] S. H. Low, A duality model of TCP and queue management algorithms[J], IEEE/ACM Trans. Networking, 2003,vol. 11, pp. 525-536.
[7] R. Srikant, The Mathematics of Internet Congestion Control[D]. Cambrige,MA:Birkhauser, 2004.
[8] B. Fortz and M. Thorup.Increasing internet capacity using local search[J]. Computational Optimization and Applications, 2004, vol. 29, no. 1, pp. 13-48.
[9] A. Sridharan, R. Gu′erin, and C. Diot, Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks[J]. IEEE/ACM Trans. Networking., 2005, vol. 13, no. 2, pp. 234-247.
[10] A. Khanna, J. Zinky: The revised ARPANET routing metric[J]. ACM SIGCOMM Symposion on Communications Architectures and Protocols,Austin, TX, 1989, pp. 45-56.
[11] Lee Kyeongja. Comparison of multipat h algorit hms for load balancing in a MPLS network[A] . ICOIN 2005[C]. Berlin Heidelberg : Springer-Verlag , 2005. 463-470.
[12] Jeonghwa Song. Dynamic load distribution in MPLS networks. ICOIN 2003[C]. Berlin Heidelberg: Springer-Verlag, 2003. 989-999.
[13] Srihari Nelakuditi, Zhang Zhili. On selection of candidate paths for proportional routing[J] . Computer Networks,2004, 44: 79-102.
[14] Z. Wang, Y. Wang, and L. Zhang. Internet traffic engineering without full-mesh overlaying[A]. In Proc. INFOCOM2001[C]. Apr.2001: 565-571.
[15] B.Fortz and M.Thorup. Internet traffic engineering by optimizing OSPF weights[A].In Proc. INFOCOM2000[C]. Apr.2000: 519-528.
[16] B.Fortz and M.Thorup. Optimizing OSPF/IS-IS weights in a changing world[J]. IEEE Journal on Selected Areas of Communication.2002,20(5): 756-767.
[17] G. Retvari and T. Cinkler, Practical OSPF Traffic Engineering[J]. IEEE Communication. 2004, 800: 689-691.
[18] Xiao X P. Trafic engineering with MPLS in the Internet[J]. IEEE Networking. 2000. 14(2):28-33.
[19] Girish M K, Zhou B, Hu J Q. Formulation of the traffic engineering problems in MPLS based IP networks[A]. Fifth IEEE ISCC[C], Antibes, France, 2000: 214-219.
[20] Wang Y F, Wang Z. Explicit routing algorithms for Internet traffic engineering[A]. IEEE ICCCN’99[C], Boston, 1999: 582-588.
[21] Lee Y, Seok Y, Choi Y. A constrained multipath traffic engineering scheme for MPLS networks[A]. ICC 2002[C], New York, 2002, 2431-2436.
[22]梁宁宁.多下一跳路由机制下的QoS研究[D].郑州:信息工程大学,2009.
[23]王超.面向多下一跳路由机制的负载均衡关键技术研究[D].郑州:信息工程大学,2009.
[24]谢希仁,计算机网络第4版[M].电子工业出版社, 2003: 171-172.
[25] D.Awduche, A.Chui, et al., Overview and principles of Internet traffic engineering[S], RFC 3272, 2002
[26] Daniel O. Awduche and B. Jabbari. Internet traffic engineering using multi-protocol label switching(MPLS)[J]. Computer Networks.2002,40 (2):111-129.
[27] Z.Wang, J.Crowcroft. Quality-of-Service Routing for Supporting Multimedia Applications [J]. IEEE JASC, 1996,14(7),pp.1228-1234.
[28] G. Apostolopoulos,et al., QoS Routing Mechanisms and OSPF Extensions[S]. IETF RFC 2676, August 1999.
[29] Ma Qingming, Steenkiste Peter. On path selection for traffic with bandwidth guarantees[A]. Fifth International Conference on Network Protocols(ICNP’97[C]);Atlanta,GA,USA; 1997. pp.191-202.
[30] Ma Qingming, Steenkiste Peter. Supporting Dynamic Inter-Class Resource Sharing: A Multi–Class QoS Routing Algorithm[A]. IEEE INFOCOM’99[C]; New York, USA; 1999. pp.649-660.
[31] Wang Jun, Nahrstedt Klara. Hop-by-Hop Routing Algorithms For Premuim-class Traffic In DiffServ Networks[A]. IEEE INFOCOM’02[C]; New York, USA; 2002.pp.705-714.
[32] Wang Yufei, Wang Zheng. Explicit routing for internet traffic engingeering[A]. IEEE International Conference on Computer Communications and Networks(ICCCN’99[C]); Piscataway, NJ,USA;1999, pp.582-588.
[33] Banerjee Gargi, Sidhu Deepinder. Path Computation for Traffic Engineering in MPLS Networks[A]. IEEE ICN2001[C]; Colmar,France; 2001, pp.302-308.
[34] M.Kodialam,T.V .Lakshman, Minimum Interference Routing with Applications to MPLS Traffic Engineering[A], Proceedings of IEEE INFOCOM 2000[C], vol2, pp.884-893.
[35] Bin Wang, XuSu, Chen, C .L.P., A new bandwidth guaranteed routing algorithm for MPLS traffic engineering[A], Proceedings of IEEE ICC 2002[C],vol.2,pp.1001-1005.
[36] K. Hendling, et al., Interference Minimizing Bandwidth Guaranteed On-line Routing Algorithm for Traffic Engineering[A], Proceedings of IEEE International Conference on Networks (ICON 2004[C]),2004.
[37] Gopalan Kartik, Chiueh Tzi-cker, Lin Yow-Jian. Load Balancing Routing with Bandwidth-Delay Guarantees[J]. IEEE Communication Magazine. 2004, 42(6):108-113.
[38] I. Cidon etc. Multi-path routing combined with resource reservation[A]. IEEE INFOCOM’97[C], Japan, April,1997, pp.92-100.
[39] Fandel G, Gal T. Multiple Criteria Decision Makin Application[M].Springer-Verlag,1980
[40]冯径,周润芳,顾冠拜.一种分类预计算Qos路由算法[J].软件学报. 2002:13(4): 591-600.
[41] C Hopps. RFC 2992: Analysis of an Equal-Cost Multi-Path Algorithm[S]. November 2000.
[42] D Thaler. RFC 2991: Multipath Issues in Unicast and Multicast Next-Hop Selection[S]. November 2000.
[43] Cao Z, Wang Z, Zegura E. Performance of hashing-based schemes for Intemet load balancing [A]. in Proceedings of IEEE INFOCOM[C]. Tel Aviv, Isr: IEEE, Piscataway, NJ, USA.2000.1: 332-341.
[44] Zinin A. Cisco Routing, Packet Forwarding and Intra-domain Routing Protocals[M]. Section 5.5.1: Addison Wesley, 2002.
[45] Chim T W, K L Yeung.Traffic distribution over equal-cost multi-paths[A]. in Proceedings of IEEE International Conference on Communications[C]. Pads, France: Institute of ELectrical and Electronic Engineers Inc., Piscataway, United States, 2004.2: 1207-1211.
[46]林伟,刘斌,唐毅.等价多路径间基于LRU Cache和计数统计的流量分配调度算法[J].电子学报Jan.2008,36(1): 32-38.
[47] W Szeto, R Boutaba, Y Iraqi. Dynamic Online Routing Algorithm for MPLS Traffic Engineering[J]. In:NETWORKING2002; Pisa; Italy; 2002: 936-946.
[48]唐治果,李乐民,虞红芳.针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报,2007,29(5): 1187-1190.
[49] S. Kandula, D. Katabi, S. Sinha, and A. Berger, Dynamic load balancing without packet reordering[A], in SIGCOMM[C], 2007,vol.37, no.2, pp.51-62.
[2] Z. Khan, H. Hassanein. QoS constrained IP Routing[J]. IEEE Electrical and Computer Engineering, 2003, 2: 1051-1054.
[3] X. M. Bruin, M. Yannuzzi, J. D. Pascual. Research Challenges in QoS Routing[J]. IEEE Computer Communications, 2006, 29: 563-581.
[4] A. Chakrabarti, G. Manimaran. Reliability Constrained Routing in QoS Networks[J]. IEEE ACM Transactions on Networking, 2005, 13(3): 662-675.
[5] M. Chiang, S. H. Low, R. A. Calderbank, and J. C. Doyle, Layering as optimization decomposition[A]. Proceedings of the IEEE[C], January 2007, Vol. 95, no.1,pp.255-273.
[6] S. H. Low, A duality model of TCP and queue management algorithms[J], IEEE/ACM Trans. Networking, 2003,vol. 11, pp. 525-536.
[7] R. Srikant, The Mathematics of Internet Congestion Control[D]. Cambrige,MA:Birkhauser, 2004.
[8] B. Fortz and M. Thorup.Increasing internet capacity using local search[J]. Computational Optimization and Applications, 2004, vol. 29, no. 1, pp. 13-48.
[9] A. Sridharan, R. Gu′erin, and C. Diot, Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks[J]. IEEE/ACM Trans. Networking., 2005, vol. 13, no. 2, pp. 234-247.
[10] A. Khanna, J. Zinky: The revised ARPANET routing metric[J]. ACM SIGCOMM Symposion on Communications Architectures and Protocols,Austin, TX, 1989, pp. 45-56.
[11] Lee Kyeongja. Comparison of multipat h algorit hms for load balancing in a MPLS network[A] . ICOIN 2005[C]. Berlin Heidelberg : Springer-Verlag , 2005. 463-470.
[12] Jeonghwa Song. Dynamic load distribution in MPLS networks. ICOIN 2003[C]. Berlin Heidelberg: Springer-Verlag, 2003. 989-999.
[13] Srihari Nelakuditi, Zhang Zhili. On selection of candidate paths for proportional routing[J] . Computer Networks,2004, 44: 79-102.
[14] Z. Wang, Y. Wang, and L. Zhang. Internet traffic engineering without full-mesh overlaying[A]. In Proc. INFOCOM2001[C]. Apr.2001: 565-571.
[15] B.Fortz and M.Thorup. Internet traffic engineering by optimizing OSPF weights[A].In Proc. INFOCOM2000[C]. Apr.2000: 519-528.
[16] B.Fortz and M.Thorup. Optimizing OSPF/IS-IS weights in a changing world[J]. IEEE Journal on Selected Areas of Communication.2002,20(5): 756-767.
[17] G. Retvari and T. Cinkler, Practical OSPF Traffic Engineering[J]. IEEE Communication. 2004, 800: 689-691.
[18] Xiao X P. Trafic engineering with MPLS in the Internet[J]. IEEE Networking. 2000. 14(2):28-33.
[19] Girish M K, Zhou B, Hu J Q. Formulation of the traffic engineering problems in MPLS based IP networks[A]. Fifth IEEE ISCC[C], Antibes, France, 2000: 214-219.
[20] Wang Y F, Wang Z. Explicit routing algorithms for Internet traffic engineering[A]. IEEE ICCCN’99[C], Boston, 1999: 582-588.
[21] Lee Y, Seok Y, Choi Y. A constrained multipath traffic engineering scheme for MPLS networks[A]. ICC 2002[C], New York, 2002, 2431-2436.
[22]梁宁宁.多下一跳路由机制下的QoS研究[D].郑州:信息工程大学,2009.
[23]王超.面向多下一跳路由机制的负载均衡关键技术研究[D].郑州:信息工程大学,2009.
[24]谢希仁,计算机网络第4版[M].电子工业出版社, 2003: 171-172.
[25] D.Awduche, A.Chui, et al., Overview and principles of Internet traffic engineering[S], RFC 3272, 2002
[26] Daniel O. Awduche and B. Jabbari. Internet traffic engineering using multi-protocol label switching(MPLS)[J]. Computer Networks.2002,40 (2):111-129.
[27] Z.Wang, J.Crowcroft. Quality-of-Service Routing for Supporting Multimedia Applications [J]. IEEE JASC, 1996,14(7),pp.1228-1234.
[28] G. Apostolopoulos,et al., QoS Routing Mechanisms and OSPF Extensions[S]. IETF RFC 2676, August 1999.
[29] Ma Qingming, Steenkiste Peter. On path selection for traffic with bandwidth guarantees[A]. Fifth International Conference on Network Protocols(ICNP’97[C]);Atlanta,GA,USA; 1997. pp.191-202.
[30] Ma Qingming, Steenkiste Peter. Supporting Dynamic Inter-Class Resource Sharing: A Multi–Class QoS Routing Algorithm[A]. IEEE INFOCOM’99[C]; New York, USA; 1999. pp.649-660.
[31] Wang Jun, Nahrstedt Klara. Hop-by-Hop Routing Algorithms For Premuim-class Traffic In DiffServ Networks[A]. IEEE INFOCOM’02[C]; New York, USA; 2002.pp.705-714.
[32] Wang Yufei, Wang Zheng. Explicit routing for internet traffic engingeering[A]. IEEE International Conference on Computer Communications and Networks(ICCCN’99[C]); Piscataway, NJ,USA;1999, pp.582-588.
[33] Banerjee Gargi, Sidhu Deepinder. Path Computation for Traffic Engineering in MPLS Networks[A]. IEEE ICN2001[C]; Colmar,France; 2001, pp.302-308.
[34] M.Kodialam,T.V .Lakshman, Minimum Interference Routing with Applications to MPLS Traffic Engineering[A], Proceedings of IEEE INFOCOM 2000[C], vol2, pp.884-893.
[35] Bin Wang, XuSu, Chen, C .L.P., A new bandwidth guaranteed routing algorithm for MPLS traffic engineering[A], Proceedings of IEEE ICC 2002[C],vol.2,pp.1001-1005.
[36] K. Hendling, et al., Interference Minimizing Bandwidth Guaranteed On-line Routing Algorithm for Traffic Engineering[A], Proceedings of IEEE International Conference on Networks (ICON 2004[C]),2004.
[37] Gopalan Kartik, Chiueh Tzi-cker, Lin Yow-Jian. Load Balancing Routing with Bandwidth-Delay Guarantees[J]. IEEE Communication Magazine. 2004, 42(6):108-113.
[38] I. Cidon etc. Multi-path routing combined with resource reservation[A]. IEEE INFOCOM’97[C], Japan, April,1997, pp.92-100.
[39] Fandel G, Gal T. Multiple Criteria Decision Makin Application[M].Springer-Verlag,1980
[40]冯径,周润芳,顾冠拜.一种分类预计算Qos路由算法[J].软件学报. 2002:13(4): 591-600.
[41] C Hopps. RFC 2992: Analysis of an Equal-Cost Multi-Path Algorithm[S]. November 2000.
[42] D Thaler. RFC 2991: Multipath Issues in Unicast and Multicast Next-Hop Selection[S]. November 2000.
[43] Cao Z, Wang Z, Zegura E. Performance of hashing-based schemes for Intemet load balancing [A]. in Proceedings of IEEE INFOCOM[C]. Tel Aviv, Isr: IEEE, Piscataway, NJ, USA.2000.1: 332-341.
[44] Zinin A. Cisco Routing, Packet Forwarding and Intra-domain Routing Protocals[M]. Section 5.5.1: Addison Wesley, 2002.
[45] Chim T W, K L Yeung.Traffic distribution over equal-cost multi-paths[A]. in Proceedings of IEEE International Conference on Communications[C]. Pads, France: Institute of ELectrical and Electronic Engineers Inc., Piscataway, United States, 2004.2: 1207-1211.
[46]林伟,刘斌,唐毅.等价多路径间基于LRU Cache和计数统计的流量分配调度算法[J].电子学报Jan.2008,36(1): 32-38.
[47] W Szeto, R Boutaba, Y Iraqi. Dynamic Online Routing Algorithm for MPLS Traffic Engineering[J]. In:NETWORKING2002; Pisa; Italy; 2002: 936-946.
[48]唐治果,李乐民,虞红芳.针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报,2007,29(5): 1187-1190.
[49] S. Kandula, D. Katabi, S. Sinha, and A. Berger, Dynamic load balancing without packet reordering[A], in SIGCOMM[C], 2007,vol.37, no.2, pp.51-62.