Filters








3,752 Hits in 3.0 sec

Policy disputes in path-vector protocols

T.G. Griffin, F.B. Shepherd, G. Wilfong
Proceedings. Seventh International Conference on Network Protocols  
We use a new formalism, called the Simple Path Vector Protocol (SPVP), that is designed to capture the underlying semantics of any path vector protocol such as BGP.  ...  While these include systems whose policies are consistent with shortest paths under some link metric, the class of systems with no dispute cycles is strictly larger.  ...  In Section 2 we define the Simplified Path-Vector Protocol (SPVP).  ... 
doi:10.1109/icnp.1999.801912 dblp:conf/icnp/GriffinSW99 fatcat:2emwlnv4q5cjdikfhis76q4zx4

Toward the design of robust interdomain routing protocols

A.D. Jaggard, V. Ramachandran
2005 IEEE Network  
The Border Gateway Protocol, the interdomain routing protocol for the Internet, allows for a wide variety of routing policies that may interact in unintended and unstable ways.  ...  Recent work on BGP and related protocols has begun to incorporate formal protocol models, which have enabled rigorous descriptive analyses of BGP.  ...  Conclusions We have reviewed recent work aimed at understanding policy conflicts in networks running path-vector protocols, and how these can be prevented through the design of protocols and routing policies  ... 
doi:10.1109/mnet.2005.1541719 fatcat:zaqi57bz4nhqzadspvnao2dmqu

Design principles of policy languages for path vector protocols

Timothy G. Griffin, Aaron D. Jaggard, Vijay Ramachandran
2003 Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03  
We believe that researchers should start to consider how to design policy languages for path-vector protocols in order to avoid routing anomalies while obtaining desirable protocol properties.  ...  We believe that researchers should start to consider how to design policy languages and path-vector protocols that together avoid such risks and yet retain other desirable features.  ...  Path-Vector Policy Systems In this section, we define the "protocol part" of our framework: the underlying exchange system for route information.  ... 
doi:10.1145/863961.863964 fatcat:nx6hntvpebfxfdog3ot2uvfuwy

Design principles of policy languages for path vector protocols

Timothy G. Griffin, Aaron D. Jaggard, Vijay Ramachandran
2003 Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03  
We believe that researchers should start to consider how to design policy languages for path-vector protocols in order to avoid routing anomalies while obtaining desirable protocol properties.  ...  We believe that researchers should start to consider how to design policy languages and path-vector protocols that together avoid such risks and yet retain other desirable features.  ...  Path-Vector Policy Systems In this section, we define the "protocol part" of our framework: the underlying exchange system for route information.  ... 
doi:10.1145/863955.863964 dblp:conf/sigcomm/GriffinJR03 fatcat:ygb24pdmpvdblg3ufwrybff7ay

The stable paths problem and interdomain routing

T.G. Griffin, F.B. Shepherd, G. Wilfong
2002 IEEE/ACM Transactions on Networking  
We define the simple path vector protocol (SPVP), a distributed algorithm for solving the stable paths problem. SPVP is intended to capture the dynamic behavior of BGP at an abstract level.  ...  We study the stable paths problem using a derived structure called a dispute wheel, representing conflicting routing policies at various nodes.  ...  SIMPLE PATH VECTOR PROTOCOL (SPVP) This section presents a simple path vector protocol (SPVP) for solving the stable paths problem in a distributed manner.  ... 
doi:10.1109/90.993304 fatcat:gd7cu6lzwfeovm4lhlykmpimxu

Robust Path-Vector Routing Despite Inconsistent Route Preferences

Aaron D. Jaggard, Vijay Ramachandran
2006 Proceedings of the 2006 IEEE International Conference on Network Protocols  
We use it to give the broadest-known sufficient condition for robust convergence of path-vector protocols, even when complex policies are used.  ...  Existing characterizations of well-behaved path-vector routing, however, critically depend on this linear ranking and do not naturally extend to more complex policies.  ...  Convergence Properties We are not only interested in whether policies interact to allow a stable path assignment, i.e., whether or not a GSPP has a solution, but also in how path-vector protocols, following  ... 
doi:10.1109/icnp.2006.320220 dblp:conf/icnp/JaggardR06 fatcat:6detu5sdqzeqrk4rfhofoxuj5u

Implications of autonomy for the expressiveness of policy routing

Nick Feamster, Ramesh Johari, Hari Balakrishnan
2005 Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '05  
Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy.  ...  This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability.  ...  Then there exists a sequence of messages in the Simple Path Vector Protocol (SPVP) such that the same sequence of path assignments is observed.  ... 
doi:10.1145/1080091.1080096 dblp:conf/sigcomm/FeamsterJB05 fatcat:lec5z2o4ivgadm7egbav4lrtt4

Implications of Autonomy for the Expressiveness of Policy Routing

