Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults

DOI10.1007/978-3-662-54580-5_10zbMath1452.68021arXiv1701.03519OpenAlexW2571858767MaRDI QIDQ3303928

Guillermo Rodriguez-Navas, Shubham Goel, Guy Avni, Thomas A. Henzinger

Publication date: 5 August 2020

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.03519

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles

Uses Software

• NetworkX
• PRISM
• Uppaal
• z3
• SciPy
• PVeStA
• sharpSAT
• PLASMA
• FatTire

Cites Work

• Random generation of combinatorial structures from a uniform distribution
• Uppaal in a nutshell
• A Platform for High Performance Statistical Model Checking – PLASMA
• Stochastization of Weighted Automata
• On the Resiliency of Randomized Routing Against Multiple Edge Failures
• Competitive Packet Routing with Priority Lists
• Approximate Counting in SMT and Value Estimation for Probabilistic Programs
• Simulation and the Monte Carlo Method

This page was built for publication: Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults