Backup path set selection in ad hoc wireless network using link expiration time
Computers and Electrical Engineering
On the scalability of BGP: the roles of topology growth and update rate-limiting
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Neighbor-specific BGP: more flexible routing policies while improving global stability
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
On understanding transient interdomain routing failures
IEEE/ACM Transactions on Networking (TON)
Computers and Electrical Engineering
A routing-table-based adaptive and minimal routing scheme on network-on-chip architectures
Computers and Electrical Engineering
Region-based BGP announcement filtering for improved BGP security
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Putting BGP on the right path: a case for next-hop routing
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
A technique for reducing BGP update announcements through path exploration damping
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
AS-TRUST: a trust quantification scheme for autonomous systems in BGP
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
A confirmation-based geocast routing algorithm for street lighting systems
Computers and Electrical Engineering
Computers and Electrical Engineering
Hi-index | 0.00 |
In the internet environment, the Diversity-path-aware Border Gateway Protocol (D-BGP) increases path diversity by advertising multiple paths. In case of a route failure, D-BGP, selects the most disjoint alternative path, but does not consider its quality moreover because update messages are propagated both for the best path and for alternate paths, D-BGP has messaging. To overcome these limitations, we propose a robust BGP protocol that increases fault tolerance and reduces update message overhead. After establishing shortest paths using D-BGP, our protocol selects an alternate path based on link availability of the link and bandwidth. It utilizes Path Exploration Damping (PED) to delay update messages of alternate paths with worst-case scenario. Simulation results justify that our proposed BGP is failure free and performs better than D-BGP.