By Topic

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

25-27 Aug. 2004

Filter Results

Displaying Results 1 - 25 of 52
  • P2P-4-DL: digital library over peer-to-peer

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

    The P2P-4-DL project aims to investigate and build a DL system that would operate over a P2P structure. Rather than storing digital objects centrally they remain the responsibility of the individual peers that provide them. This allows the system to utilise network resources more efficiently as well as providing users with a greater sense of control over the digital objects they share. Our prototy... 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 (56)
    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.
  • 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.
  • 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.
  • Cooperative pull-push cycle for searching a hybrid P2P network

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

    Information acquisition is a great challenge in the context of a continually growing Web. Nowadays, large Web search engines are primarily designed to assist an information pull by the user. On this platform, only actual information needs are handled without assistance of long-term needs. To overcome these shortcomings we propose a cooperative system for information pull and push on a peer-to-peer... 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 (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.
  • 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.
  • Semantic-laden peer-to-peer service directory

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

    The most intuitive way to build a service directory application that allows for service entities to register or search for services on top of a structured peer-to-peer network is to build reverse indices at appropriate nodes on the network. However, this implies trust on the reliability and integrity of other nodes on the network, which may be too risky an assumption for businesses. This paper pro... 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 (52)
    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.
  • The different dimensions of dynamicity

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

    In a peer-to-peer (P2P) network, a 'fabric' of overlay links helps peers discover and use other peers' resources. This fabric, however, is highly dynamic and constantly changing. While different measures of dynamicity have been implicitly and explicitly proposed, there is lack of deeper understanding about the various aspects of dynamicity. We systematically evaluate and quantify different dimensi... 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 (9)
    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.
  • Building adaptive peer-to-peer systems

    Publication Year: 2004, Page(s):268 - 269
    Cited by:  Papers (1)
    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.
  • 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.
  • 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.
  • 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.
  • Reliable peer-to-peer end system multicasting through replication

    Publication Year: 2004, Page(s):235 - 242
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    A key challenge in peer-to-peer computing system is to provide decentralized and yet reliable services on top of a network of loosely coupled, weakly connected and possibly unreliable peers. This work presents an effective dynamic passive replication scheme designed to provide reliable multicast service in peer-cast, an efficient and self-configurable peer-to-peer end system multicast (ESM) system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ICN: interest-based clustering network

    Publication Year: 2004, Page(s):219 - 226
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    An interest-based clustering peer-to-peer network (ICN) architecture is introduced in this paper. ICN uses a lot of Freenet mechanisms and is based on cache management. ICN is self-organizing, fully distributed, scalable, and logically hierarchical. In ICN, the upper level is bound by de Bruijn graph. Nodes in the lower level self-cluster based on interest. Through analysis and simulation, ICN sho... 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.
  • A distributed and measurement-based framework against free riding in peer-to-peer networks

    Publication Year: 2004, Page(s):276 - 277
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    We propose a distributed and measurement-based method to reduce the degree of free riding in P2P networks. We primarily focus on developing schemes to locate free riders and on determining policies that can be used to take actions against them. Our proposed schemes require each peer to monitor its neighboring peers, make decisions if they exhibit any kind of free riding, and take appropriate actio... 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 (1)
    Request permission for commercial 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.
  • 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.
  • "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.
  • On de Bruijn routing in distributed hash tables: there and back again

    Publication Year: 2004, Page(s):159 - 166
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    We show in this paper that de Bruijn networks, despite providing efficient search while using constant routing table size, as well as simplicity of the understanding and implementation of such networks, are unsuitable where key distribution will be uneven, a realistic scenario for most practical applications. In presence of arbitrarily skewed data distribution, it has only recently been shown that... 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.
  • Update propagation through replica chain in decentralized and unstructured P2P systems

    Publication Year: 2004, Page(s):64 - 71
    Cited by:  Papers (7)
    Request permission for commercial 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.