Journal Article

RRG: redundancy reduced gossip protocol for real-time N-to-N dynamic group communication

Lea, Chin-Tau, Luk, Vincent Wing-Hei, Wong, Albert Kai-Sun, Ouyang, Robin Wentao

2013

Overview

Real-time group communication is an indispensable part of many interactive multimedia applications over the internet. In scenarios that involve large group sizes, sporadic sources, high user churns, and random network failures, gossip-based protocols can potentially provide advantages over structure-based group communication algorithms in ease of deployment, scalability, and resiliency against churns and failures. In this paper, we propose a novel protocol called Redundancy Reduced Gossip for real-time N-to-N group communication. We show that our proposed protocol can achieve a considerably lower traffic load than conventional push-based gossip protocols and conventional push-pull gossip protocols for the same probability of successful delivery, with higher performance gains in networks with smaller delays. We derive a mathematical model for estimating the frame non-delivery probability and the traffic load from overhead, and demonstrate the general correctness of the model by simulation. We implement a functioning prototype conferencing system using the proposed protocol, completed with functions including NTP synchronization, dynamic group size estimation, redundancy suppression, and other features needed for proper operation. We perform experiments over the campus network and PlanetLab, and the prototype system demonstrates the ability of our protocol to maintain robust performance in real-world network environments.

• Publisher: Springer London,Sociedade Brasileira de Computação
• Subject: Computer Applications / Computer Communication Networks / Computer Science / Computer Systems Organization and Communication Networks / Information Systems and Communication Service / IT in Business / Processor Architectures