Martingale dynamics and optimal routing in a network
A store and forward computer communication network with parallel non intersecting channels is studied to determine an optimal procedure for message allocation. The conclusion is logical in that messages should be sent along the channel which has the least number of queued messages.
store and forward computer communication network
scientific article; zbMATH DE number 4080903