Algorithm for minimum end-to-end delay paths

We consider the transmission of a message of size r from a source to a destination with the minimum end-to-end delay over a computer network where bandwidth can be reserved and guaranteed on the links. Different paths will be required for different intervals of values for r. We propose a polynomial-time algorithm that computes a table that maps all intervals for r to the corresponding paths that minimize the end-to-end delay.