Verifying a structured peer-to-peer overlay network: the static case

Authors:
Johannes Borgström;Uwe Nestmann;Luc Onana;Dilian Gurov
Affiliations:
School of Computer and Communication Sciences, EPFL, Switzerland;School of Computer and Communication Sciences, EPFL, Switzerland;Department of Microelectronics and Information Technology, KTH, Sweden;Department of Microelectronics and Information Technology, KTH, Sweden
Venue:
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Year:
2004

Citing 7
Cited 5

A calculus for cryptographic protocols

Information and Computation
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Operating Systems: The Logical Design

Distributed Operating Systems: The Logical Design
Communication and Concurrency

Communication and Concurrency
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
DKS (N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid

Verification of Peer-to-peer Algorithms: A Case Study

Electronic Notes in Theoretical Computer Science (ENTCS)
Depletable channels: dynamics and behaviour

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Verifying security property of peer-to-peer systems using CSP

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Towards verification of the pastry protocol using TLA+

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
A mechanized model for CAN protocols

FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structured peer-to-peer overlay networks are a class of algorithms that provide e.cient message routing for distributed applications using a sparsely connected communication network. In this paper, we formally verify a typical application running on a .xed set of nodes. This work is the foundation for studies of a more dynamic system. We identify a value and expression language for a value-passing CCS that allows us to formally model a distributed hash table implemented over a static DKS overlay network. We then provide a speci.cation of the lookup operation in the same language, allowing us to formally verify the correctness of the system in terms of observational equivalence between implementation and speci.cation. For the proof, we employ an abstract notation for reachable states that allows us to work conveniently up to structural congruence, thus drastically reducing the number and shape of states to consider. The structure and techniques of the correctness proof are reusable for other overlay networks.