Table of Contents
ISRN Communications and Networking
Volume 2011, Article ID 898254, 10 pages
Research Article

Group-Based Reduction Schemes for Streaming Applications

DIEGM, University of Udine, Via delle Scienze 208, 33100 Udine, Italy

Received 4 May 2011; Accepted 3 July 2011

Academic Editors: A. K. Agrawala, G. Hasegawa, E.-C. Park, and A. B. Sesay

Copyright © 2011 Riccardo Bernardini et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Some peer-to-peer streaming systems make use of linear codes to reduce the rate of the data uploaded by peers with limited upload capabilities. Such “data reduction” techniques are based on a vector-space approach and produce the data to be uploaded by means of linear combinations of the content data in a suitable finite field. In this paper, we propose a more general approach based on group theory. The new approach, while including the vector space approach as a special case, allows to design schemes that cannot be modeled as linear codes. We analyze the properties of the schemes based on the new approach, showing also how a group-based scheme can be used to prevent stream poisoning and how a group-based scheme can be converted into a secret-sharing scheme. Examples of group-based schemes that cannot be described in the vector-space framework are also shown.