Abstract
A fundamental problem in QoS routing is to find a path between a specified source-destination node pair that satisfies a set of end-to-end quality-of-service constraints. We study this problem in a communication system where there are multiple additive quality of service parameters associated with each link. It is well-known that the multi-constrained path selection problem (MCPS) is NP-complete. In this paper, we present a fully polynomial time approximation scheme for an optimization version of the MCPS problem. This means that for any given ε > 0, we can compute, in time bounded by a polynomial of the input size of the problem and in 1/ε, a solution whose cost is at most (1 + ε) of that of the optimal solution.
Original language | English (US) |
---|---|
Title of host publication | IEEE International Conference on Communications |
Pages | 223-227 |
Number of pages | 5 |
Volume | 1 |
State | Published - 2003 |
Event | 2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States Duration: May 11 2003 → May 15 2003 |
Other
Other | 2003 International Conference on Communications (ICC 2003) |
---|---|
Country/Territory | United States |
City | Anchorage, AK |
Period | 5/11/03 → 5/15/03 |
Keywords
- Efficient approximation algorithms
- Multiple additive constraints
- Quality of service routing
ASJC Scopus subject areas
- Media Technology