### Abstract

An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. We propose an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. Our algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. In this initialization step, Reverse-Dijkstra's algorithm is used K + 1 times per path request, where K is the number of additive constraints. The algorithm then randomly traverses the graph, discovering nodes from which there is a good chance of reaching the final destination. This randomized search is a modification of the breadth-first search (BFS). Using extensive simulations, we show that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity.

Original language | English (US) |
---|---|

Pages (from-to) | 251-268 |

Number of pages | 18 |

Journal | Computer Networks |

Volume | 36 |

Issue number | 2-3 |

DOIs | |

State | Published - Jul 2001 |

### Fingerprint

### Keywords

- Multi-constrained path selection
- QoS-based routing
- Scalable routing

### ASJC Scopus subject areas

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

*Computer Networks*,

*36*(2-3), 251-268. https://doi.org/10.1016/S1389-1286(00)00209-7

**A randomized algorithm for finding a path subject to multiple QoS requirements.** / Korkmaz, T.; Krunz, Marwan M.

Research output: Contribution to journal › Article

*Computer Networks*, vol. 36, no. 2-3, pp. 251-268. https://doi.org/10.1016/S1389-1286(00)00209-7

}

TY - JOUR

T1 - A randomized algorithm for finding a path subject to multiple QoS requirements

AU - Korkmaz, T.

AU - Krunz, Marwan M

PY - 2001/7

Y1 - 2001/7

N2 - An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. We propose an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. Our algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. In this initialization step, Reverse-Dijkstra's algorithm is used K + 1 times per path request, where K is the number of additive constraints. The algorithm then randomly traverses the graph, discovering nodes from which there is a good chance of reaching the final destination. This randomized search is a modification of the breadth-first search (BFS). Using extensive simulations, we show that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity.

AB - An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. We propose an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. Our algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. In this initialization step, Reverse-Dijkstra's algorithm is used K + 1 times per path request, where K is the number of additive constraints. The algorithm then randomly traverses the graph, discovering nodes from which there is a good chance of reaching the final destination. This randomized search is a modification of the breadth-first search (BFS). Using extensive simulations, we show that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity.

KW - Multi-constrained path selection

KW - QoS-based routing

KW - Scalable routing

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

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

U2 - 10.1016/S1389-1286(00)00209-7

DO - 10.1016/S1389-1286(00)00209-7

M3 - Article

AN - SCOPUS:0035400767

VL - 36

SP - 251

EP - 268

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 2-3

ER -