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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Decision and Control, 1993 Ročník ol. 2; s. 1698 - 1703 vol.2
Hlavní autoři: Beidas, B.F., Papavassilopoulos, G.P.
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: IEEE 1993
Témata:
Acceleration
Collaboration
Concurrent computing
Convergence
Data communication
Delay estimation
Distributed computing
Parallel processing
Routing
Stochastic processes
ISBN:9780780312982, 0780312988
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISBN:9780780312982
0780312988
DOI:10.1109/CDC.1993.325479