An efficient algorithm for finding a path subject to two additive constraints

Turgay Korkmaz, Marwan M Krunz, Spyros Tragoudas

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

43 Citations (Scopus)

Abstract

One of the key issues in providing end-to-end quality-of-service guarantees in packet networks is how to determine a feasible route that satisfies a set of constraints while simultaneously maintaining high utilization of network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem that cannot be exactly solved in polynomial time. Accordingly, heuristics and approximation algorithms are often used to address to this problem. Previously proposed algorithms suffer from either excessive computational cost or low performance. In this paper, we provide an efficient approximation algorithm for finding a path subject to two additive constraints. The worst-case computational complexity of this algorithm is within a logarithmic number of calls to Dijkstra's shortest path algorithm. Its average complexity is much lower than that, as demonstrated by simulation results. The performance of the proposed algorithm is justified via theoretical performance bounds. To achieve further performance improvement, several extensions to the basic algorithm are also provided at low extra computational cost. Extensive simulations are used to demonstrate the high performance of the proposed algorithm and to contrast it with other path selection algorithms.

Original languageEnglish (US)
Title of host publicationPerformance Evaluation Review
Pages318-327
Number of pages10
Volume28
Edition1
StatePublished - 2000
EventProceedings ACM SIGMETRICS 2000 - Santa Clara, CA, United States
Duration: Jun 17 2000Jun 21 2000

Other

OtherProceedings ACM SIGMETRICS 2000
CountryUnited States
CitySanta Clara, CA
Period6/17/006/21/00

Fingerprint

Approximation algorithms
Computational complexity
Packet networks
Heuristic algorithms
Jitter
Costs
Quality of service
Polynomials

Keywords

  • Multiple constrained path selection
  • QoS routing
  • Scalable routing

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Korkmaz, T., Krunz, M. M., & Tragoudas, S. (2000). An efficient algorithm for finding a path subject to two additive constraints. In Performance Evaluation Review (1 ed., Vol. 28, pp. 318-327)

An efficient algorithm for finding a path subject to two additive constraints. / Korkmaz, Turgay; Krunz, Marwan M; Tragoudas, Spyros.

Performance Evaluation Review. Vol. 28 1. ed. 2000. p. 318-327.

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

Korkmaz, T, Krunz, MM & Tragoudas, S 2000, An efficient algorithm for finding a path subject to two additive constraints. in Performance Evaluation Review. 1 edn, vol. 28, pp. 318-327, Proceedings ACM SIGMETRICS 2000, Santa Clara, CA, United States, 6/17/00.
Korkmaz T, Krunz MM, Tragoudas S. An efficient algorithm for finding a path subject to two additive constraints. In Performance Evaluation Review. 1 ed. Vol. 28. 2000. p. 318-327
Korkmaz, Turgay ; Krunz, Marwan M ; Tragoudas, Spyros. / An efficient algorithm for finding a path subject to two additive constraints. Performance Evaluation Review. Vol. 28 1. ed. 2000. pp. 318-327
@inproceedings{91c6ba4fbf33452b81c3d27f8154808b,
title = "An efficient algorithm for finding a path subject to two additive constraints",
abstract = "One of the key issues in providing end-to-end quality-of-service guarantees in packet networks is how to determine a feasible route that satisfies a set of constraints while simultaneously maintaining high utilization of network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem that cannot be exactly solved in polynomial time. Accordingly, heuristics and approximation algorithms are often used to address to this problem. Previously proposed algorithms suffer from either excessive computational cost or low performance. In this paper, we provide an efficient approximation algorithm for finding a path subject to two additive constraints. The worst-case computational complexity of this algorithm is within a logarithmic number of calls to Dijkstra's shortest path algorithm. Its average complexity is much lower than that, as demonstrated by simulation results. The performance of the proposed algorithm is justified via theoretical performance bounds. To achieve further performance improvement, several extensions to the basic algorithm are also provided at low extra computational cost. Extensive simulations are used to demonstrate the high performance of the proposed algorithm and to contrast it with other path selection algorithms.",
keywords = "Multiple constrained path selection, QoS routing, Scalable routing",
author = "Turgay Korkmaz and Krunz, {Marwan M} and Spyros Tragoudas",
year = "2000",
language = "English (US)",
volume = "28",
pages = "318--327",
booktitle = "Performance Evaluation Review",
edition = "1",

}

TY - GEN

T1 - An efficient algorithm for finding a path subject to two additive constraints

AU - Korkmaz, Turgay

AU - Krunz, Marwan M

AU - Tragoudas, Spyros

PY - 2000

Y1 - 2000

N2 - One of the key issues in providing end-to-end quality-of-service guarantees in packet networks is how to determine a feasible route that satisfies a set of constraints while simultaneously maintaining high utilization of network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem that cannot be exactly solved in polynomial time. Accordingly, heuristics and approximation algorithms are often used to address to this problem. Previously proposed algorithms suffer from either excessive computational cost or low performance. In this paper, we provide an efficient approximation algorithm for finding a path subject to two additive constraints. The worst-case computational complexity of this algorithm is within a logarithmic number of calls to Dijkstra's shortest path algorithm. Its average complexity is much lower than that, as demonstrated by simulation results. The performance of the proposed algorithm is justified via theoretical performance bounds. To achieve further performance improvement, several extensions to the basic algorithm are also provided at low extra computational cost. Extensive simulations are used to demonstrate the high performance of the proposed algorithm and to contrast it with other path selection algorithms.

AB - One of the key issues in providing end-to-end quality-of-service guarantees in packet networks is how to determine a feasible route that satisfies a set of constraints while simultaneously maintaining high utilization of network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem that cannot be exactly solved in polynomial time. Accordingly, heuristics and approximation algorithms are often used to address to this problem. Previously proposed algorithms suffer from either excessive computational cost or low performance. In this paper, we provide an efficient approximation algorithm for finding a path subject to two additive constraints. The worst-case computational complexity of this algorithm is within a logarithmic number of calls to Dijkstra's shortest path algorithm. Its average complexity is much lower than that, as demonstrated by simulation results. The performance of the proposed algorithm is justified via theoretical performance bounds. To achieve further performance improvement, several extensions to the basic algorithm are also provided at low extra computational cost. Extensive simulations are used to demonstrate the high performance of the proposed algorithm and to contrast it with other path selection algorithms.

KW - Multiple constrained path selection

KW - QoS routing

KW - Scalable routing

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

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

M3 - Conference contribution

AN - SCOPUS:0034442313

VL - 28

SP - 318

EP - 327

BT - Performance Evaluation Review

ER -