Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in P2P resource sharing environments is efficient searching algorithm. This is especially important for Gnutella-like decentralized and unstructured networks since they have power-law degree distributions. A robust search algorithm should respond to the query message promptly without gene...

One of the most popular P2P applications on the internet is P2P media streaming. Finding nearby peer over the internet is challenging job in live media streaming because it is time constrained application and nearest neighbors have to discover as quickly as possible. Objective of media streaming is low latency, QoS and scalability. For applications like Gnutella, finding the nearest peer can re...

Peer-to-peer (p2p) systems are a fairly recent class of distributed systems. Early systems, such as Napster and SETI@Home, rely on a central server, while more recent systems like Gnutella and FastTrack are decentralized. One can also include “server peer-to-peer” systems, including USENET, MixMaster remailers and internet routing. As is common with new technologies, practice is significantly a...

Peer-to-Peer (P2P) File sharing Applications are responsible for a large amount of the (illegal) distribution of media content which systematically causes copyright infringements. In order to estimate a possible economical influence, it seems to be feasible to analyse the content of those systems. Firstly, the paper on hand describes theoretical P2P architectures in order to shed light on the p...

Many communication and social networks have power-law link distributions, containing a few nodes that have a very high degree and many with low degree. The high connectivity nodes play the important role of hubs in communication and networking, a fact that can be exploited when designing efficient search algorithms. We introduce a number of local search strategies that utilize high degree nodes...

The limitations of client/server systems become evident in an Internet-scale distributed environment. Peer-topeer (P2P) systems offer an interesting alternative to traditional client/server systems: Every node acts both as a client and a server and “pays” its participation by providing access to its computing resources. Systems such as Napster and Gnutella have proven their practical applicabil...

Recently, peer-to-peer applications have become very popular in the Internet. In most cases they are used for file sharing purposes, like the exchange of MP3 files introduced by Napster [1] and evolved by its successors (e.g. Gnutella [2]). The mechanisms these applications are based on work fine for file sharing due to the elastic traffic characteristics. This is not the case for on-demand vid...

In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model that lets us compare routing algorithms for P2P networks overlaying social networks. We propose SPROUT, a DHT routing algorithm that, by using social links, significantly increases the number of query results and reduces...

In this paper, we formulate an analytical model to characterize the spread of malware in decentralized, Gnutella type peer-to-peer (P2P) networks and study the dynamics associated with the spread of malware. Using a compartmental model, we derive the system parameters or network conditions under which the P2P network may reach a malware free equilibrium. The model also evaluates the effect of c...

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...