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

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 pra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Beidas, B.F., Papavassilopoulos, G.P.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Acceleration
Collaboration
Concurrent computing
Convergence
Data communication
Delay estimation
Distributed computing
Parallel processing
Routing
Stochastic processes
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
DOI:10.1109/CDC.1993.325479