Scheduled System Maintenance
On Tuesday, January 22, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings.

27-27 Aug. 2004

Filter Results

Displaying Results 1 - 25 of 52
  • Proceedings. Fourth International Conference on Peer-to-Peer Computing

    Publication Year: 2004
    Request permission for reuse | PDF file iconPDF (503 KB)
    Freely Available from IEEE
  • Proceedings Fourth International Conference on Peer-to-Peer Computing

    Publication Year: 2004, Page(s): 0_2
    Request permission for reuse | PDF file iconPDF (160 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2004, Page(s): 0_3
    Request permission for reuse | PDF file iconPDF (155 KB)
    Freely Available from IEEE
  • Proceedings Fourth International Conference on Peer-to-Peer Computing

    Publication Year: 2004, Page(s): 0_4
    Request permission for reuse | PDF file iconPDF (204 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): 0_5
    Request permission for reuse | PDF file iconPDF (190 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s):0_6 - 0_8
    Request permission for reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • Message from the Conference Chairs

    Publication Year: 2004, Page(s): viii
    Request permission for reuse | PDF file iconPDF (178 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organization Committee

    Publication Year: 2004, Page(s): ix
    Request permission for reuse | PDF file iconPDF (169 KB)
    Freely Available from IEEE
  • Reviewer committee

    Publication Year: 2004, Page(s): x
    Request permission for reuse | PDF file iconPDF (173 KB)
    Freely Available from IEEE
  • Percolation search in power law networks: making unstructured peer-to-peer networks scalable

    Publication Year: 2004, Page(s):2 - 9
    Cited by:  Papers (45)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    We introduce a scalable searching protocol for locating and retrieving content in random networks with power-law (PL) and heavy-tailed degree distributions. The proposed algorithm is capable of finding any content in the network with probability one in time O(logN), with a total traffic that provably scales sub-linearly with the network size, N. Unlike other proposed solutions, there is no need to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache updates in a peer-to-peer network of mobile agents

    Publication Year: 2004, Page(s):10 - 17
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    In open multi-agent systems, agents need resources provided by other agents but they are not aware of which agents provide particular resources. We consider a peer-to-peer approach, in which each agent maintains a local cache with information about k resources, that is for each of the k resources, an agent that provides it. However, when an agent or a resource moves, cache entries become obsolete.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the correctness of query results in XML P2P databases

    Publication Year: 2004, Page(s):18 - 25
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (858 KB) | HTML iconHTML

    In XML peer-to-peer (p2p) database systems, query results are usually assumed to be incomplete. Incompleteness issues derive from the unstable and open-ended nature of the network, where new nodes may connect at any time, and existing nodes may suddenly disappear. The incompleteness of input data used for query evaluation may also lead to the incorrectness of query results, which greatly affects t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information leak in the Chord lookup protocol

    Publication Year: 2004, Page(s):28 - 35
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (533 KB) | HTML iconHTML

    In peer-to-peer (P2P) systems, it is often essential that connected systems (nodes) relay messages which did not originate locally, on to the greater network. As a result, an intermediate node might be able to determine a large amount of information about the system, such as the querying tendencies of other nodes. This represents an inherent security issue in P2P networks. Therefore, we ask the fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the security of polling protocols in peer-to-peer systems

    Publication Year: 2004, Page(s):36 - 44
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    The peer-to-peer (P2P) network model differs from the well established client-server model in that all members of the network are assigned an equal role. P2P networks are recently gaining increasing popularity. Providing security in distributed content sharing in P2P networks is an important challenge. This paper identifies security vulnerabilities in the protocols for sharing servants' reputation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PKI-based security for peer-to-peer information sharing

    Publication Year: 2004, Page(s):45 - 52
    Cited by:  Papers (17)  |  Patents (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    Freeflow of information is the feature that has made peer-to-peer information sharing applications popular. However, this very feature holds back the acceptance of these applications by the corporate and scientific communities. In these communities it is important to provide confidentiality and integrity of communication and to enforce access control to shared resources. We present a collection of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive peer-to-peer topologies

    Publication Year: 2004, Page(s):53 - 62
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    We present a peer-level protocol for forming adaptive, self-organizing topologies for data-sharing P2P networks. This protocol is based on the idea that a peer should directly connect to those peers from which it is most likely to download satisfactory content. We show that the resulting topologies are more efficient than standard Gnutella topologies. Furthermore, we show that these adaptive topol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Update propagation through replica chain in decentralized and unstructured P2P systems

    Publication Year: 2004, Page(s):64 - 71
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    We propose a novel algorithm, called update propagation through replica chain (UPTReC), to maintain file consistency in decentralized and unstructured peer-to-peer (P2P) systems. In UPTReC, each file has a logical replica chain composed of all replica peers (RPs) which are defined as peers that have replicas of the file. Each RP acquires partial knowledge of the bi-directional chain by keeping a l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PeerStore: better performance by relaxing in peer-to-peer backup

    Publication Year: 2004, Page(s):72 - 79
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    Backup is cumbersome. To be effective, backups have to be made at regular intervals, forcing users to organize and store a growing collection of backup media. In this paper we propose a novel peer-to-peer backup system, PeerStore, that allows the user to store his backups on other people's computers instead. PeerStore is an adaptive, cost-effective system suitable for all types of networks ranging... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving bandwidth efficiency of peer-to-peer storage

    Publication Year: 2004, Page(s):80 - 90
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    We broaden the applicability of peer-to-peer storage infrastructures to weakly-connected clients. We present a client-side technique that exploits the commonality between consecutive versions of a file to reduce the bandwidth required to store and retrieve files in a peer-to-peer storage infrastructure. We then present a novel data structure that allows us to use this technique in an environment w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erasure code replication revisited

    Publication Year: 2004, Page(s):90 - 97
    Cited by:  Papers (59)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (396 KB) | HTML iconHTML

    Erasure coding is a technique for achieving high availability and reliability in storage and communication systems. We revisit the analysis of erasure code replication and point out some situations when whole-file replication is preferred. The switchover point (from preferring whole-file replication to erasure code replication) is studied, and characterized using asymptotic analysis. We also discu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "P2P scrabble. Can P2P games commence?"

    Publication Year: 2004, Page(s):100 - 107
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    The article considers the design of P2P games without trusted, centralized resources. The main difficulty is how to prevent the possibility of cheating. The article considers scrabble as a case study and attempts to solve issues such as maintenance of public, private, and concealed public state, as well as secret drawing from a finite set of objects. The issues of state replication are considered ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaborative automated trust negotiation in peer-to-peer systems

    Publication Year: 2004, Page(s):108 - 115
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    The increasing popularity of peer-to-peer systems has promoted the development of new techniques to support various kinds of business transactions. However, users are reluctant to conduct high value transactions over P2P systems due to the inherent untrustworthiness of peers. In this paper, we investigate building trust through automated trust negotiation, which is orthogonal to existing reputatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SeAl: managing accesses and data in peer-to-peer sharing networks

    Publication Year: 2004, Page(s):116 - 123
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (490 KB) | HTML iconHTML

    We present SeAl, a novel data/resource and data-access management infrastructure designed for the purpose of addressing a key problem in P2P data sharing networks, namely the problem of wide-scale selfish peer behavior. Selfish behavior has been manifested and well documented and it is widely accepted that unless this is dealt with, the scalability, efficiency, and the usefulness of P2P sharing ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reputation management framework and its use as currency in large-scale peer-to-peer networks

    Publication Year: 2004, Page(s):124 - 132
    Cited by:  Papers (13)  |  Patents (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    We propose a reputation management framework for large-scale peer-to-peer (P2P) networks, wherein all nodes are assumed to behave selfishly. The proposed framework has several advantages. It enables a form of virtual currency, such that the reputation of nodes is a measure of their wealth. The framework is scalable and provides protection against attacks by malicious nodes. The above features are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A placement scheme for peer-to-peer networks based on principles from geometry

    Publication Year: 2004, Page(s):134 - 141
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (414 KB) | HTML iconHTML

    Crucial for the performance of peer-to-peer networks based on geometric topologies is the measurement complexity and quality of the mapping function used to map a node in the network to a point in the geometric target space. In this paper we study how results from mathematics as well as data mining can be applied to this mapping problem. Using a metric space model for networks and results from mat... View full abstract»

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