ABSTRACT
Shared dataspaces à la Linda, and the underlying data-driven coordination model, have been successfully exploited in the development of a huge variety of applications, going from parallel computing to web-based collaborative work. In this paper we consider a novel class of applications, namely those developed for peer-to-peer networks à la Gnutella or FreeNet. We discuss the problems which arise when trying to exploit the original Linda coordination model in this new scenario. In order to address these problems, we introduce PeerSpaces, a new coordination model particularly suited for the realm of peer-to-peer network applications, and we present a prototypical implementation of this coordination model based on the JXTA peer-to-peer technology.
- D. Anderson. SETI@home. In A. Oram, editor, Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology, chapter 5. O'Reilly, Mar. 2001.]]Google Scholar
- N. Busi and G. Zavattaro. Some Thoughts on Transiently Shared Dataspaces. In Proc. on the Workshop on Software Engineering and Mobility (at ICSE 2001), 2001.]] Google ScholarDigital Library
- N. Busi, P. Ciancarini, R. Gorrieri, and G. Zavattaro. Models for Coordinating Agents: a Guided Tour. In Coordination for Internet Agents: Models, Technologies, and Applications, pages 6--24, Springer-Verlag, 2001.]] Google ScholarDigital Library
- D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80--112, 1985.]] Google ScholarDigital Library
- Project JXTA. http://www.jxta.org.]]Google Scholar
- J. Kubiatowicz et al. OceanStore: An Architecture for Global-Scale Persistent Storage. In 9th International Conference on Architectural support for Programming Languages and Operating Systems, Cambridge, MA, November 2000.]] Google ScholarDigital Library
- G. Kan. Gnutella. In A. Oram, editor, Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology, chapter 8. O'Reilly, Mar. 2001.]]Google Scholar
- A. Langley. Freenet. In A. Oram, editor, Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology, chapter 9. O'Reilly, Mar. 2001. March 2001.]]Google Scholar
- Project LighTS. http://lights.sourceforge.net/docs/info/intro.html.]]Google Scholar
- G. P. Picco, A. Murphy, and G. C. Roman. Lime: Linda Meets Mobility. In Proc. 21th IEEE Int. Conf. on Software Engineering (ICSE), pages 368--377, 1999.]] Google ScholarDigital Library
- A. Rowstron. WCL: A web co-ordination language. World Wide Web Journal, 1(3):167--179, 1998.]] Google ScholarDigital Library
- A. Rowstron and P. Druschel. Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility. In 18th Symposium on Operating Systems Principles, Canada, November 2001.]] Google ScholarDigital Library
- A. Rowstron and A. Wood. Solving the Linda multiple rd problem using the copy-collect primitive. Science of Computer Programming, 31(2--3):335--358, 1998.]] Google ScholarDigital Library
- C. Shirky. Listening to Napster. In A. Oram, editor, Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology, chapter 2. O'Reilly, Mar. 2001.]]Google Scholar
- M. T. Valente, B. Carbunar and J. Vitek. Lime Revisited. Reverse Engineering an Agent Communication Model. In Proc. of MA'01, Lectures Notes in Computer Science. Springer-Verlag, Berlin, 2001.]] Google ScholarDigital Library
- J. Waldo et al. Javaspace specification - 1.0. Technical report, Sun Microsystems, March 1998.]]Google Scholar
- P. Wyckoff, S. McLaughry, T. Lehman, and D. Ford. T spaces. IBM Systems Journal, 37(3):454--474, 1998.]] Google ScholarDigital Library
Recommendations
On the implementation of robust distributed peerspaces
PDT '11: Proceedings of the Workshop on Posters and Demos TrackWith respect to temporal and spatial coupling properties, coordination models based on the persistent tuple spaces can be easily integrated with peer-to-peer infrastructure for scalability and robustness. With a system that forms a persistent shared ...
An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing
Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected ...
Comments