Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold
From MaRDI portal
Publication:1671718
DOI10.1016/j.ins.2016.01.027zbMath1395.68032OpenAlexW2238033812MaRDI QIDQ1671718
Louis Cheng-Lu Yeng, Yi-Kuei Lin, Cheng-Fu Huang
Publication date: 7 September 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2016.01.027
routing schemetime thresholdnetwork reliabilitymultipath transmission control protocol (MPTCP)packet unreliabilityretransmission mechanism
Related Items (3)
System reliability analysis for a cloud-based network under edge server capacity and budget constraints ⋮ Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints ⋮ A quick inclusion-exclusion technique
Cites Work
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
- A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network
- The quickest path problem
- Lower bounds on two-terminal network reliability
- 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.
- A label-setting algorithm for finding a quickest path
- The all-pairs quickest path problem
- Reliability evaluation of a multistate network subject to time constraint under routing policy
This page was built for publication: Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold