By Topic

Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05)

Date Aug. 31 2005-Sept. 2 2005

Filter Results

Displaying Results 1 - 25 of 41
  • Fifth IEEE International Conference on Peer-to-Peer Computing - Cover

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (383 KB)
    Freely Available from IEEE
  • Fifth IEEE International Conference on Peer-to-Peer Computing

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Fifth IEEE International Conference on Peer-to-Peer Computing - Copyright Page

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Fifth IEEE International Conference on Peer-to-Peer Computing - Table of contents

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

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

    Publication Year: 2005, Page(s):ix - x
    Request permission for commercial reuse | PDF file iconPDF (24 KB)
    Freely Available from IEEE
  • Proximity neighbor selection for a DHT in wireless multi-hop networks

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

    A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-level tasks, such as service discovery, in a cooperative and distributed way. Originally conceived as a peer-to-peer application for the Internet, distributed hash tables (DHTs) are data structures offering both, scalable ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The essence of P2P: a reference architecture for overlay networks

    Publication Year: 2005, Page(s):11 - 20
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide variety of algorithms, data structures, and architectures have been proposed. The terminologies and abstractions used, however, have become quite inc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On overlay schemes to support point-in-range queries for scalable grid resource discovery

    Publication Year: 2005, Page(s):23 - 30
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    A resource directory is a critical component of a grid architecture. P2P computing paradigm could address some of the scalability issues that make distributed resource discovery services challenging. Unfortunately, most existing distributed hash table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups. This paper proposes a ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Result verification and trust-based scheduling in peer-to-peer grids

    Publication Year: 2005, Page(s):31 - 38
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    Peer-to-peer grids that seek to harvest idle cycles available throughout the Internet are vulnerable to hosts that fraudulently accept computational tasks and then maliciously return arbitrary results. Current strategies employed by popular cooperative computing grids, such as SETI@Home, rely heavily on task replication to check results. However, result verification through replication suffers fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-stabilizing structured ring topology P2P systems

    Publication Year: 2005, Page(s):39 - 46
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB) | HTML iconHTML

    We propose a self-stabilizing and modeless peer-to-peer (P2P) network construction and maintenance protocol, called the Ring Network (RN) protocol. The RN protocol, when started on a network of peers that are in an arbitrary state, will cause the network to converge to a structured P2P system with a directed ring topology, where peers are ordered according to their identifiers. Furthermore, the RN... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclone: a novel design schema for hierarchical DHTs

    Publication Year: 2005, Page(s):49 - 56
    Cited by:  Papers (18)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    Recent research efforts have improved the existing flat distributed hash tables to accommodate hierarchical structure. Nevertheless, many problems still remain to be solved regarding scalability issues, autonomous systems, connection degree, and network proximity. In this paper, we present a new hierarchical DHT called Cyclone that aims to solve the aforementioned issues with a near-optimal archit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range queries in trie-structured overlays

    Publication Year: 2005, Page(s):57 - 66
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    Among the open problems in P2P systems, support for nontrivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of query results have been identified as some of the most relevant issues. This paper describes how range queries as an important nontrivial search predicate can be supported in a structured overlay network that provides O(l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques for efficient routing and load balancing in content-addressable networks

    Publication Year: 2005, Page(s):67 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    As a distributed hash table (DHT), a content addressable network (CAN) provides efficient routing and object location in a decentralized manner while offering fault tolerance and dynamic peer operations. However, as opposed to other DHTs that use a flat ID space, CAN uses a multi-dimensional logical space. DHTs usually require O(logN) routing information per peer and provide routing in O(logN) hop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elders know best - handling churn in less structured P2P systems

    Publication Year: 2005, Page(s):77 - 86
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    We address the problem of highly transient populations in unstructured and loosely-structured peer-to-peer systems. We propose a number of illustrative query-related strategies and organizational protocols that, by taking into consideration the expected session times of peers (their lifespans), yield systems with performance characteristics more resilient to the natural instability of their enviro... View full abstract»

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

    Publication Year: 2005, Page(s):87 - 94
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in the presence of churn and other failures is the subject of intensive research, the problem of building them from scratch has not been addressed (apart from individual nodes joining an already functioning overlay). In this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantifying agent strategies under reputation

    Publication Year: 2005, Page(s):97 - 105
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for simple reputation-based buyer strategies, a seller's decision whether to cheat or not is dependent only on the length of its transaction history, not on the particular actions committed. Given a finite number of transacti... View full abstract»

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

    Publication Year: 2005, Page(s):106 - 113
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    The article describes and gives an economic analysis of a business model for commercial content delivery networks (CDN) based on the peer-to-peer model. The content is stored in the CDN on the hosts of the peers. A user pays for access to the content, and can sell the content to other users as in a direct sales network. The content trade is a free market transaction (including billing and accounti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trusted computing: providing security for peer-to-peer networks

    Publication Year: 2005, Page(s):117 - 124
    Cited by:  Papers (16)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    In this paper, we demonstrate the application of trusted computing to securing peer-to-peer (P2P) networks. We identify a central challenge in providing many of the security services within these networks, namely the absence of stable verifiable peer identities. We employ the functionalities provided by trusted computing technology to establish a pseudonymous authentication scheme for peers and ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ARA: a robust audit to prevent free-riding in P2P networks

    Publication Year: 2005, Page(s):125 - 132
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    A number of solutions have been proposed to address the free-riding problem in peer-to-peer file sharing systems. The solutions are either imperfect-they allow some users to cheat the system with malicious behavior, or expensive-they require human intervention, require servers, or incur high mental transaction costs. The authors proposed a method to address these weaknesses. Specifically, a utilit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of mutual trust during matchmaking

    Publication Year: 2005, Page(s):133 - 140
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    The authors introduced a new service discovery and matchmaking architecture, layered on top of Globus MDS3, that integrates mutual trust evaluations into the matchmaking process. The architecture adopts a symmetric approach, and checks trust policies of both grid users and resources without requiring policy disclosures. This approach eliminates run-time security failures arising from incompatible ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • T-DHT: topology-based distributed hash tables

    Publication Year: 2005, Page(s):143 - 144
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (69 KB) | HTML iconHTML

    In this paper, the authors introduced topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on location information and work even in the presence of voids in the network. Using a virtual coordinate system, a distributed hash table which is strongly oriented to the underlyin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the challenge of assessing overlay topology adaptation mechanisms

    Publication Year: 2005, Page(s):145 - 147
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB) | HTML iconHTML

    This thesis is that a peer-to-peer network's overlay topology should adapt to match the demand graph of the peer-to-peer network. In order to assess the effectiveness of various adaptation mechanisms, a comparison with an optimal topology for a given demand graph would be helpful. However, several related optimization/decision problems have been shown to be NP-hard. The contributions of this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P-based grid architecture for homology searching

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

    This paper describes an advanced grid architecture efficient for homology searching in bioinformatics. An integrated architecture of the computing-grid and data-grid through P2P communication attains efficient job processing. Field trials, in which broadband users and bioinformatics researchers participated to find new DNAs, show its effectiveness in reducing processing time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keyword searching in hypercubic manifolds

    Publication Year: 2005, Page(s):150 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    The authors presented a novel approach for keyword searching for file sharing applications based on a simple hash function and extension to current distributed hash tables (DHT) topology. Depart from standard hash methods on DHT systems, this approach is to develop a locality preserving hash function so that objects containing the same keyword tend to have similar hash values under Hamming metric.... View full abstract»

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