K-pair delay constrained minimum cost routing in undirected networks

Guangting Chen, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)|i = l,...,k} where si is ith source node, ti is ith destination node, and dl, is the /th delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Pages230-231
Number of pages2
StatePublished - 2001
Externally publishedYes
Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
Duration: Apr 30 2001May 1 2001

Other

Other2001 Operating Section Proceedings, American Gas Association
CountryUnited States
CityDallas, TX
Period4/30/015/1/01

Fingerprint

Routing
Costs
FPTAS
QoS Routing
Quality of service
Vertex of a graph
Tolerance
Path

Keywords

  • Algorithms
  • Performance
  • Reliability
  • Theory

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Chen, G., & Xue, G. (2001). K-pair delay constrained minimum cost routing in undirected networks. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 230-231)

K-pair delay constrained minimum cost routing in undirected networks. / Chen, Guangting; Xue, Guoliang.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 230-231.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, G & Xue, G 2001, K-pair delay constrained minimum cost routing in undirected networks. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 230-231, 2001 Operating Section Proceedings, American Gas Association, Dallas, TX, United States, 4/30/01.
Chen G, Xue G. K-pair delay constrained minimum cost routing in undirected networks. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 230-231
Chen, Guangting ; Xue, Guoliang. / K-pair delay constrained minimum cost routing in undirected networks. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. pp. 230-231
@inproceedings{c7c4aafd27a949239e065633b0d5ffeb,
title = "K-pair delay constrained minimum cost routing in undirected networks",
abstract = "We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)|i = l,...,k} where si is ith source node, ti is ith destination node, and dl, is the /th delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.",
keywords = "Algorithms, Performance, Reliability, Theory",
author = "Guangting Chen and Guoliang Xue",
year = "2001",
language = "English (US)",
isbn = "0898714907",
pages = "230--231",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

}

TY - GEN

T1 - K-pair delay constrained minimum cost routing in undirected networks

AU - Chen, Guangting

AU - Xue, Guoliang

PY - 2001

Y1 - 2001

N2 - We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)|i = l,...,k} where si is ith source node, ti is ith destination node, and dl, is the /th delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.

AB - We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)|i = l,...,k} where si is ith source node, ti is ith destination node, and dl, is the /th delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.

KW - Algorithms

KW - Performance

KW - Reliability

KW - Theory

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

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

M3 - Conference contribution

AN - SCOPUS:64049088015

SN - 0898714907

SP - 230

EP - 231

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -