Resolving inter-domain routing policy disputes at run-time with scalability consideration

Authors:
Huaming Guo;Hongke Zhang;Chi-Yuan Chen;Han-Chieh Chao;Wei-Ming Chen
Affiliations:
Next Generation Internet Research Center, Beijing Jiaotong University, PR China;Next Generation Internet Research Center, Beijing Jiaotong University, PR China;Department of Electrical Engineering, National Dong Hwa University, Hualien, Taiwan;Department of Electrical Engineering, National Dong Hwa University, Hualien, Taiwan and Institute of Computer Science & Information Engineering, National Ilan University, I-Lan, Taiwan;Institute of Computer Science & Information Engineering, National Ilan University, I-Lan, Taiwan
Venue:
Information Fusion
Year:
2011

Citing 14
Cited 0

Stable internet routing without global coordination

IEEE/ACM Transactions on Networking (TON)
On inferring autonomous system relationships in the internet

IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing

IEEE/ACM Transactions on Networking (TON)
Analysis of link failures in an IP backbone

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Policy Disputes in Path-Vector Protocols

ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Network routing with path vector protocols: theory and applications

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Design principles of policy languages for path vector protocols

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Metarouting

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
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
A stabilizing solution to the stable path problem

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Increasing bisemigroups and algebraic routing

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
A distributed method for dynamic resolution of BGP oscillations

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An architecture for stable, analyzable Internet routing

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thousands of autonomous systems (ASes) cooperate with each other to provide global Internet connectivity. The Border Gateway Protocol (BGP) is currently the only inter-domain routing protocol deployed on the Internet. It allows ASes to select and propagate routes based on flexible and locally defined policies. However, the flexibility and freedom of policies can lead to routing instability, even policy disputes among several ASes, causing inter-domain routing oscillations. Recent studies enforce global and local constraints on policies without freedom, or require expensive memory consumption and huge numbers of message exchanges. In this paper, we propose a run-time solution that operates with small overhead, guarantees safe convergence and preserves policy freedom and privacy as much as possible. The proposed scheme uses a distributed mechanism for detecting policy disputes and does this only when policy disputes exist. ASes dynamically compresses the dispute routes for safe convergence.