Modeling the routing of an autonomous system with C-BGP
- 21 November 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 19 (6) , 12-19
- https://doi.org/10.1109/mnet.2005.1541716
Abstract
Today, the complexity of ISPs' networks make it difficult to investigate the implications of internal or external changes on the distribution of traffic across their network. In this article we explain the complexity of building models of large ISPs' networks. We describe the various aspects important to understanding the routing inside an AS. We present an open source routing solver, C-BGP, that eases the investigation of changes in the routing or topology of large networks. We illustrate how to build a model of an ISP on a real transit network and apply the model on two "what-if" scenarios. The first scenario studies the impact of chances in the Internet connectivity of a transit network. The second investigates the impact of failures in its internal topology.Keywords
This publication has 9 references indexed in Scilit:
- Network-Wide Prediction of BGP RoutesIEEE/ACM Transactions on Networking, 2007
- Traffic matrix estimation on a large IP backbonePublished by Association for Computing Machinery (ACM) ,2004
- Network sensitivity to hot-potato disruptionsPublished by Association for Computing Machinery (ACM) ,2004
- The measurement manifestoACM SIGCOMM Computer Communication Review, 2004
- BGP routing stability of popular destinationsPublished by Association for Computing Machinery (ACM) ,2002
- IP network configuration for intradomain traffic engineeringIEEE Network, 2001
- BGP Route Reflection - An Alternative to Full Mesh IBGPPublished by RFC Editor ,2000
- NetScope: traffic engineering for IP networksIEEE Network, 2000
- An analysis of BGP convergence propertiesACM SIGCOMM Computer Communication Review, 1999