I am searching the web for an answer to this question, but I have only found answers for non-distributed algorithms. I am interested in this for its application to Distance Vector routing.

  • $\begingroup$ "Distributed computation on graphs: Shortest path algorithms" by Chandy and Misra might be useful to you, although it is old (written in 1982). You could try searching for newer articles that cite it if it doesn't answer your question. $\endgroup$
    – phan801
    Commented Feb 7, 2019 at 12:55
  • $\begingroup$ "for its application to Distance Vector routing". Can you explain how a routing graph could have a negative cycle? $\endgroup$
    – John L.
    Commented Feb 8, 2019 at 14:40
  • $\begingroup$ An example where a routing graph can have a negative weight is if these are weights given to represent monetary cost of sending traffic through that link. $\endgroup$
    – Anthony O
    Commented May 30, 2019 at 18:28


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.