Abstract
Humpty Dumpty is the anthropomorphic nursery-rhyme egg broken into many pieces. Similarly, we have many pieces of measurement data to represent the current iBGP state. However, unlike the nursery-rhyme where the King’s men couldn’t put Humpty together again, we present a systematic approach to putting all the pieces of measured iBGP data together to obtain a more complete picture of a network’s routing state.
Our technique determines the decisions made by all routers in a network. It is efficient, has no assumptions about router configuration and is accurate. We present a case-study of a large Tier-2 ISP, finding for those routers with adequate measurement infrastructure, we consistently find the egress location for 99.9999% of (router, prefix) pairs. Further, for the 85% of routers without measurement infrastructure we predict their decisions. This technique has been successfully applied in a ‘what-if’ scenario and has future applications in the real-time analysis of routing decisions.
Chapter PDF
Similar content being viewed by others
Keywords
References
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., True, F.: Deriving Traffic Demands for Operational IP Networks: Methodology and Experience. IEEE/ACM Transactions on Networking (2001)
Zhang, Y., Roughan, M., Lund, C., Donoho, D.: Estimating Point-to-Point and Point-to-Multipoint Traffic Matrices: An Information-Theoretic Approach. IEEE/ACM Transactions on Networking 13(5), 947–960 (2005)
Teixeira, R., Shaikh, A., Griffin, T.G., Voelker, G.M.: Network Sensitivity to Hot-Potato Disruptions. In: ACM SIGCOMM (2004)
Flavel, A., Roughan, M., Bean, N., Shaikh, A.: Where’s Waldo? Practical Searches for Stability in iBGP. In: IEEE International Conference on Network Protocols (2008)
Buob, M., Meulle, M., Uhlig, S.: Checking for Optimal Egress Points in iBGP Routing. In: International Workshop on the Design of Reliable Communications Networks (2007)
Bates, T., Chandra, R., Chen, E.: BGP Route Reflection - An Alternative to Full Mesh IBGP, RFC 2796 (2000)
Feamster, N., Rexford, J.: Network-Wide Prediction of BGP Routes. IEEE/ACM Transactions on Networking 15(2), 253–266 (2007)
Griffin, T., Wilfong, G.: On the Correctness of IBGP Configuration. In: ACM SIGCOMM (2002)
Feamster, N., Balakrishnan, H.: Correctness Properties for Internet Routing. In: Forty-third Allerton Conference on Communication, Control, and Computing (2005)
Vutukuru, M., Valiant, P., Kopparty, S., Balakrishnan, H.: How to Construct a Correct and Scalable iBGP Configuration. In: IEEE INFOCOM, Barcelona, Spain (April 2006)
Buob, M., Uhlig, S., Meulle, M.: Designing Optimal iBGP Route-Reflection Topologies. In: IFIP Networking (2008)
Bonaventure, O., Uhlig, S., Quoitin, B.: The Case for More Versatile BGP Route Reflectors, Work in progress, draft-bonaventure-bgp-route-reflectors-00.txt (2004)
Poduri, K., Alaettinoglu, C., Jacobson, V.: BST - BGP Scalable Transport. In: NANOG 27 (2003)
Caesar, M., Caldwell, D., Feamster, N., Rexford, J., Shaikh, A., van der Merwe, J.: Design and Implementation of a Routing Control Platform. In: Symposium on Networked Systems Design and Implementation (2005)
Quoitin, B., Uhlig, S.: Modeling the Routing of an Autonomous System with CBGP. IEEE Network Magazine, Special Issue on Interdomain Routing (2005)
Flavel, A.: BGP, Not As Easy As 1-2-3. Ph.D thesis, University of Adelaide (2009)
Shaikh, A., Greenberg, A.: OSPF Monitoring: Architecture, Design and Deployment Experience. In: Symposium on Networked Systems Design and Implementation (2004)
Mühlbauer, W., Maennel, O., Uhlig, S., Feldmann, A., Roughan, M.: Building an AS-Topology Model that Captures Route Diversity. In: ACM SIGCOMM (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Flavel, A., McMahon, J., Shaikh, A., Roughan, M., Bean, N. (2009). Humpty Dumpty: Putting iBGP Back Together Again. In: Fratta, L., Schulzrinne, H., Takahashi, Y., Spaniol, O. (eds) NETWORKING 2009. NETWORKING 2009. Lecture Notes in Computer Science, vol 5550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01399-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-01399-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01398-0
Online ISBN: 978-3-642-01399-7
eBook Packages: Computer ScienceComputer Science (R0)