Nick Feamster, Ramesh Johari, Hari Balakrishnan
2007 IEEE/ACM Transactions on Networking  
Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy.  ...  This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability.  ...  Then there exists a sequence of messages in the Simple Path Vector Protocol (SPVP) such that the same sequence of path assignments is observed.  ... 
doi:10.1109/tnet.2007.896531 fatcat:sk5o3xqbn5edrhmllwh4faqwry

Implications of autonomy for the expressiveness of policy routing

Nick Feamster, Ramesh Johari, Hari Balakrishnan
2005 Computer communication review  
Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy.  ...  This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability.  ...  Then there exists a sequence of messages in the Simple Path Vector Protocol (SPVP) such that the same sequence of path assignments is observed.  ... 
doi:10.1145/1090191.1080096 fatcat:67n6os2jtfc5foi25ilydhbi74

Guaranteeing BGP Stability with a Few Extra Paths

Rachit Agarwal, Virajith Jalaparti, Matthew Caesar, P. Brighten Godfrey
2010 2010 IEEE 30th International Conference on Distributed Computing Systems  
Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet's inter-domain routing protocol.  ...  We design a distributed protocol for SPA and present tight bounds on the number of paths assigned to the ASes in the network.  ...  [2] introduced Stable Paths Problem as a formal model for policy routing with path vector protocols.  ... 
doi:10.1109/icdcs.2010.85 dblp:conf/icdcs/AgarwalJCG10 fatcat:hm33scsqwzaftecgxjaie6oio4

BGP safety with spurious updates

Martin Suchara, Alex Fabrikant, Jennifer Rexford
2011 2011 Proceedings IEEE INFOCOM  
We also consider the implications of spurious updates for well-known results on dispute wheels and safety under filtering.  ...  We demonstrate that, even in simple configurations, this short-term spurious behavior may cause long-term divergence in global routing.  ...  To capture how these local phenomena affect global convergence, we introduce an extension of SPVP called the Dynamic Path Vector Protocol (DPVP).  ... 
doi:10.1109/infcom.2011.5935137 dblp:conf/infocom/SucharaFR11 fatcat:os2zwkjwuzcqlhxh6elh4nmbxe

Stability Analysis of Path-vector Routing [article]

Papadimitriou Dimitri, Cabellos Albert
2012 arXiv   pre-print
In this paper, we define a set of metrics that characterize the local stability properties of path-vector routing such as BGP (Border Gateway Protocol).  ...  Most studies on path-vector routing stability have been conducted empirically by means of ad-hoc analysis of BGP data traces.  ...  instabilities: BGP is an inter-AS pathvector routing protocol subject to Path Exploration phenomenon like any other path-vector algorithm.  ... 
arXiv:1204.5641v1 fatcat:f6yx76qvorch3i7dhgl4hpfenm

Analysis of Path-vector Routing Stability [article]

Papadimitriou Dimitri, Cabellos Albert
2012 arXiv   pre-print
In this paper, we define a set of metrics that characterize the local stability properties of path-vector routing such as BGP (Border Gateway Protocol).  ...  Most studies on path-vector routing stability have been conducted empirically by means of ad-hoc analysis of BGP data traces.  ...  instabilities: BGP is an inter-AS pathvector routing protocol subject to Path Exploration phenomenon like any other path-vector algorithm.  ... 
arXiv:1204.5642v1 fatcat:vf5gjwhvkrcwxlr3v3eqh3nabe

Rationality and traffic attraction

Sharon Goldberg, Shai Halevi, Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. Wright
2008 Proceedings of the ACM SIGCOMM 2008 conference on Data communication - SIGCOMM '08  
We find that protocols like S-BGP alone are insufficient, but that S-BGP does suffice if coupled with additional (quite unrealistic) restrictions on routing policies.  ...  We ask what combinations of BGP enhancements and restrictions on routing policies can ensure that ASes have no incentive to lie about their data-plane paths.  ...  BGP is a path-vector protocol in which ASes discover paths through the Internet via announcements from neighboring ASes.  ... 
doi:10.1145/1402958.1402989 dblp:conf/sigcomm/GoldbergHJRW08 fatcat:xvbo3j3bg5hypg4h4elbs77hcm

Rationality and traffic attraction

Sharon Goldberg, Shai Halevi, Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. Wright
2008 Computer communication review  
We find that protocols like S-BGP alone are insufficient, but that S-BGP does suffice if coupled with additional (quite unrealistic) restrictions on routing policies.  ...  We ask what combinations of BGP enhancements and restrictions on routing policies can ensure that ASes have no incentive to lie about their data-plane paths.  ...  BGP is a path-vector protocol in which ASes discover paths through the Internet via announcements from neighboring ASes.  ... 
doi:10.1145/1402946.1402989 fatcat:z4ux2gjapvgpxjltqdxc426ouq
« Previous Showing results 1 — 15 out of 3,752 results