Bicriteria shortest path in networks of queues

DOI10.1016/J.AMC.2006.04.004MaRDI QIDQ861124zbMATH OpenOpenAlexFDO

Authors Amir Azaron

Publication date 9 January 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.04.004

zbMATH Keywords

queueing networksstochastic routing problems

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Review text

The paper develops a polynomial algorithm to find the shortest path from the source to the sink node of a network of queues in the steady state. It is assumed that some nodes of the network contain service stations including either one or infinite servers with general distribution of service time. The arc lengths among the service stations are assumed to be independent random variables with general distribution functions. It is also proved that the defined utility function satisfies the monotonicity assumption.

Recommendations

• Distribution function of the shortest path in networks of queues
• An algorithm for the quickest path problem
• Shortest paths in networks with exponentially distributed arc lengths
• scientific article; zbMATH DE number 4053318
• An Appraisal of Some Shortest-Path Algorithms

Cites work

• A multi-objective resource allocation problem in dynamic PERT networks
• Bicriteria network flow problems: Continuous case
• Distribution function of the shortest path in networks of queues
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Generalized dynamic programming for multicriteria optimization
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 4076264 (Why is no real title available?)
• scientific article; zbMATH DE number 3769296 (Why is no real title available?)
• Multiobjective routing of hazardous materials in stochastic networks
• On a multicriteria shortest path problem

Cited in

(4)

• Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length
• scientific article; zbMATH DE number 1936537 (Why is no real title available?)
• A new probabilistic approach to the path criticality in stochastic PERT
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

This page was built for publication: Bicriteria shortest path in networks of queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861124)