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:
ISBN:9780780312982, 0780312988
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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 these delays are provided. The impact of varying the communication delay bound and the stepsize is also assessed.< >
AbstractList 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.< >
A distributed asynchronous algorithm that solves an optimal routing for a network that connects various U.S. 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.
Author Papavassilopoulos, G.P.
Beidas, B.F.
Author_xml – sequence: 1
  givenname: B.F.
  surname: Beidas
  fullname: Beidas, B.F.
  organization: Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
– sequence: 2
  givenname: G.P.
  surname: Papavassilopoulos
  fullname: Papavassilopoulos, G.P.
  organization: Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
BookMark eNotkM1LAzEQxQMqqLVnwVNO3lrz2W6OsloVCl70vGSTaRvNJmuSpe1_72Idhvfm8PjxmGt0HmIAhG4pmVNK1EP9VM-pUnzOmRRLdYamalmRcTllqmKXaJrzFxlHyopWiyt0qGPXD0UXF4P2GA49JAfBAI4b7LreQwehuLDFGluXS3LtUMBinY_B7FIMcchY-21Mruw6vB8V5xLNTufiDLbg9TFjF3CKwx8mQNnH9J1v0MVG-wzTf5-gz9XzR_06W7-_vNWP65ljQpSZZNxQbZm2lhPWVkq1UnLCWwpgiKJGU6s2bdUKkIYSq8aDCbALqcVSUMIn6P7E7VP8GSCXpnPZgPc6wNi9YVItpKroGLw7BR0ANH1ynU7H5vRH_gsyV23j
ContentType Conference Proceeding
Journal Article
DBID 6IE
6IL
CBEJK
RIE
RIL
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/CDC.1993.325479
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP All) 1998-Present
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 1703 vol.2
ExternalDocumentID 325479
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-i244t-523c1ad2add302b899b55303b1eec091ca1d9fb8b4e5c10d9b4e24ed65a474103
IEDL.DBID RIE
ISBN 9780780312982
0780312988
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=325479&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Fri Jul 11 03:38:07 EDT 2025
Tue Aug 26 22:23:07 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i244t-523c1ad2add302b899b55303b1eec091ca1d9fb8b4e5c10d9b4e24ed65a474103
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink http://doi.org/10.1109/CDC.1993.325479
PQID 25965981
PQPubID 23500
ParticipantIDs proquest_miscellaneous_25965981
ieee_primary_325479
PublicationCentury 1900
PublicationDate 19930000
19930101
PublicationDateYYYYMMDD 1993-01-01
PublicationDate_xml – year: 1993
  text: 19930000
PublicationDecade 1990
PublicationTitle IEEE Decision and Control, 1993
PublicationTitleAbbrev CDC
PublicationYear 1993
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558186
Score 1.2230104
Snippet A distributed asynchronous algorithm that solves an optimal routing for a network that connects various US cities is considered. The communication delays among...
A distributed asynchronous algorithm that solves an optimal routing for a network that connects various U.S. cities is considered. The communication delays...
SourceID proquest
ieee
SourceType Aggregation Database
Publisher
StartPage 1698
SubjectTerms Acceleration
Collaboration
Concurrent computing
Convergence
Data communication
Delay estimation
Distributed computing
Parallel processing
Routing
Stochastic processes
Title Computational experience of implementing a distributed asynchronous algorithm with stochastic delays in routing networks
URI https://ieeexplore.ieee.org/document/325479
https://www.proquest.com/docview/25965981
Volume ol. 2
WOSCitedRecordID wos325479&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07b4MwELaaqEOnvlI1fXroSoLBgD2njTpFGVopG7LN0SA1UPGomn9fH5B0aJduRgKDj5Pv4bvvI-RBMwgC5YVOwgzD1A13hImUI4WfRhIk56nbkk1Ei4VYreSyx9lue2EAoC0-gwkO27P8pDANpsqmvo1mIjkggygKu1atfTrFDQLEZmsDc2EV1ZNC9Pg6u2uvR_ZhrpzOHmfYp-dPuil7apVf-3FrZObH__q8EzL6adajy70ZOiUHkJ-Tr46toc_0UdgDGtMipdmmLxq391NFE8TORdorSKiqtrlBvNyiqah6fyvKrF5vKGZrqXUTzVohrjNFaMltRbOclkXTTpN35eTViLzOn15mz05PsuBk1rLXGIgaphLP7nO-62kbfmlkEvLtTwRjnQmjWCJTLTSHwDA3kXbgcUjCQHHrjbj-BRnmRQ6XhDIfOWVNYLSnuNYg7AsYN1IYcKMQ2JicodDijw5HI-7kNSb3O6HHVrXxvELlYFcZ28gsDKRgV38-d02OuuJDTIfckGFdNnBLDs1nnVXlXasd371Tu3o
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagIMHEq4jyqgfWtHGe9lyoiihVhyJ1ixznQiPRBOWB6L_Hl4QywMLmSIkTX06-h---j5C7kIHrSsszIqYYpm4cgytfGoLbsS9AOE5s1mQT_mzGl0sxb3G2614YAKiLz2CAw_osP8pUhamyoa2jGV_skj0kzmqbtbYJFdN1EZ2tDs25VlVLcN4i7HxfWy22DzPFcHQ_wk49e9BM2pKr_NqRazMzPvrXBx6T7k-7Hp1vDdEJ2YH0jHw2fA1tro_CFtKYZjFN1m3ZuL6fShohei4SX0FEZbFJFSLmZlVB5dtrliflak0xX0u1o6hWEpGdKYJLbgqapDTPqnqatCkoL7rkZfywGE2MlmbBSLRtLzEUVUxGlt7pbNMKdQAWIpeQrX8jKO1OKMkiEYc8dMBVzIyEHlgORJ4rHe2PmPY56aRZCheEMhtZZZWrQks6YQhcv4A5SnAFpu8B65FTFFrw3iBpBI28eqT_LfRAKzeeWMgU9CoDHZt5ruDs8s_n-uRgsnieBtPH2dMVOWxKETE5ck06ZV7BDdlXH2VS5Le1pnwBqaa-ww
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE+Decision+and+Control%2C+1993&rft.atitle=Computational+experience+of+implementing+a+distributed+asynchronous+algorithm+with+stochastic+delays+in+routing+networks&rft.au=Beidas%2C+B.F.&rft.au=Papavassilopoulos%2C+G.P.&rft.date=1993-01-01&rft.pub=IEEE&rft.isbn=9780780312982&rft.spage=1698&rft.epage=1703+vol.2&rft_id=info:doi/10.1109%2FCDC.1993.325479&rft.externalDocID=325479
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780312982/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780312982/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780312982/sc.gif&client=summon&freeimage=true