Incentive-Compatible Interdomain Routing with Linear Utilities

  • Alexander Hall
  • Evdokia Nikolova
  • Christos Papadimitriou
Conference paper

DOI: 10.1007/978-3-540-77105-0_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4858)
Cite this paper as:
Hall A., Nikolova E., Papadimitriou C. (2007) Incentive-Compatible Interdomain Routing with Linear Utilities. In: Deng X., Graham F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Alexander Hall
    • 1
  • Evdokia Nikolova
    • 2
  • Christos Papadimitriou
    • 1
  1. 1.UC BerkeleyUSA
  2. 2.MIT CSAILUSA

Personalised recommendations