By Topic

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

Date 25-27 Aug. 2004

Filter Results

Displaying Results 1 - 25 of 52
  • 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 (9)  |  Patents (2)
    Request permission for commercial 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.
  • Erasure code replication revisited

    Publication Year: 2004, Page(s):90 - 97
    Cited by:  Papers (50)
    Request permission for commercial 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.
  • Building adaptive peer-to-peer systems

    Publication Year: 2004, Page(s):268 - 269
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (199 KB) | HTML iconHTML

    Most peer-to-peer systems are built upon the assumption that their running environment is homogeneous. However, for Internet-scale applications this assumption could lead to performance limitations. We propose a framework for building peer-to-peer systems which use performance monitoring techniques to adapt to changes in their environment. 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 commercial 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.
  • Collaborative automated trust negotiation in peer-to-peer systems

    Publication Year: 2004, Page(s):108 - 115
    Cited by:  Papers (3)
    Request permission for commercial 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.
  • Highways: proximity clustering for scalable peer-to-peer network

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

    The "location-aware" construction of overlay networks requires the identification of nodes that are efficient with respect to network delay and available bandwidth. In this short paper, we propose Highways to create clusters of nodes using a novel "location-aware" method, based on a scalable and distributed network coordinate system. This helps to build overlay routing tables to achieve better pro... 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 (5)
    Request permission for commercial 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.
  • "P2P scrabble. Can P2P games commence?"

    Publication Year: 2004, Page(s):100 - 107
    Cited by:  Papers (2)
    Request permission for commercial 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.
  • A framework for developing reflective and dynamic P2P networks (RaDP2P)

    Publication Year: 2004, Page(s):282 - 283
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    There has been a significant body of research conducted into various structured and unstructured overlay network protocols. Both paradigms have advantages for specific application domains and researchers are beginning to examine the benefits of using hybridized systems. We hypothesize that resource awareness and adaptation are essential to the efficient exploitation of the resources available on t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Pastry in a heterogeneous system

    Publication Year: 2004, Page(s):278 - 279
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    We study how Pastry performs in a heterogeneous network environment of varying size. The large traffic overhead for management traffic makes the overlay nonfunctional if it grows too large. This can be circumvented by partitioning the routing tables at the cost of increased path lengths and response times. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for testing distributed systems

    Publication Year: 2004, Page(s):262 - 263
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    Thorough testing of distributed systems, particularly peer-to-peer systems can prove difficult due to the problems inherent in deploying, controlling and monitoring many nodes simultaneously. This problem will only increase as the scale of distributed systems continues to grow. This framework implements a test bed environment using a semi-centralized peer-to-peer network as a substrate for sharing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing a balanced, (log(N)/1oglog(N))-diameter super-peer topology for scalable P2P systems

    Publication Year: 2004, Page(s):210 - 218
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    Current peer-to-peer (P2P) file sharing applications are remarkably simple and robust, but their inefficiency can produce very high network loads. The use of super-peers has been proposed to improve the performance of unstructured P2P systems. These have the potential to approach the performance and scalability of structured systems, while retaining the benefits of unstructured P2P systems. There ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed search in P2P networks through secure-authenticated content management systems (CMSs)

    Publication Year: 2004, Page(s):260 - 261
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    Peer to peer (P2P) networks become more and more popular nowadays. They offer the capability of locating and obtaining a file from all over the world very fast. As a result, P2P networks constitute the main cause for the network traffic. Besides their many advantages, these networks suffer from a very strong drawback: authentication-security. Content management systems (CMSs) on the other hand off... 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 commercial 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.
  • Percolation search in power law networks: making unstructured peer-to-peer networks scalable

    Publication Year: 2004, Page(s):2 - 9
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial 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.
  • On the security of polling protocols in peer-to-peer systems

    Publication Year: 2004, Page(s):36 - 44
    Cited by:  Papers (2)
    Request permission for commercial 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.
  • Adaptive peer-to-peer topologies

    Publication Year: 2004, Page(s):53 - 62
    Cited by:  Papers (20)
    Request permission for commercial 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.
  • PeerStore: better performance by relaxing in peer-to-peer backup

    Publication Year: 2004, Page(s):72 - 79
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial 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.
  • PROST: a programmable structured peer-to-peer overlay network

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

    We present the idea of a programmable structured P2P architecture. Our proposed system allows the key-based routing infrastructure, which is common to all structured P2P overlays, to be shared by multiple applications. Furthermore, our architecture allows the dynamic and on-demand deployment of new applications and services on top of the shared routing layer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P applications using the semantic information oriented network

    Publication Year: 2004, Page(s):272 - 273
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (602 KB) | HTML iconHTML

    This paper describes P2P applications using an advanced P2P platform called SIONet. Based on its metadata-based routing and easy communication creation capabilities, various kinds of P2P applications can be constructed. Effective discovery, P2P content delivery with digital rights management, semi-active information exchanging community, and P2P ad hoc community are constructed. These are expected... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Peer-to-peer security in mobile devices: a user perspective

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

    Peer-to-peer networks are set to have a major impact on mobile devices after having created hopes, hypes, revolutions and disillusions in desktop applications. Mobile phones equipped with close range connectivity like Bluetooth and WLAN have already hit the market and they are the natural target to form ad hoc networks. New scenarios could attract the fantasy (and the pocket) of the end users, but... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust protocol for building superpeer overlay topologies

    Publication Year: 2004, Page(s):202 - 209
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (495 KB) | HTML iconHTML

    The concept of superpeer has been introduced to improve the performance of popular file-sharing applications. A superpeer is a node in a P2P network that operates as a server for a set of clients, and as an equal w.r.t. other superpeers. By exploiting heterogeneity, the superpeer paradigm allows P2P networks to run more efficiently, without compromising their decentralized nature. This paper descr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregating information in peer-to-peer systems for improved join and leave

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

    We introduce the Distributed Approximative System Information Service (DASIS) as a useful scheme to aggregate approximative information on the state of a peer-to-peer system. We present how this service can be integrated into existing peer-to-peer systems, such as Kademlia and Chord. As a sample application, we show how DASIS can be employed for establishing an effective deterministic join algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broose: a practical distributed hashtable based on the de-Bruijn topology

    Publication Year: 2004, Page(s):167 - 174
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    Broose is a peer-to-peer protocol based on the de Bruijn topology allowing a distributed hashtable to be maintained in a loose manner. Each association is stored on k nodes to allow higher reliability with regard to node failures. Redundancy is also used when storing contacts avoiding complex topology maintenance for node departures and arrivals. It uses a constant size routing table of 0(k) conta... 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 commercial 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.