By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Beidas, B.F. ; Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA ; Papavassilopoulos, G.P.

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

Published in:

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

Date of Conference:

15-17 Dec 1993