By Topic

Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)

Date 6-8 Sept. 2006

Filter Results

Displaying Results 1 - 25 of 48
  • Sixth IEEE International Conference on Peer-to-Peer Computing - Cover

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

    Publication Year: 2006, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Sixth IEEE International Conference on Peer-to-Peer Computing - Copyright

    Publication Year: 2006, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Sixth IEEE International Conference on Peer-to-Peer Computing - TOC

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

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

    Publication Year: 2006, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2006, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2006, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System

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

    Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave events per second. In this paper we introduce eQuus, a novel distributed hash table (DHT) suitable for highly dynamic environments. eQuus guarantees that lookups are always fast - in terms of both the delay and the total n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles

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

    This paper presents GosSkip, a self organizing and fully distributed overlay that provides a scalable support to data storage and retrieval in dynamic environments. The structure of GosSkip, while initially possibly chaotic, eventually matches a perfect set of Skip-list-like structures, where no hash is used on data attributes, thus preserving semantic locality and permitting range queries. The us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2Fast : Collaborative Downloads in P2P Networks

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

    P2P systems that rely on the voluntary contribution of bandwidth by the individual peers may suffer from free riding. To address this problem, mechanisms enforcing fairness in bandwidth sharing have been designed, usually by limiting the download bandwidth to the available upload bandwidth. As in real environments the latter is much smaller than the former, these mechanisms severely affect the dow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download

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

    The performance of peer-to-peer (P2P) content distribution networks depends highly on the coordination of the peers. Sophisticated cooperation strategies, such as the multiple source download, are the foundation for efficient file exchange. The detailed performance of the strategies are determined by the peer characteristics and the peer behaviour, such as the number of parallel upload connections... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth Trading in Unstructured P2P Content Distribution Networks

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

    Bandwidth trading schemes give peers an incentive to provide upload bandwidth to other peers in a P2P network for fast file distribution. A popular example is the tit-for-tat strategy used in the BitTorrent protocol. Although this game theoretical scheme provides an incentive to peers to contribute resources to the network it does not prevent unfairness and the performances of peers vary considera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cuckoo Ring: BalancingWorkload for Locality Sensitive Hash

    Publication Year: 2006, Page(s):49 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB) | HTML iconHTML

    Locality sensitive hash (LSH) is widely used in peer-to-peer (P2P) systems. Although it can support range or similarity queries, it breaks the load balance mechanism of traditional distributed hash table (DHT) based system by replacing consistent hash with LSH. To solve the imbalance problem, current systems either weaken the locality preserve ability from similarity preserved to order preserved o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables

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

    To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly routing lookups. Unfortunately, malicious participants can abuse these responsibilities to deny access to a set of keys or misroute lookups. We look to address both of these problems through replica placement. Using Chord as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-Dimensional Prefix Search in P2P Networks

    Publication Year: 2006, Page(s):67 - 68
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    We present a simple yet novel technique for prefix search in P2P networks. The idea is to extract characters and their position information in a keyword to index objects. Our index scheme can achieve quite balanced loads, avoid hop-spots and single point of failure, reduce storage and maintenance costs, and offer some ranking mechanisms for matching objects. We use 2.412.613 CD records collected i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Route Fingerprinting in Anonymous Communications

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

    Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only gain random knowledge of part of the network, their traffic can be detected by the uniqueness of the information they have learnt. We discuss this problem, which occurred in the initial design of Tarzan, and other related... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schema Caching for Improved XML Query Processing in P2P Systems

    Publication Year: 2006, Page(s):73 - 74
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (99 KB) | HTML iconHTML

    The advent and popularity of the World Wide Web (WWW) has enabled access to a variety of semi-structured data and, when available, this data follows some common XML schema. On the other hand the distribution of content has made centralized solutions inappropriate, entering the era of peer-to-peer (P2P) computing, where content is stored in XML databases residing on peers. In this paper, we propose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Overlay Mismatching of Unstructured P2P Networks using Physical Locality Information

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

    This paper addresses overlay topology mismatching problem by presenting "AM", an effective way to measure nodes' relative distance and a technique called "CTAG" to construct topology-aware Gnutella overlay. The approach excels in sending no extra messages to probe the target nodes, avoiding the extra traffic and delay time, while keeping the necessary accuracy View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tag Indexed DHT for Scalable Search Infrastructure in Social NetworkApplications

    Publication Year: 2006, Page(s):77 - 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (105 KB) | HTML iconHTML

    Social applications associate a set of user defined keywords named tags when publishing social objects in order to locate them later. We propose T-DHT, a hybrid unstructured-structured DHT based approach, to cope with the high demanding requirements of social applications, in a fully scalable, distributed and balanced way. T-DHT behaves as a structured DHT when publishing "tag, social-object" asso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-Aware Processing of Similarity Queries in Structured Overlays

    Publication Year: 2006, Page(s):81 - 89
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (197 KB) | HTML iconHTML

    Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users agree on exactly the same schema and value representations and data quality problems due to spelling errors and typos. In this paper, we present an approach for efficient processing of similarity selections and joins in a structured overlay. We show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conjunction Dysfunction: The Weakness of Conjunctive Queries in Peer-to-Peer File-sharing Systems

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

    Peers in peer-to-peer file-sharing systems use conjunctive queries as a way of controlling query cost in the absence of information about the behavior of other peers. Conjunctive queries are good at increasing the precision of query result sets, but may be overly selective, decreasing overall performance. We consider relaxing the conjunctive matching criterion and its impact on performance and cos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of Image Similarity Queries in P2P Systems

    Publication Year: 2006, Page(s):98 - 105
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Given some of the recent advances in distributed hash table (DHT) based peer-to-peer (P2P) systems we ask the following questions: are there applications where unstructured queries are still necessary (i.e., the underlying queries do not efficiently map onto any structured framework), and are there unstructured P2P systems that can deliver the high bandwidth and computing performance necessary to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Prefix Tree for Service Discovery within Large Scale Grids

    Publication Year: 2006, Page(s):106 - 116
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (307 KB) | HTML iconHTML

    Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ordered Slicing of Very Large-Scale Overlay Networks

    Publication Year: 2006, Page(s):117 - 124
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (317 KB) | HTML iconHTML

    Recently there has been an increasing interest to harness the potential of P2P technology to design and build rich environments where services are provided and multiple applications can be supported in a flexible and dynamic manner. In such a context, resource assignment to services and applications is crucial. Current approaches require significant "manual-mode" operations and/or rely on centrali... View full abstract»

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