Incentive-compatible interdomain routing with linear utilities

  • Authors:
  • Alexander Hall;Evdokia Nikolova;Christos Papadimitriou

  • Affiliations:
  • UC Berkeley;MIT, CSAIL;UC Berkeley

  • Venue:
  • WINE'07 Proceedings of the 3rd international conference on Internet and network economics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We revisit the problem of incentive-compatible interdomain routing, examining the, quite realistic, special case in which the autonomous systems' (ASes') utilities are linear functions of the traffic in the incident links, and the traffic leaving each AS. We show that incentive-compatibility towards maximizing total welfare is achievable efficiently, and, in the uncapacitated case, by an algorithm that can be implemented by BGP, the standard protocol for interdomain routing.