On the Cost of Participating in a Peer-to-Peer Network

在点对点内容分发网络中通过优化短视频排序和传输调度以减少视频交付成本

Optimal Short Video Ordering and Transmission Scheduling for Reducing Video Delivery Cost in Peer-to-Peer CDNs

本文提出通过优化短视频排序和传输调度，利用服务器驱动播放序列的灵活性，在点对点内容分发网络中减少视频交付成本。

MPO: An Efficient and Low-cost Peer-to-Peer Overlay for Autonomic Communications

The term Autonomic Communication (AC) refers to self-managing systems which are capable of supporting self-configuration, self-healing and self-optimization. However, information reflection and collection, lack of centralized control, non-cooperation and so on are just some of the challenges within AC systems. We have considered these problems in theory and practice and reached the following conclusion; in order to build an ideal system for autonomic communication, there are three key problems to be solved. Motivated by the need for AC, we have designed an efficient and low-cost Peer-to-Peer (…

fybrrStream: A WebRTC based Efficient and Scalable P2P Live Streaming Platform

The demand for streaming media and live video conferencing is at peak and expected to grow further, thereby the need for low-cost streaming services with better quality and lower latency is essential. Therefore, in this paper, we propose a novel peer-to-peer (P2P) live streaming platform, called fybrrStream, where a logical mesh and physical tree i.e., hybrid topology-based approach is leveraged for low latency streaming. fybrrStream distributes the load on participating peers in a hierarchical manner by considering their network bandwidth, network latency, and node stability. fybrrStream cost…

Peer-to-Peer Network Simulators: an Analytical Review

Simulators are the most dominant and eminent tool for analyzing and investigating different type of networks. The simulations can be executed with less cost as compared to large scale experiment as less computational resources are required and if the simulation model is carefully designed then it can be more practical than any well brought-up mathematical model. Generally P2P research is based on the principle of simulate first and then experiment in the real world and there is no reason that simulation results cannot be reproducible. A lack of standard documentation makes verification of resu…

CUP: Controlled Update Propagation in Peer-to-Peer Networks

Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. This paper proposes CUP, a new comprehensive architecture for Controlled Update Propagation in peer-to-peer networks. CUP asynchronously builds caches of index entries while answering search queries. It then propagates updates of index entries to maintain these caches. Under unfavorable co…

A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems

Random hashing is a standard method to balance loads among nodes in Peer-to-Peer networks. However, hashing destroys locality properties of object keys, the critical properties to many applications, more specifically, those that require range searching. To preserve a key order while keeping loads balanced, Ganesan, Bawa and Garcia-Molina proposed a load-balancing algorithm that supports both object insertion and deletion that guarantees a ratio of 4.237 between the maximum and minimum loads among nodes in the network using constant amortized costs. However, their algorithm is not straightforwa…

Estimating Self-Sustainability in Peer-to-Peer Swarming Systems

Peer-to-peer swarming is one of the \emph{de facto} solutions for distributed content dissemination in today's Internet. By leveraging resources provided by clients, swarming systems reduce the load on and costs to publishers. However, there is a limit to how much cost savings can be gained from swarming; for example, for unpopular content peers will always depend on the publisher in order to complete their downloads. In this paper, we investigate this dependence. For this purpose, we propose a new metric, namely \emph{swarm self-sustainability}. A swarm is referred to as self-sustaining if al…

On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks

Random linear network coding can be used in peer-to-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are particularly susceptible to Byzantine attacks. We quantify the impact of Byzantine attacks on the coded system by evaluating the probability that a receiver node fails to correctly recover a file. We show that even for a small probability of attack, the system fails with overwhelming probability. We then propose a novel signature scheme that allows packet-level Byzantine detection. This scheme allows one-hop containment of the …

MVP2P: Layer-Dependency-Aware Live MVC Video Streaming over Peer-to-Peer Networks

Multiview video supports observing a scene from different viewpoints. The Joint Video Team (JVT) developed H.264/MVC to enhance the compression efficiency for multiview video, however, MVC encoded multiview video (MVC video) still requires high bitrates for transmission. This paper investigates live MVC video streaming over Peer-to-Peer (P2P) networks. The goal is to minimize the server bandwidth costs whist ensuring high streaming quality to peers. MVC employs intra-view and inter-view prediction structures, which leads to a complicated layer dependency relationship. As the peers' outbound ba…

A Game Theoretic Analysis of Incentives in Content Production and Sharing over Peer-to-Peer Networks

User-generated content can be distributed at a low cost using peer-to-peer (P2P) networks, but the free-rider problem hinders the utilization of P2P networks. In order to achieve an efficient use of P2P networks, we investigate fundamental issues on incentives in content production and sharing using game theory. We build a basic model to analyze non-cooperative outcomes without an incentive scheme and then use different game formulations derived from the basic model to examine five incentive schemes: cooperative, payment, repeated interaction, intervention, and enforced full sharing. The resul…

A Motivational Game-Theoretic Approach for Peer-to-Peer Energy Trading in the Smart Grid

Peer-to-peer trading in energy networks is expected to be exclusively conducted by the prosumers of the network with negligible influence from the grid. This raises the critical question: how can enough prosumers be encouraged to participate in peer-to-peer trading so as to make its operation sustainable and beneficial to the overall electricity network? To this end, this paper proposes how a motivational psychology framework can be used effectively to design peer-to-peer energy trading to increase user participation. To do so, first, the state-of-the-art of peer-to-peer energy trading literat…

面向对等能源交易的网络感知异步分布式ADMM算法

Network-Aware Asynchronous Distributed ADMM Algorithm for Peer-to-Peer Energy Trading

针对现有分布式能源交易优化依赖同步通信、不符合实际的问题，提出考虑网络约束的异步分布式ADMM算法，支持异步通信与延迟，经真实数据仿真验证可收敛且能降低产消者用能成本。