By Topic

2004 International Workshop on Hot Topics in Peer-to-Peer Systems

8-8 Oct. 2004

Filter Results

Displaying Results 1 - 23 of 23
  • Proceedings. 2004 International Workshop on Hot Topics in Peer-to-Peer Systems

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • First International Workshop on Hot Topics in Peer-to-Peer Systems - Title Page

    Publication Year: 2004, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • First International Workshop on Hot Topics in Peer-to-Peer Systems - Copyright Page

    Publication Year: 2004, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE
  • First International Workshop on Hot Topics in Peer-to-Peer Systems - Table of contents

    Publication Year: 2004, Page(s):v - vi
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2004, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (21 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2004, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2004, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Access control in ad hoc groups

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

    Ad hoc groups, such as peer-to-peer (P2P) systems and mobile ad hoc networks (MANETs) represent recent technological advancements. They support low-cost, scalable and fault-tolerant computing and communication. Since such groups do not require any pre-deployed infrastructure or any trusted centralized authority they have many valuable applications in military and commercial settings as well as in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended Fibonacci distances for fault-tolerant routing in Chord-like DHTs

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

    Fibonacci distances have already proved to be optimal [G. Cordasco et al. (2004)] for constructing the so called "finger list" in Chord-like [I. Stoica et al. (2001)] distributed hash table routing by reducing the average number of hops compared to the original finger list based on exponentially increasing distances. In this paper we propose a generalization of this technique and, by means of simu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-uniform deterministic routing on F-Chord(α)

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

    In this paper, we present a family of novel P2P routing schemes based on Chord (and its variation F-Chord(α) that trades off uniformity with efficiency without using any additional overhead. We prove that H-F-Chord(α)'s routing is more efficient than in F-Chord(α) in terms of its average path length that is O(log n/ log log n). We also show, by simulations, that H-F-Chord(α... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BaRT, balanced randomized tree: a scalable and distributed protocol for lookup in peer-to-peer networks

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

    This paper proposes a new scheme for p2p networks. The main contributions are an extensive use of randomization techniques and a novel usage of tree-data structure. The combination of these two ingredients allows a great flexibility of network parameters, such as: load balance among the peers, fast lookups and reduced memory usage. For instance, with routing tables of size (d-1) logdn, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fair micro-payment scheme for profit sharing in P2P networks

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

    Despite their large success, file sharing and peer to peer systems are used mainly for illegal actions, such as violations of author's copyright. Many commercial proposals have been made available, but at the present time, there is a lack o/inherently legal file sharing tools which remain attractive for all the involved parties. In this paper we propose a protocol which connects authors and custom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of heterogeneous link capacities in BitTorrent-like file sharing systems

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

    Despite the recent research efforts on peer-to-peer networks modeling and performance evaluation, very few literature results have appeared on what concerns the effect of network characteristics on the overlay peer-to-peer services. Goal of this paper is to contribute in assessing the effect of different access link capacities on performance of a peer-to-peer file sharing system. In order to make ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS-aware content management in P2P networks

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

    Peer-to-peer (P2P) file sharing applications consist of nodes that share part of their local memory. A node can download a file (also called content,) from another node participating to the P2P community, and must allow others to download files stored in its own shared local memory. Since nodes join and leave the P2P community at their will in an uncoordinated way, copies of the same file must be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative evaluation of unstructured peer-to-peer architectures

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

    This paper provides an extensive performance evaluation of the main features of current unstructured super-peer P2P architectures. It quantifies the performance benefits of each feature over the previously proposed community-based message flooding protocol. Our main results show that the hierarchical super-peer architecture itself and a content-aware query routing mechanism are each responsible fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Peer-to-peer workload characterization: techniques and open issues

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

    The popularity of peer-to-peer file sharing networks has attracted multiple interests even in the research community. In this paper, we focus on workload characterization of file-sharing systems that should be at the basis of performance evaluation and investigations for possible improvements. The contribution of this paper is twofold: first, we provide a classification of related studies on file-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Creating overlay data structures with the TOTA middleware to support content-based routing in mobile P2P networks

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

    Content-based routing is a very useful and efficient interaction mechanism in a wide range of peer-to-peer network scenarios. Here we show how the TOTA ("Tuples On The Air") middleware can be effectively exploited to build and maintain those overlay data structures involved in content-based routing in mobile peer-to-peer networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PerDiS: a scalable resource discovery service for the ISAM pervasive environment

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

    This paper presents the PerDiS model for resource discovery in the scope of the ISAM architecture, ISAM aims to provide an integrated solution, from the development to the execution, for general-purpose pervasive applications. PerDiS considers a set of new requirements imposed by pervasive computing for resource discovery. In this paper, we emphasize the scalability issues and we propose a discove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SHARK, a multi-agent system to support document sharing and promote collaboration

    Publication Year: 2004, Page(s):86 - 93
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    This paper describes SHARK, a document-sharing multiagent application providing users with a means to share documents and allowing keyword-based search. SHARK's agents operate transparently-with respect to the user-by analysing (i) user's personal documents and (i) user's actions performed during Web browsing. Activity (i) aims at categorising users' documents, in order to allow keyword-based sear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Chord for meta-data management in the N3FS distributed file system

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

    In this paper we present two alternative ways of implementing a meta-data management subsystem for the N3FS distributed file system using Chord. In order to obtain high availability in presence of node failures and network losses, we develop solutions based either on replication or on redundancy. In order to assess the relative merits of these alternatives in terms of performance and availability,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a secure dynamic allocation of files in large scale distributed file systems

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

    In this paper we consider large distributed systems in which objects are shared among several users. Our focus is on peer-to-peer (P2P) systems and, specifically, we present an adaptive algorithm for file fragments allocation on multiple servers belonging to a P2P network, derived from the adaptive data replication (ADR) algorithm by Wolf-son and Jajodia. While the ADR algorithm handles replicas o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability of data in structured peer-to-peer systems

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

    Peer-to-peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose distributed hash tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distribution and retrieval of data. Thereby a common assumption of P2P systems is, that the participating nodes are unreliable and may fail at any time. Since many of research goes into th... View full abstract»

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

    Publication Year: 2004, Page(s): 115
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE