skip to main content
10.1145/952532.952608acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

PeerSpaces: data-driven coordination in peer-to-peer networks

Authors Info & Claims
Published:09 March 2003Publication History

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.

References

  1. 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 ScholarGoogle Scholar
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80--112, 1985.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Project JXTA. http://www.jxta.org.]]Google ScholarGoogle Scholar
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Kan. Gnutella. In A. Oram, editor, Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology, chapter 8. O'Reilly, Mar. 2001.]]Google ScholarGoogle Scholar
  8. 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 ScholarGoogle Scholar
  9. Project LighTS. http://lights.sourceforge.net/docs/info/intro.html.]]Google ScholarGoogle Scholar
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Rowstron. WCL: A web co-ordination language. World Wide Web Journal, 1(3):167--179, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle Scholar
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Waldo et al. Javaspace specification - 1.0. Technical report, Sun Microsystems, March 1998.]]Google ScholarGoogle Scholar
  17. P. Wyckoff, S. McLaughry, T. Lehman, and D. Ford. T spaces. IBM Systems Journal, 37(3):454--474, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SAC '03: Proceedings of the 2003 ACM symposium on Applied computing
    March 2003
    1268 pages
    ISBN:1581136242
    DOI:10.1145/952532

    Copyright © 2003 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 9 March 2003

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader