Congestion aware multipath routing: performance improvements in core networks

Abstract

In this paper the improved Congestion Aware Multipath Routing algorithm is analysed in terms of Core network throughput and longer paths contribution. The algorithm discovers unused network resources and dynamically adapts to the actual traffic load and available resources displacement. Several simulation scenarios have been benchmarked in order to verify algorithm in typical Internet Service Provider cases. Simulation scenarios in this paper are focused on verifying functionality in dense core networks. For this purpose, tests were performed on TeraStream based network – the Deutsche Telekom Group design concept. Simulation results have proven better performance and resource utilization of the proposed algorithm than traditional Bellman-Ford based algorithms and equal cost multipath approaches.