Dynamic models of shortest path routing algorithms for communication networks with multiple destinations

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.