A Routing Optimization Algorithm of Equal-Cost-Multi-Paths Based on Link Criticality

摘要：

To effectively avoid congestion and take full advantage of bandwidth inside a network, routing optimization is needed for path selection over a set of equalcost-multi-paths In this paper, a Link-Critcality-based ECMP roating optimization algorithm is proposed. As the traffic in the network overlaps on some links, LCER sdects the path with least link average utilization and hops for the ECMPs. As compared with the existing traffic splitting algorithms, LCER provides a network-wide load balancing performance, no packets arrwed out-of-order, and the lowest average end-toend packet delays. Although addihonal expected bandwidth, based on measured daily traffic profiles or servicelevel agreements, is needed by LCER, we argued that the cxtra complexity incurred is marginal.

关键词： Routing Optimization ECMPs Link Criticality

作者: Ming Tian Ju-long Lan Xuan-yong Zhu Jian-mei Huang

作者单位: National Digital Switching System Engineering Technical Researching Center,Zhengzhou,China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 203-207

在线出版日期: 2010-03-27（万方平台首次上网日期，不代表论文的发表时间）