Structured peer-to-peer (P2P) overlay networks like Distributed Hash Tables (DHTs) map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Thus, a load balancing mechanism is an indispensable part of a structured P2P overlay network for high performance. The rapid development of P2P systems has posed challeng...

A iming to ease the problems associated with making a variety of items available to multiple users over the Internet, peer-to-peer (P2P) systems create fully decentralized systems. By involving lots of peers, computational and storage capabilities increase; moreover, data replication, caching, and efficient query routing enhance overall performance. P2P systems can reduce complexity because eac...

Yiming Hu 38.

Second generation peer-to-peer systems [5, 6] have shown a lot of promise with many desirable properties such as scalability, self-configuration, automatic load balancing etc. However the open nature of these systems also makes them vulnerable to Byzantine attacks. These systems are designed to be fault tolerant in the presence of a few malicious nodes. We however believe that even a handful of...

As IP addresses have become a scarce resource most computers on the Internet no longer have permanent addresses. For client computers this is usually not a big problem but with the advent of P2P systems, where every computer acts both as a client and as a server, this has become increasingly problematic. In advanced P2P systems ad-hoc connections to peers have to be established, which can only ...

Peer to peer systems are frequently incurred more expense in terms of efficiency transfer and several systems make an effort to cover the uniqueness privacy considerations issues for their users. An anonymity approach mostly existing path base peer before transmits, it has pre-create an anonymous path. An information as well as maintenance transparency of path is a lot high. We proposed mutual ...

Large-scale distributed applications are becoming more and more demanding in terms of efficiency and flexibility of the technological infrastructure, for which traditional solutions based on the client/server paradigm are not suitable. The peer-to-peer paradigm provides an appealing solution to this problem, allowing to deploy robust networks of collectors, providers and consumers of resources....

Applying information retrieval techniques in peer-to-peer infrastructures is a demanding challenge. Peer-to-peer systems are already being used for a vast number of applications in content exchange, but mostly searching is done by simple keyword lookups. In contrast, information Retrieval techniques vastly differ from retrieval in pure data management systems. Information retrieval means that n...

Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or ooding the network with queries. In this paper we introduce the concept of Routing Indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. If a node cannot answer a query, it forwards the query to a subset of its neighbors, based on its ...

In Peer-to-Peer data sharing systems, peers typically play equal roles and have equal capabilities. From the service perspective, peers provide a single service. For this reason, there is no need to explicitly model services. We argue, that for knowledge sharing systems, we need an effective combination of the capabilities of the peers both in terms of the services as well as the content they p...