An Empirical Study of Router Response to Large BGP Routing Table Load

An Empirical Study of Router Response to Large BGP Routing Table Load

Chang, Di-Fa and Govindan, Ramesh and Heidemann, John
USC/Information Sciences Institute

Di-Fa Chang, Ramesh Govindan and John Heidemann 2002. An Empirical Study of Router Response to Large BGP Routing Table Load. Proceedings of the ACM SIGCOMM Internet Measurement Workshop (Marseille, France, Nov. 2002), 203–208.

Abstract

Anecdotal evidence suggests that misconfiguration of backbone routers occasionally leads to an injection of large routing tables into the BGP routing system. In this paper, we investigate the detailed mechanics of router response to large BGP routing tables. We examine three commercial grade routers, and find that their responses vary significantly. Some routers exhibit \emphtable-size oscillations that have the potential to cause \emphcascading failure. Others need operator intervention to recover from large routing tables. We also find that deployed resource control mechanisms, such as prefix limits and route flap damping, are only partially successful in mitigating the impact of large routing tables.

Reference

@inproceedings{Chang02a,
  author = {Chang, Di-Fa and Govindan, Ramesh and Heidemann, John},
  title = {An Empirical Study of Router Response to
                           Large {BGP} Routing Table Load},
  booktitle = {Proceedings of the ACM SIGCOMM Internet Measurement Workshop},
  year = {2002},
  sortdate = {2002-11-01},
  project = {ant, saman, conser},
  jsubject = {routing},
  publisher = {ACM},
  address = {Marseille, France},
  month = nov,
  pages = {203--208},
  otherurl = {http://www.isi.edu/%7edifac/imw-2002.ps.gz},
  url = {http://www.isi.edu/%7ejohnh/PAPERS/Chang02a.html},
  psurl = {http://www.isi.edu/%7ejohnh/PAPERS/Chang02a.ps.gz},
  pdfurl = {http://www.isi.edu/%7ejohnh/PAPERS/Chang02a.pdf},
  myorganization = {USC/Information Sciences Institute},
  copyrightterms = {
  	Permission to make digital or
  	hard copies of part or all 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 new 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, to republish, to post on servers or to
  	redistribute to lists, requires prior specific permission
  	and/or a fee. Request Permissions from
  	Publications Dept, ACM Inc.,
  	Fax +1 (212) 869--0481, or
  	permissions@acm.org.
  }
}

Copyright

Permission to make digital or hard copies of part or all 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 new 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, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request Permissions from Publications Dept, ACM Inc., Fax +1 (212) 869–0481, or permissions@acm.org.