In order to overcome the problem of free-riding in current P2P system, we suggest applying social network theory. Based on our exploration of the overlapping research fields of social networks and peer-to-peer networks, we propose a new P2P framework within this paper. It specifies social network information that can be used in a P2P system to avoid performance inefficiencies caused by free-rid...

A substantial number of massive large-scale applications require scalable underlying network topologies. Nowadays structured Peer-to-Peer overlay networks meet these requirements very well. But there is still a need to decide which of these overlay networks is most suitable for providing the best possible performance for a certain application. This paper describes SimCon a simulation environmen...

Peer-to-Peer (P2P) networks provide a significant solution for file sharing among peers connected to Internet. It is fast and completely decentralised system with robustness. But due to absence of a server documents on a P2P network are not rated which makes it difficult for a peer to obtain precise information in result of a query. In past, some researchers tried to attach ratings to the peers...

Peer-to-peer overlay networks present new opportunities and challenges for achieving enhanced network functionality at the application level. In this paper we study the impact of point-to-point network latency on flooding broadcast operations in peer-topeer overlay networks. We show that two standard protocol mechanisms, used to control the amount of network resources used during flooding, can ...

Network Address Translation (NAT) causes well-known dif culties for peer-to-peer (P2P) communication, since the peers involved may not be reachable at any globally valid IP address. Several NAT traversal techniques are known, but their documentation is slim, and data about their robustness or relative merits is slimmer. This paper documents and analyzes one of the simplest but most robust and p...

As Peer-to-Peer (P2P) networks become popular, there is an emerging need to collect a variety of statistical summary information about the participating nodes. The P2P networks of today lack mechanisms to compute even such basic aggregates as MIN, MAX, SUM, COUNT or AVG. In this paper, we define and study the NODEAGGREGATION problem that is concerned with aggregating data stored at nodes in the...

Assessing the performance of peer-to-peer algorithms such as topology construction protocols, distributed trust or search algorithms is impossible without simulations since testing new algorithms by deploying them in an existing P2P network is prohibitively expensive. However, some P2P algorithms are sensitive to the network and traffic models that are used in the simulations. In order to produ...

Peer-to-peer file sharing systems now generate a significant portion of Internet traffic. A good understanding of their workloads is crucial in order to improve their scalability, robustness and performance. Previous measurement studies on Kazaa and Gnutella were based on monitoring peer requests, and mostly concerned with peer and file availability and network traffic. In this paper, we take d...