By Topic

An approach to seek policy disputes based on dispute cycle avoidance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chunhong Zhang ; Dept. of Comput. Sci. & Technol., Northeastern Univ., Hebei, China ; Yuan Gao ; Zhongqiu Fu ; Lixin Gao

The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol used to exchange network reachability information between ASes in the global Internet. However, it was shown previously that the conflict of BGP routing policies can cause it to diverge. An approach is presented to seek the set of conflict routing policies based on dispute cycle avoidance. The stable paths problem, a static formalism that captures the semantics of inter-domain routing protocol, provides the theoretical foundation for this approach. And this approach draws on the simple path vector protocol to identify the dispute cycles that cause routing oscillation first, and then queries which routing policies lead to these cycles in a distributed manner. Finally, it determines conflict routing policies based on dispute cycle avoidance. In addition, a simulation instance is given in order to explain results of this method.

Published in:

Telecommunications, 2003. ICT 2003. 10th International Conference on  (Volume:2 )

Date of Conference:

23 Feb.-1 March 2003