A Class of Decentralized Routing Algorithms Using Relaxation

DOI10.1109/TCOM.1977.1093750zbMATH Open0402.94047OpenAlexW2155681385MaRDI QIDQ4187745FDOQ4187745

Authors: T. E. Stern 

Publication date: 1977

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1977.1093750

zbMATH Keywords

RelaxationAverage Message DelayDecentralized Routing AlgorithmsPacket-Switched Communication NetworksRouting Assignment

Mathematics Subject Classification ID

Circuits, networks (94C99) Communication, information (94A99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited In (3)

• Dual coordinate step methods for linear network flow problems
• Adaptive block coordinate DIRECT algorithm
• A unified framework for primal-dual methods in minimum cost network flow problems

This page was built for publication: A Class of Decentralized Routing Algorithms Using Relaxation

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