Internet and Network Economics

Volume 4858 of the series Lecture Notes in Computer Science pp 232-244

Incentive-Compatible Interdomain Routing with Linear Utilities

  • Alexander HallAffiliated withUC Berkeley
  • , Evdokia NikolovaAffiliated withMIT CSAIL
  • , Christos PapadimitriouAffiliated withUC Berkeley

* Final gross prices may vary according to local VAT.

Get Access


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.