Title :
Algorithm for minimum end-to-end delay paths
Author :
Rao, Nageswara S V ; Batsell, Stephen G.
Author_Institution :
Oak Ridge Nat. Lab., TN, USA
Abstract :
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.
Keywords :
delays; message switching; polynomials; telecommunication network routing; wide area networks; bandwidth reservation; computer network; guaranteed bandwidth; intervals; message size; message transmission; minimum delay routing algorithm; minimum end to end delay paths; polynomial-time algorithm; wide area networks; Algorithm design and analysis; Application software; Bandwidth; Biomedical imaging; Computer networks; Delay; Image retrieval; Polynomials; Quality of service; Routing;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/4234.625044
