Distributed rational decision making
Multiagent systems
Distributed games: from mechanisms to protocols
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
iBundle: an efficient ascending price bundle auction
Proceedings of the 1st ACM conference on Electronic commerce
Journal of the ACM (JACM)
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Iterative Combinatorial Auctions: Theory and Practice
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Using redundancy to improve robustness of distributed mechanism implementations
Proceedings of the 4th ACM conference on Electronic commerce
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Hardness results for multicast cost sharing
Theoretical Computer Science
Mechanism design for policy routing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Network monitors and contracting systems: competition and innovation
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
ACM Transactions on Algorithms (TALG)
Subjective-cost policy routing
Theoretical Computer Science
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
No-regret learning and a mechanism for distributed multiagent planning
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Inapproximability of Combinatorial Public Projects
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Network Formation and Routing by Strategic Agents Using Local Contracts
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Fault Tolerance in Distributed Mechanism Design
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Neighbor-specific BGP: more flexible routing policies while improving global stability
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Optimal collusion-resistant mechanisms with verification
Proceedings of the 10th ACM conference on Electronic commerce
Congestion-only charging: a novel pricing mechanism for use in differentiated services networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
CSR: Constrained Selfish Routing in Ad-Hoc Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Incentive compatible mechanism in P2P systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Mechanism design meets computer science
Communications of the ACM
Improved lower bounds for non-utilitarian truthfulness
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Incentive compatibility and dynamics of congestion control
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimized protection schemes for resilient interdomain traffic distribution
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Truthful least-priced-path routing in opportunistic spectrum access networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation
YAMR: yet another multipath routing protocol
ACM SIGCOMM Computer Communication Review
Improved lower bounds for non-utilitarian truthfulness
Theoretical Computer Science
Inter-domain pricing: challenges and possible approaches
International Journal of Network Management
Computer Networks: The International Journal of Computer and Telecommunications Networking
Strategic pricing in next-hop routing with elastic demands
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
End-to-end transmission control by modeling uncertainty about the network state
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
A trust-based game theoretical model for Web services collaboration
Knowledge-Based Systems
Subjective-Cost policy routing
WINE'05 Proceedings of the First international conference on Internet and Network Economics
IEEE/ACM Transactions on Networking (TON)
SIAM Journal on Computing
An economic analysis of routing conflict and its resolution
Performance Evaluation
Strategic Pricing in Next-Hop Routing with Elastic Demands
Theory of Computing Systems
Hi-index | 0.02 |
The routing of traffic between Internet domains, or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address the problem of interdomain routing from a mechanism-design point of view. The application of mechanism-design principles to the study of routing is the subject of earlier work by Nisan and Ronen [16] and Hershberger and Suri [12]. In this paper, we formulate and solve a version of the routing-mechanism design problem that is different from the previously studied version in three ways that make it more accurately reflective of real-world interdomain routing: (1) we treat the nodes as strategic agents, rather than the links; (2) our mechanism computes lowest-cost routes for all source-destination pairs and payments for transit nodes on all of the routes (rather than computing routes and payments for only one source-destination pair at a time, as is done in [12, 16]); (3) we show how to compute our mechanism with a distributed algorithm that is a straightforward extension to BGP and causes only modest increases in routing-table size and convergence time (in contrast with the centralized algorithms used in [12, 16]). This approach of using an existing protocol as a substrate for distributed computation may prove useful in future development of Internet algorithms generally, not only for routing or pricing problems. Our design and analysis of a strategy proof, BGP-based routing mechanism provides a new, promising direction in distributed algorithmic mechanism design, which has heretofore been focused mainly on multicast cost sharing.