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)
Robustness of Class-Based Path-Vector Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
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
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Resolving inter-domain policy disputes
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Robust Path-Vector Routing Despite Inconsistent Route Preferences
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Implications of autonomy for the expressiveness of policy routing
IEEE/ACM Transactions on Networking (TON)
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
ACM SIGCOMM Computer Communication Review
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
An Online Mechanism for BGP Instability Detection and Analysis
IEEE Transactions on Computers
Federation of virtualized infrastructures: sharing the value of diversity
Proceedings of the 6th International COnference
Internet economics: the use of Shapley value for ISP settlement
IEEE/ACM Transactions on Networking (TON)
Safe interdomain routing under diverse commercial agreements
IEEE/ACM Transactions on Networking (TON)
Toward a practical approach for BGP stability with root cause check
Journal of Parallel and Distributed Computing
On cooperative settlement between content, transit, and eyeball internet service providers
IEEE/ACM Transactions on Networking (TON)
Wheel + ring = reel: the impact of route filtering on the stability of policy routing
IEEE/ACM Transactions on Networking (TON)
BGP routing policies in ISP networks
IEEE Network: The Magazine of Global Internetworking
Principles of safe Policy Routing Dynamics
ICNP '09 Proceedings of the 2009 17th IEEE International Conference on Network Protocols. ICNP 2009
| Hi-index | 0.00 |
Thousands of competing autonomous systems (ASes) must cooperate with each other to provide global Internet connectivity. Each AS has independent economic objectives and retains autonomy in setting their routing policies independently to maximize its profit. However, such autonomy enables ASes to produce conflicting routing polices and thus raises route oscillations between them (i.e., routing divergence). This paper studies the basic problem of routing divergence by investigating real ISP pricing data. We first demonstrate that routing divergences occur under economic dependency cycles, i.e., provider-customer cycles, of different ASes which are raised by economic conflicts between themselves. We then propose a provable cycle-breaking routing mechanism to detect and solve economic conflicts and route divergence. We show that every cycle-breaking strategy allows ASes to maximize their own profits to converge to a Nash equilibrium with a profit-sharing mechanism derived from the coalition game concept of Shapley value. At the Nash equilibrium point, the cycle-breaking strategies maximize ASes' profits and encourage ASes so as to ensure divergence-free routing.