An analysis of BGP multiple origin AS (MOAS) conflicts
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
IP v6 - An opportunity for new service and network features
ICNS '06 Proceedings of the International conference on Networking and Services
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
NIRA: a new inter-domain routing architecture
IEEE/ACM Transactions on Networking (TON)
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Open issues in interdomain routing: a survey
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
To maximize the utilization of network resources it is necessary to have good approach for Routing Policy. The protocol currently used for Interdomain Routing is Border Gateway Protocol (BGP). BGP permits each router to use single best route for each destination prefix even though multiple routes to the same destination exists. Secondly BGP not only selects a single best route but also advertises the same route to its peers. Even if BGP knows multiple routes to a destination BGP does not advertise them to other BGP routers. It means BGP uses network bandwidth partially. If a link on the best route fails BGP has to construct a new route. This time required for reconstruction of new route lead to interruption in the data transmission. Therefore BGP has disadvantages like underutilization of Network Bandwidth and Low Resistance to Link Failure. We propose an extension to existing Border Gateway Protocol (BGP) called as Multiple Route Selector Border Gateway Protocol (MRS-BGP) Algorithm which will not only efficiently utilize the residual network bandwidth but will also be less prone to the victim of Link failure. It would not be susceptible to looping as various other multiple route selection algorithms are. The proposed MRS-BGP algorithm will be compatible with existing route selection algorithm (BGP) where initially traffic would be passing through selected best path till MRS-BGP algorithm finds out alternate paths. After this the load is dynamically distributed depending on capacity of individual paths calculated periodically.