University of Cambridge > Talks.cam > Computer Laboratory NetOS Group Talklets > Asynchronous Convergence of Policy-Rich Distributed Bellman-Ford Routing Protocols

Asynchronous Convergence of Policy-Rich Distributed Bellman-Ford Routing Protocols

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Gemma Gordon.

Several modern day routing protocols suffer from convergence problems. This talk will explain the algebraic approach to routing protocol design that allows one to reason about the behaviour of whole families of routing protocols at the same time. The talk will then discuss the algebraic conditions sufficient to guarantee desirable convergence guarantees for the protocol. In particular we take the “strictly increasing” condition of Sobrinho and show that several new results for distance and path-vector protocols including a weaker asynchronous model and a guarantee of a unique final state. Finally, the talk will discuss how the results have been fully formalised in the Agda theorem prover and the resulting library is publicly available for others to use and extend.

Paper: https://dl.acm.org/authorize.cfm?key=N666832.

This talk is part of the Computer Laboratory NetOS Group Talklets series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity