HEAL DSpace

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

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Beidas, B en
dc.contributor.author Papavassilopoulos, G en
dc.date.accessioned 2014-03-01T02:48:09Z
dc.date.available 2014-03-01T02:48:09Z
dc.date.issued 1993 en
dc.identifier.uri http://hdl.handle.net/123456789/33576
dc.subject Asynchronous Algorithm en
dc.subject Communication Delay en
dc.subject Computer Experiment en
dc.subject Optimal Routing en
dc.subject Probability Distribution en
dc.title Computational experience of implementing a distributed asynchronous algorithm with stochastic delays in routing networks en
heal.type conferenceItem en
heal.identifier.primary 10.1109/CDC.1993.325479 en
heal.identifier.secondary http://dx.doi.org/10.1109/CDC.1993.325479 en
heal.publicationDate 1993 en
heal.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 en
heal.journalName Conference on Decision and Control en
dc.identifier.doi 10.1109/CDC.1993.325479 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record