Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)

2-5 Sept. 2007

Filter Results

Displaying Results 1 - 25 of 47
  • Seventh IEEE International Conference on Peer-to-Peer Computing - Cover

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

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

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

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

    Publication Year: 2007, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (28 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organizers

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

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

    Publication Year: 2007, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2007, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Rescuing Tit-for-Tat with Source Coding

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

    Tit-for-tat is widely believed to be the most effective strategy to enforce collaboration among selfish users. However, it has been shown that its usefulness for decentralized and dynamic environments such as peer-to-peer networks is marginal, as peers can rapidly end up in a deadlock situation. Many proposed solutions to this problem are either less resilient to freeloading behavior or induce a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies

    Publication Year: 2007, Page(s):11 - 18
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies and obtain theoretical bounds on the performance of any P2P network employing such strategies. These are fundamental limitations that stem from peers unwillingness to cooperate without getting something in return. We sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling Real P2P Networks: The Effect of Altruism

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

    We develop a model of the interaction of rational peers in an incentive-free peer-to-peer (P2P) network and use game theoretic analysis to derive results about peer and network behavior. We calculate and discuss Nash equilibria and predict peer behavior in terms of individual contribution. At the heart of our model is altruism, an intrinsic parameter reflecting peers inherent willingness to contri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Information-Theoretic Framework for Analyzing Leak of Privacy in Distributed Hash Tables

    Publication Year: 2007, Page(s):27 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about other nodes in the system and therefore compromise privacy. In this paper, we use information theory to build a model to quantify the information leak from compromised routing tables for a given DHT with certain routing g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Attacking a Swarm with a Band of Liars: evaluating the impact of attacks on BitTorrent

    Publication Year: 2007, Page(s):37 - 44
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (889 KB) | HTML iconHTML

    BitTorrent has become one of the most popular Internet applications, given the number of users and the fraction of the Internet traffic it consumes. Its wide adoption has exposed some potential problems, like selfish peer behavior. Related research efforts so far have focused on modeling the dynamics of swarms, as well as devising incentive mechanisms that improve fairness without sacrificing effi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Trust-Based Exchange Framework for Multiple Services in P2P Systems

    Publication Year: 2007, Page(s):45 - 52
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    In this paper we propose fully distributed trust-based policies for p2p systems to regulate the exchange of different type of services and discourage misbehaviour. In a system of peers with different service valuations and capabilities, the resource allocation and server selection policies are based on local reputation vectors, whose elements are the reputations of the peers in providing each serv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reputation Systems for Fighting Pollution in Peer-to-Peer File Sharing Systems

    Publication Year: 2007, Page(s):53 - 60
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (279 KB) | HTML iconHTML

    Content pollution is a de facto problem in several currently popular Peer-to-Peer file sharing systems. Previously proposed strategies to fight content pollution include a peer reputation system named Scrubber as well as the alternative Credence object reputation system. This paper builds on previous work into three directions. First, it evaluates the cost-effectiveness of Scrubber and Credence in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Feasibility Study on Defending Against Ultra-Fast TopologicalWorms

    Publication Year: 2007, Page(s):61 - 70
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    Self-propagating worms have been terrorizing the Internet for several years and they are becoming imminent threats to large-scale Peer-to-Peer (P2P) systems featuring rich host connectivity and popular data services. In this paper, we consider topological worms, which exploit P2P host vulnerabilities and topology information to spread in an ultra-fast way. We study the feasibility of leveraging th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness Estimation of Range Queries in Structured Overlays

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

    Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be utilized in order to provide efficient techniques for processing them, resulting in the support of applications and techniques based on range queries in large-scale distributed information systems. But, due to the limited... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting Query Duplication with Box-Jenkins Models and Its Applications

    Publication Year: 2007, Page(s):79 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB) | HTML iconHTML

    Many previous works of Peer-to-Peer traffic characterization and modeling focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper characterizes query traffic by using automatic time series analysis to evaluate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search

    Publication Year: 2007, Page(s):87 - 96
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (653 KB) | HTML iconHTML

    Location based services are becoming increasingly popular as devices that determine geographical position become more available to end users. The main problem of existing solutions to location-based search is keeping information updated requires centralized maintenance at specific times. Therefore, retrieved results do not include all objects that exist in reality. A peer-to-peer (P2P) approach ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Price of Structured Routing and Its Mitigation in P2P Systems under Churn

    Publication Year: 2007, Page(s):97 - 104
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB) | HTML iconHTML

    We study the resilience of structured peer-to-peer (P2P) networks in the presence of churn. Using the lifetime-based failure assumptions, we first show that a realistic churn model has an equivalent uniform failure model in the steady state. We then determine via percolation analysis and simulation the gap between the size of the connected component and the reachable component of a randomly picked... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Eigenvalue-based P2P XML Routing Framework

    Publication Year: 2007, Page(s):105 - 112
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    Many emerging applications that use XML are distributed, usually over large peer-to-peer (P2P) networks on the Internet. The deployment of an XML query shipping system over P2P networks requires a specialized synopsis to capture XML data in routing tables. In this paper, we propose a novel eigenvalue-based routing synopsis for deployment over unstructured P2P networks. Based on well-established Ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Routing in Distributed Hash Tables

    Publication Year: 2007, Page(s):113 - 122
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    There have been many proposals for constructing routing tables for distributed hash tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allow order-preserving hash functions that lead to a skewed peer distribution in the identifier space. Good solutions for group A have been known fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An End-to-End Solution to Scalable Unstructured P2P Networking

    Publication Year: 2007, Page(s):123 - 131
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    Despite many improvements on original unstructured P2P networks, these systems still suffer from many problems, the most important of which are, (a) lack of guarantees on the integrity of the network topology in the face of churns, (b) excessive traffic cost, and (c) poor quality of search results. This paper introduces an end-to-end scalable unstructured P2P networking solution called SUPNET to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handling Network Partitions and Mergers in Structured Overlay Networks

    Publication Year: 2007, Page(s):132 - 139
    Cited by:  Papers (4)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB) | HTML iconHTML

    Structured overlay networks form a major class of peer- to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been ... View full abstract»

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