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
Analysis of the MED Oscillation Problem in BGP
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
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
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
NetScope: traffic engineering for IP networks
IEEE Network: The Magazine of Global Internetworking
Network sensitivity to hot-potato disruptions
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the ACM SIGCOMM workshop on Network troubleshooting: research, theory and operations practice meet malfunctioning reality
A measurement framework for pin-pointing routing changes
Proceedings of the ACM SIGCOMM workshop on Network troubleshooting: research, theory and operations practice meet malfunctioning reality
The case for separating routing from routers
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Designing BGP-based outbound traffic engineering techniques for stub ASes
ACM SIGCOMM Computer Communication Review
TIE breaking: tunable interdomain egress selection
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
BGP routing changes: merging views from two ISPs
ACM SIGCOMM Computer Communication Review
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Building an AS-topology model that captures route diversity
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On-demand computation of policy based routes for large-scale network simulation
WSC '04 Proceedings of the 36th conference on Winter simulation
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Network-wide prediction of BGP routes
IEEE/ACM Transactions on Networking (TON)
Foundations and Trends® in Networking
TIE breaking: tunable interdomain egress selection
IEEE/ACM Transactions on Networking (TON)
Intent-based analysis of network-wide routing policy configuration
Proceedings of the 2007 SIGCOMM workshop on Internet network management
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
Computer Communications
Wresting control from BGP: scalable fine-grained route control
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
On understanding transient interdomain routing failures
IEEE/ACM Transactions on Networking (TON)
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Incentive-compatible interdomain routing with linear utilities
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Designing optimal iBGP route-reflection topologies
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Simulated, emulated, and physical investigative analysis (SEPIA) of networked systems
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
On reducing the impact of interdomain route changes
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
A self-healing web server using differentiated services
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data
ACM SIGCOMM Computer Communication Review
Impact analysis of BGP sessions for prioritization of maintenance operations
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of the Internet can all degrade performance. To maintain good performance, network operators must continually reconfigure the routing protocols. Operators configure BGP to control how traffic flows to neighboring Autonomous Systems (ASes), as well as how traffic traverses their networks. However, because BGP route selection is distributed, indirectly controlled by configurable policies, and influenced by complex interactions with intradomain routing protocols, operators cannot predict how a particular BGP configuration would behave in practice. To avoid inadvertently degrading network performance, operators need to evaluate the effects of configuration changes before deploying them on a live network. We propose an algorithm that computes the outcome of the BGP route selection process for each router in a single AS, given only a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe a BGP emulator based on this algorithm; the emulator exploits the unique characteristics of routing data to reduce computational overhead. Using data from a large ISP, we show that the emulator correctly computes BGP routing decisions and has a running time that is acceptable for many tasks, such as traffic engineering and capacity planning.