|
Abstract : |
Qo!3 requirements across networks, when the information available for ma:king routing decisions is inaccurate. This uncertainty about the actual stale of a network component arises naturally in a number of different environments, which are reviewed in the paper. The goal of the route selection process is then to identify a path that is most likely to satisfy the QoS re-quirements. For end-to-end delay guarantees, this problem is intractable. However, we show that by decomposing the end-to-end constraint into local delay constraints, efficient and tractable solutions can be established. ?We first consider the simpler problem of decomposing the end-to-end, |
