Algorithm for minimum end-to-end delay paths

Nageswara S.V. Rao, Stephen G. Batsell

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

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.

Original languageEnglish
Pages (from-to)152-154
Number of pages3
JournalIEEE Communications Letters
Volume1
Issue number5
DOIs
StatePublished - Sep 1997

Keywords

  • End-to-end delay
  • Quality-of-service routing
  • Routing algorithms

Fingerprint

Dive into the research topics of 'Algorithm for minimum end-to-end delay paths'. Together they form a unique fingerprint.

Cite this