Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
On the marginal utility of network topology measurements
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
An Analysis of Internet Inter-Domain Topology and Route Stability
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A model of BGP routing for network engineering
Proceedings of the joint international conference on Measurement and modeling of computer systems
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Mechanism design for policy routing
Distributed Computing - Special issue: PODC 04
Strategic Network Formation through Peering and Service Agreements
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Cuts and disjoint paths in the valley-free path model of internet BGP routing
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Hi-index | 0.00 |
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.