Creating realistic BGP models

Modeling the Internet infrastructure is a challenging endeavor. Complex interactions between protocols, increasing traffic volumes and the irregular structure of the Internet lead to demanding requirements for the simulation developer. These requirements include implementation detail, memory efficiency and scalability, among others. We introduce a simulation model of the Border Gateway Protocol that we call BGP++, which is built on the popular ns-2 simulation environment. A novel development approach is presented that incorporates the public domain routing software GNU Zebra in the simulator. Most of the original software functionality is retained, while the transition to the simulation environment required a manageable amount of effort. Moreover, the discussed design inherits much of the maturity of the original software, since the later is only minimally modified. We analyze BGP++ features and highlight its potential to provide significant aid in BGP research and modeling.

[1]  Kevin L. Mills,et al.  Expand-ing confidence in network simulation , 2000 .

[2]  David M. Nicol,et al.  Towards Realistic Million-Node Internet Simulation , 1999, PDPTA.

[3]  kc claffy,et al.  Analysis of RouteViews BGP data: policy atoms , 2001 .

[4]  Richard M. Fujimoto,et al.  Design of high performance RTI software , 2000, Proceedings Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications (DS-RT 2000).

[5]  J. Heidemann,et al.  Expanding confidence in network simulations , 2001, IEEE Netw..

[6]  Timothy G. Griffin,et al.  An experimental analysis of BGP convergence time , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[7]  Deborah Estrin,et al.  Persistent route oscillations in inter-domain routing , 2000, Comput. Networks.

[8]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  James Cowie Hongbo Liu Jason Liu David Nicol Andy Ogielski.  Towards Realistic Million-Node Internet Simulations , 1999 .

[10]  Ramesh Govindan,et al.  Internet path inflation due to policy routing , 2001, SPIE ITCom.

[11]  Ramesh Govindan,et al.  An analysis of Internet inter-domain topology and route stability , 1997, Proceedings of INFOCOM '97.

[12]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[13]  kc claffy,et al.  Complexity of global routing policies , 2001 .

[14]  Lixin Gao,et al.  The extent of AS path inflation by routing policies , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[15]  J.H. Cowie,et al.  Modeling the global Internet , 1999, Comput. Sci. Eng..