Peer-to-peer streaming has witnessed a great success, thanks to the possibility of aggregating resources from all participants. However, performance of the entire system may be highly degraded due to the presence of malicious peers that share bogus data on purpose. In a peer-to-peer (P2P) streaming system, since each peer needs to participate in uploading data to other peers, malicious peers ma...

Agents in a peer-to-peer system typically have incentives to influence its network structure, either to reduce their costs or increase their ability to capture value. The problem is compounded when agents can join and leave the system dynamically. This paper proposes three economic mechanisms that offset the incentives for strategic behavior and facilitate the formation of networks with desirab...

Traffic engineering in P2P networks deals with organizing overlay networks. The challenge of unavailability has not been mastered yet. Considering the resource allocation can gain further improvements. While adapting P2P file sharing onto mobile infrastructures, we learned that replication is a solution to both issues: availability and traffic optimization.

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

We study unlimited infinite churn in peer-to-peer overlay networks. Under this churn, arbitrary many peers may concurrently request to join or leave the overlay network; moreover these requests may never stop coming. We prove that unlimited adversarial churn, where processes may just exit the overlay network, is unsolvable. We focus on cooperative churn where exiting processes participate in th...

Peer-to-peer systems can benefit from a service that delivers multicasts in a consistent manner to applications and other services. ScopeCast offers such a service. It does not assume membership is static or known, nor require logical or physical infrastructure for support. It allows users and applications to force (manually or via timeouts, etc.) delivery of received messages when congestion o...

Probabilistic flooding has been proposed as a means of reducing the excessive message overheads induced by plain flooding in unstructured peer-to-peer network search. We propose here Advanced Probabilistic Flooding (apf), a novel strategy which operates differently from other known strategies. In particular, the decision of a node to propagate a message (or not) is based on both the popularity ...

The growing online traffic that is bringing the infrastructure to its limits induces an urgent demand for an efficient content delivery model. Capitalizing social networks and using advanced delivery networks potentially can help to solve this problem. However, due to the complex nature of the involved networks such a model is difficult to assess. In this paper we use a simulative approach to a...

Both in terms of number of participating users and in traffic volume, FastTrack is one of the most important applications in the Internet today. Nevertheless, because FastTrack is proprietary and uses encryption, little is understood about FastTrack s overlay structure and dynamics, its messaging protocol, and its index management. We have built two measurement apparatus—the FastTrack Sniffing ...

The existence of a high degree of free riding in Peer-to-Peer (P2P) networks is an important threat that should be addressed while designing P2P protocols. In this paper we propose a connection-based solution that will help to reduce the free riding effects on a P2P network and discourage free riding. Our solution includes a novel P2P connection type and an adaptive connection management protoc...