Paper Info
Title
Quality-of-service provisioning via stochastic path selection under Weibullian link delays.
Abstract
We study the problem of finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay. The link metrics are defined as random variables following Weibull probability distributions as empirically reported in [13] and analytically derived in [12]. The problem of finding the most likely path is NP-Hard [24]. Our approach involves reducing the complicated probability convolutions necessary to calculate the most probable path that satisfies a requested delay value. With the reduction of the objective function, an extended Bellman-Ford algorithm is devised to solve the problem. The resulting approach have the same complexity as the standard Bellman-Ford algorithm. Our reduced objective function only needs the location parameter of the Weibull distributions, hence avoiding the complexity of inferring the shape and scale parameters. We evaluate the performance of our approach by simulations and conclude with possible extensions of our work.
Year
DOI
Venue
2007
10.1145/1577222.1577238
QSHINE
Keywords
Field
DocType
stochastic path selection,delay,networks,likely path,weibull probability distribution,extended bellman-ford algorithm,qos routing,objective function,probable path,weibullian link delay,inaccuracy,requested additive,resulting approach,weibull,complicated probability,routing,reduced objective function,weibull distribution,network routing,random variable,quality of service,satisfiability,probability distribution
Location parameter,Random variable,Mathematical optimization,Computer science,Convolution,Quality of service provisioning,Weibull distribution,Quality of service,Probability distribution
Conference
Citations 
PageRank 
References 
0
0.34
23
Authors
4
Name
Order
Citations
PageRank
Suleyman Uludag130217.13
Ljubomir Perković21008.74
Anna Kashkanova300.34
Kemal Akkaya42825178.70