Network-Conscious π-calculus - A Model of Pastry

A peer-to-peer (p2p) system provides the networking substrate for the execution of distributed applications. It is made of peers that interact over an overlay network. Overlay networks are highly dynamic, as peers can join and leave at any time. Traditional process calculi, such as π-calculus, CCS and others, seem inadequate to capture these kinds of networks, their routing mechanisms, and to verify their properties. In order to model network architecture in a more explicit way, in Ugo Montanari and Matteo Sammartino. Network conscious π-calculus: A concurrent semantics. ENTCS, 286:291-306, 2012; Matteo Sammartino. A Network-Aware Process Calculus for Global Computing and its Categorical Framework. PhD thesis, University of Pisa, 2013. available at http://www.di.unipi.it/~sammarti/publications/thesis.pdf; Ugo Montanari and Matteo Sammartino. A network-conscious π-calculus and its coalgebraic semantics. Theor. Comput. Sci., 546:188-224, 2014] we have introduced the Network Conscious π-calculus (NCPi), an extension of the π-calculus with names representing network nodes and links. In Ugo Montanari and Matteo Sammartino. A network-conscious π-calculus and its coalgebraic semantics. Theor. Comput. Sci., 546:188-224, 2014] (a simpler version of) NCPi has been equipped with a coalgebraic operational models, along the lines of Fiore-Turi presheaf-based approach Marcelo P. Fiore and Daniele Turi. Semantics of name and value passing. In LICS 2001, pages 93-104. IEEE Computer Society, 2001], and with an equivalent History Dependent Automaton Ugo Montanari and Marco Pistore. Structured coalgebras and minimal hd-automata for the π-calculus. Theor. Comput. Sci., 340(3):539-576, 2005], i.e., an (often) finite-state automaton suitable for verification. In this paper we first give a brief account of these results. Then, our contribution is the sketch of a NCPi representation of the p2p architecture Pastry. In particular, we give models of its overlay network and of a Distributed Hash Table built on top of it, and we give evidence of their correctness by proving convergence of routing mechanisms.

[1]  Ugo Montanari,et al.  A network-conscious π-calculus and its coalgebraic semantics , 2014, Theor. Comput. Sci..

[2]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[3]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[4]  Edsko de Vries.  Reasoning about Explicit Resource Management ∗ ( Abstract ) , 2011 .

[5]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[6]  Matthew Hennessy,et al.  A Theory of System Behaviour in the Presence of Node and Link Failures , 2005, CONCUR.

[7]  Matthew Hennessy.  A calculus for costed computations , 2011, Log. Methods Comput. Sci..

[8]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, HLCL.

[9]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[10]  Matthew Hennessy,et al.  A theory of system behaviour in the presence of node and link failure , 2008, Inf. Comput..

[11]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  Marco Pistore,et al.  Structured coalgebras and minimal HD-automata for the pi-calculus , 2005, Theor. Comput. Sci..

[14]  Rocco De Nicola,et al.  Basic observables for a calculus for global computing , 2007, Inf. Comput..

[15]  Vincenzo Ciancia,et al.  Families of Symmetries as Efficient Models of Resource Binding , 2010, CMCS.

[16]  Matthew Hennessy,et al.  Counting the Cost in the Picalculus (Extended Abstract) , 2009, Electron. Notes Theor. Comput. Sci..

[17]  Rocco De Nicola,et al.  KLAIM: A Kernel Language for Agents Interaction and Mobility , 1998, IEEE Trans. Software Eng..

[18]  Emilio Tuosto,et al.  Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types , 2005, Theor. Comput. Sci..

[19]  Ugo Montanari,et al.  Network Conscious π-calculus: A Concurrent Semantics , 2012, MFPS.