Trading potatoes in distributed multi-tier routing systems

  • Authors:
  • Yuval Shavitt;Yaron Singer

  • Affiliations:
  • Tel Aviv University, Tel Aviv, Israel;UC Berkeley, Berkeley, CA, USA

  • Venue:
  • Proceedings of the 3rd international workshop on Economics of networked systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The The Internet is an example of a distributed system where the task of routing is performed in a multi-tier fashion: interdomain paths between autonomously-managed networks are sub ject to a global agreement (BGP), and the choice of intradomain paths is left to the discretion of each such network. When forwarding packets, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot potato routing. As a result, paths in the Internet are suboptimal from a global perspective. In this paper we explore complementary deviations from hot-potato routing in a manner which benefits both ASes. We show that even for a pair of ASes obtaining such path trading solutions is NP-complete, and give pseudo-polynomial algorithms to find them. We use PoP-level maps of ASes obtained from measurements of real AS topologies in the Internet to show that, in comparison to hot-potato routing, path trading can substantially reduce the cost of intradomain routing.