The assumptions on which peer-to-peer computing has grown are wildly different than those underlying Grid computing. Peer-to-peer systems have evolved to support resource sharing in an environment characterised by users potentially numbering millions, most with homogenous desktop systems and low bandwidth, intermittent connections to the Internet. As such, the emphasis has been on global fault-...

Basic P2P routing algorithms require log(n) hops to route a message in a geographically distributed network. High latency of basic P2P routes is often unacceptable for delay-sensitive applications such as interactive browsing. Additional routing information at a node could help to reduce the latency at an expense of larger routing tables. We propose cyclic routing as a new approach to balance t...

Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuousl...

Shared ride systems match the travel demand of transport clients with the supply by vehicles, or hosts, such that the clients find rides to their destinations. A peer-to-peer shared ride system allows clients to find rides in an ad-hoc manner, by negotiating directly with nearby hosts via radio-based communication. Such a peer-to-peer shared ride system has to deal with various types of hosts, ...

Peer-to-peer systems have reached a widespread use, ranging from academic and industrial applications to home entertainment. The key advantage of this paradigm lies in its scalability and flexibility, consequences of the participants sharing their resources for the common welfare. Security in such systems is a desirable goal. For example, when mission-critical operations or bank transactions ar...

In most application scenarios for Peer-to-Peer systems, in order to achieve an overall acceptable system performance an incentive scheme is required that motivates users to share as much as possible of their free resources Today most peers use connections of asymmetric links, such as A-DSL or cable modems. Therefore, users have significantly more download bandwidth than their available upload b...

Peer-to-Peer systems have become, in a short period of time, one of the fastest growing and most popular applications. The decentralized and distributed nature of p2p systems leads to living aside the client-server model. In p2p model each node takes both the roles of client and server. As a client, it can query and download its wanted data files from other nodes and as a server, it can provide...

Peer-to-Peer systems have often been advertised to as being “self-organizing”. This has become a somewhat elusive property with meaning and significance being far from clear. Answers sought in this research therefore focused on questions like: How well is self-organization understood in terms of peer-to-peer systems? How much self-organization is there really? How can, if at all, mechanisms of ...

Peer-to-Peer systems have become a focus of distributed computing these years. Document discovery is a key problem in this field. In this paper, abstract indices are proposed for content-based information retrieval in Peer-to-Peer systems, especially for multimedia documents. Abstract information is extracted from the shared documents of each peer, then the similar documents on other peers can ...