Computational experience of implementing a distributed asynchronous algorithm with stochastic delays in routing networks

A distributed asynchronous algorithm that solves an optimal routing for a network that connects various US cities is considered. The communication delays among the processors are assumed to be stochastic with Markovian character. Results of the extensive simulation that we implemented assert the practical applicability of distributed asynchronous algorithms with stochastic delays. Comparison results for varying the probability distribution of these delays are provided. The impact of varying the communication delay bound and the stepsize is also assessed.<
>