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.
P2P networks constitute the foundation for many scalable and fault-tolerant applications. These networks may consist of millions of peers due to their decentralized design. While each peer advertises the same service interface, the actual data provided by common large-scale P2P applications often yields an imbalance, i.e., particular peer subsets are more frequently contacted than the rest of the...
The resource location of traditional structured P2P Networks is usually with high efficiency, but do not support the retrieval of semantic correlation. Therefore, this paper on the basis of studying structured P2P Networksdeeply, combines with the advantages of search-engine technology, then proposesa layered P2P network retrieval model of semantics based on VS-KAD protocol (KSL-P2P). This model uses...
Recent structured Peer-to-Peer (P2P) systems can't be simply applied to grid information services, because grid resources need to be registered and searched using multiple attributes. This paper proposes a multi-attribute addressable DHT (MAA-DHT) for grid information services. It uses hypercube as its logical graph and provides a new resource placement mechanism based on the values of all attributes,...
Decentralized Online Social Networks (OSNs) attempt to improve user privacy and security. One example is Vegas, a Peer-to-Peer (P2P) OSN which attempts to bring its users back into complete control of the data they share. Due to its decentralized characteristics, P2P OSNs cannot support social search functions in the same way users of centralized OSNs like Facebook are familiar with. Well-known and...
Peer-to-peer systems have recently achieved a remarkable success in the social, academic and commercial communities. In P2P systems, a very large number of autonomous computing peers pool together their resources and rely on each other for any request. A fundamental problem in Peer-to-Peer networks is how to locate efficiently appropriate peers to answer a specific query (Query routing). A lot of...
We propose a random-walk-based file search for unstructured P2P networks. In the proposal, each node keeps two pieces of information, one is the hop-limited routing tables, storing the route information to nodes within a small number (say n) hops from each node. The hop-limited routing table is substantially equivalent to the hop-limited shortest path tree, which is made of nodes within limited hop...
P2P technology provides new views for data integration purposes. In P2P systems, there is no global knowledge, neither a global schema nor information of data distribution or indices. An important issue in the context of schema-based P2P systems is efficient query processing. Because of the lack of global knowledge, query planning is much more difficult than in centralized systems. In this paper,...
We propose a random-walk-based file search for unstructured P2P networks. In the proposal, each node keeps two pieces of information, one is on the hop-limited shortest path tree rooted at itself and the other is on the indexes of files owned by neighbor nodes, referred to as the file list. A random-walk search is conducted along the concatenation of hop limited shortest path trees. To find a file,...
Churn is one of the crucial problems which restrict the development and deployment of DHT networks. In terms of churn treatment, this paper studies the quick start-up bootstrapping mechanism for Kademlia and proposes a heuristic bootstrapping algorithm to overcome the defects of the original. By modifying the way how to populate the routing tables, the heuristic algorithm decreases the messages sent...
In traditional P2P networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. However, it is a costly operation since it consumes node and link resources excessively, which are often unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not on the path to a...
In order to achieve the self-adaptive architecture-centric services' selection, this paper put forward the design principle of topology routing about service nodes, a network structure is built that agent is viewed as the basic Internetware granularity unit; By virtue of P2P environment such as open, dynamic, varied and more controllable evolution character, it is done to expand the self-adaptive...
Many structured Peer-to-Peer-Systems (P2P) have been developed over the past years. However, most of them rely on hash-functions and thus put major restrictions on applications being implemented on top of them. In this paper we present a very detailed description of Papnet, a hash-free P2P overlay-network that supports range-queries and realizes an infinite alphanumeric address space that can be used...
Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in the design of P2P systems. In this paper, to achieve better scalability and improve the routing performance of REIK, we design a novel hierarchical REIK...
Range query in Peer-to-Peer networks based on Distributed Hash Table (DHT) is still an open problem. The traditional way uses order-preserving hashing functions to create value indexes that are placed and stored on the corresponding peers to support range query. The way, however, suffers from high index maintenance costs. To avoid the issue, a scalable blind search method over DHTs - recursive partition...
Kademlia-based DHT has been deployed in many P2P applications and it is reported that there are millions of simultaneous users in Kad network. For such a protocol that significantly involves so many peers, its robustness and security must be evaluated carefully. In this paper, we analyze the Kademlia protocol and identify several potential vulnerabilities. We classify potential attacks as three types:...
Effectiveness of P2P systems highly depends on efficiency of their search algorithms. With existence of malicious and dishonest nodes, reputation systems are essential to evaluate the trustworthiness of participating peers and to combat subversive peer behaviors. Surprisingly majority of the available reputation systems, ignore the underlying search algorithm and assume it pre-existing. In this paper...
The open, sharing and anonymous nature of peer-to-peer (P2P) network has offered opportunities and threats. One feasible way to minimize threats is to establish the reputation-based global trust model. Previous work about the global trust model is almost based on the assumption that the peer with higher trust value will provide more honest feedbacks, and make the quality of feedback of a peer approximately...
In a structured peer-to-peer (P2P) overlay network, the stability of the entire network will be greatly affected by simultaneous join-in and drop-out of large amount of nodes. Aiming at reducing the overhead of handling this activity, we propose a group-based hierarchically structured overlay network, GSON. GSON is also a structured P2P overlay network using distributed hash table (DHT). In GSON,...
The structured P2P overlay networks with the constant degree have the efficient data location mechanism. They reduce the maintenance cost caused by nodes joining/leaving the overlay network and make the items in routing table as less as possible. An enhanced structure based on the cycloid system is proposed in this paper. It combines cycloid and folded hypercube and employs the concept of complementary...
The lack of a trusted authority, responsible for peers' identity verification or for authentication purposes, makes actual P2P systems extremely vulnerable to a large spectrum of attacks. The main purpose of this paper is to present Likir (layered identity-based Kademlia-like infrastructure), a framework that includes an identity-based scheme and a secure communication protocol, built on top of Kademlia,...
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.