Optimal allocation of effort in packet switching networks with generally distributed transmission times

Phil Pollett

Abstract: We consider the problem of how best to assign resources in a packet switching network with generally distributed transmission times so as to minimize the average delay under a cost constraint. For such networks there are typically no analytical formulae for the delay distributions. Thus, we shall approach the optimal allocation problem using an approximation technique, namely the Residual-life Approximation. This work extends previous work of author and generalizes results of Kleinrock, who studied networks with exponentially distributed service times.

Acknowledgement: This worked was funded by the Australian Research Council.

The author:

Last modified: 31st October 1997