Scipediacontent: Scipediacontent moved page Draft Content 503684781 to Gurney et al 2018a

2021-02-01T20:16:54Z

Scipediacontent moved page Draft Content 503684781 to Gurney et al 2018a

Scipediacontent: Created page with " == Abstract == We present new results in the theory of asynchronous convergence for the Distributed Bellman-Ford (DBF) family of routing protocols which includes distance-ve..."

2021-02-01T20:16:48Z

Created page with " == Abstract == We present new results in the theory of asynchronous convergence for the Distributed Bellman-Ford (DBF) family of routing protocols which includes distance-ve..."

New page

== Abstract ==

We present new results in the theory of asynchronous convergence for the Distributed Bellman-Ford (DBF) family of routing protocols which includes distance-vector protocols (e.g. RIP) and path-vector protocols (e.g. BGP). We take the \emph{strictly increasing} conditions of Sobrinho and make three main new contributions. First, we show that the conditions are sufficient to guarantee that the protocols will converge to a \emph{unique} solution, preventing the possibility of BGP wedgies. Second, we decouple the computation from the asynchronous context in which it occurs, allowing us to reason about a more relaxed model of asynchronous computation in which routing messages can be lost, reordered, and duplicated. Third, our theory and results have been fully formalised in the Agda theorem prover and the resulting library is publicly available for others to use and extend. This is in line with the increasing emphasis on formal verification of software for critical infrastructure.

== Original document ==

The different versions of the original document can be found in:

* [https://www.repository.cam.ac.uk/bitstream/1810/287727/3/ConvergencePaper%20%281%29.pdf https://www.repository.cam.ac.uk/bitstream/1810/287727/3/ConvergencePaper%20%281%29.pdf]

* [https://www.repository.cam.ac.uk/handle/1810/287727 https://www.repository.cam.ac.uk/handle/1810/287727]

* [http://dl.acm.org/ft_gateway.cfm?id=3230561&ftid=1992925&dwn=1 http://dl.acm.org/ft_gateway.cfm?id=3230561&ftid=1992925&dwn=1],
: [http://dx.doi.org/10.1145/3230543.3230561 http://dx.doi.org/10.1145/3230543.3230561] under the license http://www.acm.org/publications/policies/copyright_policy#Background

* [https://dblp.uni-trier.de/db/conf/sigcomm/sigcomm2018.html#DaggittGG18 https://dblp.uni-trier.de/db/conf/sigcomm/sigcomm2018.html#DaggittGG18],
: [https://www.repository.cam.ac.uk/handle/1810/287727 https://www.repository.cam.ac.uk/handle/1810/287727],
: [https://dl.acm.org/citation.cfm?doid=3230543.3230561 https://dl.acm.org/citation.cfm?doid=3230543.3230561],
: [https://doi.org/10.1145/3230543.3230561 https://doi.org/10.1145/3230543.3230561],
: [https://doi.acm.org/10.1145/3230543.3230561 https://doi.acm.org/10.1145/3230543.3230561],
: [https://academic.microsoft.com/#/detail/2839252377 https://academic.microsoft.com/#/detail/2839252377]

DOIS: 10.17863/cam.35042 10.1145/3230543.3230561

← Older revision	Revision as of 20:16, 1 February 2021
(No difference)

Gurney et al 2018a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 503684781 to Gurney et al 2018a

Scipediacontent: Created page with " == Abstract == We present new results in the theory of asynchronous convergence for the Distributed Bellman-Ford (DBF) family of routing protocols which includes distance-ve..."