Terminal-pair reliability in ATM virtual path networks

DOI10.1016/S0898-1221(00)00204-2MaRDI QIDQ1591928zbMATHOpenAlexFDO

Authors R. Smith

Publication date 14 January 2001

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(00)00204-2

zbMATH Keywords

asynchronous transfer modevirtual pathcut-based partitionpath-based partitionterminal-pair reliabilitypath-based and cut-based partition

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Fault-tolerant virtual path layout in ATM networks
• Virtual Path Layouts in ATM Networks
• Virtual path design in service-specific ATM networks
• Virtual connections and a traffic optimization model for an ATM network
• Integrating reliability and quality of service in networks with switched virtual circuits
• A network reduction axiom for efficient computation of terminal-pair reliability

Cites work

• A note on two problems in connexion with graphs
• Computational Complexity of Network Reliability Analysis: An Overview
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• Parallel algorithms for terminal-pair reliability
• Reliability of directed networks using the factoring theorem

Cited in

(1)

• A network reduction axiom for efficient computation of terminal-pair reliability

This page was built for publication: Terminal-pair reliability in ATM virtual path networks

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