Download now Free registration required
Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probability distributions is NP-Hard. The authors transform the probability distributions into the Laplace domain, find the Laplace Transform of their convolutions and numerically inverse to find the distribution function in the time domain. Picard's iterative method of successive approximations is used to find the solution. To the best of the knowledge, ours is the first to propose a transform-based approach for the QoS routing problem of finding the most likely path.
- Format: PDF
- Size: 198.8 KB