@techreport{cheng-rtgwg-adaptive-routing-framework-03, number = {draft-cheng-rtgwg-adaptive-routing-framework-03}, type = {Internet-Draft}, institution = {Internet Engineering Task Force}, publisher = {Internet Engineering Task Force}, note = {Work in Progress}, url = {https://datatracker.ietf.org/doc/draft-cheng-rtgwg-adaptive-routing-framework/03/}, author = {Weiqiang Cheng and Changwang Lin and Kevin Wang and Jiaming Ye and Rui Zhuang and PengFei Huo}, title = {{Adaptive Routing Framework}}, pagetotal = 21, year = 2024, month = oct, day = 20, abstract = {In many cases, ECMP (Equal-Cost Multi-Path) flow-based hashing leads to high congestion and variable flow completion time. This reduces applications performance. Load balancing based on local link quality is not always optimal, A global view of congestion, with information from remote links, is needed for optimal balancing. Adaptive routing is a technology that makes dynamic routing decision based on changes in traffic load and network topology. This document describes a framework for Adaptive Routing. Specifically, it identifies a set of adaptive routing components, explains their interactions, and exemplifies the workflow mechanism.}, }