Assuming that NP \not⊆ ϵ>0 BPTIME (2^n^ϵ), we show that graph min-bisection, dense k-
subgraph, and bipartite clique have no polynomial time approximation scheme (PTAS). We …

Researchers have used the simulation technique to develop new networks and test, modify,
and optimize existing ones. The scientific community has developed a wide range of …

As scientists, our research must be tested and evaluated in order for it to be shown to be
valid. Part of this process includes providing reproducible results so that peers are able to …

The last few years have witnessed the appearance of a growing number of peer-to-peer
(P2P) file sharing systems. Such systems make it possible to harness the resources of large …

Peer-to-Peer (P2P) systems have become popular over the past few years. However, their
large scale and the open nature of the system makes studying them challenging. This paper …

Peer-to-peer (P2P) networking is widely used to exchange, contribute, or obtain files from
any participating user. Building trust relationships between peers in a large-scale distributed …

Reputation management (RM) is employed in distributed and peer-to-peer networks to help
users compute a measure of trust in other users based on initial belief, observed behavior …

We present a peer-level protocol for forming adaptive, self-organizing topologies for data-
sharing P2P networks. This protocol is based on the idea that a peer should directly connect …

Abstract Peer-to-peer (P2P) technology has undergone rapid growth, producing new
protocols and applications, many of which enjoy considerable commercial success and …

Superpeer architectures exploit the heterogeneity of nodes in a peer-to-peer (P2P) network
by assigning additional responsibilities to higher capacity nodes. In the design of a …