Skip to main content

Plexus: Routing and Indexing

  • Chapter
  • First Online:
Collaborative Web Hosting

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 967 Accesses

Abstract

A scalable and distributed indexing mechanism is essential for any P2P web hosting solution. We also need to search indexed information in a bandwidth efficient manner. Search and indexing is essential for a number of reasons. First, we need to maintain information about each peer in the system, e.g., their name and IP address binding, availability information, last seen time etc. Second, we need to keep track of the Web contents hosted in different peers. Third, we need to keep track of the relative importance or popularity of the available contents for ranking them in the search results. We have previously developed a distributed search technique named Plexus [1] that supports bandwidth efficient search and approximate matching. Plexus has been intensively used for pWeb deployment. In this section, we present the basic protocols in Plexus. We also outline a few enhancements to the basic Plexus protocol to support the above mentioned requirements.

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

Access this chapter

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 EPUB and 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

References

  1. R. Ahmed and R. Boutaba. Plexus: A scalable peer-to-peer protocol enabling efficient subset search. IEEE/ACM Transactions on Networking, 17(1):130–143, February 2009.

    Article  Google Scholar 

  2. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of ACM, 13(7):422–426, 1970.

    Article  MATH  Google Scholar 

  3. G. Cohen. Covering codes, volume 54. North Holland, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 The Author(s)

About this chapter

Cite this chapter

Ahmed, R., Boutaba, R. (2014). Plexus: Routing and Indexing. In: Collaborative Web Hosting. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-03807-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03807-0_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03806-3

  • Online ISBN: 978-3-319-03807-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics