Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third 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
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed algorithmic mechanism design
Distributed algorithmic mechanism design
Implications of autonomy for the expressiveness of policy routing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Mechanism design for policy routing
Distributed Computing - Special issue: PODC 04
A genetic algorithm for solving the first price sealed bid auction in communication networks
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Implications of autonomy for the expressiveness of policy routing
IEEE/ACM Transactions on Networking (TON)
Cooperative Data Management Services Based on Accountable Contract
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Inapproximability of Combinatorial Public Projects
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Model checking nash equilibria in MAD distributed systems
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Model Checking Coalition Nash Equilibria in MAD Distributed Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Mechanisms for complement-free procurement
Proceedings of the 12th ACM conference on Electronic commerce
Collusion in peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end transmission control by modeling uncertainty about the network state
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Subjective-Cost policy routing
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Hi-index | 0.00 |
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these preferences as arising from an AS's underlying utility for each route and study the problem of finding a set of routes that maximizes the overall welfare (i.e., the sum of all ASes' utilities for their selected routes).We show that, if the utility functions are unrestricted, this problem is NP-hard even to approximate closely. We then study a natural class of restricted utilities that we call next-hop preferences. We present a strategyproof, polynomial-time computable mechanism for welfare-maximizing routing over this restricted domain. However, we show that, in contrast to earlier work on lowest-cost routing mechanism design, this mechanism appears to be incompatible with BGP and hence difficult to implement in the context of the current Internet. Our contributions include a new complexity measure for Internet algorithms, the dynamic stability, which may be useful in other problem domains.