Routing in the Internet
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stable Internet routing without global coordination
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Internet Routing Architectures
Internet Routing Architectures
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
On the correctness of IBGP configuration
Proceedings of the 2002 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
An architecture for stable, analyzable Internet routing
IEEE Network: The Magazine of Global Internetworking
Design principles of policy languages for path vector protocols
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Implications of autonomy for the expressiveness of policy routing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Efficient large-scale BGP simulations
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Resolving inter-domain policy disputes
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
On understanding transient interdomain routing failures
IEEE/ACM Transactions on Networking (TON)
Nettle: A Language for Configuring Routing Networks
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
The stratified shortest-paths problem
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Theory and new primitives for safely connecting routing protocol instances
Proceedings of the ACM SIGCOMM 2010 conference
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
On the convergence condition and convergence time of BGP
Computer Communications
Nettle: taking the sting out of programming network routers
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Optimal gateway selection in multi-domain wireless networks: a potential game perspective
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Reduction-based formal analysis of BGP instances
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
SIAM Journal on Computing
FSR: formal analysis and implementation toolkit for safe interdomain routing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
BGP is unique among IP-routing protocols in that routing is determined using semantically rich routing policies. However, this expressiveness has come with hidden risks. The interaction of locally defined routing policies can lead to unexpected global routing anomalies, which can be very difficult to identify and correct in the decentralized and competitive Internet environment. These risks increase as the complexity of local policies increase, which is precisely the current trend. BGP policy languages have evolved in a rather organic fashion with little effort to avoid policy-interaction problems. We believe that researchers should start to consider how to emphdesign policy languages for path-vector protocols that avoid such risks and yet retain other desirable features. We take a few steps in this direction by identifying the important dimensions of this design space and characterizing some of the inherent design trade-offs. We attempt to do this in a general way that is not constrained by the details of BGP.