MC-based algorithm for a telecommunication network under node and budget constraints

DOI10.1016/J.AMC.2007.02.133zbMath1143.94030OpenAlexW2032015072MaRDI QIDQ2383899

Yi-Kuei Lin

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.133

zbMATH Keywords

performance evaluationbudget constraintmulticommodityminimal cuts, unreliable nodes, telecommunication network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints

Cites Work

• Unnamed Item
• Two-commodity reliability evaluation for a stochastic-flow network with node failure
• A Simple Method for Reliability Evaluation of a Communication System
• 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
• Multistate reliability models
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure

This page was built for publication: MC-based algorithm for a telecommunication network under node and budget constraints