Structured P2P systems are equipped with a distributed indexing service which is based on hashing, and is known as Distributed Hash Table (DHT). Peers and files are mapped usually using the same hash function to a key space. Peers and file indices are organized in a rigid structured according to their keys, which facilitates the location of files. Most structured P2P systems support naturally exact match queries in O(logN) hops, where N is the size of the key space. However they do not support directly keyword searches which constitute the core of queries in real P2P systems. The number of different structures that can be employed has enabled the development of a number of structured systems. However, only one of them has achieved global-scale deployment. In what follows we review some of the most popular structured P2P systems.
Top of the page
Print this page | Add this page to your favorites
Copyright © 2005 VTT