Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not only improve the performance itself of the Internet but also its security and availability. However, previous approaches for making Internet routing adaptive based on optimizing network-wide objectives are not suited for an environment in which autonomous and possibly malicious entities interact. In this paper, we propose a different framework for adaptive routing decisions based on regret-minimizing online learning algorithms. These algorithms, as applied to routing, are appealing because adopters can independently improve their own performance while being robust to adversarial behavior. However, in contrast to approaches based on optimization theory that provide guarantees from the outset about network-wide behavior, the network-wide behavior if online learning algorithms were to interact with each other is less understood. In this paper, we study this interaction in a realistic Internet environment, and find that the outcome is a stable state and that the optimality gap with respect to the network-wide optimum is small. Our findings suggest that online learning may be a suitable framework for adaptive routing decisions in the Internet.

Original languageEnglish (US)
StatePublished - 2008
Event3rd Workshop on Tackling Computer Systems Problems with Machine Learning Techniques, SysML 2008 - San Diego, United States
Duration: Dec 11 2008 → …


Conference3rd Workshop on Tackling Computer Systems Problems with Machine Learning Techniques, SysML 2008
Country/TerritoryUnited States
CitySan Diego
Period12/11/08 → …

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software
  • Information Systems


Dive into the research topics of 'From optimization to regret minimization and back again'. Together they form a unique fingerprint.

Cite this