Availability-based path selection and network vulnerability assessment

DOI10.1002/NET.21652MaRDI QIDQ4642430zbMATH OpenOpenAlexFDO

Authors Song Yang, Stojan Trajanovski, Fernando A. Kuipers

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL http://resolver.tudelft.nl/uuid:57b20a8a-746e-4bfb-a832-73a7cf599f11

zbMATH Keywords

availabilityheuristicinteger nonlinear programmultilayer networks min-cut link-disjoint pathsreliabilityroutingshared-risk link group networkssurvivability

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Integer programming (90C10) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions
• Optimal routing with failure-independent path protection
• Reliability evaluation of large telecommunication networks
• Optimization algorithms for resilient path selection in networks
• scientific article; zbMATH DE number 795224

Cited in

(1)

• A new linear path pair availability constraint for network design

This page was built for publication: Availability-based path selection and network vulnerability assessment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642430)