D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang. Improving BGP convergence through consistency assertions. In IEEE INFOCOM, pages 976--985, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... [12] Later work examined the impact of specific Internet Service Provider policies and topologies on the speed of routing convergence [13] Finally, Pei et al. used consistency assertions to compare similar routes and identify infeasible routes in an effort to speed up BGP convergence times [17]. 10. Conclusions and Future Work We have described a solution to the route oscillation problem in IBGP with route reflection. The solution is a modification to I BGP and the modified protocol provably converges. That is, it prevents persistent as well as transient route oscillations for I BGP ....

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang. Improving BGP Convergence Through Consistency Assertions. Submitted for Publication, 2001.

....of route announcements [10] 11] 12] For example, BGP can be modified to allow bundling of routes or to specify aggregation scopes. These proposals may limit the illeffects of multi homing but do not solve the issues of fast failover and inbound load balancing that we are concerned with. Pei [13] proposes modifications to BGP to reduce convergence time by identifying which withdrawals are due to actual failures and filtering out announcements of invalid or conflicting paths during the transient periods. He employs a new community attribute to convey routing policy information over the ....

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang, "Improving BGP convergence through consistency assertions," in Proc. IEEE INFOCOM, 2002.

....send withdrawals and announcements, we benefit from the minRouteAd er timer and improve the convergence time in a general network, and even decrease its message complexity. While researchers started to analyze and study the BGP convergence problem only recently [1] 2] 3] 4] 5] 6] 7] [8], the basic problem observed is not new. It is a variant of the known counting to infinity problem, that occurs in distance vector routing protocols [9] 10] in a different disguise (of course, in BGP the counting is limited since BGP is using the ASpath to avoid loops) There are known ....

....from the old routes and after waiting long enough time to guarantee that the old route does not exist any more in the network, it starts computing a new route. Waiting for such a long time in BGP is prohibitive. A new solution to reduce the convergence time complexity was recently introduced in [8]. It uses the information provided in the ASpath to define route consistency assertion and uses these assertion to identify infeasible routes. However, this technique requires extra computation resources from the router to compute the consistency check, and to send extra information in the BGP ....

[Article contains additional citation context not shown here]

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. Felix Wu, and L. Zhang, "Improving bgp convergence through consistency assertions," in Proc. IEEE INFOCOM, 2002.

....stage 1, when node 2 receives a withdrawal from node 1, it seems intuitive to invalidate the routes [3 1] and [4 1] as well. Sadly, this is not possible in general because policies may require invalidating direct routes without invalidating indirect routes. This is the basis of a recent proposal [14], but it does not eliminate such path explorations due to withdrawals caused by policy changes. The penalty value is above 2000 and it has to decay to 750 before the route can be re used. This requires that that penalty be halved at least once. Since the half life time is 15 minutes, the route ....

....topologies. In their future work, they pointed out the potential for route flap damping to be invoked by oscillations inherent in the BGP protocol. In this work, we confirm their suspicion by thoroughly studying its interaction with convergence. More directly related is the work of Pei et al. [14] who attempted to avoid path exploration during route withdrawal by using consistency assertions. They showed that their approach can invalidate all paths within one MRAI round in some cases. This is an intriguing approach that might work, although it needs extensive experimentation to be widely ....

[Article contains additional citation context not shown here]

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, , and L. Zhang, "Improving BGP Convergence Through Consistency Assertions," .

