Time complexity of a path formulated optimal routing algorithm

DOI10.1109/9.272341MaRDI QIDQ4297264zbMATH OpenOpenAlexFDO

Authors John K. Antonio, Wei K. Tsai, Garng M. Huang

Publication date 3 July 1994

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1276&context=ecetr

zbMATH Keywords

convergence rateoptimal routing algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A computationally efficient iterative solution of the multidestination optimal dynamic routing problem
• A parallel optimal routing algorithm
• Time complexity of a path formulated optimal routing algorithm (second printing)
• An optimal distributed routing algorithm
• Asymptotic optimality of shortest path routing algorithms

Cited in

(2)

• scientific article; zbMATH DE number 6672134 (Why is no real title available?)
• Time complexity of a path formulated optimal routing algorithm (second printing)

This page was built for publication: Time complexity of a path formulated optimal routing algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297264)