The complexity of probabilistic verification
Journal of the ACM (JACM)
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Approximate Verification of Probabilistic Systems
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Distribution, Approximation and Probabilistic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Telecommunication services will be in the future built upon peer-to-peer protocols. This implies the need to have strong guarantees of the dependability of those protocols. One building block for such protocols are distributed hash tables (DHT in short), and Pastry is a protocol implementing distributed hash tables. We have designed a probabilist model of Pastry that enabled us to simulate it. In particular, we have studied the performance of the protocol with respect to the number of nodes. We have used for this study probabilistic model checking tools used in the RNTL project Averros. This is a significant application of academic tools to industrial concerns.