A New Broadcast Model for Several Network Topologies

TL;DR

The paper introduces BBS, a versatile broadcast algorithm that improves communication efficiency and reduces latency across various network topologies, especially in large-scale systems.

Contribution

It presents a novel broadcast algorithm, BBS, that maximizes node utilization and outperforms existing methods in diverse network topologies.

Findings

BBS consistently outperforms common broadcast algorithms in simulations.

BBS reduces broadcast latency significantly.

The algorithm maintains sustained node activity during broadcast.

Abstract

We present Broadcast by Balanced Saturation (BBS), a general broadcast algorithm designed to optimize communication efficiency across diverse network topologies. BBS maximizes node utilization, addressing challenges in broadcast operations such as topology constraints, bandwidth limitations, and synchronization overhead, particularly in large-scale systems like supercomputers. The algorithm ensures sustained activity with nodes throughout the broadcast, thereby enhancing data propagation and significantly reducing latency. Through a precise communication cycle, BBS provides a repeatable, streamlined, stepwise broadcasting framework. Simulation results across various topologies demonstrate that the BBS algorithm consistently outperforms common general broadcast algorithms, often by a substantial margin. These findings suggest that BBS is a versatile and robust framework with the potential to redefine broadcast strategies across network topologies.