Incorporating Congestion Control in BGP considering its Economic & Policy Effects

1164 Words3 Pages

I. Research Question and Problem Setting
The Border Gateway Protocol (BGP) is responsible for communication between different Autonomous Systems (AS). The Internet is comprised of a large number of Autonomous Systems (AS) and exchanging routing information between two or more AS is achieved using BGP. Inter-domain routing in the Internet is carried out majorly by one protocol – Border Gateway Protocol (BGP). BGP is a distance-vector protocol and uses TCP as its underlying mechanism.
BGP peers are the routers running BGP that exchange routing information directly with each other. Two BGP peers communicate with each other via a BGP session. It is important for the BGP sessions to be reliable and scalable to provide high-quality Internet data communication. At present, the Internet lacks a differentiation mechanism in packet forwarding making BGP sessions sensitive to network congestion. Thus, it is important to understand the reliability of BGP in congested networks, for the purposes of evaluating system stability and avoiding system failure [1].
BGP forwards packets based on its best path. The current BGP routing table does not include an alternate path in it. If there is only one best path, and if that best path becomes congested, current BGPv4 still forwards packets using that best path. This does not improve the congestion scenario along the best path. It not only leads to the packets being dropped and re-sent again and again, it also leads to a large amount of delay which eventually affects the customer. To avoid delays and congestion on BGP paths, alternate paths are fed into the routing table for each destination.
Also, it does not have an inherent mechanism to avoid or detect traffic congested areas. This causes large d...

... middle of paper ...

...anies, who base their business on inbound traffic, will be interviewed. This will give a detailed description of the industry standpoint on the possible integration of this new concept in BGP.

Works Cited

Sahoo, A., (2002). An OSPF based load sensitive QoS routing algorithm using alternate paths. IEEE International Conference on Computer Communication Networks. pp.236- 241. DOI: 10.1109/ICCCN.2002.1043072
Shieh, Y.-P. & Hsu, W.-H. (2011). Simple path diversity algorithm for interdomain routing. IET Communications. 5 (16), pp.2310-2316. DOI: 10.1049/iet-com.2011.0050
Wang, F., Gao, L., (2009). Path Diversity Aware Interdomain Routing. IEEE INFOCOM. pp.307 - 315. DOI: 10.1109/INFCOM.2009.5061934
Wang, Y., Wang, Z., (1999). Explicit routing algorithms for internet traffic engineering. Computer Communications and Networks. pp.582 – 588. DOI: 10.1109/ICCCN.1999.805577

More about Incorporating Congestion Control in BGP considering its Economic & Policy Effects

Open Document