Compression and Quantitative Analysis of Buffer Map Message in P2P Streaming System

TL;DR

This paper introduces a novel buffer map compression scheme for P2P streaming systems that nearly eliminates redundancy, backed by theoretical limits and validated through real-world trace analysis, significantly improving message efficiency.

Contribution

The paper presents an original compression scheme for buffer messages that approaches theoretical limits and demonstrates its effectiveness through simulation and trace analysis.

Findings

The new scheme nearly removes all redundant information from buffer messages.

Theoretical limits of compression rates are established based on information theory.

Simulation results show superior compression ratios compared to existing methods.

Abstract

BM compression is a straightforward and operable way to reduce buffer message length as well as to improve system performance. In this paper, we thoroughly discuss the principles and protocol progress of different compression schemes, and for the first time present an original compression scheme which can nearly remove all redundant information from buffer message. Theoretical limit of compression rates are deduced in the theory of information. Through the analysis of information content and simulation with our measured BM trace of UUSee, the validity and superiority of our compression scheme are validated in term of compression ratio.