From Optimization to Regret Minimization and Back Again

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 ...

• Type: Conference
• Year: 2008
• Where: OSDI
• Authors: Ioannis C. Avramopoulos, Jennifer Rexford, Robert E. Schapire
• Keywords: Adaptive Routing Decisions, Online Learning Algorithms, Operating System, OSDI 2008, Regret-minimizing Online Learning