• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.191-197
• /
• 2010

In this paper, we propose a novel methodology to identify border gateway protocol (BGP) updates associated with major events - affecting network reachability to multiple ASes - and separate them (statistically) from those attributable to minor events, which individually generate few updates, but collectively form the persistent background noise observed at BGP vantage points. Our methodology is based on principal component analysis, which enables us to transform and reduce the BGP updates into different AS clusters that are likely affected by distinct major events. We demonstrate the accuracy and effectiveness of our methodology through simulations and real BGP data.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.1050-1052
• /
• 2010

Locator and Identifier Split is considered as the solution to the scalability problem Internet is facing today. The separation approach of Locator and Identifier requires a third party called mapping system. The mapping system enables the inter-domain routing between two different edge networks. The design of this third party has generated many proposals, among them one approach use Border Gateway Protocol (BGP) for effective mapping information updates distribution. In this paper, we take advantage of this approach by considering the scalability in term of mapping information storage. Our goal is to provide scalability in term of mapping information storage as well as effective mapping information updates distribution.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.490-498
• /
• 2007

BGP route flap damping(RFD) was anecdotally considered to be a key contributor to the stability of the global Internet inter-domain routing system. However, it was recently shown that RFD can incorrectly suppress for substantially long periods of time relatively stable routes, i.e., routes that only fail occasionally. This phenomenon can be attributed to the complex interaction between BGP path exploration and how the RFD algorithm identifies route flaps. In this paper we identify a distinct characteristic of BGP path exploration following a single network event such as a link or router failure. Based on this characteristic, we distinguish BGP route updates during BGP path exploration from route flaps and propose a novel BGP route flap damping algorithm, RFD+. RFD+ has a number of attractive properties in improving Internet routing stability. In particular, it can correctly suppress persistent route flaps without affecting routes that only fail occasionally. In addition to presenting the new algorithm and analyzing its properties, we also perform simulation studies to illustrate the performance of the algorithm.