....of updates was consistently about 1 3 of the total number of prefixes contained in the updates. Therefore the achievable savings would range between the 30 we have shown above and an upper bound of 66 . To achieve further reduction in update traffic will mean changing the way BGP handles updates [10]. We can also suggest that the very knowledge of the Atom structure may be useful in filtering out noise from the updates. This can be done, for example, by demanding a longer update timer on updates that show change for only some of the prefixes belonging to an atom (since we expect updates on ....

Dan Pei et al, "Improving BGP Convergence Through Consistency Assertion" In Proc. IEEE INFOCOM, 2002

.... [11] Later work examined the impact of specific Internet Service Provider policies and topologies on the speed of routing convergence [12] Finally, Pei et al. used consistency assertions to compare similar routes and identify infeasible routes in an effort to speed up BGP convergence times [18]. X. CONCLUSIONS We have described a solution to the route oscillation problem in I BGP. The solution is a modification to I BGP that provably converges. That is, it prevents persistent as well as transient route oscillations, both for fully meshed I BGP and I BGP with route reflection. In ....

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang. Improving BGP Convergence Through Consistency Assertions. Submitted for Publication, 2001.

No context found.

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang. Improving BGP convergence through consistency assertions. In IEEE INFOCOM, pages 976--985, 2002.

No context found.

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang. Improving BGP convergence through consistency assertions. In IEEE INFOCOM, pages 976--985, 2002.

No context found.

Dan Pei, Xiaoliang Zhao, Lan Wang, Dan Massey, Allison Mankin, S. Felix Wu, and Lixia Zhang. Improving BGP Convergence through Consistency Assertions. In Proceedings of INFOCOM 2002.

No context found.

D. Pei, X. Zhao, L.Wang, D.Massey, A.Mankin, S.Wu, and L. Zhang, "Improving BGP Convergence through Consistency Assertions", in Proceeding of the IEEE INFOCOM, June 2002.

....the filter can be adjusted to accept longterm path changes. 4.1.1 Slow Convergence After a topology or routing policy change, BGP explores the (potentially very large) set of all possible routes before converging on a new stable route or declares the prefix is unreachable. Previous measurement [6, 10] showed that this convergence delay may last 3 minutes on average, and some non trivial percentage of cases lasted up to 15 minutes. The transient paths during the slow convergence period do not necessarily provide reachability to the destination. We examined the BGP updates to determine how many ....

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. Wu, and L. Zhang. Improving BGP convergence through consistency assertions. In Proceedings of the IEEE INFOCOM, June 2002.

....happened to only a small number of highly unstable networks (Section III E) The BGP protocol allows these local changes to propagate globally and BGP s slow convergence [5] further exacerbated the problem. Slow convergence could be reduced or eliminated using techniques such as those proposed in [8]) The paper is organized as follows. Section II describes our methodology and system for classifying BGP updates into meaningful groupings. Section III provides a more detailed look at the volume of updates received during our study period and presents our results. Section IV presents the ....

....message[5] Such exhaustive search not only results in long convergence time, but also produces a significant number of unnecessary BGP updates. In particular, this withdrawal triggered a total of 13 implicit withdrawals from six peers, all of which can be avoided if the mechanism proposed in [8] is deployed. F. Different Behavior among ISPs Due to differences in implementations and routing policies, the 12 routers peering with the monitoring point exhibited different behaviors, especially during the worm attack period. As we noted earlier, different ISPs generated different amount of ....

[Article contains additional citation context not shown here]

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. Wu, and L. Zhang, "Improving BGP convergence through consistency assertions," in Proceedings of the IEEE INFOCOM, June 2002.

No context found.

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang. Improving BGP Convergence Through Consistency Assertions. Submitted for Publication, 2001.

No context found.

D. Pei et al. Improving BGP Convergence Through Consistency Assertions. In Proceedings of the IEEE INFOCOM, 2002.

No context found.

Dan Pei, Xiaoliang Zhao, Lan Wang, Daniel Massey, Allison Mankin, Shyhtsun Felix Wu, and Lixia Zhang. Improving BGP convergence through consistency assertions. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), volume 2 of Proceedings IEEE INFOCOM 2002.

No context found.

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, , and L. Zhang. Improving BGP Convergence Through Consistency Assertions. In Infocom 2002.

No context found.

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. F. Wu, and L. Zhang, "Improving BGP Convergence Through Consistency Assertions", In Proc. IEEE INFOCOM, 2002

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC