Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
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)
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
A recursive random search algorithm for large-scale network parameter configuration
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Experimental Study of Internet Stability and Backbone Failures
FTCS '99 Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
A model of BGP routing for network engineering
Proceedings of the joint international conference on Measurement and modeling of computer systems
Implications of autonomy for the expressiveness of policy routing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Proactive techniques for correct and predictable internet routing
Proactive techniques for correct and predictable internet routing
Detecting BGP configuration faults with static analysis
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Building bug-tolerant routers with virtualization
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
Answering what-if deployment and configuration questions with wise
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Dynamic appointment of ABR for the OSPF routing protocol
Computer Communications
Humpty Dumpty: Putting iBGP Back Together Again
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Virtually eliminating router bugs
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Scalable simulation of complex network routing policies
Proceedings of the 7th ACM international conference on Computing frontiers
BGP route prediction within ISPs
Computer Communications
Simulated, emulated, and physical investigative analysis (SEPIA) of networked systems
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Better by a HAIR: hardware-amenable Internet routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Debugging the data plane with anteater
Proceedings of the ACM SIGCOMM 2011 conference
Towards a cost model for network traffic
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
This paper presents provably correct algorithms for computing the outcome of the BGP route-selection process for each router in a network, without simulating the complex details of BGP message passing. The algorithms require only static inputs that can be easily obtained from the routers: the BGP routes learned from neighboring domains, the import policies configured on the BGP sessions, and the internal topology. Solving the problem would be easy if the route-selection process were deterministic and every router received all candidate BGP routes. However, two important features of BGP--the Multiple Exit Discriminator (MED) attribute and route reflectors--violate these properties. After presenting a simple route-prediction algorithm for networks that do not use these features, we present algorithms that capture the effects of the MED attribute and route reflectors in isolation. Then, we explain why the interaction between these two features precludes efficient route prediction. These two features also create difficulties for the operation of BGP itself, leading us to suggest improvements to BGP that achieve the same goals as MED and route reflection without introducing the negative side effects.