Reliability evaluation of a limited-flow network in terms of minimal cutsets

From MaRDI portal
Revision as of 18:33, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4285196

DOI10.1109/24.257817zbMath0795.90028OpenAlexW2134858346MaRDI QIDQ4285196

Jsen-Shung Lin, John Yuan, Chin-Chia Jane

Publication date: 14 September 1994

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4c3bcd3f65312bc10a11c75a125de08f09e6087e




Related Items (55)

Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodesReliable and economic resource allocation in an unreliable flow networkESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGETMC-based algorithm for a telecommunication network under node and budget constraintsReliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rateA two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodityAn improved algorithm for reliability bounds of multistate networksTopology optimisation of repairable flow networks for a maximum average availabilitySystem capacity for a two-commodity multistate flow network with unreliable nodes and capacity weightSystem performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cutsA method to evaluate routing policy through \(p\) minimal paths for stochastic caseSystem reliability for quickest path problems under time threshold and budgetUnnamed ItemSearch for all \(d\)-mincuts of a limited-flow networkTwo-commodity reliability evaluation for a stochastic-flow network with node failureUsing minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budgetOverall-terminal reliability of a stochastic capacitated-flow network.On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraintEvaluation of network reliability for computer networks with multiple sourcesUsing minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case.Stochastic flow networks via multiple paths under time threshold and budget constraintAn algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cutsStochastic computer network under accuracy rate constraint from QoS viewpointBackup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer networkAlgorithms for an integer multicommodity network flow problem with node reliability considerationsDistribution and reliability evaluation of MAX-flow in dynamic multi-state flow networksTwo-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal pathsA novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow networkReliability evaluation of multi-state systems under cost considerationSpare routing problem with \(p\) minimal paths for time-based stochastic flow networksPerformance evaluation for a transportation system in stochastic caseOn transmission time through \(k\) minimal paths of a capacitated-flow networkReliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate ConstraintMultistate components assignment problem with optimal network reliability subject to assignment budgetA dynamic bounding algorithm for approximating multi-state two-terminal reliabilityUnreliability evaluation for a limited-flow network with failed nodes subject to the budget constraintResource allocation decisions under various demands and cost requirements in an unreliable flow networkOptimal resource assignment to maximize multistate network reliability for a computer networkA simple algorithm for reliability evaluation of a stochastic-flow network with node failureDecision diagram based symbolic algorithm for evaluating the reliability of a multistate flow networkA novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networksAn improved algorithm for finding all upper boundary points in a stochastic-flow networkSystem Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routingReliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networksTime version of the shortest path problem in a stochastic-flow networkSimulation research of space-time evolution of emergency logistics network reliability based on complex network theoryBackup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraintsAssessment of spare reliability for multi-state computer networks within tolerable packet unreliabilityReliability evaluation of a computer network in cloud computing environment subject to maintenance budgetMeasure the quality level for a supplier-demand system by a multicommodity stochastic-flow networkReliability evaluation of a multistate network subject to time constraint under routing policyDetermine the optimal carrier selection for a logistics network based on multi-commodity reliability criterionSpare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency ConsiderationsReliability evaluation and big data analytics architecture for a stochastic flow network with time attributeExtend the quickest path problem to the system reliability evaluation for a stochastic-flow network







This page was built for publication: Reliability evaluation of a limited-flow network in terms of minimal cutsets