Distributed algorithms for the quickest path problem

DOI10.1016/0167-8191(92)90048-CzbMath0754.68057OpenAlexW2039773416MaRDI QIDQ1195152

Gen-Huey Chen, Yung-Chen Hung

Publication date: 8 November 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90048-c

zbMATH Keywords

quickest path problemasynchronous networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (26)

Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Unnamed Item ⋮ The quickest path problem with batch constraints. ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Inverse quickest center location problem on a tree ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ The quickest path problem with interval lead times ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ Reliability based assignment in stochastic-flow freight network ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ Fast data transmission and maximal dynamic flow. ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Algorithms for the constrained quickest path problem and the enumeration of quickest paths ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets ⋮ Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network

This page was built for publication: Distributed algorithms for the quickest path problem