In this paper we propose an adaptive P2P video streaming framework to address the challenges due to bandwidth heterogeneity and peer churn on the Internet. This adaptive streaming framework consists of two major components, source rate adaptation and adaptive overlay topology formation, to maximize the video quality and fully utilize the overall peer upload capacity. In the source rate adaptati...

Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefits on performance have been recognized, an uneven overlay zone distribution has emerged. Recent work has shown that topology-aware neighbor selection during construction can aggravate the unbalance of zone distribution ...

In this article, we discuss the new constraints that will apply to future, highly dynamic networks and investigate one of the major problems that is likely to affect their deployment: traffic/workload distribution. Starting with a very simple model, we demonstrate that a structure made of undifferentiated subunits will almost inevitably hit a scalability barrier, unless new design rules are app...

Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. They provide efficient and fault-tolerant routing, object location and load balancing within a selforganizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying...

Peer-to-Peer systems form logical overlay networks on top of the Internet. Essentially, peers randomly choose logical neighbours without any knowledge about underlying physical topology. This may cause inefficient communications among peers. This topology mismatch problem may result in poor performance and scalability for Peer-to-Peer systems. A possible way to improve the performance of Peer-t...

Unstructured peer-to-peer network is a prevalent model in current P2P networks. In general, unstructured P2P model divides the sharing file into many chunks. A peer must search the positions before downloads a chunk. Since a peer does not know the global topology of the overlay network and the distributions of the wanted chunks, what he can do is flooding chunk queries without a proper order wh...

The goal of this thesis is to contribute to the development of data localization and summarization techniques in P2P environments. At the application layer, we focus on exploiting the semantics that can be captured from the shared data. These semantics can improve the search efficiency, and allow for more query facilities. To this end, we introduce a novel data indexing technique into P2P syste...

Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building and maintaining the network topology itself as well as to support a pervasive diffusion of the information injected into the network. In this paper, we propose the general architecture of a system that tries to exploit the ...

Networked systems often consist of inter-dependent subsystems that are governed by locally determined heterogeneous preferences or policies. Examples include interdomain routing, peer-to-peer storage, and decentralised security systems. This dissertation introduces a notion called dispute — a cyclic structure that underlies the dependence and preferences of subsystems. Disputes may cause advers...

We introduce a self-stabilizing algorithm that builds and maintains a spanning tree topology on any large scale system. We assume that the existing topology is a complete graph and that nodes may arrive or leave at any time. To cope with the large number of processes of a grid or a peer to peer system, we limit the memory usage of each process to a small constant number of variables, combining ...