Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
  • First Online:
Web Engineering and Peer-to-Peer Computing (NETWORKING 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2376))

Included in the following conference series:

  • 484 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. 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

    Article  Google Scholar 

  3. Crespo, A. Garcia-Molina, H.: Routing Indices For Peer-to-Peer Systems, to be published in proceedings of ICDCS, (2002).

    Google Scholar 

  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. Deutsch, P., Schoultz, R., Faltstrom, P., Weider, C.: Architecture of the WHOIS++ service. RFC 1835, (1995) http://www.ietf.org/rfc/rfc1835.txt

  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. Freenet http://www.freenetproject.org

  8. Gnutella http://gnutella.wego.com

  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. 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. Napster http://www.napster.com

  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. 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. 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. Rohrs, C.: Query Routing for the Gnutella Network (2002). http://www.limewire.com/developer/query_routing/keyword%20routing.htm

  16. Salton, G., and Yang, C. On the specification of term values in automatic indexing. Journal of Documentation 29 (1973) 351–372.

    Article  Google Scholar 

  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. 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. 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. 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. Watts, D., Strogatz, S.: Collective dynamics of’ small-world’ networks, Nature 393, (1998) 440–442.

    Article  Google Scholar 

  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. Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-Peer Networks, to be published in ICDCS, (2002).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Strategic Software Division, University of Tokyo, Tokyo, Japan

    Sam Joseph

Authors
  1. Sam Joseph
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Istituto IIT, Consiglio Nazionale delle Ricerche, Via G. Moruzzi, 1, 56124, Pisa, Italy

    Enrico Gregori

  2. Hewlett-Packard Laboratories, 1501 Page Mill Road MS 3U-6, 94303-1126, Palo Alto, CA, USA

    Ludmila Cherkasova

  3. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Via Ponzio 34/5, 20133, Milano, Italy

    Gianpaolo Cugola

  4. University of Bologna, Via Mura Zamboni 7, 40127, Bologna, Italy

    Fabio Panzieri

  5. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32, 20133, Milano, Italy

    Gian Pietro Picco

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joseph, S. (2002). NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks. In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds) Web Engineering and Peer-to-Peer Computing. NETWORKING 2002. Lecture Notes in Computer Science, vol 2376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45745-3_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45745-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44177-9

  • Online ISBN: 978-3-540-45745-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation