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

Full description

Saved in:
Bibliographic Details
Published in:IEEE Decision and Control, 1993 Vol. ol. 2; pp. 1698 - 1703 vol.2
Main Authors: Beidas, B.F., Papavassilopoulos, G.P.
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 1993
Subjects:
Acceleration
Collaboration
Concurrent computing
Convergence
Data communication
Delay estimation
Distributed computing
Parallel processing
Routing
Stochastic processes
ISBN:9780780312982, 0780312988
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISBN:9780780312982
0780312988
DOI:10.1109/CDC.1993.325479