Results 1 - 10
of
304
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
, 2004
"... Peer-to-peer (P2P) online communities are commonly perceived as an environment offering both opportunities and threats. One way to ..."
Abstract
-
Cited by 402 (17 self)
- Add to MetaCart
(Show Context)
Peer-to-peer (P2P) online communities are commonly perceived as an environment offering both opportunities and threats. One way to
Managing Trust in a Peer-2-Peer Information System
, 2001
"... Managing trust is a problem of particular importance ...In this paper we illustrate that the problem needs to be addressed at both the data management and the semantic, i.e. trust management, level and we devise a method of how trust assessments can be performed by using at both levels scalable peer ..."
Abstract
-
Cited by 397 (26 self)
- Add to MetaCart
Managing trust is a problem of particular importance ...In this paper we illustrate that the problem needs to be addressed at both the data management and the semantic, i.e. trust management, level and we devise a method of how trust assessments can be performed by using at both levels scalable peer-to-peer mechanisms. We expect that such methods are an important factor if fully decentralized peer-to-peer systems should become the platform for more serious applications than simple file exchange
A Reputation-Based Trust Model for Peer-to-Peer eCommerce Communities (Extended Abstract)
, 2003
"... Peer-to-Peer eCommerce communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such an open community is to use community-based reputations, which can be computed, for example, through feedback about peers' transaction histori ..."
Abstract
-
Cited by 148 (7 self)
- Add to MetaCart
Peer-to-Peer eCommerce communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such an open community is to use community-based reputations, which can be computed, for example, through feedback about peers' transaction histories. Such reputation information can help estimating the trustworthiness and predicting the future behavior of peers. This paper presents a coherent adaptive trust model for quantifying and comparing the trustworthiness of peers based on a transaction-based feedback system. There are two main features of our model. First, we argue that the trust models based solely on feedback from other peers in the community is inaccurate and ineffective. We introduce three basic trust parameters in computing trustworthiness of peers. In addition to feedback a peer receives through its transactions with other peers, we incorporate the total number of transactions a peer performs, and the credibility of the feedback sources into the model for evaluating the trustworthiness of peers. Second, we introduce two adaptive factors, the transaction context factor and the community context factor, to allow the metric to adapt to different domains and situations and to address common problems encountered in a variety of online communities. We also developed a concrete method to validate the proposed trust model and obtained initial results, showing the feasibility and benefit of our approach.
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
- In VLDB
, 2005
"... We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to be made between nodes at different levels in the tree, we show that the load at each node is approxima ..."
Abstract
-
Cited by 132 (16 self)
- Add to MetaCart
(Show Context)
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to be made between nodes at different levels in the tree, we show that the load at each node is approximately equal. In spite of the tree structure providing precisely one path between any pair of nodes, we show that sideways routing tables maintained at each node provide sufficient fault tolerance to permit efficient repair. Specifically, in a network with N nodes, we guarantee that both exact queries and range queries can be answered in O(logN) steps and also that update operations (to both data and network) have an amortized cost of O(logN). An experimental assessment validates the practicality of our proposal. 1
Content-based retrieval in hybrid peer-to-peer networks
- In CIKM
, 2003
"... Hybrid peer-to-peer architectures use special nodes to provide directory services for regions of the network (“regional directory services”). Hybrid peer-to-peer architectures are a potentially powerful model for developing large-scale networks of complex digital libraries, but peer-to-peer networks ..."
Abstract
-
Cited by 111 (6 self)
- Add to MetaCart
(Show Context)
Hybrid peer-to-peer architectures use special nodes to provide directory services for regions of the network (“regional directory services”). Hybrid peer-to-peer architectures are a potentially powerful model for developing large-scale networks of complex digital libraries, but peer-to-peer networks have so far tended to use very simple methods of resource selection and document retrieval. In this paper, we study the application of content-based resource selection and document retrieval to hybrid peer-to-peer networks. The directory nodes that provide regional directory services construct and use the content models of neighboring nodes to determine how to route query messages through the network. The leaf nodes that provide information use contentbased retrieval to decide which documents to retrieve for queries. The experimental results demonstrate that using content-based retrieval in hybrid peer-to-peer networks is both more accurate and more efficient for some digital library environments than more common alternatives such as Gnutella 0.6.
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
- In Proceedings of the 23rd International Conference on Distributed Computing Systems
, 2003
"... This paper studies the problem of updates in decentralised and self-organising P2P systems in which peers have low online probabilities and only local knowledge. The update strategy we propose for this environment is based on a hybrid push/pull rumor spreading algorithm and provides a fully decentra ..."
Abstract
-
Cited by 98 (28 self)
- Add to MetaCart
(Show Context)
This paper studies the problem of updates in decentralised and self-organising P2P systems in which peers have low online probabilities and only local knowledge. The update strategy we propose for this environment is based on a hybrid push/pull rumor spreading algorithm and provides a fully decentralised, efficient and robust communication scheme which offers probabilistic guarantees rather than ensuring strict consistency. We describe a generic analytical model to investigate the utility of our hybrid update propagation scheme from the perspective of communication overhead.
Querying peer-to-peer networks using p-trees
- In WebDB
, 2004
"... Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish data. However, most existing P2P systems only provide a very rudimentary query facility; they only support equality or keyword search queries over files. We believe that future P2P applications, such as ..."
Abstract
-
Cited by 75 (4 self)
- Add to MetaCart
Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish data. However, most existing P2P systems only provide a very rudimentary query facility; they only support equality or keyword search queries over files. We believe that future P2P applications, such as resource discovery on a grid, will require more complex query functionality. As a first step towards this goal, we propose a new distributed, fault-tolerant P2P index structure for resource discovery applications called the P-tree. Ptrees efficiently evaluate range queries in addition to equality queries. We describe algorithms to maintain a P-tree under insertions and deletions of data items/peers, and evaluate its performance using both a simulation and a real distributed implementation. Our results show the efficacy of our approach. 1.
A casestudy in building layered DHT applications
- In Proceedings of the 2005 SIGCOMM (Aug. 2005). [11] CHAWATHE, Y., RATNASAMY, S., BRESLAU, L., LANHAM, N., AND SHENKER, S. Making Gnutella-like P2P systems scalable.In Proceedings of the 2003 SIGCOMM
, 2003
"... Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that of simplicity of implementation and deployment. In this paper, we explore a case study of building an application for whi ..."
Abstract
-
Cited by 54 (2 self)
- Add to MetaCart
(Show Context)
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that of simplicity of implementation and deployment. In this paper, we explore a case study of building an application for which ease of deployment dominated the need for high performance. The application we focus on is Place Lab, an end-user positioning system. We evaluate whether it is feasible to use DHTs as an application-independent building block to implement a key component of Place Lab: its “mapping infrastructure.” We present Prefix Hash Trees, a data structure used by Place Lab for geographic range queries that is built entire on top of a standard DHT. By strictly layering Place Lab’s data structures on top of a generic DHT service, we were able to decouple the deployment and management of Place Lab from that of the underlying DHT. We identify the characteristics of Place Lab that made it amenable for deploying in this layered manner, and comment on its effect on performance.
Building Trust in Decentralized Peer-to-Peer Electronic Communities
- In The 5th International Conference on Electronic Commerce Research. (ICECR
, 2002
"... Many players in electronic markets have to cope with much higher amount of uncertainty as to quality and reliability of the products they buy and the information they obtain from other peers in the respective online business communities. ..."
Abstract
-
Cited by 54 (0 self)
- Add to MetaCart
(Show Context)
Many players in electronic markets have to cope with much higher amount of uncertainty as to quality and reliability of the products they buy and the information they obtain from other peers in the respective online business communities.
Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks
- In DBISP2P
, 2003
"... Abstract. In this work we study how to process complex queries in DHT-based Peer-to-Peer (P2P) data networks. Queries are made over tuples and relations and are expressed in a query language, such as SQL. We describe existing research approaches for query processing in P2P systems, we suggest improv ..."
Abstract
-
Cited by 52 (7 self)
- Add to MetaCart
(Show Context)
Abstract. In this work we study how to process complex queries in DHT-based Peer-to-Peer (P2P) data networks. Queries are made over tuples and relations and are expressed in a query language, such as SQL. We describe existing research approaches for query processing in P2P systems, we suggest improvements and enhancements, and propose a unifying framework that consists of a modified DHT architecture, data placement and search algorithms, and provides efficient support for processing a variety of query types, including queries with one or more attributes, queries with selection operators (involving equality and range queries), and queries with join operators. To our knowledge, this is the first work that puts forth a framework providing support for all these query types. 1
