A laplace transform-based method to stochastic path finding

Authors:
Suleyman Uludag;Ziyneti E. Uludag;Klara Nahrstedt;King-Shan Lui;Fred Baker
Affiliations:
Department of CSEP, University of Michigan, Flint;Department of CSEP, University of Michigan, Flint;Department of Computer Science, University of Illinois at Urbana-Champaign;Department of EEE, University of Hong Kong;Cisco Systems, Inc.
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 13
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
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)
Numerical Methods for Engineers: With Programming and Software Applications

Numerical Methods for Engineers: With Programming and Software Applications
Maple Computer Manual for Advanced Engineering Mathematics

Maple Computer Manual for Advanced Engineering Mathematics
Introduction to Algorithms

Introduction to Algorithms
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Probabilistic Scheme for Hierarchical QoS Routing

ICON '01 Proceedings of the 9th IEEE International Conference on Networks
Bandwidth-delay constrained path selection under inaccurate state information

IEEE/ACM Transactions on Networking (TON)
Approximation and Heuristic Algorithms for Delay Constrained Path Selection under Inaccurate State Information

QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [1]. We 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 our knowledge, ours is the first to propose a transform-based approach for the QoS routing problem of finding the most likely path. Simulations show that our stochastic approach (1) Selects correct paths more frequently, (2) Incurs less overhead with respect to the dissemination and processing of state information, and (3) Reduces the churn by selecting more stable paths.