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

P.K. 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.

Keywords: Circuit switched networks; optimal allocation of effort

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

The author:

• Phil Pollett, Discipline of Mathematics, The University of Queensland. pkp@maths.uq.edu.au

Back to Research Communications

Back to PKP's home page

Last modified: 24th August 1997