Algorithm for minimum end-to-end delay paths

Nageswara S.V. Rao; Stephen G. Batsell

doi:10.1109/4234.625044

Algorithm for minimum end-to-end delay paths

Nageswara S.V. Rao, Stephen G. Batsell

Autonomous and Complex Systems

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	152-154
Number of pages	3
Journal	IEEE Communications Letters
Volume	1
Issue number	5
DOIs	https://doi.org/10.1109/4234.625044
State	Published - Sep 1997

Keywords

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

Access to Document

10.1109/4234.625044

Cite this

@article{54bfee65d1024270869640c3a5d57ba9,

title = "Algorithm for minimum end-to-end delay paths",

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 = "End-to-end delay, Quality-of-service routing, Routing algorithms",

author = "Rao, {Nageswara S.V.} and Batsell, {Stephen G.}",

year = "1997",

month = sep,

doi = "10.1109/4234.625044",

language = "English",

volume = "1",

pages = "152--154",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers",

number = "5",

}

TY - JOUR

T1 - Algorithm for minimum end-to-end delay paths

AU - Rao, Nageswara S.V.

AU - Batsell, Stephen G.

PY - 1997/9

Y1 - 1997/9

N2 - 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.

AB - 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.

KW - End-to-end delay

KW - Quality-of-service routing

KW - Routing algorithms

UR - http://www.scopus.com/inward/record.url?scp=0031236831&partnerID=8YFLogxK

U2 - 10.1109/4234.625044

DO - 10.1109/4234.625044

M3 - Article

AN - SCOPUS:0031236831

SN - 1089-7798

VL - 1

SP - 152

EP - 154

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 5

ER -

Algorithm for minimum end-to-end delay paths

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this