DYNAMIC MODELS OF SHORTEST PATH ROUTING ALGORITHMS FOR COMMUNICATION NETWORKS WITH MULTIPLE DESTINATIONS.

Research output: Contribution to journalConference articlepeer-review

10 Scopus citations

Abstract

This study provides analysis and computational results relating to the dynamic behavior of shortest path routing algorithms for store and forward communication networks. This work considers networks with multiple destinations.

Original languageEnglish (US)
Pages (from-to)127-133
Number of pages7
JournalProceedings of the IEEE Conference on Decision and Control
Volume1
DOIs
StatePublished - 1979
Externally publishedYes
EventProc IEEE Conf Decis Control Incl Symp Adapt Processes 18th - Fort Lauderdale, FL, USA
Duration: Dec 12 1979Dec 14 1979

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'DYNAMIC MODELS OF SHORTEST PATH ROUTING ALGORITHMS FOR COMMUNICATION NETWORKS WITH MULTIPLE DESTINATIONS.'. Together they form a unique fingerprint.

Cite this