The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Peer-to-peer systems based on Distributed Hash Tables face tradeoffs between the performance (latency or availability) and their desired functionality. In fact, lookup latency is affected by the mismatch problem between the overlay hop and the underlying topology. So, applications built on top of such systems can be impacted. A core problem in peer-to-peer systems is the distribution of items to be...
A fundamental problem in P2P systems is content-based full-text search. Traditional approaches have either been centralized or use flooding to ensure accuracy of the results returned. In this paper, we present the design of a distributed P2P system (S-Peer) that supports semantics-based content searches of relevant documents. S-Peer nodes with semantically similar content are grouped into one semantic...
Most current approaches have been explored to improve Chord lookup efficiency. However, the problem that confronts every node is to increase the routing table size to maintain too much state information of other nodes. In this paper, we propose a regional lookup algorithm based on super-node that routes data keys queries by region information and super-node. The lookup process can be easily implemented...
Recent research has explored that if network churn is not very high, maintaining global lookup table at every node is reasonable. This paper presents GRBM protocol for maintaining global lookup table. In GRBM, events are merged into notification message in the dispatcher node. Then notification messages are sent to all nodes using a novel event dissemination algorithm. It shows that GRBM is able to...
This paper proposes an efficient algorithm for P2P file sharing systems based on WiMAX mesh mode and Wi-Fi technologies. Wireless networks in our system are hierarchically divided into three layers: Wi-Fi based wireless local area networks under a subscriber station; the mesh network of subscriber stations under a base station; the network of base stations. File lookup procedure may go through three...
DHTs are efficient peer-to-peer systems which can locate objects within an bounded amount of overlay hops. Originally, those systems don't exploit network proximity in the underlying Internet and lead to high latency when searching a target. Recently, some approaches, such as random landmarking (RLM) and lookup-parasitic random sampling (LPRS), have been suggested to build topology-aware overlay to...
Distributed hash tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in order to keep little routing information and minimize maintenance traffic. In this paper, we introduce D1HT, a novel single hop DHT that is able to maximize performance with reasonable maintenance traffic overhead even for...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.