Proceedings ArticleDOI
Minimum hop flow assignment and routing in computer-communication networks
James S. Meditch,F. Gorecki +1 more
- Vol. 19, Iss: 19, pp 634-636
Reads0
Chats0
TLDR
The problem of minimum hop flow assignment and routing in computer-communication networks subject to an average message delay constraint or to a set of end-to-end average messagedelay constraints is formulated, and a simple algorithm for solution of the problem is developed.Abstract:
The problem of minimum hop flow assignment and routing in computer-communication networks subject to an average message delay constraint or to a set of end-to-end average message delay constraints is formulated, and a simple algorithm for solution of the problem is developed. The algorithm is illustrated via an example, and directions for future research are indicated.read more
Citations
More filters
Journal ArticleDOI
On Minimum HOP Flow Assignment in Message-Switched Telecommunication Networks
F.D. Gorecki,James S. Meditch +1 more
TL;DR: A dynamic programming algorithm for minimum hop flow assignment in message-switched telecommunication networks is developed and is a significant improvement over previous ones since it is applicable to any network topology, to anySet of link capacities, and to any set of traffic requirements.
Journal ArticleDOI
Minimum hop flow assignment and routing subject to an average message delay constraint
James S. Meditch,M.S. Chen +1 more
TL;DR: An algorithm for minimum hop flow assignment and routing in message-switched networks subject to an average message delay constraint is developed and illustrated and obtains the desired solution directly if one exists or shows that no solution is possible.