skip to main content
10.1145/633025.633029acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Realistic BGP traffic for test labs

Published:19 August 2002Publication History

ABSTRACT

This paper examines the possibility of generating realistic routing tables of arbitrary size along with realistic BGP updates of arbitrary frequencies via an automated tool deployable in a small-scale test lab. Such a tool provides the necessary foundations to study such questions as: the limits of BGP scalability, the reasons behind routing instability, and the extent to which routing instability influences the forwarding performance of a router.We find that the answer is affirmative. In this paper we identify important characteristics/metrics of routing tables and updates which provide the foundation of the proposed BGP workload model. Based on the insights of an extensive characterization of BGP traffic according to such metrics as prefix length distributions, fanout, amount of nesting of routing table prefixes, AS path length, number and times between BGP update bursts and number and times between BGP session resets, etc., we introduce our prototype tool, rtg. rtg realizes the workload model and is capable of generating realistic BGP traffic. Through its flexibility and parameterization rtg enables us to study the sensibilities of test systems in a repeatable and consistent manner while still providing the possibility of capturing the different characteristics from different vantage points in the network.

References

  1. IXIA BGP Routing Protocol Emulation Software, 2002. http://www.ixiacom.com/.]]Google ScholarGoogle Scholar
  2. Chariot, 2002. http://www.netiq.com/products/chr/default.asp.]]Google ScholarGoogle Scholar
  3. TeraRouter Tester, 2002. http://www.netcomsystems.com/ solutions/products/applications/pdf/TeraRouting/index.htm.]]Google ScholarGoogle Scholar
  4. A. Krämer, "RIG, A BGP Routing Instability Generator," 2002. Diploma Thesis, ETH Z "urich. http://www.barman.ch/rig/.]]Google ScholarGoogle Scholar
  5. T. G. Griffin and G. Wilfong, "An analysis of BGP convergence properties," in Proc. ACM SIGCOMM, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Shaikh, R. Dube, and A. Varma, "Avoiding instability during graceful shutdown of OSPF," in Proc. IEEE INFOCOM, 2002.]]Google ScholarGoogle Scholar
  7. T. Griffin, "What is the Sound of One Route Flapping?," 2002. IPAM talk.]]Google ScholarGoogle Scholar
  8. B. Halabi, Internet Routing Architectures. Cisco Press, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. W. Stewart, BGP4: Inter-Domain Routing in the Internet. Addison-Wesley, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Huitema, Routing in the Internet. Prentice Hall, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Chinoy, "Dynamics of Internet routing information," in Proc. ACM SIGCOMM, pp. 45--52, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Govindan and A. Reddy, "An analysis of Internet inter-domain topology and route stability," in Proc. IEEE INFOCOM, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. K. Varadhan, R. Govindan, and D. Estrin, "Persistent route oscillations in inter-domain routing," tech. rep., 96-631, USC/ISI, 1996.]]Google ScholarGoogle Scholar
  14. C. Labovitz, R. Malan, and F. Jahanian, "Internet routing instability," IEEE/ACM Trans. Networking, vol. 6, no. 5, pp. 515--558, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. Labovitz, R. Malan, and F. Jahanian, "Origins of Internet routing instability," in Proc. IEEE INFOCOM, 1999.]]Google ScholarGoogle ScholarCross RefCross Ref
  16. C. Labovitz, A. Ahuja, and F. Jahanian, "Experimental study of Internet stability and wide-area network failures," in Proc. International Symposium on Fault-Tolerant Computing, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, "Delayed Internet routing convergence," in Proc. ACM SIGCOMM, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. T. G. Griffin and B. J. Premore, "An experimental analysis of BGP convergence time," in Proc. International Conference on Network Protocols, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Shaikh, L. Kalampoukas, R. Dube, and A. Varma, "Routing stability in congested networks: Experimentation and analysis," in Proc. ACM SIGCOMM, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. D. Chang, R. Govindan, and J. Heidemann, "An Empirical Study of Router Response to Large BGP Routing Table Load," tech. rep., USC/ISI, 2001.]]Google ScholarGoogle Scholar
  21. S. Ramachandra, Y. Rekhter, R. Fernando, J. Scudder, and E. Chen, "Graceful restart mechanism for BGP," 2001. Internet Draft (draft-ietf-idr-restart-05.txt).]]Google ScholarGoogle Scholar
  22. D. McPerson, V. Gill, D. Walton, and A. Retana, "BGP persistent route oscillation condition," 2001. Internet Draft (draft-ietf-idr-route-oscillation-01.txt).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. H. Berkowitz, A. Retana, S. Hares, and P. Krishnaswamy, "Benchmarking methodology for basic BGP convergence," 2002. Internet Draft (draft-ietf-bmwg-bgpbas-01.txt).]]Google ScholarGoogle Scholar
  24. H. Berkowitz, A. Retana, S. Hares, P. Krishnaswamy, and M. Lepp, "Terminology for benchmarking external routing convergence measurements," 2002. Internet Draft (draft-ietf-bmwg-conterm-01.txt).]]Google ScholarGoogle Scholar
  25. NANOG: The North American Network Operators Group. http://www.nanog.org/.]]Google ScholarGoogle Scholar
  26. S. Hare, P. Krishnaswamy, M. Lepp, A. Retana, H. Berkowitz, and E. Davis, "BGP convergence measurement issues," 2001. IETF/bmwg talk.]]Google ScholarGoogle Scholar
  27. P. Barford and M. Crovella, "Generating Representative Web Workloads for Network and Server Performance Evaluation," in Proc. ACM SIGMETRICS, pp. 151--160, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. P. Danzig, R. Caceres, D. Mitzel, and D. Estrin, "An empirical workload model for driving wide-area TCP/IP network simulations," IEEE/ACM Trans. Networking, vol. 3, no. 1, pp. 1--26, 1992.]]Google ScholarGoogle Scholar
  29. P. Danzig and S. Jamin, "tcplib: A Library of TCP Internetwork Traffic Characteristics," tech. rep., USC, 1991.]]Google ScholarGoogle Scholar
  30. C. Huitema, Routing in the Internet. Prentice Hall, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Y. Rekhter and T. Li, "A Border Gateway Protocol 4 (BGP-4)," 1995. RFC 1771.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. C. Villamiyar, R. Chandra, and R. Govindan, "BGP route flap damping," 1998. RFC 2439.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. C. Panigl, J. Schmitz, P. Smith, and C. Vistoli, "RIPE Routing-WG Recommendation for Coordinated Route-flap Damping Parameters ," 2001. http://www.ripe.net/ripe/docs/ripe-229.html.]]Google ScholarGoogle Scholar
  34. M. Musuvathi, S. Venkatachary, R. Wattenhofer, C. Labovitz, and A. Ahuja, "BGP-CT: A First Step Towards Fast Internet Fail-Over," in Microsoft Research Technical Report, 2000.]]Google ScholarGoogle Scholar
  35. G. Varghese, R. Govindan, R. Katz, and Z. Mao, "Route flap damping exacerbates Internet routing convergence," in Proc. ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," in Proc. ACM SIGCOMM, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. K. Calvert, M. Doar, and E. W. Zegura, "Modeling Internet topology," in IEEE Communication Magazine, 1997.]]Google ScholarGoogle Scholar
  38. L. Gao, "On inferring autonomous system relationships in the Internet," in Proc. IEEE Global Internet, 2000.]]Google ScholarGoogle Scholar
  39. L. Gao and J. Rexford, "Stable Internet routing without global coordination," in Proc. ACM SIGMETRICS, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. B. Norton, "The art of peering: The peering playbook," 2002.]]Google ScholarGoogle Scholar
  41. "SSFNet, Scalable Simulation Framework." http://www.ssfnet.org/.]]Google ScholarGoogle Scholar
  42. O. Maennel and A. Feldmann, "BGPcharacter: Tool for processing and characterizing BGP data," February 2002. NANOG 24 talk.]]Google ScholarGoogle Scholar
  43. D. Wetherall, R. Mahajan, and T. Anderson, "Understanding BGP misconfigurations," in Proc. ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. T. G. Griffin, F. B. Shepherd, and G. Wilfong, "Policy disputes in path vector protocols," in Proc. International Conference on Network Protocols, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. A. Feldmann and S. Muthukrishnan, "Tradeoffs for packet classification," in Proc. IEEE INFOCOM, 2000.]]Google ScholarGoogle ScholarCross RefCross Ref
  46. W. Fang and L. Peterson, "Inter-AS traffic patterns and their implications," in Proc. IEEE Global Internet, 1999.]]Google ScholarGoogle Scholar
  47. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topology generators: Degree -based vs. structural," in Proc. ACM SIGCOMM, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. B. Krishnamurthy and J. Rexford, Web Protocols and Practice. Addison-Wesley, 2001.]]Google ScholarGoogle Scholar
  49. RIPE's Routing Information Service Raw Data Page. http://data.ris.ripe.net/.]]Google ScholarGoogle Scholar
  50. SaarGate. http://www.saargate.de/.]]Google ScholarGoogle Scholar
  51. University of Oregon RouteViews project. http://www.routeviews.org/.]]Google ScholarGoogle Scholar
  52. Merit. http://www.merit.edu/.]]Google ScholarGoogle Scholar
  53. V. Fuller, T. Li., J. Yu, and K. Varadhan, "Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy," 1993. RFC 1519.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Light Reading, "The Internet Core Router Test," 2001.]]Google ScholarGoogle Scholar
  55. G. Huston, "Analyzing the Internet BGP routing table," in Internet Protocol Journal, 2001.]]Google ScholarGoogle Scholar
  56. A. Broido, E. Nemeth, and K. Claffy, "Internet Expansion, Refinement and Churn," in ETT, 2002.]]Google ScholarGoogle Scholar
  57. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, "Characterizing the Internet hierarchy from multiple vantage points," in Proc. IEEE INFOCOM, 2002.]]Google ScholarGoogle ScholarCross RefCross Ref
  58. C. Labovitz, "Multithreaded routing toolkit," in Merit Technical Report to the National Science Foundation, 1996.]]Google ScholarGoogle Scholar

Index Terms

  1. Realistic BGP traffic for test labs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2002
      368 pages
      ISBN:158113570X
      DOI:10.1145/633025
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 32, Issue 4
        Proceedings of the 2002 SIGCOMM conference
        October 2002
        332 pages
        ISSN:0146-4833
        DOI:10.1145/964725
        Issue’s Table of Contents

      Copyright © 2002 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 19 August 2002

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Author Tags

      Qualifiers

      • Article

      Acceptance Rates

      SIGCOMM '02 Paper Acceptance Rate25of300submissions,8%Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader