Group-Based Reduction Schemes for Streaming Applications. (13th July 2011)

• Record Type: Journal Article
• Authors: Bernardini, Riccardo; Cesco Fabbro, Roberto; Rinaldo, Roberto
• Other Names: Agrawala A. K. Academic Editor.; Hasegawa G. Academic Editor.; Park E.-C. Academic Editor.; Sesay A. B. Academic Editor.
• Is Part Of: ISRN communications and networking. Volume 2011(2011)
• Publication Date: 2011-07-13
• Subjects: Communication -- Periodicals; Computer networks -- Periodicals; Telecommunication -- Periodicals; Communication; Computer networks; Telecommunication; Electronic journals; Electronic journals; Periodicals; 004.6
• DOI: 10.5402/2011/898254
• Languages: English
• ISSNs: 2090-4355

Abstract

Abstract : 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.