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.
We analyze the performance of a DHT-based P2P overlay network in resource access and overlay maintenance activities. We use a cross-platform implementation of the protocol called P2PP. Mobile systems are the main target platform of our protocol implementation; due to practical reasons, we conduct large-scale evaluations using a server array. The performance metric is the request accomplishment success...
One-hop algorithms have been proposed to solve the problem of fast queries in structured Peer-to-Peer (P2P) system. The core concept for one-hop algorithms is to maintain a huge routing table, but most of them so far have opted to deal with routing table maintenance with a fixed consuming for peers, in order to keep minimal maintenance traffic at the cost of operating performance. In this paper we...
We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to over-come their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow...
In a structured peer-to-peer (p2p) network, key based routing algorithms are used for searching and locating resources in the network. For dynamic and scalable behavior these algorithms suffer from high overhead to maintain large state information of nodes and to keep them up-to-date. To deal with this problem, a Sub-ring Based Chord model and a lookup algorithm are proposed. The lookup process keeps...
Routing is essential in P2P applications. Chord is a kind of structured P2P network, but its routing table can only cover half of the Chord ring. As long as target node is in the half ring which is not covered by the routing table, the target node must be found via not less than one medium node, namely, two hops. So, Chord is not very efficient. Therefore, a two-layer routing model for Chord(T-Chord)...
In peer-to-peer (P2P) networks, how to effective locate data on distributed hash tables is challenging and has attracted much research attention in recent years. Two measurements are usually considered when discussing the effective location of data items: the path length (the hop count for resolving a lookup request on the overlay network) and the latency (the actual time period between the issuing...
Most Distributed Hash Tables (DHTs) inherently assume interconnecting nodes with homogeneous capabilities. Realistically however, capabilities of nodes on a network widely vary, leading traditional DHTs to inevitably exhibit poor performance in real-world environments. Stealth DHT was previously proposed to address node heterogeneity by enabling a DHT to separate highly capable (super-peers or service)...
For the problems of complex queries, load balance and routing efficiency in structured P2P networks based on DHT, a protocol is presented for text retrieval on the basis of Kleinberg small world model. In this protocol, nodes are clustered to support complex query according to the similarity of nodes, and the grouped nodes could adjust their size to balance the load of networks. Routing path length...
As resource management becomes a hot research in P2P area, a fundamental problem is to efficiently locate the node that stores a particular data item. Most existing P2P system support only title-based and are limited in functionality when compared to today's search engines. In this paper, we present the design of a distributed P2P resource management system that supports semantic-based content searches...
In this paper, we provide an analytical model for the structured P2P overlay based on Chord DHT used for lookup service in session based applications like IP telephony systems. Our model captures the performance behavior of such overlays including the mean session set-up delay of a call as well as the system capacity. These parameters reflect how good the overlay as a lookup service is performing...
Distributed Hash Tables (DHTs) organize the peer-to-peer network in a structured manner and provide a simple lookup interface which is similar to a hash table. In this paper, we present a new DHT protocol, Tambour, which bounds its communication overhead automatically and controls the lookup latency with high probability across a wide range of operating scenarios. Unlike many popular DHTs which employ...
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...
Though widely accepted as a key building block for next-generation large scale decentralized systems, the lack of flexibility of DHTs on efficient non identifier-based lookups is a well-known problem. In this paper, a resource discovery service that tackles the issues identified in a decentralized and distributed DHT-based caching architecture for media content distribution is presented. In the proposed...
Peer-to-Peer overlays have become a popular paradigm for building distributed systems, aiming to provide resource localization and sharing in large-scale networks. To design an overlay network, the first step is to choose an overlay topology connecting all the overlay nodes. Many proposed distributed hash table schemes for peer-to-peer network are based on some traditional calculated interconnection...
One of the most critical operations performed in a P2P system is the lookup of a resource. The main issues to be addressed by lookup algorithms are: (1) support for flexible search criteria (e.g., wildcard or multi-keyword searches), (2) effectiveness - i.e., ability to identify all the resources that match the search criteria, (3) efficiency - i.e. low overhead, (4) robustness with respect to node...
In this paper, we present a novel file searching protocol to structure a DHT ring consisting of only ultrapeers, not all the nodes. The DHT ring in this protocol is much less sensitive to the churn rate because ultrapeers have much longer uptime compared with leaf nodes. Thus, this feature makes the protocol more scalable and efficient than the previous DHT ones in terms of costs of file search, node...
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...
This paper addresses two research challenges of P2PSIP: i) call setup latency ii) decentralized bootstrapping. To optimize the call setup latency of P2PSIP, we design an O(1) lookup protocol which completes the overlay routing within 3 hops most time. We also leverage the routing table of O(l) DHT to achieve decentralized bootstrapping. Experimental results indicate that 90% of bootstrapping latency...
In peer-to-peer (P2P) networks, how to efficiently locate data on distributed hash tables (DHTs) is challenging and has attracted much research attention in recent years. Two measurements are usually considered when discussing the efficient location of data items: the path length (the hop count for resolving a lookup request on the overlay network)and the latency (the actual time period between the...
The Chord protocol is the best known example of implementation of logarithmic complexity routing for structured peer-to-peer networks. Its routing algorithm, however, does not provide an optimal trade-off between the size of the finger table and the average number of hops to reach destination. Lately, a base-k chord appeared based on the original Chord, the routing perfomence of this system improved...
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.