Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Modelling extremal events: for insurance and finance
Modelling extremal events: for insurance and finance
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
A Probabilistic Scheme for Hierarchical QoS Routing
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Back to the future part 4: the internet
ACM SIGCOMM Computer Communication Review
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
Measurement and analysis of single-hop delay on an IP backbone network
IEEE Journal on Selected Areas in Communications
Advertising interdomain QoS routing information
IEEE Journal on Selected Areas in Communications
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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.