“The Routing of an Autonomous System with C-Border Gateway Protocol in Network”

Miss. Snehal D. Nanhore, Mr. Mahip M. Bartere


The Internet has quickly evolved into a vast global network owned and operated by thousands of different administrative entities.
During this time, it became apparent that vanilla shortest path routing would be insufficient to handle the myriad operational, economic, and
political factors involved in routing. ISPs began to modify routing configurations to support routing policies — goals held by the router’s owner
that controlled which routes were chosen and which routes were propagated to neighbors. BGP, originally a simple path vector protocol, was
incrementally modified over time with a number of mechanisms to support policie, adding substantially to the complexity. Much of the mystery
in BGP comes not only from the protocol complexity, but also from a lack of understanding of the underlying policies and the problems ISPs
face that are addressed by these policies. 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. 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 changes in the Internet connectivity of a transit network. The
second investigates the impact of failures in its internal topology.

Full Text:


DOI: https://doi.org/10.26483/ijarcs.v4i6.1702


  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science