skip to main content
10.1145/1169067.1169069acmconferencesArticle/Chapter ViewAbstractPublication PagesadpucConference Proceedingsconference-collections
Article

MAPS: approximate publish/subscribe functionality in peer-to-peer networks

Authors Info & Claims
Published:27 November 2006Publication History

ABSTRACT

Information filtering has been a research issue for years. In an information filtering scenario users information needs are expressed by user subscriptions, and users are notified about published documents or events that match these interests. The combination of the publish/subscribe scenario with the peer-to-peer (P2P) approach of autonomous peers makes high demands on the scalability and the efficiency of such a given highly distributed network. However, in many cases a subscriber is not interested in all the events that match his profile, but rather in a small representative set. In this paper, we present our approach of an approximate publish/subscribe system, that relaxes the assumption for receiving notifications from every information producer in the network. Our work builds upon distributed hash table technology to create and maintain a distributed global directory that contains information about peers' publishing behavior and combines the current peer state and the prediction of the future publishing behavior of a peer to store a subscription only to the most promising peers in the network. Our experimental evaluation shows that approximate information filtering results satisfying recall level and is able to accommodate changes in peer publishing behaviour.

References

  1. I. Aekaterinidis and P. Triantafillou. Internet scale string attribute publish/subscribe data networks. In CIKM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. Improving collection selection with overlap-awareness. In SIGIR, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. P2p content search: Give the web back to the people. In IPTPS), 2006.Google ScholarGoogle Scholar
  4. M. Bender, S. Michel, G. Weikum, and C. Zimmer. The minerva project: Database selection in the context of p2p search. In BTW, 2005.Google ScholarGoogle Scholar
  5. J. Callan. Distributed information retrieval., 2000.Google ScholarGoogle Scholar
  6. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. TOCS, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Chatfield. The Analysis of Time Series - An Introduction. CRC Press, 2004.Google ScholarGoogle Scholar
  8. G. M. D. Corso, A. Gulli, and F. Romani. Ranking a stream of news. In WWW, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J.-P. Dittrich, P. M. Fischer, and D. Kossmann. Agile: Adaptive indexing for context-aware information filters. In SIGMOD, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. N. Fuhr. A decision-theoretic approach to database selection in networked ir. TOCS, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. L. Gravano, H. Garcia-Molina, and A. Tomasic. Gloss: Text-source discovery over the internet. TODS, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Nottelmann and N. Fuhr. Evaluating different methods of estimating retrieval quality for resource selection. In SIGIR, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. I. T. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel. Scribe: The design of a large-scale event notification infrastructure. In NGC, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. L. Si, R. Jin, J. P. Callan, and P. Ogilvie. A language modeling framework for resource selection and results merging. In CIKM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. Tang and Z. Xu. pfilter: Global information filtering and dissemination using structured overlay networks. In FTDCS, 2003.Google ScholarGoogle Scholar
  19. C. Tryfonopoulos, S. Idreos, and M. Koubarakis. Publish/subscribe functionality in ir environments using structured overlay networks. In SIGIR, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. Tryfonopoulos, M. Koubarakis, and Y. Drougas. Filtering algorithms for information retrieval models with named attributes and proximity operators. In SIGIR, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. J. Xu and W. B. Croft. Cluster-based language models for distributed retrieval. In SIGIR, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. B. Yang and G. Jeh. Retroactive answering of search queries. In WWW, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. MAPS: approximate publish/subscribe functionality in peer-to-peer networks

        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
          ADPUC '06: Proceedings of the 1st international workshop on Advanced data processing in ubiquitous computing (ADPUC 2006)
          November 2006
          38 pages
          ISBN:1595934227
          DOI:10.1145/1169067

          Copyright © 2006 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: 27 November 2006

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          ADPUC '06 Paper Acceptance Rate6of6submissions,100%Overall Acceptance Rate6of6submissions,100%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader