Multi-constrained soft-QoS provisioning in wireless sensor networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Two techniques for fast computation of constrained shortest paths
IEEE/ACM Transactions on Networking (TON)
Multiconstrained QoS multipath routing in wireless sensor networks
Wireless Networks
Quality-of-service provisioning via stochastic path selection under Weibullian link delays
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
A laplace transform-based method to stochastic path finding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.00 |
Given a communication network modeled as a directed graph with a delay parameter associated with each link, we consider the problem of determining the most probable delay constrained path from a source node to a destination node. Assuming that the link delays are random variables with continuous and differentiable probability density function and using the central limit theorem this problem can be formulated as a path problem which involves simultaneously optimizing two additive path parameters. Two cases arise. When there is one path with mean delay less than the delay bound, we present an exact pseudo polynomial algorithm, a fully polynomial time ..-approximation algorithm and a strongly polynomial heuristic algorithm. In the unlikely case when this assumption is violated, the problem is shown to be NP-hard and no constant factor approximation algorithm exists if P 驴 NP. We also study the path protection problem under inaccurate state information.