Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A scalable inter-domain routing update mechanism
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
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
Rate limiting in an event-driven BGP speaker
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
Better by a HAIR: hardware-amenable Internet routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhancing the trust of internet routing with lightweight route attestation
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
On reducing the impact of interdomain route changes
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
Toward a practical approach for BGP stability with root cause check
Journal of Parallel and Distributed Computing
Obtaining provably legitimate internet topologies
IEEE/ACM Transactions on Networking (TON)
Impact analysis of BGP sessions for prioritization of maintenance operations
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Internet routers today can be overwhelmed by a large number of BGP updates triggered by events such as session resets, linkfailures, and policy changes. Such excessive updates can delay routing convergence, which, in turn, degrades the performanceof delay-and jitter-sensitive applications. This paper proposes a simple and novel idea of differentiated processing of BGPupdates to reduce routers' load and improve routing convergence without changing the protocol semantics. Based on a set ofcriteria, BGP updates are grouped into different priority classes. Higher-priority updates are processed and propagated sooner,while lower-priority ones, not affecting routing decisions, can be delayed to both reduce routers' load and improve routingconvergence. We first present a general methodology for update classification, update processing, and priority-state inference.By analyzing real BGP data obtained from Route Views, we show that our update classification is feasible and beneficial. Wefurther propose two differentiated update processing (DUP) algorithms and evaluate them using the SSFNet BGP simulator onseveral realistic network topologies. The algorithms are shown to be very effective for large networks, yielding 30% fewerupdates and reducing convergence time by 80%. Our scheme is simple and light-weight with little added processing overhead.It can be deployed incrementally, since BGP messages are not modified and every BGP router makes routing decisions independently.