Advertisement

NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks

  • Sam Joseph
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2376)

Abstract

NeuroGrid is an adaptive decentralized search system. NeuroGrid nodes support distributed search through semantic routing (forwarding of queries based on content), and a learning mechanism that dynamically adjusts meta-data describing the contents of nodes and the files that make up those contents. NeuroGrid is an open-source project, and prototype software has been made available at http://www.neurogrid.net/ NeuroGrid presents users with an alternative to hierarchical, folder-based file organization, and in the process offers an alternative approach to distributed search.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babaoglu, O., Meling, H. and Montresor, A.: Anthill: a Framework for the Development of Agent-Based Peer-to-Peer Systems. Technical Report UBLCS-2001-09 November (2001).Google Scholar
  2. 2.
    Bowman, C.M., Danzig, P.B., Hardy, D.R., Manber, U., Schwartz, M.F.: The Harvest Information Discovery and Access System. Computer Networks and ISDN Systems 28 (1995) 119–125. http://citeseer.nj.nec.com/bowman95harvest.html CrossRefGoogle Scholar
  3. 3.
    Crespo, A. Garcia-Molina, H.: Routing Indices For Peer-to-Peer Systems, to be published in proceedings of ICDCS, (2002).Google Scholar
  4. 4.
    Cuenca-Acuna, F.M., Peery, C., Martin R.P. and Nguyen, T.D.: PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities. International Workshop on Peer-to-Peer Computing, Pisa (2002).Google Scholar
  5. 5.
    Deutsch, P., Schoultz, R., Faltstrom, P., Weider, C.: Architecture of the WHOIS++ service. RFC 1835, (1995) http://www.ietf.org/rfc/rfc1835.txt
  6. 6.
    Druschel, P., Rowstron, A.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (2001).Google Scholar
  7. 7.
  8. 8.
  9. 9.
    Joseph, S.R.H., Kawamura, T.: Why Autonomy makes the Agent. In “Agent Engineering” Eds. Liu, J. Zhong, et al. World Scientific Publishing (2001) 7–28.Google Scholar
  10. 10.
    Kronfol, A.Z.: FASD: A fault-tolerant, Adaptive Scalable, Distributed Search Engine. Princeton University Technical Report. (2002). http://www.cs.princeton.edu/~akronfol/fasd/
  11. 11.
  12. 12.
    Nejdl, W., Wolf, B., Qu, C., Decker, S., Sintek, M., Naeve, A., Nilsson, M., Palmer, M. and Risch, T.: Edutella: A P2P Networking Infrastructure Based on RDF (2001) http://edutella.jxta.org/
  13. 13.
    Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of ACM SPAA. ACM, June (1997).Google Scholar
  14. 14.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. Proc. ACM SIGCOMM (2001). http://www.acm.org/sigcomm/sigcomm2001/p13.html
  15. 15.
    Rohrs, C.: Query Routing for the Gnutella Network (2002). http://www.limewire.com/developer/query_routing/keyword%20routing.htm
  16. 16.
    Salton, G., and Yang, C. On the specification of term values in automatic indexing. Journal of Documentation 29 (1973) 351–372.CrossRefGoogle Scholar
  17. 17.
    Sheldon, M.A., Duda, A., Weiss, R., Gifford, D.K.: Discover: A Resource Discovery System based on Content Routing. Proc. 3rd International World Wide Web Conference Elsevier, North Holland Computer Networks and ISDN Systems, (1995). http://www.psrg.lcs.mit.edu/publications/Papers/wwwabs.htm
  18. 18.
    Sripanidkulchai, K.: The popularity of Gnutella queries and its implications on scalability, (2001). http://www-2.cs.cmu.edu/~kunwadee/research/p2p/paper.html
  19. 19.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. Proceedings of the ACM SIGCOMM’ 01 Conference (2001). http://www.acm.org/sigcomm/sigcomm2001/p12.html
  20. 20.
    Sugiura, A., Etzioni, O.: Query Routing for Web Search Engines: Architecture and Experiments. Proc. 9th International World-Wide Web Conference. Foretec Seminars, Inc., (2000). http://www.cs.washington.edu/homes/etzioni/papers/www9-final.pdf
  21. 21.
    Watts, D., Strogatz, S.: Collective dynamics of’ small-world’ networks, Nature 393, (1998) 440–442.CrossRefGoogle Scholar
  22. 22..
    Xie, Y., O’Hallaron, D.: Locality in Search Engine Queries and Its Implications for Caching. Infocom (2002). http://www-2.cs.cmu.edu/~ylxie/papers/infocom02.ps
  23. 23.
    Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-Peer Networks, to be published in ICDCS, (2002).Google Scholar
  24. 24.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical ReportCSD-01-1141, U.C. Berkeley, (2001).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Sam Joseph
    • 1
  1. 1.Strategic Software DivisionUniversity of TokyoTokyoJapan

Personalised recommendations