Incentive-Compatible Interdomain Routing with Linear Utilities
Hall, Alexander ; Nikolova, Evdokia ; Papadimitriou, Christos
Internet Math., Tome 5 (2008) no. 4, p. 395-410 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We revisit the problem of incentive-compatible interdomain routing, examining the quite realistic special case in which the utilities of autonomous systems (ASes) are linear functions of the traffic in the incident links and the traffic leaving each AS. We show that incentive-compatibility toward maximizing total welfare is achievable efficiently, and in the uncapacitated case, by an algorithm that can be easily implemented by the border gateway protocol (BGP), the standard protocol for interdomain routing.
Publié le : 2008-05-15
Classification:  
@article{1265033172,
     author = {Hall, Alexander and Nikolova, Evdokia and Papadimitriou, Christos},
     title = {Incentive-Compatible Interdomain Routing with Linear Utilities},
     journal = {Internet Math.},
     volume = {5},
     number = {4},
     year = {2008},
     pages = { 395-410},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1265033172}
}

Hall, Alexander; Nikolova, Evdokia; Papadimitriou, Christos. Incentive-Compatible Interdomain Routing with Linear Utilities. Internet Math., Tome 5 (2008) no. 4, pp.  395-410. http://gdmltest.u-ga.fr/item/1265033172/