Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint
From MaRDI portal
(Redirected from Publication:4960684)
Recommendations
- scientific article; zbMATH DE number 1735793
- Reliability-constrained dimensioning of transmission resources in packet-switched networks
- Reliability evaluation of a multistate network subject to time constraint under routing policy
- scientific article; zbMATH DE number 7028869
- Reliability evaluation of a multicast over coded packet networks
- scientific article; zbMATH DE number 2080546
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
- scientific article; zbMATH DE number 2088388
- Reliability analysis of a data transmission model for multicast
Cites work
- A label-setting algorithm for finding a quickest path
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- An algorithm for finding the \(k\) quickest paths in a network
- An algorithm for the quickest path problem
- Evaluating cost and reliability integrated performance of stochastic logistics systems
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Finding the \(k\) quickest simple paths in a network
- Minimum time paths in a network with mixed time constraints.
- On the quickest path problem
- Reliability Evaluation of Multistate Systems with Multistate Components
- Statistical estimation of internal available bandwidth
- The quickest path problem
This page was built for publication: Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960684)