On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths

Authors:
Arunabha Sen;K. Selçuk Candan;Afonso Ferreira;Bruno Beauquier;Stephane Perennes
Affiliations:
-;-;-;-;-
Venue:
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Year:
2000

Citing 6
Cited 1

Data networks

Data networks
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
A Distributed Algorithm for Delay-Constrained Unicast Routing

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Least-Cost High-Quality Object Retrieval for Distributed Multimedia Collaborations

ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Ultra low-power signal processing in wearable monitoring systems: A tiered screening architecture with optimal bit resolution

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a new class of shortest path problems, where the contribution of a link to the path length computation depends not only on the weight of that link but also on the weights of the links already traversed. This class of problems may be viewed as "non-Markovian". We consider a specific problem that belong to this class, which is encountered in the multimedia data transmission domain. We consider this problem under different conditions and develop algorithms. The shortest path problem in multimedia data transmission environment can be solved in O(n2) or O(n3) computational time.