The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] peer-to-peer overlay(2hit)

1-2hit
  • Cooperative Resource Pricing in Service Overlay Networks for Mobile Agents

    Tadashi NAKANO  Yutaka OKAIE  

     
    LETTER-Network

      Vol:
    E93-B No:7
      Page(s):
    1927-1930

    The success of peer-to-peer overlay networks depends on cooperation among participating peers. In this paper, we investigate the degree of cooperation among individual peers required to induce globally favorable properties in an overlay network. Specifically, we consider a resource pricing problem in a market-oriented overlay network where participating peers sell own resources (e.g., CPU cycles) to earn energy which represents some money or rewards in the network. In the resource pricing model presented in this paper, each peer sets the price for own resource based on the degree of cooperation; non-cooperative peers attempt to maximize their own energy gains, while cooperative peers maximize the sum of own and neighbors' energy gains. Simulation results are presented to demonstrate that the network topology is an important factor influencing the minimum degree of cooperation required to increase the network-wide global energy gain.

  • Mirinae: A Peer-to-Peer Overlay Network for Content-Based Publish/Subscribe Systems

    Yongjin CHOI  Daeyeon PARK  

     
    PAPER-Network

      Vol:
    E89-B No:6
      Page(s):
    1755-1765

    Content-based publish/subscribe systems provide a useful alternative to traditional address-based communication due to their ability to decouple communication between participants. It has remained a challenge to design a scalable overlay supporting the complexity of content-based networks, while satisfying the desirable properties large distributed systems should have. This paper presents the design of Mirinae, a new structured peer-to-peer overlay mesh based on the interests of peers. Given an event, Mirinae provides a flexible and efficient dissemination tree minimizing the participation of non-matching nodes. We also present a novel ID space transformation mechanism for balancing routing load of peers even with highly skewed data, which is typical of the real world. Our evaluation demonstrates that Mirinae is able to achieve its goals of scalability, efficiency, and near-uniform load balancing. Mirinae can be used as a substrate for content-search and range query in other important distributed applications.