Design and Analysis of Multipath Policy Based Routing

• Main Authors: TSAI, HSIANG-CHI, 蔡湘琪
• Other Authors: HOU, TING-CHAO
• Format: Others
• Language: zh-TW
• Published: 2016
• Online Access: http://ndltd.ncl.edu.tw/handle/39906890535152660422

碩士 === 國立中正大學 === 通訊工程研究所 === 104 === In recent years, many efforts have been tried to bring the advantages of L3 routing to L2 networks by using equal cost multipath (ECMP) to increase link utilization and improve load-balancing. However, ECMP routing only allows the use of paths with the same cost and this cost is usually expressed by a metric value (e.g., hops). In many network topologies, ECMP does not necessarily provide enough path diversity. Non-ECMP can open up a new horizon where bisection bandwidth can be increased with a smaller cost and alternative topology designs can be explored for different applications or traffic patterns. Thus we propose a policy based multipath routing by using an algebraic routing model. Paths are selected based on a policy value that grades their preference. Paths with equal preference values might be different in the number of hops, bandwidth, etc. Although the policy based multipath routing has a great potential in finding multipath, the policy based multipath seems also affected by the network topology and the algebraic policy. For this reason, we also present a congestion control mechanism to spread loading dynamically by taking a global view of link utilization. In addition, we also provide several forwarding methods about how multiple paths are allocated to different flows.