Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Design principles of policy languages for path vector protocols
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of 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
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Subjective-Cost policy routing
WINE'05 Proceedings of the First international conference on Internet and Network Economics
BGP routing policies in ISP networks
IEEE Network: The Magazine of Global Internetworking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Incentive-compatible interdomain routing with linear utilities
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Incentive compatibility and dynamics of congestion control
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Cooperative interdomain traffic engineering using Nash bargaining and decomposition
IEEE/ACM Transactions on Networking (TON)
A multidimensional procurement auction for trading composite services
Electronic Commerce Research and Applications
Putting BGP on the right path: a case for next-hop routing
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Safe interdomain routing under diverse commercial agreements
IEEE/ACM Transactions on Networking (TON)
Inter-domain pricing: challenges and possible approaches
International Journal of Network Management
Weakly-acyclic (internet) routing games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
SIAM Journal on Computing
A theory for the connectivity discovered by routing protocols
IEEE/ACM Transactions on Networking (TON)
What's a little collusion between friends?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
An economic analysis of routing conflict and its resolution
Performance Evaluation
A survey of interdomain routing policies
ACM SIGCOMM Computer Communication Review
Weakly-Acyclic (Internet) Routing Games
Theory of Computing Systems
Hi-index | 0.00 |
The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP) [17]. Using BGP, autonomous systems can apply semantically rich routing policies to choose interdomain routes in a distributed fashion. This expressiveness in routing-policy choice supports domains' autonomy in network operations and in business decisions, but it comes at a price: The interaction of locally defined routing policies can lead to unexpected global anomalies, including route oscillations or overall protocol divergence (see, e.g., [20]). Networking researchers have addressed this problem by devising constraints on policies that guarantee BGP convergence without unduly limiting expressiveness and autonomy (see, e.g., [7, 8]).In addition to taking this engineering or "protocol-design" approach, researchers have approached interdomain routing from an economic or "mechanism-design" point of view. It is known that lowest-cost-path (LCP) routing can be implemented in a truthful, BGP-compatible manner [3] but that several other natural classes of routing policies cannot [2, 5]. In this paper, we present a natural class of interdomain-routing policies that is more realistic than LCP routing and admits incentive-compatible, BGP-compatible implementation. We also present several positive steps toward a general theory of incentive-compatible interdomain routing.