Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
From MaRDI portal
Publication:506140
DOI10.1016/j.ins.2014.03.002zbMath1401.68015OpenAlexW2021150676MaRDI QIDQ506140
Publication date: 31 January 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.03.002
\(k\)-MPbackup reliabilityminimal capacity vector (MCV)multi-state unreliable vertex computer network (MUVCN)packet error rate (PER)
Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold, Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints, A quick inclusion-exclusion technique, Combinatorial analysis of the subsystem reliability of the split-star network
Cites Work
- Unnamed Item
- Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Time version of the shortest path problem in a stochastic-flow network
- Availability guarantee in survivable WDM mesh networks: a time perspective
- A fuzzy approach to hierarchical multiobjective programming problems and its application to an industrial pollution control problem
- Lower bounds on two-terminal network reliability
- Distributed algorithms for 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
- An algorithm for ranking quickest simple paths
- The all-pairs quickest path problem
- Reliability Evaluation of Multistate Systems with Multistate Components
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets