Phillipa Gill
Abstract
Researchers studying the interdomain routing system, its properties and new protocols, face many challenges in performing realistic evaluations and simulations. Modeling decisions with respect to AS-level topology, routing policies and traffic matrices are complicated by a scarcity of ground truth for each of these components. Moreover, scalability issues arise when attempting to simulate over large (although still incomplete) empirically-derived AS-level topologies. In this paper, we discuss our approach for analyzing the robustness of our results to incomplete empirical data. We do this by (1) developing fast simulation algorithms that enable us to (2) running multiple simulations with varied parameters that test the sensitivity of our research results.
- B. Augustin, B. Krishnamurthy, and W. Willinger. IXPs: Mapped? In IMC, 2009. Google Scholar
Digital Library
- I. Avramopoulos, M. Suchara, and J. Rexford. How small groups can secure interdomain routing. Technical report, Princeton University Comp. Sci., 2007.Google Scholar
- H. Chang, D. Dash, A. Perrig, and H. Zhang. Modeling adoptability of secure BGP protocol. In Sigcomm, 2006. Google ScholarDigital Library
- H. Chang, S. Jamin, Z. Mao, and W. Willinger. An empirical approach to modeling inter-AS traffic matrices. In IMC, 2005. Google ScholarDigital Library
- Y.-J. Chi, R. Oliveira, and L. Zhang. Cyclops: The Internet AS-level observatory. ACM SIGCOMM CCR, 2008.Google Scholar
- X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, and kc claffy. AS relationships: Inference and validation. ACM SIGCOMM Computer Communication Review, JAN 2007. Google ScholarDigital Library
- X. Dimitropoulos and G. Riley. Efficient large-scale BGP simulations. Elsevier Computer Networks, Special Issue on Network Modeling and Simulation, 50(12), 2006. Google ScholarDigital Library
- N. Feamster, J. Winick, and J. Rexford. A model of BGP routing for network engineering. In SIGMETRICS, 2004. Google ScholarDigital Library
- L. Gao and J. Rexford. Stable Internet routing without global coordination. Trans. on Networking, 2001. Google ScholarDigital Library
- P. Gill, M. Schapira, and S. Goldberg. Let the market drive deployment: A strategy for transitioning to BGP security. In SIGCOMM, 2011. Google ScholarDigital Library
- P. Gill, M. Schapira, and S. Goldberg. Let the market drive deployment: A strategy for transitioning to BGP security. Full version. Technical report, 2011.Google Scholar
- S. Goldberg, M. Schapira, P. Hummon, and J. Rexford. How secure are secure interdomain routing protocols. In Sigcomm, 2010. Google ScholarDigital Library
- T. Griffin, F. B. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. Trans. on Networking, 2002. Google ScholarDigital Library
- C. Jin, Q. Chen, and S. Jamin. Inet: Internet topology generator. Technical report, UM, 2000.Google Scholar
- J. John, E. Katz-Bassett, A. Krishnamurthy, T. Anderson, and A. Venkataramani. Consensus routing: The Internet as a distributed system. In NSDI, 2008. Google ScholarDigital Library
- J. Karlin, S. Forrest, and J. Rexford. Autonomous security for autonomous systems. Computer Networks, oct 2008. Google ScholarDigital Library
- J. Karlin, S. Forrest, and J. Rexford. Nation-state routing: Censorship, wiretapping, and BGP. CoRR, abs/0903.3218, 2009.Google Scholar
- B. Krishnamurthy, W. Willinger, P. Gill, and M. Arlitt. A socratic method for validation of measurement-based networking research. Computer Communications, 2011. Google ScholarDigital Library
- V. Krishnamurthy, M. Faloutsos, M. Chrobak, L. Lao, J.-H. Cui, and A. G. Percus. Sampling large Internet topologies for simulation purposes. Computer Networks (Elsevier), 51(15):4284--4302, 2007. Google ScholarDigital Library
- C. Labovitz. Arbor blog: Battle of the hyper giants. http://asert.arbornetworks.com/2010/04/ the-battle-of-the-hyper-giants-part-i-2/.Google Scholar
- C. Labovitz, S. Iekel-Johnson, D. McPherson, J. Oberheide, and F. Jahanian. Internet inter-domain traffic. In Sigcomm, 2010. Google ScholarDigital Library
- A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: an approach to universal topology generation. In MASCOTS, 2001. Google ScholarDigital Library
- R. Oliveira, D. Pei, W. Willinger, B. Zhang, and L. Zhang. In search of the elusive ground truth: The Internet's AS-level connectivity structure. In SIGMETRICS, 2008. Google ScholarDigital Library
- R. Oliveira, D. Pei, W. Willinger, B. Zhang, and L. Zhang. Quantifying the completeness of the observed Internet AS-level structure. UCLA Computer Science Department - Techical Report TR-080026-2008, Sept 2008.Google Scholar
- F. Orbit. http://www.fixedorbit.com/metrics.htm.Google Scholar
- B. J. Premore. An analysis of convergence properties of the border gateway protocol usingdiscrete event simulation. PhD thesis, Dartmouth College, 2003. Google ScholarDigital Library
- B. Quoitin and S. Uhlig. Modeling the routing of an autonomous system with CBGP. IEEE Network Magazine, 2005. Google ScholarDigital Library
- M. Roughan, W. Willinger, O. Maennel, D. Perouli, and R. Bush. 10 lessons from 10 years of measuring and modeling the Internet's autonomous systems. Journal on Select Areas in Communications, 2011.Google ScholarCross Ref
- Sandvine. Fall 2010 global Internet phenomena, 2010.Google Scholar
- W. Willinger, D. Alderson, and J. Doyle. Mathematics and the Internet: A source of enourmous confusion and great potential. Notices of the American Mathematical Society, 2009.Google Scholar
- M. Wojciechowski. Border gateway protocol modeling and simulation. Master's thesis, University of Warsaw, 2008.Google Scholar
- J. Wu, Y. Zhang, Z. M. Mao, and K. Shin. Internet routing resilience to failures: Analysis and implications. In CoNEXT, 2007. Google ScholarDigital Library
- Y. Yu, M. Isard, D. Fetterly, M. Budiu, U. Erlingsson, P. K. Gunda, and J. Currey. Dryadlinq: a system for general-purpose distributed data-parallel computing using a high-level language. In Usenix OSDI, 2008. Google ScholarDigital Library
- E. Zegura, K. Calvert, and S. Bhattarcharjee. How to model an internetwork. In Infocom, 1996. Google ScholarDigital Library
Index Terms
- Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data
Recommendations
Architecture of the remote routing validation tool for BGP anomaly detection
RACS '12: Proceedings of the 2012 ACM Research in Applied Computation SymposiumThe Border Gateway Protocol (BGP) is an Inter-domain routing protocol that has gradually evolved over the past few decades. The main functionality of BGP is to exchange Network Layer Reachability Information (NLRI) between ASes so that a BGP speaker can ...
On understanding transient interdomain routing failures
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes. Yet, routing behavior during BGP route convergence is poorly understood. During route convergence, an end-to-end Internet path can experience a transient loss ...
The BGP monitoring and alarming system to detect and prevent anomaly IP prefix advertisement
RACS '13: Proceedings of the 2013 Research in Adaptive and Convergent SystemsThe Border Gateway Protocol (BGP) is the routing protocol that enables large IP networks to form a single Internet. The main objective of BGP is to exchange Network Layer Reachability Information (NLRI) between Autonomous Systems (ASes) so that a BGP ...
Comments