Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint
From MaRDI portal
Publication:4960684
DOI10.1080/00949655.2018.1458309OpenAlexW2797200381WikidataQ129989452 ScholiaQ129989452MaRDI QIDQ4960684
Yi-Kuei Lin, Chih-Li Pan, Louis Cheng-Lu Yeng
Publication date: 23 April 2020
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2018.1458309
network reliabilitypacket error rate (PER)multipath transmission control protocol (MPTCP)data latencymulti-state retransmission flow network (MSRFN)packets retransmission
Cites Work
- The quickest path problem
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- Minimum time paths in a network with mixed time constraints.
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- A label-setting algorithm for finding a quickest path
- Evaluating cost and reliability integrated performance of stochastic logistics systems
- Statistical estimation of internal available bandwidth
- Reliability Evaluation of Multistate Systems with Multistate Components
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
This page was built for publication: Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint