1 / 18

Routing Indices For P-to-P Systems

Routing Indices For P-to-P Systems. ICDCS 2002. Introduction. Search in a P2P system Mechanisms without an index Mechanisms with specialized index nodes (centralized search) Mechanisms with indices at each node Structure P2P network Unstructure P2P network

emilia
Download Presentation

Routing Indices For P-to-P Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Routing Indices For P-to-P Systems ICDCS 2002

  2. Introduction • Search in a P2P system • Mechanisms without an index • Mechanisms with specialized index nodes (centralized search) • Mechanisms with indices at each node • Structure P2P network • Unstructure P2P network • Parallel v.s. sequentially search • Response time • Network traffic

  3. Routing indices(RI) • Query • Documents are on zero or more “topics”, and queries request documents on particular topics. • Documents topics are independent • Local index • RI • Each node has a local routing index which contains following information • The number of documents along each path • The number of documents on each topic of interest • Allow a node to select the “best” neighbors to send a query to

  4. The RI may be “coarser” than the local indices • overcounts • Undercounts

  5. Goodness measure • Number of results in a path • Using Routing indices

  6. Storage space • N: number of nodes in the P2P network • b: branching factor • c: number of categories • s: counter size in bytes Centralized index : s*( c+1) *N Distributed system: s*(c+1)*b (each node)

  7. Creating routing indices

  8. Maintaining Routing Indices • Trade off between RI freshness and update cost • No requiring the participation of a disconnecting node • Discussion • If the search topics is dependent? • Can the number of “hops” necessary to reach a document be estimated?

  9. Alternative Routing Indices • Hop-count RI • Aggregated RIs for each “hop” up to a maximum number of hops are stored

  10. Search cost • Number of messages • The goodness of a neighbor • The ratio between the number of documents available through that neighbor and the number of messages required to get those documents • Regular tree with fanout F • It takes Fh messages to find all documents at hop h • Storage cost?

  11. Exponentially aggregated RI • Store the result of applying the regular-tree cost formula to a hop-count RI • How to compute the goodness of a path for the query containing several topics?

  12. Cycles in the P2P network (HW)

  13. Similarity Discovery in structured P2P Overlays ICPP

  14. Introduction • Structured overlays • Only support search with a single keyword • Similarity between two documents • Keyword sets • Vector space • Measure • Problems • Search problem • New keyword?

  15. Meteorograph • Absolute angle

  16. Publishing and Searching • Publish • Hash • Publish the item to a node np with the hash key closest to hash value

  17. Search problem • Nearest answers • K_nearest answers • e • Partial • Comprehensive • Search strategy • Discussions • What happened when keyword vector is represented by q?

  18. Other issues • Load balance (HW) • Changes of vector space • Republished? • Comprehensive set of keywords

More Related