Mechanical Support for Efficient Dissemination on the CAN Overlay Network

The various algorithms underlying P2P systems are notoriously difficult to design and analyze. Coming up with new proven algorithms for such large scale systems is a challenging task. We report on the initial steps of an ongoing work that aims to devise an efficient correct-by-construction broadcast algorithm for the CAN structured overlay network. To rigorously reason about such an algorithm and prove correctness we rely on an interactive theorem prover : Isabelle/HOL. This paper presents a generic reasoning framework which should ease the promotion of formal correctness proofs of existing multicast algorithms and also facilitate the design of new ones.

[1]  Qiao Haiyan,et al.  Testing and Proving Distributed Algorithms in Constructive Type Theory , 2007, TAP.

[2]  Seif Haridi,et al.  Efficient Broadcast in Structured P2P Networks , 2003, IPTPS.

[3]  Juan Pedro Muñoz-Gea,et al.  Multicast Services over Structured P2P Networks , 2010 .

[4]  Stephan Merz,et al.  Model Checking the Pastry Routing Protocol , 2010 .

[5]  Tom Ridge,et al.  A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service , 2008, FM.

[6]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[7]  Edward A. Ashcroft,et al.  Proving Assertions about Parallel Programs , 1975, J. Comput. Syst. Sci..

[8]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Tom Ridge.  Verifying distributed systems: the operational approach , 2009, POPL '09.

[10]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[11]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[12]  Ching-Tsun Chou.  Mechanical Verification of Distributed Algorithms in Higher-Order Logic , 1995, Comput. J..

[13]  Dilian Gurov,et al.  Verification of Peer-to-peer Algorithms: A Case Study , 2007, CoOrg/MTCoord@COORDINATION.

[14]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[15]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[16]  Ali Ghodsi,et al.  Distributed k-ary System: Algorithms for Distributed Hash Tables , 2006 .

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

[18]  Mark Handley,et al.  Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

[19]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[20]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[21]  Tobias Nipkow,et al.  Isabelle/HOL , 2002, Lecture Notes in Computer Science.

[22]  Miguel Castro,et al.  Peer-to-peer overlays: structured, unstructured, or both? , 2004 .