Fast data transmission and maximal dynamic flow.

DOI10.1016/S0020-0190(98)00047-7MaRDI QIDQ2583548zbMATH OpenOpenAlexFDO

Authors Guoliang Xue, Shangzhi Sun, J. B. Rosen

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00047-7

zbMATH Keywords

AlgorithmsShortest pathsCommunication networksMaximal dynamic flowsMinimum transmission timeQuickest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Network design and communication in computer systems (68M10)

Recommendations

• Transmissions in a network with capacities and delays
• On the computation of fast data transmissions in networks with capacities and delays
• The quickest flow problem
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• The multichannel quickest-path problem

Cites work

• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the enumeration of quickest paths
• An algorithm for finding the \(k\) quickest paths in a network
• Distributed algorithms for the quickest path problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the \(k\) quickest simple paths in a network
• On the computation of fast data transmissions in networks with capacities and delays
• On the quickest path problem
• The all-pairs quickest path problem
• The quickest path problem

Cited in

(11)

• An optimal file transfer on a directed path network with step arc costs
• Terminal pair maximal flow finding using DNA computation
• Maximum flow under proportional delay constraint
• Computing the throughput of a network with dedicated lines
• On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints
• Maximum flow in buffer-limited delay tolerant networks. The static approach
• On the computation of fast data transmissions in networks with capacities and delays
• A label-setting algorithm for finding a quickest path
• The quickest flow problem
• FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
• Fast and fine quickest path algorithm

This page was built for publication: Fast data transmission and maximal dynamic flow.

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