Learning Algorithms for Dynamic Call Routing: Lessons from Yesteryears

Deep Medhi · ACM SIGCOMM Computer Communication Review · 2025

With the advent of softwarization of digital telephone switches, many dynamic call routing schemes were explored in the 1980s to provide better network performance. In particular, we highlight two learning algorithms for dynamic call routing from that era. We note that while the learning algorithms have the adaptive capability to benefit dynamic call routing performance, they alone cannot address network instabilities in certain network load conditions. Additional controls are necessary. This note is to present an overview of various dynamic call routing schemes, and in particular, learning algorithms for dynamic call routing from yesteryears. We also discuss control mechanisms that were deployed for network stability. Finally, we present lessons learned from this work, which could hopefully be useful in applying artificial intelligence or machine learning (AI/ML) to networking in today's world.

Read the paper · More papers on PaperTik