The most popular non-minimal adaptive routing algorithms (namely UGAL) decide at the source router whether to route minimally to the destination or to route minimally to a randomly chosen intermediate node then minimally to the destination. The random intermediate selection implements Valiant's randomized routing which provides perfect load balancing, albeit at a reduced injection rate. In contrast, this methodology chooses the intermediate node to be a router that lies on the least congested output path of the current router.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
McDonald, Nicholas George, "Using the Least Congested Path for Non-minimal Load-balanced Routing (LCP)", Technical Disclosure Commons, (July 13, 2017)