By Topic

2008 Eighth International Conference on Peer-to-Peer Computing

Date 8-11 Sept. 2008

Filter Results

Displaying Results 1 - 25 of 56
  • [Front cover]

    Publication Year: 2008, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (2446 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2008, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (10 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (129 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • Message from Conference Chairs

    Publication Year: 2008, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (56 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organizers

    Publication Year: 2008, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2008, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2008, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (24 KB)
    Freely Available from IEEE
  • Transaction Rate Limiters for Peer-to-Peer Systems

    Publication Year: 2008, Page(s):3 - 11
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period. They can be used to limit the consumption of selfish users and the damage done by malicious users. They complement reputation systems, solving the traitor problem. We give simple distributed algorithms that work over ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incentives Against Hidden Action in QoS Overlays

    Publication Year: 2008, Page(s):12 - 21
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    Peer-to-peer networks providing QoS-enabled services are sensitive to hidden action situations, where the actions of a server peer are hidden from the peers who receive services from it. This is because server peers can choose to strategically minimize their effort, and client peers may be unable to distinguish between cases where the server exerted insufficient effort and cases where the server k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Securing Peer-to-Peer Content Sharing Service from Poisoning Attacks

    Publication Year: 2008, Page(s):22 - 29
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (639 KB) | HTML iconHTML

    Poisoning attacks in the Peer-to-Peer (P2P) content sharing service have become a serious security problem on the global Internet due to the features of P2P systems such as self-organization, self-maintenance, etc. In this paper, we propose a novel poisoning-resistant security framework based on the notion that the content providers would be the only trusted sources to verify the integrity of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tempering Kademlia with a Robust Identity Based System

    Publication Year: 2008, Page(s):30 - 39
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    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 Ka... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AREX: An Adaptive System for Secure Resource Access in Mobile P2P Systems

    Publication Year: 2008, Page(s):43 - 52
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB) | HTML iconHTML

    In open environments, such as mobile peer-to-peer systems, participants may need to access resources from unknown users. A critical security concern in such systems is the access of faulty resources, thereby wasting the requester's time and energy and possibly causing damage to her system. A common approach to mitigating the problem involves reputation mechanisms; however, since reputation relies ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Popularity-Aware Prefetch in P2P Range Caching

    Publication Year: 2008, Page(s):53 - 62
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (830 KB) | HTML iconHTML

    Unstructured peer-to-peer infrastructure has been widely employed to support large-scale distributed applications. Many of these applications, such as location-based services and multimedia content distribution, require the support of range selection queries. Under the widely adopted query shipping protocols, the cost of query processing is affected by the number of result copies or replicas in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query Workload Driven Summarization for P2P Query Routing

    Publication Year: 2008, Page(s):63 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    Query routing in peer-to-peer systems is based onthe peers' content summaries. For the sake of scalability, summaries are built at a "peer level." The coarseness of peer level summaries limits their ability to route queries accurately to peers sharing relevant contents. We propose to improve the quality of each peer's summary by grouping its contents and summarizing each group individually. To enh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chordella - A Hierarchical Peer-to-Peer Overlay Implementation for Heterogeneous, Mobile Environments

    Publication Year: 2008, Page(s):75 - 76
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (103 KB) | HTML iconHTML

    This paper deals with Chordella, a peer-to-peer system that is particularly designed for heterogeneous environments such as in wireless networks. We use a pool of standard personal computers distributed over the Internet which act as reliable nodes and form the backbone of the network as superpeers. The mobile nodes are represented by mobile phones running a lightweight implementation of our syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IgorFs: A Distributed P2P File System

    Publication Year: 2008, Page(s):77 - 78
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (127 KB) | HTML iconHTML

    IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, which is similar to Chord, but provides additional features like service orientation or proximity neighbor and route selection. IgorFs offers an efficient means to publish data files that are subject to frequent but minor mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualizing Transactional Algorithms for DHTs

    Publication Year: 2008, Page(s):79 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (149 KB) | HTML iconHTML

    The focus of this demonstrator is on the study of algorithms for implementing transactions on peer-to-peer networks. Their visualization contributes to the analysis and test of the protocols, verifying their tolerance to failures. In particular, we show a DHT running two-phase commit and the Paxos consensus algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A NAT Traversal Mechanism for Peer-To-Peer Networks

    Publication Year: 2008, Page(s):81 - 83
    Cited by:  Papers (7)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    In this demo we present our approach for establishing a communication channel between hosts behind a NAT-based router. To do so, we developed a peer-to-peer based variant of the STUN protocol using so-called superpeers. Using this protocol we determine the used NAT types for the hosts and select a suitable NAT traversal technique dynamically. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P Information Retrieval and Filtering with MAPS

    Publication Year: 2008, Page(s):84 - 85
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (503 KB) | HTML iconHTML

    In this demonstration paper we present MAPS, a novel system that combines approximate information retrieval and filtering functionality in a peer-to-peer setting. In MAPS, a user is able to submit one-time and continuous queries, and receive matching resources and notifications from selected information sources. The selection of these sources in the retrieval case is based on well-known resource s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems

    Publication Year: 2008, Page(s):89 - 98
    Cited by:  Papers (22)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and maintained. The simplest redundancy scheme is replication, which however suffers from storage inefficiency. Another approach is erasure coding, which provides the same level of reliability as replication using a significa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EAD: An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems

    Publication Year: 2008, Page(s):99 - 108
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    In peer-to-peer file sharing systems, file replication technology is widely used to reduce hot spots and improve file query efficiency. Most current file replication methods replicate files in all nodes or two endpoints on a client-server query path. However, these methods either have low effectiveness or come at a cost of high overhead. This paper presents an Efficient and adaptive decentralized ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible Routing in Grouped DHTs

    Publication Year: 2008, Page(s):109 - 118
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (369 KB) | HTML iconHTML

    In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support for Concept Hierarchies in DHTs

    Publication Year: 2008, Page(s):121 - 124
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    Concept hierarchies greatly help in the organization and reuse of information and are widely used in a variety of applications, such as data warehouses. In this paper, we describe a method for efficiently storing and querying data organized into concept hierarchies and dispersed over a DHT. In our method, peers individually decide on the level of indexing according to the incoming queries. Roll-up... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.