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
A scalable algorithm for finding delay-constraint least-cost end-to-end path
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
A scalable method for DCLC problem using hierarchical MDP model
Computer Communications
| Hi-index | 0.00 |
Quality of Service (QoS) routing consists of two parts:(a) collecting network QoS resource availability information using topology aggregation schemes and (b) computing feasible paths using this information. This paper firstlyproposes a probabilistic scheme for topology aggregation inlarge networks which are QoS sensitive. Our goal is to account for the inherent dynamic nature of the QoS resourcesby using probablistic measures as opposed to the existingdeterministic ones. Additionally, this paper also proposes amodification to an existing probabilistic QoS routing algorithm for concave QoS parameters. The proposed heuristicalgorithm increases the global network resource utilization.