By Topic

Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International Conference on

Date 9-11 Sept. 2009

Filter Results

Displaying Results 1 - 25 of 53
  • [Front cover]

    Publication Year: 2009, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (840 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (16 KB)
    Freely Available from IEEE
  • Welcome from the Technical Program Chairs

    Publication Year: 2009, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (584 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organization

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (339 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2009, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • Technical program

    Publication Year: 2009, Page(s):1 - 15
    Request permission for commercial reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • An efficient distributed PKI for structured P2P networks

    Publication Year: 2009, Page(s):1 - 10
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB) | HTML iconHTML

    In decentralized P2P networks, many security mechanisms still rely on a central authority. This centralization creates a single point of failure and does not comply with the P2P principles. We previously proposed a distributed PKI for P2P networks which allows to push security mechanisms to the edges of the network but relies on unaffordable maintenance operations using byzantine agreements. In th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorcery: Could we make P2P content sharing systems robust to deceivers?

    Publication Year: 2009, Page(s):11 - 20
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB) | HTML iconHTML

    Deceptive behaviors of peers in peer-to-peer (P2P) content sharing systems have become a serious problem due to the features of P2P overlay networks such as anonymity, self-organization, etc. This paper presents Sorcery, a novel active challenge-response mechanism based on the notion that one side of interaction with dominant information can detect whether the other side is telling a lie. To make ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SyMon: Defending large structured P2P systems against Sybil attack

    Publication Year: 2009, Page(s):21 - 30
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (531 KB) | HTML iconHTML

    Sybil attack is one of the most challenging problems that plague current decentralized peer-to-peer systems. In Sybil attack, a single malicious user creates multiple peer identities known as sybils. These sybils are employed to target honest peers and hence subvert the system. In this paper, we propose a novel solution that enables all honest peers to protect themselves from sybils with high prob... 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: Is reputation a shelter from malicious behavior and churn?

    Publication Year: 2009, Page(s):31 - 40
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (590 KB) | HTML iconHTML

    Recently, it has been argued that reputation mechanisms could be used to improve routing by conditioning next-hop decisions to the past behavior of peers. However, churn may severely hinder the applicability of reputations mechanisms. In particular, short peer lifetimes imply that reputations are typically generated from a small number of transactions and are few reliable. To examine how high rate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing capacity-heterogeneous unstructured P2P networks for random-walk traffic

    Publication Year: 2009, Page(s):41 - 50
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (838 KB) | HTML iconHTML

    Existing algorithms for utilizing high-capacity nodes in heterogeneous P2P systems (e.g.) often require unrealistically large node degree and high maintenance overhead in P2P networks with highly diverse node capacities and high churn. In this paper, we propose an unstructured P2P system that addresses these issues. We first prove that the overall throughput of search queries in a heterogeneous ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Imbuing unstructured P2P systems with non-intrusive topology awareness

    Publication Year: 2009, Page(s):51 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (673 KB) | HTML iconHTML

    The random nature of unstructured P2P overlays imbues them with enhanced self-* properties. Most of the algorithms which make searching in unstructured P2P systems scalable, such as dynamic querying and 1-hop replication, rely on the random nature of the overlay to function efficiently. However, they do not take into account the structure of the underlying physical communications networ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Direction Routing for overlay networks

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

    The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay networks. Routing and search in these overlay networks have ranged from flooding-based unstructured techniques to structured ones mainly for popular and rate items respectively. In this paper, we propose a new method of establi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximation algorithm for minimum-delay peer-to-peer streaming

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

    Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on end-to-end delays. Obtaining assurances on meeting those delay constraints in dynamic and heterogenous network environments is a challenge. In this paper, we devise a streaming scheme which minimizes the maximum end-to-en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ModelNet: Towards a datacenter emulation environment

    Publication Year: 2009, Page(s):81 - 82
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (139 KB) | HTML iconHTML

    ModelNet is a network emulator designed for repeatable, large-scale experimentation with real networked systems. This talk introduces the ideas behind ModelNet that have made it a successful experimental platform. Beyond these core concepts, the talk highlights the latest additions to our methodology to test the next generation of network protocols and applications. Many of these developments addr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PlanetLab - P2P testing in the wild

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

    PlanetLab is a seasoned Internet testbed for distributed applications consisting of donated nodes located at more than 350 remote locations spread across the globe. It is particularly appropriate for peer-to-peer application research due its large-scale, distributed operation, and the availability of nodes with edge characteristics. This talk describes the basic testbed offering and suggests appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PlanetSim: An extensible simulation tool for peer-to-peer networks and services

    Publication Year: 2009, Page(s):85 - 86
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB) | HTML iconHTML

    We introduce PlanetSim, a discrete event-based simulation framework for peer-to-peer overlay networks and services. It is implemented in Java and provides good qualities for both researchers and developers, such as a strong system development background, as well as modularity, flexibility and clarity on its design and implementation. All this is corroborated by the important community using and su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OverSim: A scalable and flexible overlay framework for simulation and real network applications

    Publication Year: 2009, Page(s):87 - 88
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (374 KB) | HTML iconHTML

    A fundamental problem in studying peer-to-peer networks is the evaluation of new protocols. This commonly involves both the simulation of the protocol in a large-scale network as well as the testing of the protocol in connection with real applications in networks like PlanetLab. To facilitate these tasks we have developed the overlay simulation framework OverSim. It is designed to fulfill a number... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application management and visualization with Plush

    Publication Year: 2009, Page(s):89 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (139 KB) | HTML iconHTML

    Deploying, running, and maintaining applications running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the complexities associated with software configuration and management in these environments. Distributed application management systems are designed to automate the process, and to ultimately help developers cop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building distributed systems using Mace

    Publication Year: 2009, Page(s):91 - 92
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (153 KB) | HTML iconHTML

    Mace, MaceMC and MacePC work together to make it easier to build correct, high performance distributed systems implementations. Mace developers find that it now takes them a fraction of the time previously needed to go from design to implementation of a new distributed system. Together with ModelNet and Plush, the whole toolkit is among the best in the world for implementing, testing, evalu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building and evaluating P2P systems using the Kompics component framework

    Publication Year: 2009, Page(s):93 - 94
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    We present a framework for building and evaluating P2P systems in simulation, local execution, and distributed deployment. Such uniform system evaluations increase confidence in the obtained results. We briefly introduce the Kompics component model and its P2P framework. We describe the component architecture of a Kompics P2P system and show how to define experiment scenarios for large dynamic sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SimGrid: a generic framework for large-scale distributed experiments

    Publication Year: 2009, Page(s):95 - 96
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (150 KB) | HTML iconHTML

    We presented the SimGrid simulation framework whose goal is to provide a generic evaluation tool for large-scale distributed computing. Its main components are: two APIs for researchers who study algorithm and need to prototype simulations quickly, and two for developers who can develop applications in the comfort of the simulated world before deploying them seamlessly in the real world. SimGrid e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ProtoPeer: Distributed systems prototyping toolkit

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

    In ProtoPeer, the developer can switch between the simulation of a P2P system to its deployment on the actual network without changing a single line of code. This dramatically speeds up the implement-evaluate-reimplement cycle and allows for rapid system prototyping. Most of the major bugs and performance problems are caught early on during the simulation while the more time-consuming live deploym... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PeerSim: A scalable P2P simulator

    Publication Year: 2009, Page(s):99 - 100
    Cited by:  Papers (84)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB) | HTML iconHTML

    The key features of peer-to-peer (P2P) systems are scalability and dynamism. The evaluation of a P2P protocol in realistic environments is very expensive and difficult to reproduce, so simulation is crucial in P2P research. PeerSim is an extremely scalable simulation environment that supports dynamic scenarios such as churn and other failure models. Protocols need to be specifically implemented fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust lifetime measurement in large-scale P2P systems with non-stationary arrivals

    Publication Year: 2009, Page(s):101 - 110
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (851 KB) | HTML iconHTML

    Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work has shown that direct sampling of user lifetimes may lead to certain bias (arising from missed peers and round-off inconsistencies) and proposed a technique that estimates lifetimes based on sampled residuals. In this paper, however, we show that under non-s... View full abstract»

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