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

Author

Beidas, Bassem F. ; Papavassilopoulos, George P.

Author_Institution

Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA

fYear

1993

fDate

15-17 Dec 1993

Firstpage

1698

Abstract

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

Keywords

Markov processes; delays; distributed algorithms; graph theory; operations research; Markovian character; communication delay bound; communication delays; distributed asynchronous algorithm; optimal routing; probability distribution; routing networks; stepsize; stochastic delays; Acceleration; Collaboration; Concurrent computing; Convergence; Data communication; Delay estimation; Distributed computing; Parallel processing; Routing; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on

Conference_Location

San Antonio, TX

Print_ISBN

0-7803-1298-8

Type

conf

DOI

10.1109/CDC.1993.325479

Filename

325479