Title :
Dynamic models of shortest path routing algorithms for communication networks with multiple destinations
Author_Institution :
Massachusetts Institute of Technology, Cambridge, Mass.
Abstract :
This paper provides analysis and computational results relating to the dynamic behavior of shortest path routing algorithms for store and forward communication networks. A companion paper [1] focuses on networks with a single destination. The present work considers networks with multiple destinations.
Keywords :
Algorithm design and analysis; Clocks; Communication networks; Convergence; Damping; Density functional theory; Information analysis; Laboratories; Routing; State-space methods;
Conference_Titel :
Decision and Control including the Symposium on Adaptive Processes, 1979 18th IEEE Conference on
Conference_Location :
Fort Lauderdale, FL, USA
DOI :
10.1109/CDC.1979.270147
